About the Execution of ITS-Tools for DES-PT-60a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1698745.00 | 0.00 | 0.00 | FFTFFTFFFFFFTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064000364.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 DES-PT-60a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064000364
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K 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.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 110K 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 DES-PT-60a-LTLFireability-00
FORMULA_NAME DES-PT-60a-LTLFireability-01
FORMULA_NAME DES-PT-60a-LTLFireability-02
FORMULA_NAME DES-PT-60a-LTLFireability-03
FORMULA_NAME DES-PT-60a-LTLFireability-04
FORMULA_NAME DES-PT-60a-LTLFireability-05
FORMULA_NAME DES-PT-60a-LTLFireability-06
FORMULA_NAME DES-PT-60a-LTLFireability-07
FORMULA_NAME DES-PT-60a-LTLFireability-08
FORMULA_NAME DES-PT-60a-LTLFireability-09
FORMULA_NAME DES-PT-60a-LTLFireability-10
FORMULA_NAME DES-PT-60a-LTLFireability-11
FORMULA_NAME DES-PT-60a-LTLFireability-12
FORMULA_NAME DES-PT-60a-LTLFireability-13
FORMULA_NAME DES-PT-60a-LTLFireability-14
FORMULA_NAME DES-PT-60a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748755849961
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 05:30:52] [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-01 05:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 05:30:53] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2025-06-01 05:30:53] [INFO ] Transformed 354 places.
[2025-06-01 05:30:53] [INFO ] Transformed 311 transitions.
[2025-06-01 05:30:53] [INFO ] Found NUPN structural information;
[2025-06-01 05:30:53] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 459 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 353 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 353 transition count 296
Applied a total of 2 rules in 156 ms. Remains 353 /354 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 353 cols
[2025-06-01 05:30:53] [INFO ] Computed 59 invariants in 77 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:30:54] [INFO ] Implicit Places using invariants in 1087 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 352/354 places, 296/297 transitions.
Applied a total of 0 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1383 ms. Remains : 352/354 places, 296/297 transitions.
Support contains 39 out of 352 places after structural reductions.
[2025-06-01 05:30:55] [INFO ] Flatten gal took : 138 ms
[2025-06-01 05:30:55] [INFO ] Flatten gal took : 80 ms
[2025-06-01 05:30:55] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 40000 steps (891 resets) in 3012 ms. (13 steps per ms) remains 17/27 properties
BEST_FIRST walk for 4004 steps (16 resets) in 63 ms. (62 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (22 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (17 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (24 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (24 resets) in 78 ms. (50 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (15 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (20 resets) in 53 ms. (74 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (16 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (15 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (19 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (19 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (24 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (18 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
// Phase 1: matrix 296 rows 352 cols
[2025-06-01 05:30:57] [INFO ] Computed 58 invariants in 20 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 10/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 63/95 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 193/288 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 6/294 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 295/589 variables, 294/352 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:30:59] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:30:59] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:31:01] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:31:01] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/648 variables, and 356 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 294/352 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 10/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 63/95 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 193/288 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 6/294 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 295/589 variables, 294/356 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/648 variables, and 358 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 294/352 constraints, PredecessorRefiner: 2/17 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10207ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 352 transition count 294
Applied a total of 6 rules in 126 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (549 resets) in 921 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (27 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (27 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (27 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 539660 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 17
Probabilistic random walk after 539660 steps, saw 77459 distinct states, run finished after 3007 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2025-06-01 05:31:10] [INFO ] Computed 60 invariants in 9 ms
[2025-06-01 05:31:10] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 10/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 72/104 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 193/297 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 294/591 variables, 297/357 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:31:14] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:31:15] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 21 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/591 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 55/646 variables, 55/416 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:31:23] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:31:23] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 15 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 418 constraints, problems are : Problem set: 0 solved, 17 unsolved in 23746 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 10/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 72/104 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 193/297 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 294/591 variables, 297/361 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/591 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:31:46] [INFO ] Deduced a trap along path composed of 8 places in 126 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:32:03] [INFO ] Deduced a trap along path composed of 18 places in 141 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/646 variables, and 367 constraints, problems are : Problem set: 0 solved, 17 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/17 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 68825ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 19 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2025-06-01 05:32:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:32:20] [INFO ] Implicit Places using invariants in 699 ms returned []
[2025-06-01 05:32:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:32:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 05:32:21] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:32:21] [INFO ] Redundant transitions in 34 ms returned []
Running 293 sub problems to find dead transitions.
[2025-06-01 05:32:21] [INFO ] Invariant cache hit.
[2025-06-01 05:32:21] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:32:35] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:32:35] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:32:42] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:32:59] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:33:00] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 294/646 variables, 352/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 293/712 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 712 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60575ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62409 ms. Remains : 352/352 places, 294/294 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2025-06-01 05:33:22] [INFO ] Computed 58 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:33:22] [INFO ] Implicit Places using invariants in 446 ms returned []
[2025-06-01 05:33:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:33:24] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:33:24] [INFO ] Redundant transitions in 33 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-01 05:33:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:33:36] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:33:50] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:34:01] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:34:01] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60298ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61970 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-00
Product exploration explored 100000 steps with 2245 reset in 631 ms.
Product exploration explored 100000 steps with 2194 reset in 376 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 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 126 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (891 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (178 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1041511 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 1
Probabilistic random walk after 1041511 steps, saw 148511 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
[2025-06-01 05:34:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/79 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/79 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:34:30] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 540 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 57 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (529 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (71 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1010496 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :0 out of 1
Probabilistic random walk after 1010496 steps, saw 142948 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2025-06-01 05:34:34] [INFO ] Computed 60 invariants in 6 ms
[2025-06-01 05:34:34] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:34:35] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:34:35] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:34:36] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 60/646 variables, 60/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2870 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3187ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 437 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 24 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 23 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2025-06-01 05:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:34:38] [INFO ] Implicit Places using invariants in 491 ms returned []
[2025-06-01 05:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:34:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 05:34:39] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:34:39] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2025-06-01 05:34:39] [INFO ] Invariant cache hit.
[2025-06-01 05:34:39] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:34:59] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:35:02] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:35:07] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:35:07] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:35:10] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 14 ms to minimize.
SMT process timed out in 30186ms, After SMT, problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 30188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31673 ms. Remains : 352/352 places, 294/294 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 44 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2025-06-01 05:35:10] [INFO ] Computed 60 invariants in 9 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 05:35:10] [INFO ] After 118ms 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-01 05:35:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2025-06-01 05:35:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 43 ms returned sat
[2025-06-01 05:35:11] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 05:35:11] [INFO ] After 764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 05:35:11] [INFO ] After 1154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1351 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2025-06-01 05:35:11] [INFO ] Computed 58 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:35:12] [INFO ] Implicit Places using invariants in 387 ms returned []
[2025-06-01 05:35:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:35:13] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:35:13] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-01 05:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:35:25] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:35:39] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:35:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:35:50] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61548 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (876 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (178 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 853117 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :0 out of 1
Probabilistic random walk after 853117 steps, saw 126448 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
[2025-06-01 05:36:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/79 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/79 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:36:17] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2045ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 475 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 47 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (539 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 883451 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :0 out of 1
Probabilistic random walk after 883451 steps, saw 125898 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2025-06-01 05:36:22] [INFO ] Computed 60 invariants in 5 ms
[2025-06-01 05:36:22] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:36:23] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:36:23] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:36:23] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 17 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 60/646 variables, 60/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3162 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3633ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9315 steps, including 47 resets, run visited all 1 properties in 41 ms. (steps per millisecond=227 )
Parikh walk visited 1 properties in 48 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 168 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 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2218 reset in 398 ms.
Product exploration explored 100000 steps with 2248 reset in 426 ms.
Built C files in :
/tmp/ltsmin3094451565660349268
[2025-06-01 05:36:27] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2025-06-01 05:36:27] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:36:27] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2025-06-01 05:36:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:36:27] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2025-06-01 05:36:27] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:36:27] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3094451565660349268
Running compilation step : cd /tmp/ltsmin3094451565660349268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1659 ms.
Running link step : cd /tmp/ltsmin3094451565660349268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin3094451565660349268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4938945518250502891.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2025-06-01 05:36:42] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:36:42] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-06-01 05:36:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:36:43] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:36:43] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-01 05:36:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:36:55] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:37:04] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:37:20] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:37:20] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61670 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin1906307410729643938
[2025-06-01 05:37:44] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2025-06-01 05:37:44] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:37:44] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2025-06-01 05:37:44] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:37:44] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2025-06-01 05:37:44] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:37:44] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1906307410729643938
Running compilation step : cd /tmp/ltsmin1906307410729643938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1395 ms.
Running link step : cd /tmp/ltsmin1906307410729643938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin1906307410729643938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10097921539968372509.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 05:37:59] [INFO ] Flatten gal took : 56 ms
[2025-06-01 05:37:59] [INFO ] Flatten gal took : 55 ms
[2025-06-01 05:37:59] [INFO ] Time to serialize gal into /tmp/LTL9155773818317689116.gal : 10 ms
[2025-06-01 05:37:59] [INFO ] Time to serialize properties into /tmp/LTL13681495555040613945.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/LTL9155773818317689116.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15906556801096848096.hoa' '-atoms' '/tmp/LTL13681495555040613945.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13681495555040613945.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15906556801096848096.hoa
Detected timeout of ITS tools.
[2025-06-01 05:38:14] [INFO ] Flatten gal took : 29 ms
[2025-06-01 05:38:14] [INFO ] Flatten gal took : 26 ms
[2025-06-01 05:38:14] [INFO ] Time to serialize gal into /tmp/LTL15337892014458887044.gal : 6 ms
[2025-06-01 05:38:14] [INFO ] Time to serialize properties into /tmp/LTL13291201275283417369.ltl : 6 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/LTL15337892014458887044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13291201275283417369.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p100==0)||(p349==0))"))))
Formula 0 simplified : FG!"((p100==0)||(p349==0))"
Detected timeout of ITS tools.
[2025-06-01 05:38:29] [INFO ] Flatten gal took : 27 ms
[2025-06-01 05:38:29] [INFO ] Applying decomposition
[2025-06-01 05:38:29] [INFO ] Flatten gal took : 27 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/graph11151089937839315917.txt' '-o' '/tmp/graph11151089937839315917.bin' '-w' '/tmp/graph11151089937839315917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11151089937839315917.bin' '-l' '-1' '-v' '-w' '/tmp/graph11151089937839315917.weights' '-q' '0' '-e' '0.001'
[2025-06-01 05:38:29] [INFO ] Decomposing Gal with order
[2025-06-01 05:38:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 05:38:30] [INFO ] Removed a total of 16 redundant transitions.
[2025-06-01 05:38:30] [INFO ] Flatten gal took : 91 ms
[2025-06-01 05:38:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-01 05:38:30] [INFO ] Time to serialize gal into /tmp/LTL18084796684416318044.gal : 8 ms
[2025-06-01 05:38:30] [INFO ] Time to serialize properties into /tmp/LTL15724557155255412182.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/LTL18084796684416318044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15724557155255412182.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((u48.p100==0)||(u48.p349==0))"))))
Formula 0 simplified : FG!"((u48.p100==0)||(u48.p349==0))"
Detected timeout of ITS tools.
Treatment of property DES-PT-60a-LTLFireability-00 finished in 322781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U (p1&&G(F(p2))))&&G(p3)))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-01 05:38:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:38:45] [INFO ] Implicit Places using invariants in 576 ms returned []
[2025-06-01 05:38:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:38:46] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:38:57] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:39:08] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:39:23] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:39:24] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Finished structural reductions in LTL mode , in 1 iterations and 61715 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-60a-LTLFireability-01
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-01 finished in 62132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(X(X(X(G(p0)))))&&!p1))) U p0))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-01 05:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:39:47] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-06-01 05:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:39:48] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:39:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:40:01] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:40:12] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:40:26] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:40:26] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in LTL mode , in 1 iterations and 61434 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-04 finished in 61802 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)))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-01 05:40:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:40:49] [INFO ] Implicit Places using invariants in 459 ms returned []
[2025-06-01 05:40:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:40:50] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:40:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:41:03] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:41:15] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:41:27] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:41:27] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Finished structural reductions in LTL mode , in 1 iterations and 61828 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-60a-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 931 ms.
Product exploration explored 100000 steps with 50000 reset in 857 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 25 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-05 finished in 63860 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 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 19 ms. Remains 351 /352 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 351 cols
[2025-06-01 05:41:53] [INFO ] Computed 58 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:41:53] [INFO ] Implicit Places using invariants in 542 ms returned []
[2025-06-01 05:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:41:55] [INFO ] Implicit Places using invariants and state equation in 1854 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:41:55] [INFO ] Redundant transitions in 2 ms returned []
Running 292 sub problems to find dead transitions.
[2025-06-01 05:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 2/350 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 295/645 variables, 350/408 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:42:18] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:42:18] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/646 variables, and 410 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 295/645 variables, 350/410 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 292/702 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/646 variables, and 702 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62626 ms. Remains : 351/352 places, 295/296 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-06
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-06 finished in 62701 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)&&X(p1)))'
Support contains 3 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2025-06-01 05:42:55] [INFO ] Computed 58 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:42:56] [INFO ] Implicit Places using invariants in 626 ms returned []
[2025-06-01 05:42:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:42:57] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:42:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:43:09] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:43:24] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:43:33] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:43:33] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Finished structural reductions in LTL mode , in 1 iterations and 61956 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DES-PT-60a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-07 finished in 62157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U !p1))&&F(p2)))'
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-01 05:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:43:58] [INFO ] Implicit Places using invariants in 599 ms returned []
[2025-06-01 05:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:43:59] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:43:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:44:11] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:44:24] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:44:37] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:44:37] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Finished structural reductions in LTL mode , in 1 iterations and 61679 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) p1), p1, (NOT p2), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-08
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-08 finished in 61883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p1)&&X(X(G((p1||X(p2))))))))'
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-01 05:44:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:45:00] [INFO ] Implicit Places using invariants in 553 ms returned []
[2025-06-01 05:45:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:45:01] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:45:13] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:45:27] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:45:39] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:45:39] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Finished structural reductions in LTL mode , in 1 iterations and 61761 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-09
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-09 finished in 62028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&F(!p1))) U X(X(X(X(G((p2 U p0))))))))'
Support contains 7 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-01 05:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:46:02] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-06-01 05:46:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:46:02] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:46:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:46:11] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:46:21] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:46:38] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:46:38] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Finished structural reductions in LTL mode , in 1 iterations and 61315 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 954 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : DES-PT-60a-LTLFireability-10
Stuttering criterion allowed to conclude after 222 steps with 17 reset in 1 ms.
FORMULA DES-PT-60a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-10 finished in 62314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(G(p1))) U X(!p2))))'
Support contains 7 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-01 05:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:47:04] [INFO ] Implicit Places using invariants in 383 ms returned []
[2025-06-01 05:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:47:05] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:47:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:47:14] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:47:23] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:47:40] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:47:40] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Finished structural reductions in LTL mode , in 1 iterations and 61399 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 229 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : DES-PT-60a-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 498 ms.
Product exploration explored 100000 steps with 33333 reset in 531 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-12 finished in 62705 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 U p1)||p0)) U !F(X(p2))))'
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-01 05:48:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:48:07] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-06-01 05:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:48:07] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:48:16] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:48:26] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:48:43] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:48:43] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in LTL mode , in 1 iterations and 61269 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 139 ms :[p2, p2, true, p2]
Running random walk in product with property : DES-PT-60a-LTLFireability-13
Product exploration explored 100000 steps with 2212 reset in 483 ms.
Product exploration explored 100000 steps with 2208 reset in 407 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p0)), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 203 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p2, true, p2]
RANDOM walk for 40000 steps (892 resets) in 618 ms. (64 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (254 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (232 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (207 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (232 resets) in 468 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (248 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (204 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
[2025-06-01 05:49:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/284 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/290 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 295/585 variables, 290/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 63/648 variables, 62/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 6 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/284 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/290 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 295/585 variables, 290/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 63/648 variables, 62/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:49:14] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 417 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5968ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 352 transition count 294
Applied a total of 6 rules in 26 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (525 resets) in 273 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (290 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (273 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (74 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (138 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (289 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 538470 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 6
Probabilistic random walk after 538470 steps, saw 77295 distinct states, run finished after 3003 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2025-06-01 05:49:19] [INFO ] Computed 60 invariants in 4 ms
[2025-06-01 05:49:19] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/293 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 294/587 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 59/646 variables, 59/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 414 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/293 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 294/587 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 59/646 variables, 59/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/646 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 420 constraints, problems are : Problem set: 0 solved, 6 unsolved in 15986 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17036ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9040 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2025-06-01 05:49:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:49:45] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-06-01 05:49:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:49:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 05:49:46] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:49:46] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2025-06-01 05:49:46] [INFO ] Invariant cache hit.
[2025-06-01 05:49:46] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:49:56] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:49:56] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:50:01] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:50:21] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:50:21] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 294/646 variables, 352/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 293/712 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 712 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61301 ms. Remains : 352/352 places, 294/294 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 6 properties.
[2025-06-01 05:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 05:50:46] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2025-06-01 05:50:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2025-06-01 05:50:47] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 05:50:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-06-01 05:50:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-06-01 05:50:50] [INFO ] After 2980ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:50:52] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 3 ms to minimize.
[2025-06-01 05:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:50:53] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 6 ms to minimize.
[2025-06-01 05:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
TRAPS : Iteration 1
[2025-06-01 05:50:55] [INFO ] After 8634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-01 05:50:58] [INFO ] After 11007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 11356 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p0)), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 16 factoid took 261 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 139 ms :[p2, true, p2]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2025-06-01 05:50:58] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:50:58] [INFO ] Implicit Places using invariants in 410 ms returned []
[2025-06-01 05:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:50:59] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:50:59] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-01 05:50:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:51:08] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:51:18] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 50.0)
(t2 50.0)
(t3 46.0)
(t4 4.0)
(t5 4.0)
(t6 1.0)
(t7 1.0)
(t8 0.0)
(t9 1.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:51:34] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:51:34] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61268 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1))))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1)))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 209 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[p2, true, p2]
RANDOM walk for 40000 steps (909 resets) in 321 ms. (124 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (251 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (236 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (186 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (231 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (251 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (207 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
[2025-06-01 05:52:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/284 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/290 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 295/585 variables, 290/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 63/648 variables, 62/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 6 unsolved in 979 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/284 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/290 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 295/585 variables, 290/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 63/648 variables, 62/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:52:05] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 417 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6031ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 352 transition count 294
Applied a total of 6 rules in 19 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (527 resets) in 355 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (289 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (277 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (139 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (292 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 697870 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 6
Probabilistic random walk after 697870 steps, saw 100116 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2025-06-01 05:52:10] [INFO ] Computed 60 invariants in 4 ms
[2025-06-01 05:52:10] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/293 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 294/587 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 59/646 variables, 59/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 414 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/293 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 294/587 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 59/646 variables, 59/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/646 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 420 constraints, problems are : Problem set: 0 solved, 6 unsolved in 16306 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17385ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8373 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2025-06-01 05:52:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:52:36] [INFO ] Implicit Places using invariants in 531 ms returned []
[2025-06-01 05:52:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:52:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 05:52:37] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:52:37] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2025-06-01 05:52:37] [INFO ] Invariant cache hit.
[2025-06-01 05:52:37] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:52:47] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:52:47] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:52:55] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:53:14] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:53:15] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 294/646 variables, 352/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 293/712 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 712 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61489 ms. Remains : 352/352 places, 294/294 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 6 properties.
[2025-06-01 05:53:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 05:53:37] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2025-06-01 05:53:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2025-06-01 05:53:37] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 05:53:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-06-01 05:53:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2025-06-01 05:53:41] [INFO ] After 3672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:53:44] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 4 ms to minimize.
[2025-06-01 05:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:53:45] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 6 ms to minimize.
[2025-06-01 05:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
TRAPS : Iteration 1
[2025-06-01 05:53:47] [INFO ] After 9770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-01 05:53:50] [INFO ] After 12579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 12939 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1))))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1)))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 16 factoid took 310 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 118 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 119 ms :[p2, true, p2]
Product exploration explored 100000 steps with 2236 reset in 527 ms.
Product exploration explored 100000 steps with 2238 reset in 604 ms.
Built C files in :
/tmp/ltsmin9474030502952035880
[2025-06-01 05:53:52] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2025-06-01 05:53:52] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:53:52] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2025-06-01 05:53:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:53:52] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2025-06-01 05:53:52] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:53:52] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9474030502952035880
Running compilation step : cd /tmp/ltsmin9474030502952035880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1319 ms.
Running link step : cd /tmp/ltsmin9474030502952035880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin9474030502952035880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12518788086327180718.hoa' '--buchi-type=spotba'
LTSmin run took 3182 ms.
FORMULA DES-PT-60a-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60a-LTLFireability-13 finished in 350073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2025-06-01 05:53:56] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:53:57] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-06-01 05:53:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:53:58] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:53:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:54:11] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:54:23] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:54:36] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:54:36] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Finished structural reductions in LTL mode , in 1 iterations and 61653 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-14
Product exploration explored 100000 steps with 2220 reset in 404 ms.
Product exploration explored 100000 steps with 2220 reset in 365 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (895 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (177 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 967987 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 1
Probabilistic random walk after 967987 steps, saw 139001 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
[2025-06-01 05:55:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:55:04] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2520 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3432ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1784 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=223 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-14 finished in 69378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 8 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-01 05:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:55:06] [INFO ] Implicit Places using invariants in 440 ms returned []
[2025-06-01 05:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:55:07] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-01 05:55:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:55:19] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:55:31] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:55:45] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:55:45] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in LTL mode , in 1 iterations and 61770 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 617 ms.
Product exploration explored 100000 steps with 50000 reset in 659 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-15 finished in 63164 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)))'
[2025-06-01 05:56:09] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1684682587572354962
[2025-06-01 05:56:09] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2025-06-01 05:56:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:56:09] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2025-06-01 05:56:09] [INFO ] Applying decomposition
[2025-06-01 05:56:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:56:09] [INFO ] Flatten gal took : 21 ms
[2025-06-01 05:56:09] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2025-06-01 05:56:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 05:56:09] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1684682587572354962
Running compilation step : cd /tmp/ltsmin1684682587572354962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph14697154253485924655.txt' '-o' '/tmp/graph14697154253485924655.bin' '-w' '/tmp/graph14697154253485924655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14697154253485924655.bin' '-l' '-1' '-v' '-w' '/tmp/graph14697154253485924655.weights' '-q' '0' '-e' '0.001'
[2025-06-01 05:56:09] [INFO ] Decomposing Gal with order
[2025-06-01 05:56:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 05:56:09] [INFO ] Removed a total of 14 redundant transitions.
[2025-06-01 05:56:10] [INFO ] Flatten gal took : 54 ms
[2025-06-01 05:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2025-06-01 05:56:10] [INFO ] Time to serialize gal into /tmp/LTLFireability13839810327107506486.gal : 7 ms
[2025-06-01 05:56:10] [INFO ] Time to serialize properties into /tmp/LTLFireability9695808868497390213.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/LTLFireability13839810327107506486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9695808868497390213.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 1 LTL properties
Checking formula 0 : !((G(F("((u47.p100==0)||(u47.p349==0))"))))
Formula 0 simplified : FG!"((u47.p100==0)||(u47.p349==0))"
Compilation finished in 1323 ms.
Running link step : cd /tmp/ltsmin1684682587572354962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1684682587572354962;'/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 t1, t256, t257, t289, u2.t8, u2.t130, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u...839
Computing Next relation with stutter on 8.35188e+06 deadlock states
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
7112 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,71.2078,1097812,1,0,2.26856e+06,317541,2702,1.9703e+06,6377,2.21254e+06,3691286
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-60a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1695930 ms.
BK_STOP 1748757548706
--------------------
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="DES-PT-60a"
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 DES-PT-60a, 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 r058-smll-174854064000364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a 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 ;