About the Execution of ITS-Tools for StigmergyCommit-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1464.800 | 544446.00 | 680528.00 | 1553.90 | FFFTTFFFFFTFTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531600100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is StigmergyCommit-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531600100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 231K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716984119181
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-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 12:02:00] [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]
[2024-05-29 12:02:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:02:00] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-29 12:02:00] [INFO ] Transformed 928 places.
[2024-05-29 12:02:00] [INFO ] Transformed 1040 transitions.
[2024-05-29 12:02:00] [INFO ] Found NUPN structural information;
[2024-05-29 12:02:00] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyCommit-PT-02b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 863 transition count 975
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 863 transition count 975
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 171 place count 822 transition count 934
Iterating global reduction 0 with 41 rules applied. Total rules applied 212 place count 822 transition count 934
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 236 place count 798 transition count 910
Iterating global reduction 0 with 24 rules applied. Total rules applied 260 place count 798 transition count 910
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 280 place count 778 transition count 890
Iterating global reduction 0 with 20 rules applied. Total rules applied 300 place count 778 transition count 890
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 318 place count 760 transition count 872
Iterating global reduction 0 with 18 rules applied. Total rules applied 336 place count 760 transition count 872
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 353 place count 743 transition count 855
Iterating global reduction 0 with 17 rules applied. Total rules applied 370 place count 743 transition count 855
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 387 place count 726 transition count 838
Iterating global reduction 0 with 17 rules applied. Total rules applied 404 place count 726 transition count 838
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 420 place count 710 transition count 822
Iterating global reduction 0 with 16 rules applied. Total rules applied 436 place count 710 transition count 822
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 449 place count 697 transition count 809
Iterating global reduction 0 with 13 rules applied. Total rules applied 462 place count 697 transition count 809
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 472 place count 687 transition count 799
Iterating global reduction 0 with 10 rules applied. Total rules applied 482 place count 687 transition count 799
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 485 place count 687 transition count 796
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 488 place count 684 transition count 793
Iterating global reduction 1 with 3 rules applied. Total rules applied 491 place count 684 transition count 793
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 493 place count 682 transition count 791
Iterating global reduction 1 with 2 rules applied. Total rules applied 495 place count 682 transition count 791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 496 place count 681 transition count 790
Iterating global reduction 1 with 1 rules applied. Total rules applied 497 place count 681 transition count 790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 498 place count 680 transition count 789
Iterating global reduction 1 with 1 rules applied. Total rules applied 499 place count 680 transition count 789
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 500 place count 679 transition count 788
Iterating global reduction 1 with 1 rules applied. Total rules applied 501 place count 679 transition count 788
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 502 place count 678 transition count 787
Iterating global reduction 1 with 1 rules applied. Total rules applied 503 place count 678 transition count 787
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 504 place count 677 transition count 786
Iterating global reduction 1 with 1 rules applied. Total rules applied 505 place count 677 transition count 786
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 506 place count 676 transition count 785
Iterating global reduction 1 with 1 rules applied. Total rules applied 507 place count 676 transition count 785
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 508 place count 675 transition count 784
Iterating global reduction 1 with 1 rules applied. Total rules applied 509 place count 675 transition count 784
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 510 place count 674 transition count 783
Iterating global reduction 1 with 1 rules applied. Total rules applied 511 place count 674 transition count 783
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 512 place count 673 transition count 782
Iterating global reduction 1 with 1 rules applied. Total rules applied 513 place count 673 transition count 782
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 514 place count 672 transition count 781
Iterating global reduction 1 with 1 rules applied. Total rules applied 515 place count 672 transition count 781
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 516 place count 672 transition count 780
Applied a total of 516 rules in 908 ms. Remains 672 /928 variables (removed 256) and now considering 780/1040 (removed 260) transitions.
// Phase 1: matrix 780 rows 672 cols
[2024-05-29 12:02:01] [INFO ] Computed 4 invariants in 37 ms
[2024-05-29 12:02:01] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-29 12:02:01] [INFO ] Invariant cache hit.
[2024-05-29 12:02:02] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Running 779 sub problems to find dead transitions.
[2024-05-29 12:02:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 12:02:17] [INFO ] Deduced a trap composed of 333 places in 203 ms of which 33 ms to minimize.
[2024-05-29 12:02:17] [INFO ] Deduced a trap composed of 183 places in 192 ms of which 4 ms to minimize.
[2024-05-29 12:02:17] [INFO ] Deduced a trap composed of 266 places in 190 ms of which 4 ms to minimize.
[2024-05-29 12:02:18] [INFO ] Deduced a trap composed of 531 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:02:18] [INFO ] Deduced a trap composed of 311 places in 150 ms of which 4 ms to minimize.
[2024-05-29 12:02:19] [INFO ] Deduced a trap composed of 303 places in 136 ms of which 3 ms to minimize.
[2024-05-29 12:02:21] [INFO ] Deduced a trap composed of 303 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:02:21] [INFO ] Deduced a trap composed of 311 places in 155 ms of which 5 ms to minimize.
[2024-05-29 12:02:22] [INFO ] Deduced a trap composed of 304 places in 191 ms of which 10 ms to minimize.
[2024-05-29 12:02:22] [INFO ] Deduced a trap composed of 323 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:02:22] [INFO ] Deduced a trap composed of 328 places in 158 ms of which 3 ms to minimize.
[2024-05-29 12:02:23] [INFO ] Deduced a trap composed of 333 places in 192 ms of which 4 ms to minimize.
[2024-05-29 12:02:23] [INFO ] Deduced a trap composed of 326 places in 152 ms of which 4 ms to minimize.
[2024-05-29 12:02:26] [INFO ] Deduced a trap composed of 309 places in 156 ms of which 3 ms to minimize.
[2024-05-29 12:02:28] [INFO ] Deduced a trap composed of 304 places in 135 ms of which 3 ms to minimize.
[2024-05-29 12:02:29] [INFO ] Deduced a trap composed of 303 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:02:29] [INFO ] Deduced a trap composed of 317 places in 161 ms of which 4 ms to minimize.
[2024-05-29 12:02:29] [INFO ] Deduced a trap composed of 324 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/1452 variables, and 22 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 12:02:45] [INFO ] Deduced a trap composed of 317 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/1452 variables, and 23 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 19/19 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Starting structural reductions in LTL mode, iteration 1 : 672/928 places, 780/1040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62014 ms. Remains : 672/928 places, 780/1040 transitions.
Support contains 33 out of 672 places after structural reductions.
[2024-05-29 12:03:02] [INFO ] Flatten gal took : 84 ms
[2024-05-29 12:03:03] [INFO ] Flatten gal took : 41 ms
[2024-05-29 12:03:03] [INFO ] Input system was already deterministic with 780 transitions.
Support contains 31 out of 672 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (653 resets) in 1742 ms. (22 steps per ms) remains 17/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (15 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (14 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (16 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (14 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
[2024-05-29 12:03:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 648/672 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 12:03:04] [INFO ] Deduced a trap composed of 323 places in 171 ms of which 3 ms to minimize.
[2024-05-29 12:03:04] [INFO ] Deduced a trap composed of 332 places in 199 ms of which 4 ms to minimize.
[2024-05-29 12:03:04] [INFO ] Deduced a trap composed of 309 places in 155 ms of which 3 ms to minimize.
Problem AtomicPropp14 is UNSAT
[2024-05-29 12:03:04] [INFO ] Deduced a trap composed of 324 places in 159 ms of which 3 ms to minimize.
[2024-05-29 12:03:05] [INFO ] Deduced a trap composed of 304 places in 152 ms of which 4 ms to minimize.
[2024-05-29 12:03:05] [INFO ] Deduced a trap composed of 310 places in 149 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 780/1452 variables, 672/682 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1452 variables, 0/682 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/1452 variables, 0/682 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1452/1452 variables, and 682 constraints, problems are : Problem set: 1 solved, 16 unsolved in 2723 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 672/672 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 649/672 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 780/1452 variables, 672/682 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1452 variables, 16/698 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1452 variables, 0/698 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/1452 variables, 0/698 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1452/1452 variables, and 698 constraints, problems are : Problem set: 1 solved, 16 unsolved in 2180 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 672/672 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 6/6 constraints]
After SMT, in 4917ms problems are : Problem set: 1 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 3 properties in 3068 ms.
Support contains 18 out of 672 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 672/672 places, 780/780 transitions.
Graph (trivial) has 625 edges and 672 vertex of which 50 / 672 are part of one of the 9 SCC in 3 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (complete) has 917 edges and 631 vertex of which 627 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 440 rules applied. Total rules applied 442 place count 627 transition count 284
Reduce places removed 437 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 443 rules applied. Total rules applied 885 place count 190 transition count 278
Reduce places removed 3 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 17 rules applied. Total rules applied 902 place count 187 transition count 264
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 917 place count 173 transition count 263
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 917 place count 173 transition count 228
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 987 place count 138 transition count 228
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 990 place count 135 transition count 225
Iterating global reduction 4 with 3 rules applied. Total rules applied 993 place count 135 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 993 place count 135 transition count 223
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 997 place count 133 transition count 223
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 998 place count 132 transition count 222
Iterating global reduction 4 with 1 rules applied. Total rules applied 999 place count 132 transition count 222
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1045 place count 109 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1050 place count 109 transition count 194
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1063 place count 96 transition count 160
Iterating global reduction 5 with 13 rules applied. Total rules applied 1076 place count 96 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1080 place count 96 transition count 156
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1086 place count 90 transition count 150
Iterating global reduction 6 with 6 rules applied. Total rules applied 1092 place count 90 transition count 150
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1096 place count 86 transition count 146
Iterating global reduction 6 with 4 rules applied. Total rules applied 1100 place count 86 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1102 place count 86 transition count 144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1110 place count 82 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1116 place count 79 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1117 place count 79 transition count 152
Free-agglomeration rule applied 17 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 1134 place count 79 transition count 133
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1153 place count 62 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1163 place count 62 transition count 121
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1165 place count 62 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1166 place count 62 transition count 120
Applied a total of 1166 rules in 107 ms. Remains 62 /672 variables (removed 610) and now considering 120/780 (removed 660) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 62/672 places, 120/780 transitions.
RANDOM walk for 40000 steps (4696 resets) in 757 ms. (52 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40002 steps (1199 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (925 resets) in 56 ms. (701 steps per ms) remains 2/3 properties
// Phase 1: matrix 120 rows 62 cols
[2024-05-29 12:03:12] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 12:03:12] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 12:03:12] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 120/182 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 42/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 62/62 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 120/182 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 42/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 62/62 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 258ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 12 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 120/120 transitions.
Graph (trivial) has 38 edges and 62 vertex of which 2 / 62 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 61 transition count 108
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 51 transition count 107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 51 transition count 105
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 49 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 45 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 45 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 42 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 42 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 42 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 41 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 41 transition count 88
Performed 4 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 51 place count 37 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 37 transition count 82
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 54 place count 35 transition count 80
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 35 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 57 place count 34 transition count 79
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 34 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 34 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 33 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 33 transition count 77
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 65 place count 33 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 67 place count 32 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 32 transition count 77
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 77 place count 32 transition count 62
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 102 place count 23 transition count 46
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 105 place count 20 transition count 43
Iterating global reduction 7 with 3 rules applied. Total rules applied 108 place count 20 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 111 place count 20 transition count 40
Applied a total of 111 rules in 23 ms. Remains 20 /62 variables (removed 42) and now considering 40/120 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 20/62 places, 40/120 transitions.
RANDOM walk for 146 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-02b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-02b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 126 stabilizing places and 132 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&F(G(p1)))))))'
Support contains 4 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 658 transition count 766
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 658 transition count 766
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 649 transition count 757
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 649 transition count 757
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 643 transition count 751
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 643 transition count 751
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 637 transition count 745
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 637 transition count 745
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 633 transition count 741
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 633 transition count 741
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 630 transition count 738
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 630 transition count 738
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 627 transition count 735
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 627 transition count 735
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 624 transition count 732
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 624 transition count 732
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 621 transition count 729
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 621 transition count 729
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 618 transition count 726
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 618 transition count 726
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 616 transition count 724
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 616 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 614 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 614 transition count 722
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 612 transition count 720
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 612 transition count 720
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 610 transition count 718
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 610 transition count 718
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 608 transition count 716
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 608 transition count 716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 129 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 604 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 603 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 601 transition count 708
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 601 transition count 708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 144 place count 601 transition count 707
Applied a total of 144 rules in 311 ms. Remains 601 /672 variables (removed 71) and now considering 707/780 (removed 73) transitions.
// Phase 1: matrix 707 rows 601 cols
[2024-05-29 12:03:13] [INFO ] Computed 4 invariants in 8 ms
[2024-05-29 12:03:13] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-29 12:03:13] [INFO ] Invariant cache hit.
[2024-05-29 12:03:13] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 706 sub problems to find dead transitions.
[2024-05-29 12:03:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (OVERLAPS) 1/601 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-05-29 12:03:28] [INFO ] Deduced a trap composed of 302 places in 174 ms of which 5 ms to minimize.
[2024-05-29 12:03:28] [INFO ] Deduced a trap composed of 290 places in 136 ms of which 3 ms to minimize.
[2024-05-29 12:03:28] [INFO ] Deduced a trap composed of 297 places in 140 ms of which 3 ms to minimize.
[2024-05-29 12:03:30] [INFO ] Deduced a trap composed of 297 places in 151 ms of which 3 ms to minimize.
[2024-05-29 12:03:31] [INFO ] Deduced a trap composed of 298 places in 159 ms of which 3 ms to minimize.
[2024-05-29 12:03:31] [INFO ] Deduced a trap composed of 292 places in 136 ms of which 3 ms to minimize.
[2024-05-29 12:03:32] [INFO ] Deduced a trap composed of 298 places in 171 ms of which 3 ms to minimize.
[2024-05-29 12:03:32] [INFO ] Deduced a trap composed of 291 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:03:34] [INFO ] Deduced a trap composed of 298 places in 169 ms of which 5 ms to minimize.
[2024-05-29 12:03:34] [INFO ] Deduced a trap composed of 302 places in 143 ms of which 3 ms to minimize.
[2024-05-29 12:03:34] [INFO ] Deduced a trap composed of 296 places in 131 ms of which 3 ms to minimize.
[2024-05-29 12:03:34] [INFO ] Deduced a trap composed of 297 places in 140 ms of which 3 ms to minimize.
[2024-05-29 12:03:34] [INFO ] Deduced a trap composed of 292 places in 129 ms of which 2 ms to minimize.
[2024-05-29 12:03:35] [INFO ] Deduced a trap composed of 296 places in 115 ms of which 3 ms to minimize.
[2024-05-29 12:03:35] [INFO ] Deduced a trap composed of 291 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:03:35] [INFO ] Deduced a trap composed of 298 places in 142 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/601 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-05-29 12:03:42] [INFO ] Deduced a trap composed of 292 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/1308 variables, and 21 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/601 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (OVERLAPS) 1/601 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/601 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 302 places in 164 ms of which 4 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 298 places in 152 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 5 (OVERLAPS) 707/1308 variables, 601/624 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1308 variables, 706/1330 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-05-29 12:04:13] [INFO ] Deduced a trap composed of 290 places in 152 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1308/1308 variables, and 1331 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 20/20 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 706 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 601/672 places, 707/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60908 ms. Remains : 601/672 places, 707/780 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-00
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-00 finished in 61357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Graph (trivial) has 664 edges and 672 vertex of which 53 / 672 are part of one of the 9 SCC in 2 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 463 transitions
Trivial Post-agglo rules discarded 463 transitions
Performed 463 trivial Post agglomeration. Transition count delta: 463
Iterating post reduction 0 with 463 rules applied. Total rules applied 464 place count 627 transition count 266
Reduce places removed 463 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 470 rules applied. Total rules applied 934 place count 164 transition count 259
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 937 place count 161 transition count 259
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 937 place count 161 transition count 227
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1001 place count 129 transition count 227
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1011 place count 119 transition count 217
Iterating global reduction 3 with 10 rules applied. Total rules applied 1021 place count 119 transition count 217
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1021 place count 119 transition count 214
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1027 place count 116 transition count 214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1030 place count 113 transition count 211
Iterating global reduction 3 with 3 rules applied. Total rules applied 1033 place count 113 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1034 place count 113 transition count 210
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1084 place count 88 transition count 184
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1104 place count 68 transition count 124
Iterating global reduction 4 with 20 rules applied. Total rules applied 1124 place count 68 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1133 place count 68 transition count 115
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1144 place count 57 transition count 101
Iterating global reduction 5 with 11 rules applied. Total rules applied 1155 place count 57 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1156 place count 57 transition count 100
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1166 place count 47 transition count 90
Iterating global reduction 6 with 10 rules applied. Total rules applied 1176 place count 47 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1180 place count 47 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1186 place count 44 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1192 place count 41 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1195 place count 41 transition count 90
Applied a total of 1195 rules in 43 ms. Remains 41 /672 variables (removed 631) and now considering 90/780 (removed 690) transitions.
[2024-05-29 12:04:14] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
// Phase 1: matrix 86 rows 41 cols
[2024-05-29 12:04:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:04:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-29 12:04:14] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-29 12:04:14] [INFO ] Invariant cache hit.
[2024-05-29 12:04:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 12:04:14] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-29 12:04:14] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-29 12:04:14] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-29 12:04:14] [INFO ] Invariant cache hit.
[2024-05-29 12:04:14] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 12:04:14] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 12:04:14] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:04:14] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:04:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 12:04:15] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 85/126 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 64 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1782 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 85/126 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 81/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 145 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints]
After SMT, in 3873ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3874ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/672 places, 90/780 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4101 ms. Remains : 41/672 places, 90/780 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-01
Product exploration explored 100000 steps with 361 reset in 184 ms.
Product exploration explored 100000 steps with 290 reset in 77 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 25326 steps (4128 resets) in 127 ms. (197 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 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-29 12:04:19] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-29 12:04:19] [INFO ] Invariant cache hit.
[2024-05-29 12:04:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 12:04:19] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-29 12:04:19] [INFO ] Invariant cache hit.
[2024-05-29 12:04:19] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 12:04:19] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-29 12:04:19] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-29 12:04:19] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-29 12:04:19] [INFO ] Invariant cache hit.
[2024-05-29 12:04:19] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 12:04:19] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:04:19] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:04:19] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-29 12:04:19] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 12:04:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 85/126 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 64 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 85/126 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 81/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 145 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints]
After SMT, in 3890ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3891ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4018 ms. Remains : 41/41 places, 90/90 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7120 steps (1157 resets) in 19 ms. (356 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 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 261 reset in 37 ms.
Product exploration explored 100000 steps with 1025 reset in 143 ms.
Built C files in :
/tmp/ltsmin15854816216196793610
[2024-05-29 12:04:24] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-29 12:04:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:04:24] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-29 12:04:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:04:24] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-29 12:04:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:04:24] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15854816216196793610
Running compilation step : cd /tmp/ltsmin15854816216196793610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 374 ms.
Running link step : cd /tmp/ltsmin15854816216196793610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin15854816216196793610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11527964654214772892.hoa' '--buchi-type=spotba'
LTSmin run took 179 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-02b-LTLFireability-01 finished in 10472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 657 transition count 765
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 657 transition count 765
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 647 transition count 755
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 647 transition count 755
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 640 transition count 748
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 640 transition count 748
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 633 transition count 741
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 633 transition count 741
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 628 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 628 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 625 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 622 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 622 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 619 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 616 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 616 transition count 724
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 115 place count 613 transition count 721
Iterating global reduction 0 with 3 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 611 transition count 719
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 609 transition count 717
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 607 transition count 715
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 605 transition count 713
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 603 transition count 711
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 603 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 139 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 601 transition count 708
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 600 transition count 707
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 146 place count 599 transition count 706
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 148 place count 598 transition count 705
Iterating global reduction 1 with 1 rules applied. Total rules applied 149 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 150 place count 597 transition count 704
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 152 place count 596 transition count 703
Iterating global reduction 1 with 1 rules applied. Total rules applied 153 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 154 place count 596 transition count 702
Applied a total of 154 rules in 311 ms. Remains 596 /672 variables (removed 76) and now considering 702/780 (removed 78) transitions.
// Phase 1: matrix 702 rows 596 cols
[2024-05-29 12:04:25] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 12:04:25] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-29 12:04:25] [INFO ] Invariant cache hit.
[2024-05-29 12:04:25] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 701 sub problems to find dead transitions.
[2024-05-29 12:04:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-29 12:04:40] [INFO ] Deduced a trap composed of 290 places in 203 ms of which 9 ms to minimize.
[2024-05-29 12:04:40] [INFO ] Deduced a trap composed of 290 places in 179 ms of which 3 ms to minimize.
[2024-05-29 12:04:42] [INFO ] Deduced a trap composed of 292 places in 157 ms of which 3 ms to minimize.
[2024-05-29 12:04:44] [INFO ] Deduced a trap composed of 298 places in 159 ms of which 3 ms to minimize.
[2024-05-29 12:04:45] [INFO ] Deduced a trap composed of 292 places in 168 ms of which 3 ms to minimize.
[2024-05-29 12:04:45] [INFO ] Deduced a trap composed of 298 places in 174 ms of which 3 ms to minimize.
[2024-05-29 12:04:45] [INFO ] Deduced a trap composed of 291 places in 183 ms of which 3 ms to minimize.
[2024-05-29 12:04:45] [INFO ] Deduced a trap composed of 292 places in 206 ms of which 4 ms to minimize.
[2024-05-29 12:04:46] [INFO ] Deduced a trap composed of 292 places in 156 ms of which 3 ms to minimize.
[2024-05-29 12:04:46] [INFO ] Deduced a trap composed of 297 places in 190 ms of which 3 ms to minimize.
[2024-05-29 12:04:46] [INFO ] Deduced a trap composed of 297 places in 174 ms of which 3 ms to minimize.
[2024-05-29 12:04:47] [INFO ] Deduced a trap composed of 298 places in 192 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-29 12:04:49] [INFO ] Deduced a trap composed of 292 places in 143 ms of which 2 ms to minimize.
[2024-05-29 12:04:53] [INFO ] Deduced a trap composed of 291 places in 138 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1298 variables, and 18 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 702/1298 variables, 596/614 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1298 variables, 701/1315 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-29 12:05:18] [INFO ] Deduced a trap composed of 298 places in 189 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1298/1298 variables, and 1316 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 596/596 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 15/15 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 596/672 places, 702/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61035 ms. Remains : 596/672 places, 702/780 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1325 steps with 22 reset in 2 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-02 finished in 61141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 659 transition count 767
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 659 transition count 767
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 651 transition count 759
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 651 transition count 759
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 645 transition count 753
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 645 transition count 753
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 639 transition count 747
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 639 transition count 747
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 634 transition count 742
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 634 transition count 742
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 631 transition count 739
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 631 transition count 739
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 628 transition count 736
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 628 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 625 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 622 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 622 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 619 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 617 transition count 725
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 617 transition count 725
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 615 transition count 723
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 615 transition count 723
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 613 transition count 721
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 611 transition count 719
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 609 transition count 717
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 609 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 608 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 604 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 603 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 602 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 142 place count 602 transition count 708
Applied a total of 142 rules in 214 ms. Remains 602 /672 variables (removed 70) and now considering 708/780 (removed 72) transitions.
// Phase 1: matrix 708 rows 602 cols
[2024-05-29 12:05:26] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 12:05:26] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 12:05:26] [INFO ] Invariant cache hit.
[2024-05-29 12:05:26] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 707 sub problems to find dead transitions.
[2024-05-29 12:05:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 1 (OVERLAPS) 1/602 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 707 unsolved
[2024-05-29 12:05:41] [INFO ] Deduced a trap composed of 294 places in 178 ms of which 4 ms to minimize.
[2024-05-29 12:05:42] [INFO ] Deduced a trap composed of 299 places in 180 ms of which 4 ms to minimize.
[2024-05-29 12:05:42] [INFO ] Deduced a trap composed of 293 places in 151 ms of which 3 ms to minimize.
[2024-05-29 12:05:43] [INFO ] Deduced a trap composed of 294 places in 141 ms of which 3 ms to minimize.
[2024-05-29 12:05:44] [INFO ] Deduced a trap composed of 300 places in 158 ms of which 3 ms to minimize.
[2024-05-29 12:05:44] [INFO ] Deduced a trap composed of 298 places in 144 ms of which 3 ms to minimize.
[2024-05-29 12:05:45] [INFO ] Deduced a trap composed of 300 places in 125 ms of which 3 ms to minimize.
[2024-05-29 12:05:46] [INFO ] Deduced a trap composed of 294 places in 139 ms of which 3 ms to minimize.
[2024-05-29 12:05:46] [INFO ] Deduced a trap composed of 293 places in 121 ms of which 3 ms to minimize.
[2024-05-29 12:05:48] [INFO ] Deduced a trap composed of 291 places in 144 ms of which 3 ms to minimize.
[2024-05-29 12:05:48] [INFO ] Deduced a trap composed of 298 places in 162 ms of which 3 ms to minimize.
[2024-05-29 12:05:49] [INFO ] Deduced a trap composed of 302 places in 139 ms of which 2 ms to minimize.
[2024-05-29 12:05:49] [INFO ] Deduced a trap composed of 292 places in 165 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 707 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 602/1310 variables, and 17 constraints, problems are : Problem set: 0 solved, 707 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/602 constraints, PredecessorRefiner: 707/707 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 707 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 1 (OVERLAPS) 1/602 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 707 unsolved
[2024-05-29 12:06:10] [INFO ] Deduced a trap composed of 297 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 707 unsolved
[2024-05-29 12:06:12] [INFO ] Deduced a trap composed of 294 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 707 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/1310 variables, and 19 constraints, problems are : Problem set: 0 solved, 707 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/602 constraints, PredecessorRefiner: 0/707 constraints, Known Traps: 15/15 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 707 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in LTL mode, iteration 1 : 602/672 places, 708/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60953 ms. Remains : 602/672 places, 708/780 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-03 finished in 61562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Graph (trivial) has 662 edges and 672 vertex of which 53 / 672 are part of one of the 9 SCC in 4 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 627 transition count 267
Reduce places removed 462 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 469 rules applied. Total rules applied 932 place count 165 transition count 260
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 935 place count 162 transition count 260
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 935 place count 162 transition count 228
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 999 place count 130 transition count 228
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1008 place count 121 transition count 219
Iterating global reduction 3 with 9 rules applied. Total rules applied 1017 place count 121 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1017 place count 121 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1023 place count 118 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1025 place count 116 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 1027 place count 116 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1028 place count 116 transition count 213
Performed 25 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1078 place count 91 transition count 186
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1098 place count 71 transition count 126
Iterating global reduction 4 with 20 rules applied. Total rules applied 1118 place count 71 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1126 place count 71 transition count 118
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1137 place count 60 transition count 104
Iterating global reduction 5 with 11 rules applied. Total rules applied 1148 place count 60 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1149 place count 60 transition count 103
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1159 place count 50 transition count 93
Iterating global reduction 6 with 10 rules applied. Total rules applied 1169 place count 50 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1173 place count 50 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1179 place count 47 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1185 place count 44 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1188 place count 44 transition count 96
Applied a total of 1188 rules in 36 ms. Remains 44 /672 variables (removed 628) and now considering 96/780 (removed 684) transitions.
[2024-05-29 12:06:27] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
// Phase 1: matrix 92 rows 44 cols
[2024-05-29 12:06:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:06:27] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-29 12:06:27] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-29 12:06:27] [INFO ] Invariant cache hit.
[2024-05-29 12:06:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 12:06:27] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-29 12:06:27] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-29 12:06:27] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-29 12:06:27] [INFO ] Invariant cache hit.
[2024-05-29 12:06:27] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-29 12:06:28] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:06:28] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:06:28] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:06:28] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:06:28] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:06:28] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 91/135 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 71 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1849 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-29 12:06:29] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 91/135 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 87/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/136 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-29 12:06:31] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:06:31] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-29 12:06:31] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/136 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 14 (OVERLAPS) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 162 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 10/10 constraints]
After SMT, in 5923ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 5924ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/672 places, 96/780 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6147 ms. Remains : 44/672 places, 96/780 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-04
Product exploration explored 100000 steps with 595 reset in 141 ms.
Product exploration explored 100000 steps with 82 reset in 157 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 32204 steps (4996 resets) in 207 ms. (154 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-29 12:06:34] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-29 12:06:34] [INFO ] Invariant cache hit.
[2024-05-29 12:06:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 12:06:34] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-29 12:06:34] [INFO ] Invariant cache hit.
[2024-05-29 12:06:34] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 12:06:34] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-29 12:06:34] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-29 12:06:34] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2024-05-29 12:06:34] [INFO ] Invariant cache hit.
[2024-05-29 12:06:34] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-29 12:06:35] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:06:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:06:35] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:06:35] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:06:35] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:06:35] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 91/135 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 71 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-29 12:06:36] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 91/135 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 87/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/136 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-29 12:06:38] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:06:38] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-29 12:06:39] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/136 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 14 (OVERLAPS) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 162 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 10/10 constraints]
After SMT, in 5923ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 5924ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6023 ms. Remains : 44/44 places, 96/96 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 36878 steps (5695 resets) in 92 ms. (396 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 249 reset in 41 ms.
Product exploration explored 100000 steps with 460 reset in 37 ms.
Built C files in :
/tmp/ltsmin15734349001479031105
[2024-05-29 12:06:41] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-29 12:06:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:06:41] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-29 12:06:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:06:41] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-29 12:06:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:06:41] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15734349001479031105
Running compilation step : cd /tmp/ltsmin15734349001479031105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin15734349001479031105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15734349001479031105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13598905510923705160.hoa' '--buchi-type=spotba'
LTSmin run took 131 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-02b-LTLFireability-04 finished in 14440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Graph (trivial) has 664 edges and 672 vertex of which 53 / 672 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 628 transition count 268
Reduce places removed 462 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 469 rules applied. Total rules applied 932 place count 166 transition count 261
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 936 place count 163 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 937 place count 162 transition count 260
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 937 place count 162 transition count 227
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1003 place count 129 transition count 227
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1012 place count 120 transition count 218
Iterating global reduction 4 with 9 rules applied. Total rules applied 1021 place count 120 transition count 218
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1021 place count 120 transition count 216
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1025 place count 118 transition count 216
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1028 place count 115 transition count 213
Iterating global reduction 4 with 3 rules applied. Total rules applied 1031 place count 115 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1032 place count 115 transition count 212
Performed 27 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1086 place count 88 transition count 183
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1105 place count 69 transition count 124
Iterating global reduction 5 with 19 rules applied. Total rules applied 1124 place count 69 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1133 place count 69 transition count 115
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1143 place count 59 transition count 102
Iterating global reduction 6 with 10 rules applied. Total rules applied 1153 place count 59 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1154 place count 59 transition count 101
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1163 place count 50 transition count 92
Iterating global reduction 7 with 9 rules applied. Total rules applied 1172 place count 50 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1175 place count 50 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1181 place count 47 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1187 place count 44 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1190 place count 44 transition count 93
Applied a total of 1190 rules in 26 ms. Remains 44 /672 variables (removed 628) and now considering 93/780 (removed 687) transitions.
[2024-05-29 12:06:41] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
// Phase 1: matrix 89 rows 44 cols
[2024-05-29 12:06:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:06:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 12:06:41] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-29 12:06:41] [INFO ] Invariant cache hit.
[2024-05-29 12:06:42] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-29 12:06:42] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-29 12:06:42] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-29 12:06:42] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-29 12:06:42] [INFO ] Invariant cache hit.
[2024-05-29 12:06:42] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-29 12:06:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:06:42] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:06:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:06:42] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:06:42] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:06:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 88/132 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 27/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 80 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1869 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 88/132 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 27/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 85/164 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-29 12:06:44] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 166 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 7/7 constraints]
After SMT, in 4308ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4309ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/672 places, 93/780 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4436 ms. Remains : 44/672 places, 93/780 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-05 finished in 4550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (F(G(p1))||(p0&&G(p2)))))'
Support contains 3 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 660 transition count 768
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 660 transition count 768
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 653 transition count 761
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 653 transition count 761
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 647 transition count 755
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 647 transition count 755
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 641 transition count 749
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 641 transition count 749
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 637 transition count 745
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 637 transition count 745
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 635 transition count 743
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 635 transition count 743
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 633 transition count 741
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 633 transition count 741
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 631 transition count 739
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 631 transition count 739
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 629 transition count 737
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 629 transition count 737
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 627 transition count 735
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 627 transition count 735
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 626 transition count 734
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 626 transition count 734
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 625 transition count 733
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 624 transition count 732
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 624 transition count 732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 623 transition count 731
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 623 transition count 731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 622 transition count 730
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 622 transition count 730
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 622 transition count 729
Applied a total of 101 rules in 166 ms. Remains 622 /672 variables (removed 50) and now considering 729/780 (removed 51) transitions.
// Phase 1: matrix 729 rows 622 cols
[2024-05-29 12:06:46] [INFO ] Computed 4 invariants in 8 ms
[2024-05-29 12:06:46] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 12:06:46] [INFO ] Invariant cache hit.
[2024-05-29 12:06:47] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 728 sub problems to find dead transitions.
[2024-05-29 12:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/622 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-29 12:06:59] [INFO ] Deduced a trap composed of 291 places in 146 ms of which 3 ms to minimize.
[2024-05-29 12:07:00] [INFO ] Deduced a trap composed of 173 places in 151 ms of which 3 ms to minimize.
[2024-05-29 12:07:00] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 3 ms to minimize.
[2024-05-29 12:07:00] [INFO ] Deduced a trap composed of 503 places in 186 ms of which 4 ms to minimize.
[2024-05-29 12:07:00] [INFO ] Deduced a trap composed of 298 places in 130 ms of which 3 ms to minimize.
[2024-05-29 12:07:02] [INFO ] Deduced a trap composed of 293 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:07:03] [INFO ] Deduced a trap composed of 293 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:07:03] [INFO ] Deduced a trap composed of 299 places in 178 ms of which 3 ms to minimize.
[2024-05-29 12:07:03] [INFO ] Deduced a trap composed of 319 places in 173 ms of which 4 ms to minimize.
[2024-05-29 12:07:04] [INFO ] Deduced a trap composed of 293 places in 137 ms of which 4 ms to minimize.
[2024-05-29 12:07:04] [INFO ] Deduced a trap composed of 320 places in 141 ms of which 3 ms to minimize.
[2024-05-29 12:07:05] [INFO ] Deduced a trap composed of 293 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:07:06] [INFO ] Deduced a trap composed of 319 places in 174 ms of which 4 ms to minimize.
[2024-05-29 12:07:07] [INFO ] Deduced a trap composed of 298 places in 153 ms of which 3 ms to minimize.
[2024-05-29 12:07:08] [INFO ] Deduced a trap composed of 313 places in 132 ms of which 3 ms to minimize.
[2024-05-29 12:07:10] [INFO ] Deduced a trap composed of 292 places in 157 ms of which 3 ms to minimize.
[2024-05-29 12:07:10] [INFO ] Deduced a trap composed of 319 places in 160 ms of which 3 ms to minimize.
[2024-05-29 12:07:11] [INFO ] Deduced a trap composed of 298 places in 154 ms of which 4 ms to minimize.
[2024-05-29 12:07:13] [INFO ] Deduced a trap composed of 295 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-29 12:07:13] [INFO ] Deduced a trap composed of 298 places in 146 ms of which 4 ms to minimize.
[2024-05-29 12:07:14] [INFO ] Deduced a trap composed of 314 places in 133 ms of which 3 ms to minimize.
[2024-05-29 12:07:16] [INFO ] Deduced a trap composed of 290 places in 129 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1351 variables, and 26 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/622 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-29 12:07:29] [INFO ] Deduced a trap composed of 298 places in 149 ms of which 3 ms to minimize.
[2024-05-29 12:07:31] [INFO ] Deduced a trap composed of 292 places in 144 ms of which 3 ms to minimize.
[2024-05-29 12:07:31] [INFO ] Deduced a trap composed of 290 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-29 12:07:40] [INFO ] Deduced a trap composed of 313 places in 145 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-29 12:07:45] [INFO ] Deduced a trap composed of 166 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1351 variables, and 31 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/728 constraints, Known Traps: 27/27 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 622/672 places, 729/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60806 ms. Remains : 622/672 places, 729/780 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-06
Product exploration explored 100000 steps with 130 reset in 85 ms.
Product exploration explored 100000 steps with 1650 reset in 141 ms.
Computed a total of 125 stabilizing places and 131 stable transitions
Computed a total of 125 stabilizing places and 131 stable transitions
Detected a total of 125/622 stabilizing places and 131/729 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p0) (NOT p2))), (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 p2))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p2)))), (X (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 613 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
RANDOM walk for 40000 steps (653 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (163 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1090090 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 1
Probabilistic random walk after 1090090 steps, saw 237969 distinct states, run finished after 3004 ms. (steps per millisecond=362 ) properties seen :0
[2024-05-29 12:07:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 217/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 404/622 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1351 variables, 622/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1351 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1351 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1351/1351 variables, and 626 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 217/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 404/622 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1351 variables, 622/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1351 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1351 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1351 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1351/1351 variables, and 627 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 816ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 729/729 transitions.
Graph (trivial) has 617 edges and 622 vertex of which 51 / 622 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 856 edges and 580 vertex of which 577 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 437 rules applied. Total rules applied 439 place count 577 transition count 235
Reduce places removed 434 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 443 rules applied. Total rules applied 882 place count 143 transition count 226
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 885 place count 140 transition count 226
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 885 place count 140 transition count 191
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 955 place count 105 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 956 place count 104 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 957 place count 104 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 957 place count 104 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 959 place count 103 transition count 189
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1005 place count 80 transition count 166
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1012 place count 80 transition count 159
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1031 place count 61 transition count 103
Iterating global reduction 4 with 19 rules applied. Total rules applied 1050 place count 61 transition count 103
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1060 place count 61 transition count 93
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1069 place count 52 transition count 84
Iterating global reduction 5 with 9 rules applied. Total rules applied 1078 place count 52 transition count 84
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1084 place count 46 transition count 78
Iterating global reduction 5 with 6 rules applied. Total rules applied 1090 place count 46 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1093 place count 46 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1099 place count 43 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1107 place count 39 transition count 92
Free-agglomeration rule applied 17 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 17 rules applied. Total rules applied 1124 place count 39 transition count 68
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 33 rules applied. Total rules applied 1157 place count 22 transition count 52
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1160 place count 19 transition count 49
Iterating global reduction 7 with 3 rules applied. Total rules applied 1163 place count 19 transition count 49
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1166 place count 19 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1178 place count 19 transition count 34
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1180 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1181 place count 19 transition count 33
Applied a total of 1181 rules in 18 ms. Remains 19 /622 variables (removed 603) and now considering 33/729 (removed 696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 19/622 places, 33/729 transitions.
RANDOM walk for 133 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p0) (NOT p2))), (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 p2))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p2)))), (X (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT p1))]
Knowledge based reduction with 29 factoid took 559 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 1 out of 622 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 : 622/622 places, 729/729 transitions.
Graph (trivial) has 613 edges and 622 vertex of which 51 / 622 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 425 rules applied. Total rules applied 426 place count 579 transition count 255
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 434 rules applied. Total rules applied 860 place count 154 transition count 246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 863 place count 151 transition count 246
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 863 place count 151 transition count 214
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 927 place count 119 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 929 place count 117 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 931 place count 117 transition count 212
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 983 place count 91 transition count 186
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1002 place count 72 transition count 127
Iterating global reduction 3 with 19 rules applied. Total rules applied 1021 place count 72 transition count 127
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1031 place count 72 transition count 117
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1039 place count 64 transition count 107
Iterating global reduction 4 with 8 rules applied. Total rules applied 1047 place count 64 transition count 107
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1055 place count 56 transition count 99
Iterating global reduction 4 with 8 rules applied. Total rules applied 1063 place count 56 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1066 place count 56 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1074 place count 52 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1080 place count 49 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1083 place count 49 transition count 99
Applied a total of 1083 rules in 41 ms. Remains 49 /622 variables (removed 573) and now considering 99/729 (removed 630) transitions.
[2024-05-29 12:07:53] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
// Phase 1: matrix 95 rows 49 cols
[2024-05-29 12:07:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:07:53] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 12:07:53] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
[2024-05-29 12:07:53] [INFO ] Invariant cache hit.
[2024-05-29 12:07:53] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-29 12:07:53] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-29 12:07:53] [INFO ] Redundant transitions in 2 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-29 12:07:53] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
[2024-05-29 12:07:53] [INFO ] Invariant cache hit.
[2024-05-29 12:07:53] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 2/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 94/143 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 27/87 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 88 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2420 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 2/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 94/143 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 27/87 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 90/177 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 12:07:57] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 179 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints]
After SMT, in 5629ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5630ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/622 places, 99/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5808 ms. Remains : 49/622 places, 99/729 transitions.
Computed a total of 3 stabilizing places and 10 stable transitions
Computed a total of 3 stabilizing places and 10 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
RANDOM walk for 40000 steps (4813 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (946 resets) in 14 ms. (2666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5019 steps, run visited all 1 properties in 12 ms. (steps per millisecond=418 )
Probabilistic random walk after 5019 steps, saw 1704 distinct states, run finished after 18 ms. (steps per millisecond=278 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Product exploration explored 100000 steps with 225 reset in 68 ms.
Product exploration explored 100000 steps with 121 reset in 69 ms.
Built C files in :
/tmp/ltsmin3659235569938336330
[2024-05-29 12:07:59] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-29 12:07:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:07:59] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-29 12:07:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:07:59] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-29 12:07:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:07:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3659235569938336330
Running compilation step : cd /tmp/ltsmin3659235569938336330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 232 ms.
Running link step : cd /tmp/ltsmin3659235569938336330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3659235569938336330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12307850105063771074.hoa' '--buchi-type=spotba'
LTSmin run took 221 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-02b-LTLFireability-06 finished in 73419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(G(p0))&&F(p1)))||G(p2))))'
Support contains 5 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 659 transition count 767
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 659 transition count 767
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 650 transition count 758
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 650 transition count 758
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 644 transition count 752
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 644 transition count 752
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 638 transition count 746
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 638 transition count 746
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 634 transition count 742
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 634 transition count 742
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 631 transition count 739
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 631 transition count 739
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 628 transition count 736
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 628 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 625 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 622 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 622 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 619 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 617 transition count 725
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 617 transition count 725
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 615 transition count 723
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 615 transition count 723
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 613 transition count 721
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 611 transition count 719
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 609 transition count 717
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 609 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 608 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 604 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 603 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 602 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 142 place count 602 transition count 708
Applied a total of 142 rules in 230 ms. Remains 602 /672 variables (removed 70) and now considering 708/780 (removed 72) transitions.
// Phase 1: matrix 708 rows 602 cols
[2024-05-29 12:08:00] [INFO ] Computed 4 invariants in 9 ms
[2024-05-29 12:08:00] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 12:08:00] [INFO ] Invariant cache hit.
[2024-05-29 12:08:00] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 707 sub problems to find dead transitions.
[2024-05-29 12:08:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 1 (OVERLAPS) 1/602 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 707 unsolved
[2024-05-29 12:08:15] [INFO ] Deduced a trap composed of 296 places in 208 ms of which 4 ms to minimize.
[2024-05-29 12:08:15] [INFO ] Deduced a trap composed of 298 places in 166 ms of which 3 ms to minimize.
[2024-05-29 12:08:15] [INFO ] Deduced a trap composed of 298 places in 136 ms of which 2 ms to minimize.
[2024-05-29 12:08:15] [INFO ] Deduced a trap composed of 297 places in 146 ms of which 3 ms to minimize.
[2024-05-29 12:08:16] [INFO ] Deduced a trap composed of 298 places in 122 ms of which 3 ms to minimize.
[2024-05-29 12:08:17] [INFO ] Deduced a trap composed of 292 places in 113 ms of which 3 ms to minimize.
[2024-05-29 12:08:18] [INFO ] Deduced a trap composed of 292 places in 137 ms of which 2 ms to minimize.
[2024-05-29 12:08:18] [INFO ] Deduced a trap composed of 298 places in 143 ms of which 3 ms to minimize.
[2024-05-29 12:08:18] [INFO ] Deduced a trap composed of 291 places in 122 ms of which 2 ms to minimize.
[2024-05-29 12:08:21] [INFO ] Deduced a trap composed of 303 places in 154 ms of which 3 ms to minimize.
[2024-05-29 12:08:21] [INFO ] Deduced a trap composed of 292 places in 113 ms of which 2 ms to minimize.
[2024-05-29 12:08:21] [INFO ] Deduced a trap composed of 297 places in 148 ms of which 3 ms to minimize.
[2024-05-29 12:08:21] [INFO ] Deduced a trap composed of 298 places in 152 ms of which 3 ms to minimize.
[2024-05-29 12:08:22] [INFO ] Deduced a trap composed of 291 places in 136 ms of which 3 ms to minimize.
[2024-05-29 12:08:22] [INFO ] Deduced a trap composed of 303 places in 163 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 707 unsolved
[2024-05-29 12:08:28] [INFO ] Deduced a trap composed of 292 places in 130 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/1310 variables, and 20 constraints, problems are : Problem set: 0 solved, 707 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/602 constraints, PredecessorRefiner: 707/707 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 707 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 1 (OVERLAPS) 1/602 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 707 unsolved
[2024-05-29 12:08:43] [INFO ] Deduced a trap composed of 292 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 707 unsolved
[2024-05-29 12:08:52] [INFO ] Deduced a trap composed of 291 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 707 unsolved
(s97 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/1310 variables, and 22 constraints, problems are : Problem set: 0 solved, 707 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/602 constraints, PredecessorRefiner: 0/707 constraints, Known Traps: 18/18 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 707 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 602/672 places, 708/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60841 ms. Remains : 602/672 places, 708/780 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-07
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-07 finished in 61037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 658 transition count 766
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 658 transition count 766
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 649 transition count 757
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 649 transition count 757
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 643 transition count 751
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 643 transition count 751
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 637 transition count 745
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 637 transition count 745
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 633 transition count 741
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 633 transition count 741
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 631 transition count 739
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 631 transition count 739
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 629 transition count 737
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 629 transition count 737
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 627 transition count 735
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 627 transition count 735
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 625 transition count 733
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 623 transition count 731
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 623 transition count 731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 622 transition count 730
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 622 transition count 730
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 621 transition count 729
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 621 transition count 729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 620 transition count 728
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 620 transition count 728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 619 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 618 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 618 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 617 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 617 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 616 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 616 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 615 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 615 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 614 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 614 transition count 722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 613 transition count 721
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 612 transition count 720
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 612 transition count 720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 611 transition count 719
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 611 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 611 transition count 718
Applied a total of 123 rules in 222 ms. Remains 611 /672 variables (removed 61) and now considering 718/780 (removed 62) transitions.
// Phase 1: matrix 718 rows 611 cols
[2024-05-29 12:09:01] [INFO ] Computed 4 invariants in 7 ms
[2024-05-29 12:09:01] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 12:09:01] [INFO ] Invariant cache hit.
[2024-05-29 12:09:01] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 717 sub problems to find dead transitions.
[2024-05-29 12:09:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (OVERLAPS) 1/611 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-05-29 12:09:16] [INFO ] Deduced a trap composed of 305 places in 179 ms of which 4 ms to minimize.
[2024-05-29 12:09:16] [INFO ] Deduced a trap composed of 297 places in 181 ms of which 4 ms to minimize.
[2024-05-29 12:09:17] [INFO ] Deduced a trap composed of 297 places in 146 ms of which 3 ms to minimize.
[2024-05-29 12:09:17] [INFO ] Deduced a trap composed of 306 places in 141 ms of which 3 ms to minimize.
[2024-05-29 12:09:18] [INFO ] Deduced a trap composed of 298 places in 188 ms of which 4 ms to minimize.
[2024-05-29 12:09:18] [INFO ] Deduced a trap composed of 292 places in 166 ms of which 4 ms to minimize.
[2024-05-29 12:09:19] [INFO ] Deduced a trap composed of 306 places in 157 ms of which 4 ms to minimize.
[2024-05-29 12:09:20] [INFO ] Deduced a trap composed of 291 places in 170 ms of which 4 ms to minimize.
[2024-05-29 12:09:20] [INFO ] Deduced a trap composed of 297 places in 152 ms of which 7 ms to minimize.
[2024-05-29 12:09:23] [INFO ] Deduced a trap composed of 306 places in 147 ms of which 4 ms to minimize.
[2024-05-29 12:09:23] [INFO ] Deduced a trap composed of 292 places in 142 ms of which 4 ms to minimize.
[2024-05-29 12:09:23] [INFO ] Deduced a trap composed of 291 places in 145 ms of which 3 ms to minimize.
[2024-05-29 12:09:24] [INFO ] Deduced a trap composed of 313 places in 139 ms of which 3 ms to minimize.
[2024-05-29 12:09:24] [INFO ] Deduced a trap composed of 313 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-05-29 12:09:31] [INFO ] Deduced a trap composed of 291 places in 134 ms of which 2 ms to minimize.
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 611/1329 variables, and 19 constraints, problems are : Problem set: 0 solved, 717 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/611 constraints, PredecessorRefiner: 717/717 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 717 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (OVERLAPS) 1/611 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-05-29 12:09:39] [INFO ] Deduced a trap composed of 297 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:09:39] [INFO ] Deduced a trap composed of 394 places in 177 ms of which 3 ms to minimize.
[2024-05-29 12:09:39] [INFO ] Deduced a trap composed of 292 places in 158 ms of which 3 ms to minimize.
[2024-05-29 12:09:41] [INFO ] Deduced a trap composed of 292 places in 184 ms of which 3 ms to minimize.
[2024-05-29 12:09:43] [INFO ] Deduced a trap composed of 292 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/611 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 5 (OVERLAPS) 718/1329 variables, 611/635 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1329 variables, 717/1352 constraints. Problems are: Problem set: 0 solved, 717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1329 variables, and 1352 constraints, problems are : Problem set: 0 solved, 717 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 611/611 constraints, PredecessorRefiner: 717/717 constraints, Known Traps: 20/20 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 717 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 611/672 places, 718/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60941 ms. Remains : 611/672 places, 718/780 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-11 finished in 61081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F((p1&&G(p2)))&&G(p3))))))'
Support contains 3 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 780/780 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 658 transition count 766
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 658 transition count 766
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 648 transition count 756
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 648 transition count 756
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 641 transition count 749
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 641 transition count 749
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 634 transition count 742
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 634 transition count 742
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 629 transition count 737
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 629 transition count 737
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 627 transition count 735
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 627 transition count 735
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 625 transition count 733
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 625 transition count 733
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 623 transition count 731
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 623 transition count 731
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 621 transition count 729
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 621 transition count 729
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 619 transition count 727
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 618 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 618 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 617 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 617 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 616 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 616 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 615 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 615 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 614 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 614 transition count 722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 613 transition count 721
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 613 transition count 721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 612 transition count 720
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 612 transition count 720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 611 transition count 719
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 611 transition count 719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 610 transition count 718
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 610 transition count 718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 609 transition count 717
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 609 transition count 717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 608 transition count 716
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 607 transition count 715
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 607 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 131 place count 607 transition count 714
Applied a total of 131 rules in 226 ms. Remains 607 /672 variables (removed 65) and now considering 714/780 (removed 66) transitions.
// Phase 1: matrix 714 rows 607 cols
[2024-05-29 12:10:02] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 12:10:02] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 12:10:02] [INFO ] Invariant cache hit.
[2024-05-29 12:10:02] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 713 sub problems to find dead transitions.
[2024-05-29 12:10:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (OVERLAPS) 1/607 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 713 unsolved
[2024-05-29 12:10:17] [INFO ] Deduced a trap composed of 301 places in 180 ms of which 3 ms to minimize.
[2024-05-29 12:10:17] [INFO ] Deduced a trap composed of 297 places in 153 ms of which 3 ms to minimize.
[2024-05-29 12:10:18] [INFO ] Deduced a trap composed of 309 places in 151 ms of which 3 ms to minimize.
[2024-05-29 12:10:19] [INFO ] Deduced a trap composed of 297 places in 146 ms of which 3 ms to minimize.
[2024-05-29 12:10:20] [INFO ] Deduced a trap composed of 292 places in 163 ms of which 3 ms to minimize.
[2024-05-29 12:10:20] [INFO ] Deduced a trap composed of 298 places in 185 ms of which 2 ms to minimize.
[2024-05-29 12:10:21] [INFO ] Deduced a trap composed of 292 places in 126 ms of which 3 ms to minimize.
[2024-05-29 12:10:22] [INFO ] Deduced a trap composed of 297 places in 145 ms of which 3 ms to minimize.
[2024-05-29 12:10:22] [INFO ] Deduced a trap composed of 292 places in 156 ms of which 3 ms to minimize.
[2024-05-29 12:10:23] [INFO ] Deduced a trap composed of 291 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:10:23] [INFO ] Deduced a trap composed of 302 places in 150 ms of which 3 ms to minimize.
[2024-05-29 12:10:23] [INFO ] Deduced a trap composed of 298 places in 165 ms of which 3 ms to minimize.
[2024-05-29 12:10:23] [INFO ] Deduced a trap composed of 291 places in 157 ms of which 3 ms to minimize.
[2024-05-29 12:10:24] [INFO ] Deduced a trap composed of 297 places in 147 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 713 unsolved
[2024-05-29 12:10:26] [INFO ] Deduced a trap composed of 309 places in 129 ms of which 3 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 292 places in 119 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1321 variables, and 20 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/607 constraints, PredecessorRefiner: 713/713 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 713 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (OVERLAPS) 1/607 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 713 unsolved
[2024-05-29 12:10:42] [INFO ] Deduced a trap composed of 301 places in 135 ms of which 3 ms to minimize.
[2024-05-29 12:10:42] [INFO ] Deduced a trap composed of 298 places in 135 ms of which 3 ms to minimize.
[2024-05-29 12:10:43] [INFO ] Deduced a trap composed of 292 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/607 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 5 (OVERLAPS) 714/1321 variables, 607/630 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1321 variables, 713/1343 constraints. Problems are: Problem set: 0 solved, 713 unsolved
[2024-05-29 12:11:02] [INFO ] Deduced a trap composed of 291 places in 121 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 1344 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 607/607 constraints, PredecessorRefiner: 713/713 constraints, Known Traps: 20/20 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 713 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 607/672 places, 714/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60888 ms. Remains : 607/672 places, 714/780 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p3 (NOT p1) p2), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X p2), (X (NOT (AND (NOT p0) p3))), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X p0), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p3)))), (X (X p3)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 19 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-15 finished in 61554 ms.
All properties solved by simple procedures.
Total runtime 543240 ms.
BK_STOP 1716984663627
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-02b"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-02b, 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 r400-tall-171690531600100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-02b.tgz
mv StigmergyCommit-PT-02b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;