About the Execution of ITS-Tools for StigmergyCommit-PT-09a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 824973.00 | 0.00 | 0.00 | TTFFTFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490700116.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 StigmergyCommit-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490700116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 51M May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749105403491
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 06:36:45] [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-05 06:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:36:48] [INFO ] Load time of PNML (sax parser for PT used): 2917 ms
[2025-06-05 06:36:48] [INFO ] Transformed 364 places.
[2025-06-05 06:36:49] [INFO ] Transformed 50444 transitions.
[2025-06-05 06:36:49] [INFO ] Found NUPN structural information;
[2025-06-05 06:36:49] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 3632 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 284 transition count 2430
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 284 transition count 2430
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 170 place count 284 transition count 2420
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 211 place count 243 transition count 2369
Iterating global reduction 1 with 41 rules applied. Total rules applied 252 place count 243 transition count 2369
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 262 place count 243 transition count 2359
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 272 place count 233 transition count 2349
Iterating global reduction 2 with 10 rules applied. Total rules applied 282 place count 233 transition count 2349
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 292 place count 223 transition count 2339
Iterating global reduction 2 with 10 rules applied. Total rules applied 302 place count 223 transition count 2339
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 312 place count 213 transition count 2329
Iterating global reduction 2 with 10 rules applied. Total rules applied 322 place count 213 transition count 2329
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 332 place count 203 transition count 2319
Iterating global reduction 2 with 10 rules applied. Total rules applied 342 place count 203 transition count 2319
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 352 place count 203 transition count 2309
Applied a total of 352 rules in 235 ms. Remains 203 /364 variables (removed 161) and now considering 2309/2520 (removed 211) transitions.
[2025-06-05 06:36:50] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2025-06-05 06:36:50] [INFO ] Computed 2 invariants in 88 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:36:50] [INFO ] Implicit Places using invariants in 581 ms returned []
[2025-06-05 06:36:50] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
[2025-06-05 06:36:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:36:52] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2025-06-05 06:36:54] [INFO ] Implicit Places using invariants and state equation in 3922 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4565 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/364 places, 2309/2520 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 173 transition count 2280
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 173 transition count 2280
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 68 place count 173 transition count 2270
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 163 transition count 2260
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 163 transition count 2260
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 98 place count 153 transition count 2250
Iterating global reduction 1 with 10 rules applied. Total rules applied 108 place count 153 transition count 2250
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 118 place count 143 transition count 2240
Iterating global reduction 1 with 10 rules applied. Total rules applied 128 place count 143 transition count 2240
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 138 place count 133 transition count 2230
Iterating global reduction 1 with 10 rules applied. Total rules applied 148 place count 133 transition count 2230
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 157 place count 124 transition count 2221
Iterating global reduction 1 with 9 rules applied. Total rules applied 166 place count 124 transition count 2221
Applied a total of 166 rules in 171 ms. Remains 124 /202 variables (removed 78) and now considering 2221/2309 (removed 88) transitions.
[2025-06-05 06:36:54] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2025-06-05 06:36:54] [INFO ] Computed 1 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:36:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-05 06:36:54] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:36:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:36:56] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-05 06:36:56] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/364 places, 2221/2520 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6720 ms. Remains : 124/364 places, 2221/2520 transitions.
Support contains 10 out of 124 places after structural reductions.
[2025-06-05 06:36:57] [INFO ] Flatten gal took : 498 ms
[2025-06-05 06:36:57] [INFO ] Flatten gal took : 268 ms
[2025-06-05 06:36:58] [INFO ] Input system was already deterministic with 2221 transitions.
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 252 steps (0 resets) in 150 ms. (1 steps per ms) remains 0/3 properties
FORMULA StigmergyCommit-PT-09a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 3 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' '!(F((!p0||X(X(X(p0))))))'
Support contains 0 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 2218 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2025-06-05 06:37:01] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2025-06-05 06:37:01] [INFO ] Computed 1 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:37:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-05 06:37:01] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:37:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:37:01] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:37:02] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:37:02] [INFO ] Redundant transitions in 191 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:37:02] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:37:02] [INFO ] Invariant cache hit.
[2025-06-05 06:37:02] [INFO ] State equation strengthened by 1043 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:12] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:12] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:13] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:13] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:13] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:13] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:13] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:14] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:14] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:15] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:15] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:15] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:16] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:16] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:16] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:17] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:17] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:17] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:17] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:18] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:18] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:18] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:19] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:19] [INFO ] Deduced a trap composed of 4 places in 505 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:20] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:20] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:20] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:21] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:27] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:27] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:27] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:27] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:40] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:40] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:40] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:41] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:41] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:41] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:41] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:42] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:42] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:47] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:52] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:52] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:37:52] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 1042/1120 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63018ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 63055ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66004 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 70 ms :[false]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-00
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-00 TRUE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-00 finished in 66209 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(!p1)||X(F(p2))||p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 11 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2025-06-05 06:38:05] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2025-06-05 06:38:05] [INFO ] Computed 1 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:38:05] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-05 06:38:05] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:38:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:38:06] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-05 06:38:06] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2025-06-05 06:38:06] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:38:06] [INFO ] Invariant cache hit.
[2025-06-05 06:38:08] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
SMT process timed out in 35730ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 35755ms
Finished structural reductions in LTL mode , in 1 iterations and 37133 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 578 ms.
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-09a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-09a-LTLFireability-01 finished in 38544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 978 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2025-06-05 06:38:45] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2025-06-05 06:38:45] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:38:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-05 06:38:45] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:38:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:38:45] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:38:45] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:38:45] [INFO ] Redundant transitions in 93 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:38:45] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:38:45] [INFO ] Invariant cache hit.
[2025-06-05 06:38:45] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:56] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:56] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:56] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:56] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:56] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:57] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:57] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:57] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:58] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:58] [INFO ] Deduced a trap composed of 4 places in 563 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:59] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:38:59] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:00] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:00] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:00] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:01] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:01] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:01] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:01] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:02] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:02] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:02] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:03] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:03] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:04] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:04] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:04] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:11] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:11] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:11] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:11] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:22] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:23] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:23] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:23] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:24] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:24] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:24] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:25] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:25] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:29] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:34] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:34] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:34] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 1042/1120 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62497ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62505ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64271 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-02
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-02 finished in 64391 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 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 1188 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2025-06-05 06:39:49] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:39:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:39:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-05 06:39:49] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:39:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:39:49] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:39:50] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:39:50] [INFO ] Redundant transitions in 118 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:39:50] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:39:50] [INFO ] Invariant cache hit.
[2025-06-05 06:39:50] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:59] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:59] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:59] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:59] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:59] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:39:59] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:00] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:00] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:00] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:01] [INFO ] Deduced a trap composed of 4 places in 582 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:01] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:02] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:02] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:02] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:03] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:03] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:03] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:03] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:04] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:04] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:04] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:04] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:05] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:05] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:06] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:06] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:06] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:06] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:13] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:14] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:14] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:14] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:27] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:27] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:27] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:28] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:28] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:28] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:28] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:29] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:29] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:33] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:37] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:38] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:40:38] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 1042/1120 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62217ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62224ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64031 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 54 ms :[p0]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-04
Product exploration explored 100000 steps with 9090 reset in 4282 ms.
Product exploration explored 100000 steps with 9090 reset in 3853 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
RANDOM walk for 40 steps (0 resets) in 9 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
[2025-06-05 06:41:01] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:41:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 06:41:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 06:41:02] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-06-05 06:41:03] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:41:03] [INFO ] [Real]Added 1043 Read/Feed constraints in 170 ms returned sat
[2025-06-05 06:41:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 06:41:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 06:41:04] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2025-06-05 06:41:04] [INFO ] [Nat]Added 1043 Read/Feed constraints in 190 ms returned sat
[2025-06-05 06:41:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 304 ms.
[2025-06-05 06:41:05] [INFO ] Added : 0 causal constraints over 0 iterations in 470 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 232 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2025-06-05 06:41:05] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:41:05] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-05 06:41:05] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:41:05] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:41:06] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:41:06] [INFO ] Redundant transitions in 85 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:41:06] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:41:06] [INFO ] Invariant cache hit.
[2025-06-05 06:41:06] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:15] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:15] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:15] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:15] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:15] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:15] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:15] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:16] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:16] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:17] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:17] [INFO ] Deduced a trap composed of 4 places in 470 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:18] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:18] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:18] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:19] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:19] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:19] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:19] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:20] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:20] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:20] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:20] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:20] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:21] [INFO ] Deduced a trap composed of 4 places in 545 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:21] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:22] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:22] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:22] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:23] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:29] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:29] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:29] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:30] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:42] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:42] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:42] [INFO ] Deduced a trap composed of 4 places in 540 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:43] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:43] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:43] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:44] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:44] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:44] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:49] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:54] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:54] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:41:54] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 1042/1120 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62009ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62018ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62851 ms. Remains : 31/31 places, 1075/1075 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
RANDOM walk for 40 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
[2025-06-05 06:42:08] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 06:42:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 06:42:10] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2025-06-05 06:42:10] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:42:10] [INFO ] [Real]Added 1043 Read/Feed constraints in 161 ms returned sat
[2025-06-05 06:42:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 06:42:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 06:42:11] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2025-06-05 06:42:11] [INFO ] [Nat]Added 1043 Read/Feed constraints in 194 ms returned sat
[2025-06-05 06:42:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 1008 ms.
[2025-06-05 06:42:13] [INFO ] Added : 0 causal constraints over 0 iterations in 1145 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 49 ms :[p0]
Product exploration explored 100000 steps with 9090 reset in 3786 ms.
Product exploration explored 100000 steps with 9090 reset in 3782 ms.
Built C files in :
/tmp/ltsmin1847450086879194034
[2025-06-05 06:42:20] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2025-06-05 06:42:21] [INFO ] Computation of Complete disable matrix. took 731 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 06:42:21] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2025-06-05 06:42:21] [INFO ] Computation of Complete enable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 06:42:21] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2025-06-05 06:42:22] [INFO ] Computation of Completed DNA matrix. took 114 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 06:42:22] [INFO ] Built C files in 1436ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1847450086879194034
Running compilation step : cd /tmp/ltsmin1847450086879194034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1847450086879194034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1847450086879194034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 236 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2025-06-05 06:42:25] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:42:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-05 06:42:25] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:42:25] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:42:26] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:42:26] [INFO ] Redundant transitions in 148 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:42:26] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:42:26] [INFO ] Invariant cache hit.
[2025-06-05 06:42:26] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:34] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:34] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:34] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:34] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:35] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:35] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:35] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:35] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:36] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:36] [INFO ] Deduced a trap composed of 4 places in 589 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:37] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:37] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:38] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:38] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:38] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:38] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:39] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:39] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:39] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:39] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:40] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:40] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:40] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:41] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:41] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:41] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:42] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:42] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:42] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:48] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:49] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:49] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:42:49] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/65 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 32091ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 32101ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33035 ms. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin1197004439587281857
[2025-06-05 06:42:58] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2025-06-05 06:42:59] [INFO ] Computation of Complete disable matrix. took 704 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 06:42:59] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2025-06-05 06:42:59] [INFO ] Computation of Complete enable matrix. took 89 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 06:42:59] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2025-06-05 06:42:59] [INFO ] Computation of Completed DNA matrix. took 139 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 06:42:59] [INFO ] Built C files in 1438ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1197004439587281857
Running compilation step : cd /tmp/ltsmin1197004439587281857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1197004439587281857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1197004439587281857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-05 06:43:03] [INFO ] Flatten gal took : 87 ms
[2025-06-05 06:43:03] [INFO ] Flatten gal took : 82 ms
[2025-06-05 06:43:03] [INFO ] Time to serialize gal into /tmp/LTL4939428038295486726.gal : 49 ms
[2025-06-05 06:43:03] [INFO ] Time to serialize properties into /tmp/LTL17444087710469637173.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/LTL4939428038295486726.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9241970399740809793.hoa' '-atoms' '/tmp/LTL17444087710469637173.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17444087710469637173.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9241970399740809793.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t2201, t2203, t2205, t2207, t2209, t2211, t22...282
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
885 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,9.45836,138820,1,0,1161,44534,2161,46,42863,27843,2245
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-09a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyCommit-PT-09a-LTLFireability-04 finished in 204624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 1097 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2025-06-05 06:43:14] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:43:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:43:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-05 06:43:14] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:43:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:43:14] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:43:14] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:43:14] [INFO ] Redundant transitions in 158 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:43:14] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:43:14] [INFO ] Invariant cache hit.
[2025-06-05 06:43:15] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:25] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:25] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:25] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:25] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:25] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:25] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:26] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:26] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:27] [INFO ] Deduced a trap composed of 4 places in 596 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:27] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:28] [INFO ] Deduced a trap composed of 4 places in 559 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:28] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:29] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:29] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:29] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:30] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:30] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:30] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:30] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:31] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:31] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:31] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:31] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:32] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:32] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:33] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:33] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:33] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:40] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:40] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:40] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:40] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:52] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:52] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:53] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:53] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:53] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:53] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:54] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:54] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:54] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:43:59] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:44:03] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:44:03] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:44:04] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 1042/1120 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62662ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62670ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64539 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-05
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-05 finished in 64618 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((X(!p0)&&G((!p0||G(p0)))))))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2025-06-05 06:44:17] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2025-06-05 06:44:17] [INFO ] Computed 1 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:44:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 06:44:17] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:44:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:44:18] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-05 06:44:18] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2025-06-05 06:44:18] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:44:18] [INFO ] Invariant cache hit.
[2025-06-05 06:44:18] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
SMT process timed out in 34244ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 34253ms
Finished structural reductions in LTL mode , in 1 iterations and 35304 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 223 ms :[p0, p0, p0, false, false]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-06
Stuttering criterion allowed to conclude after 3009 steps with 0 reset in 574 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-06 finished in 36136 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((X(G(!p1))&&p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 879 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2025-06-05 06:44:54] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2025-06-05 06:44:54] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:44:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 06:44:54] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:44:55] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:44:55] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:44:55] [INFO ] Redundant transitions in 85 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:44:55] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:44:55] [INFO ] Invariant cache hit.
[2025-06-05 06:44:55] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:05] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:05] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:05] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:05] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:05] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:06] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:06] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:06] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:07] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:07] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:07] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:08] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:08] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:08] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:09] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:09] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:09] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:09] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:10] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:10] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:10] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:10] [INFO ] Deduced a trap composed of 4 places in 532 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:11] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:11] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:11] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:12] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:12] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:18] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:18] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:18] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:45:19] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/65 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 32164ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 32168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33645 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-08
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-08 finished in 33810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 13 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2025-06-05 06:45:27] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2025-06-05 06:45:27] [INFO ] Computed 1 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:45:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-05 06:45:27] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:45:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:45:28] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-05 06:45:29] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2025-06-05 06:45:29] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:45:29] [INFO ] Invariant cache hit.
[2025-06-05 06:45:29] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
SMT process timed out in 34155ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 34166ms
Finished structural reductions in LTL mode , in 1 iterations and 35775 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, p0, p0, p0]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-09 finished in 35960 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 G(!p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2025-06-05 06:46:03] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:46:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:46:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-05 06:46:03] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:46:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:46:04] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-05 06:46:04] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2025-06-05 06:46:04] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:46:04] [INFO ] Invariant cache hit.
[2025-06-05 06:46:04] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
SMT process timed out in 34132ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 34141ms
Finished structural reductions in LTL mode , in 1 iterations and 35186 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, p0, p0]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-10 finished in 35306 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(!p1)&&p0)))) U G(!p1)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
[2025-06-05 06:46:38] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:46:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:46:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-05 06:46:38] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:46:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:46:39] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-05 06:46:40] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2025-06-05 06:46:40] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2025-06-05 06:46:40] [INFO ] Invariant cache hit.
[2025-06-05 06:46:40] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
SMT process timed out in 34532ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 34546ms
Finished structural reductions in LTL mode , in 1 iterations and 35834 ms. Remains : 124/124 places, 2221/2221 transitions.
Stuttering acceptance computed with spot in 421 ms :[p1, (OR (NOT p0) p1), p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1, p1, (AND p1 p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-11 finished in 36286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 1210 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2025-06-05 06:47:16] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2025-06-05 06:47:16] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:47:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-05 06:47:16] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:47:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:47:16] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:47:16] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:47:16] [INFO ] Redundant transitions in 84 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:47:17] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:47:17] [INFO ] Invariant cache hit.
[2025-06-05 06:47:17] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:26] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:26] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:26] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:26] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:26] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:26] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:27] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:27] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:27] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:28] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:28] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:29] [INFO ] Deduced a trap composed of 4 places in 477 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:29] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:30] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:30] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:30] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:30] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:31] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:31] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:31] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:32] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:32] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:32] [INFO ] Deduced a trap composed of 4 places in 528 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:33] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:33] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:34] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:34] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:34] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:39] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:40] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:40] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:40] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:53] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:54] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:54] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:55] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:55] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:55] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:56] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:56] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:47:56] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:00] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:05] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:05] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:06] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 1042/1120 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62004ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62008ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63811 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-12
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-12 finished in 63887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 875 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2025-06-05 06:48:19] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:48:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:48:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-05 06:48:19] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:48:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:48:20] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:48:20] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:48:20] [INFO ] Redundant transitions in 96 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:48:20] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:48:20] [INFO ] Invariant cache hit.
[2025-06-05 06:48:20] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:31] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:31] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:31] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:31] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:31] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:31] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:31] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:32] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:32] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:33] [INFO ] Deduced a trap composed of 4 places in 658 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:33] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:34] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:34] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:34] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:35] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:35] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:35] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:35] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:36] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:36] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:36] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:36] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:36] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:37] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:37] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:38] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:38] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:39] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:39] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:46] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:47] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:47] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:47] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:57] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:57] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:58] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:58] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:58] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:59] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:59] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:48:59] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:00] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:04] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:08] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:08] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:08] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 1042/1120 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1094 variables, 1/1121 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62402ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62406ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64069 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 86 ms :[p0, p0]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-14
Stuttering criterion allowed to conclude after 9889 steps with 898 reset in 690 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-14 finished in 64867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2221/2221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 123 transition count 2189
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 92 transition count 2189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 62 place count 92 transition count 2179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 82 transition count 2179
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 51 transition count 2137
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1167 place count 51 transition count 1114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1185 place count 42 transition count 1105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1194 place count 42 transition count 1096
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1224 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1225 place count 31 transition count 1075
Applied a total of 1225 rules in 1250 ms. Remains 31 /124 variables (removed 93) and now considering 1075/2221 (removed 1146) transitions.
[2025-06-05 06:49:25] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:49:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-05 06:49:25] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 06:49:25] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-05 06:49:25] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 06:49:25] [INFO ] Redundant transitions in 85 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-05 06:49:25] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-05 06:49:25] [INFO ] Invariant cache hit.
[2025-06-05 06:49:25] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:34] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:34] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:34] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:34] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:34] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:34] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:35] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:35] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:35] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:36] [INFO ] Deduced a trap composed of 4 places in 587 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:36] [INFO ] Deduced a trap composed of 4 places in 570 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:37] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:37] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:38] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:38] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:38] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:38] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:39] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:39] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:39] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:40] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:40] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:40] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:41] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:41] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:41] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:42] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:42] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:42] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:50] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:50] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:50] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:49:50] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:02] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:03] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:03] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:03] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:04] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:04] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:05] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:05] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:05] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:10] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:15] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:15] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:50:15] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 62522ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62525ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/124 places, 1075/2221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64354 ms. Remains : 31/124 places, 1075/2221 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-15 finished in 64448 ms.
All properties solved by simple procedures.
Total runtime 822831 ms.
BK_STOP 1749106228464
--------------------
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="StigmergyCommit-PT-09a"
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 StigmergyCommit-PT-09a, 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 r226-smll-174903490700116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09a.tgz
mv StigmergyCommit-PT-09a 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 ;