About the Execution of ITS-Tools for StigmergyCommit-PT-11a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7708.699 | 2068886.00 | 2323628.00 | 8107.40 | FFTFFTTTFFFTFTFF | 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-171690531900235.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-11a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531900235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 464M 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-11a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-11a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717003789708
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 17:29:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 17:29:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:30:08] [INFO ] Load time of PNML (sax parser for PT used): 16747 ms
[2024-05-29 17:30:08] [INFO ] Transformed 436 places.
[2024-05-29 17:30:10] [INFO ] Transformed 373236 transitions.
[2024-05-29 17:30:10] [INFO ] Found NUPN structural information;
[2024-05-29 17:30:10] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 19025 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-11a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 345 transition count 8655
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 345 transition count 8655
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 193 place count 345 transition count 8644
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 237 place count 301 transition count 8589
Iterating global reduction 1 with 44 rules applied. Total rules applied 281 place count 301 transition count 8589
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 292 place count 301 transition count 8578
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 299 place count 294 transition count 8571
Iterating global reduction 2 with 7 rules applied. Total rules applied 306 place count 294 transition count 8571
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 312 place count 288 transition count 8565
Iterating global reduction 2 with 6 rules applied. Total rules applied 318 place count 288 transition count 8565
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 323 place count 283 transition count 8560
Iterating global reduction 2 with 5 rules applied. Total rules applied 328 place count 283 transition count 8560
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 332 place count 279 transition count 8556
Iterating global reduction 2 with 4 rules applied. Total rules applied 336 place count 279 transition count 8556
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 340 place count 279 transition count 8552
Applied a total of 340 rules in 352 ms. Remains 279 /436 variables (removed 157) and now considering 8552/8758 (removed 206) transitions.
[2024-05-29 17:30:12] [INFO ] Flow matrix only has 8538 transitions (discarded 14 similar events)
// Phase 1: matrix 8538 rows 279 cols
[2024-05-29 17:30:12] [INFO ] Computed 3 invariants in 112 ms
[2024-05-29 17:30:15] [INFO ] Implicit Places using invariants in 2844 ms returned []
[2024-05-29 17:30:15] [INFO ] Flow matrix only has 8538 transitions (discarded 14 similar events)
[2024-05-29 17:30:15] [INFO ] Invariant cache hit.
[2024-05-29 17:30:18] [INFO ] State equation strengthened by 8315 read => feed constraints.
[2024-05-29 17:30:27] [INFO ] Implicit Places using invariants and state equation in 11809 ms returned [278]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 14702 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 278/436 places, 8552/8758 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 246 transition count 8520
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 246 transition count 8520
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 246 transition count 8508
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 86 place count 236 transition count 8498
Iterating global reduction 1 with 10 rules applied. Total rules applied 96 place count 236 transition count 8498
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 106 place count 226 transition count 8488
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 226 transition count 8488
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 126 place count 216 transition count 8478
Iterating global reduction 1 with 10 rules applied. Total rules applied 136 place count 216 transition count 8478
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 145 place count 207 transition count 8469
Iterating global reduction 1 with 9 rules applied. Total rules applied 154 place count 207 transition count 8469
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 162 place count 199 transition count 8461
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 199 transition count 8461
Applied a total of 170 rules in 268 ms. Remains 199 /278 variables (removed 79) and now considering 8461/8552 (removed 91) transitions.
[2024-05-29 17:30:27] [INFO ] Flow matrix only has 8447 transitions (discarded 14 similar events)
// Phase 1: matrix 8447 rows 199 cols
[2024-05-29 17:30:27] [INFO ] Computed 2 invariants in 49 ms
[2024-05-29 17:30:30] [INFO ] Implicit Places using invariants in 2498 ms returned []
[2024-05-29 17:30:30] [INFO ] Flow matrix only has 8447 transitions (discarded 14 similar events)
[2024-05-29 17:30:30] [INFO ] Invariant cache hit.
[2024-05-29 17:30:33] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:30:36] [INFO ] Implicit Places using invariants and state equation in 6100 ms returned []
Implicit Place search using SMT with State Equation took 8600 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 199/436 places, 8461/8758 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23944 ms. Remains : 199/436 places, 8461/8758 transitions.
Support contains 23 out of 199 places after structural reductions.
[2024-05-29 17:30:37] [INFO ] Flatten gal took : 981 ms
[2024-05-29 17:30:38] [INFO ] Flatten gal took : 711 ms
[2024-05-29 17:30:39] [INFO ] Input system was already deterministic with 8461 transitions.
Support contains 22 out of 199 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 39406 ms. (1 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 4/4 properties
[2024-05-29 17:30:50] [INFO ] Flow matrix only has 8447 transitions (discarded 14 similar events)
[2024-05-29 17:30:50] [INFO ] Invariant cache hit.
[2024-05-29 17:30:52] [INFO ] State equation strengthened by 8201 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 174/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/199 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8446/8645 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8645 variables, 8200/8401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8645 variables, 0/8401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/8646 variables, 1/8402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8646 variables, 0/8402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/8646 variables, 0/8402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8646/8646 variables, and 8402 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, ReadFeed: 8201/8201 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 174/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 17:30:59] [INFO ] Deduced a trap composed of 13 places in 2910 ms of which 18 ms to minimize.
[2024-05-29 17:31:02] [INFO ] Deduced a trap composed of 17 places in 2645 ms of which 3 ms to minimize.
SMT process timed out in 11561ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Graph (complete) has 687 edges and 199 vertex of which 197 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.57 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 197 transition count 8359
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 100 rules applied. Total rules applied 201 place count 122 transition count 8334
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 214 place count 111 transition count 8332
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 218 place count 110 transition count 8329
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 107 transition count 8329
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 221 place count 107 transition count 8326
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 227 place count 104 transition count 8326
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 240 place count 91 transition count 8312
Iterating global reduction 5 with 13 rules applied. Total rules applied 253 place count 91 transition count 8312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 91 transition count 8311
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 264 place count 81 transition count 8301
Iterating global reduction 6 with 10 rules applied. Total rules applied 274 place count 81 transition count 8301
Performed 49 Post agglomeration using F-continuation condition with reduction of 8145 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 374 place count 30 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 6 with 76 rules applied. Total rules applied 450 place count 30 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 453 place count 28 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 455 place count 28 transition count 28
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 456 place count 28 transition count 27
Applied a total of 456 rules in 1018 ms. Remains 28 /199 variables (removed 171) and now considering 27/8461 (removed 8434) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1018 ms. Remains : 28/199 places, 27/8461 transitions.
RANDOM walk for 40000 steps (8 resets) in 423 ms. (94 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
// Phase 1: matrix 27 rows 28 cols
[2024-05-29 17:31:03] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 17:31:03] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/28 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/55 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 0 solved, 2 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 28/28 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:31:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:31:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem AtomicPropp7 is UNSAT
[2024-05-29 17:31:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:31:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 17:31:03] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 21/55 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 6/9 constraints, State Equation: 0/28 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 170ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA StigmergyCommit-PT-11a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 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(F(p0)))'
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 183 transition count 8444
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 183 transition count 8444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 183 transition count 8442
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 171 transition count 8430
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 171 transition count 8430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 171 transition count 8428
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 163 transition count 8420
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 163 transition count 8420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 163 transition count 8419
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 84 place count 156 transition count 8412
Iterating global reduction 3 with 7 rules applied. Total rules applied 91 place count 156 transition count 8412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 156 transition count 8410
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 98 place count 151 transition count 8405
Iterating global reduction 4 with 5 rules applied. Total rules applied 103 place count 151 transition count 8405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 151 transition count 8404
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 107 place count 148 transition count 8401
Iterating global reduction 5 with 3 rules applied. Total rules applied 110 place count 148 transition count 8401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 148 transition count 8399
Applied a total of 112 rules in 262 ms. Remains 148 /199 variables (removed 51) and now considering 8399/8461 (removed 62) transitions.
[2024-05-29 17:31:04] [INFO ] Flow matrix only has 8386 transitions (discarded 13 similar events)
// Phase 1: matrix 8386 rows 148 cols
[2024-05-29 17:31:04] [INFO ] Computed 1 invariants in 41 ms
[2024-05-29 17:31:06] [INFO ] Implicit Places using invariants in 2704 ms returned []
[2024-05-29 17:31:06] [INFO ] Flow matrix only has 8386 transitions (discarded 13 similar events)
[2024-05-29 17:31:06] [INFO ] Invariant cache hit.
[2024-05-29 17:31:09] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:31:13] [INFO ] Implicit Places using invariants and state equation in 6467 ms returned []
Implicit Place search using SMT with State Equation took 9178 ms to find 0 implicit places.
Running 8398 sub problems to find dead transitions.
[2024-05-29 17:31:13] [INFO ] Flow matrix only has 8386 transitions (discarded 13 similar events)
[2024-05-29 17:31:13] [INFO ] Invariant cache hit.
[2024-05-29 17:31:14] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 147/8534 variables, and 0 constraints, problems are : Problem set: 0 solved, 8398 unsolved in 30154 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/148 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8398/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 147/8534 variables, and 0 constraints, problems are : Problem set: 0 solved, 8398 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/148 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 206952ms problems are : Problem set: 0 solved, 8398 unsolved
Search for dead transitions found 0 dead transitions in 207073ms
Starting structural reductions in LTL mode, iteration 1 : 148/199 places, 8399/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216563 ms. Remains : 148/199 places, 8399/8461 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 644 ms.
Product exploration explored 100000 steps with 50000 reset in 480 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [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 23 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-11a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-02 finished in 218137 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((X(p0)||G(p1))))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 185 transition count 8446
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 185 transition count 8446
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 185 transition count 8444
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 175 transition count 8434
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 175 transition count 8434
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 167 transition count 8426
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 167 transition count 8426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 167 transition count 8425
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 160 transition count 8418
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 160 transition count 8418
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 160 transition count 8416
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 88 place count 155 transition count 8411
Iterating global reduction 3 with 5 rules applied. Total rules applied 93 place count 155 transition count 8411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 155 transition count 8410
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 97 place count 152 transition count 8407
Iterating global reduction 4 with 3 rules applied. Total rules applied 100 place count 152 transition count 8407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 152 transition count 8405
Applied a total of 102 rules in 220 ms. Remains 152 /199 variables (removed 47) and now considering 8405/8461 (removed 56) transitions.
[2024-05-29 17:34:42] [INFO ] Flow matrix only has 8392 transitions (discarded 13 similar events)
// Phase 1: matrix 8392 rows 152 cols
[2024-05-29 17:34:42] [INFO ] Computed 1 invariants in 46 ms
[2024-05-29 17:34:44] [INFO ] Implicit Places using invariants in 2585 ms returned []
[2024-05-29 17:34:44] [INFO ] Flow matrix only has 8392 transitions (discarded 13 similar events)
[2024-05-29 17:34:44] [INFO ] Invariant cache hit.
[2024-05-29 17:34:47] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:34:50] [INFO ] Implicit Places using invariants and state equation in 5965 ms returned []
Implicit Place search using SMT with State Equation took 8563 ms to find 0 implicit places.
Running 8404 sub problems to find dead transitions.
[2024-05-29 17:34:50] [INFO ] Flow matrix only has 8392 transitions (discarded 13 similar events)
[2024-05-29 17:34:50] [INFO ] Invariant cache hit.
[2024-05-29 17:34:51] [INFO ] State equation strengthened by 8201 read => feed constraints.
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 151/8544 variables, and 0 constraints, problems are : Problem set: 0 solved, 8404 unsolved in 30114 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/152 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8404/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 151/8544 variables, and 0 constraints, problems are : Problem set: 0 solved, 8404 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/152 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 197898ms problems are : Problem set: 0 solved, 8404 unsolved
Search for dead transitions found 0 dead transitions in 197985ms
Starting structural reductions in LTL mode, iteration 1 : 152/199 places, 8405/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206831 ms. Remains : 152/199 places, 8405/8461 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 2913 ms.
Product exploration explored 100000 steps with 0 reset in 6117 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 37432 ms. (1 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8955 steps, run visited all 1 properties in 90 ms. (steps per millisecond=99 )
Probabilistic random walk after 8955 steps, saw 8759 distinct states, run finished after 97 ms. (steps per millisecond=92 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 6 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-11a-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-04 finished in 226262 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&&X(p1)))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 185 transition count 8446
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 185 transition count 8446
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 185 transition count 8444
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 175 transition count 8434
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 175 transition count 8434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 175 transition count 8432
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 169 transition count 8426
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 169 transition count 8426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 169 transition count 8425
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 70 place count 164 transition count 8420
Iterating global reduction 3 with 5 rules applied. Total rules applied 75 place count 164 transition count 8420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 164 transition count 8418
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 79 place count 162 transition count 8416
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 162 transition count 8416
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 160 transition count 8414
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 160 transition count 8414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 160 transition count 8413
Applied a total of 86 rules in 211 ms. Remains 160 /199 variables (removed 39) and now considering 8413/8461 (removed 48) transitions.
[2024-05-29 17:38:28] [INFO ] Flow matrix only has 8400 transitions (discarded 13 similar events)
// Phase 1: matrix 8400 rows 160 cols
[2024-05-29 17:38:28] [INFO ] Computed 1 invariants in 43 ms
[2024-05-29 17:38:30] [INFO ] Implicit Places using invariants in 2519 ms returned []
[2024-05-29 17:38:30] [INFO ] Flow matrix only has 8400 transitions (discarded 13 similar events)
[2024-05-29 17:38:30] [INFO ] Invariant cache hit.
[2024-05-29 17:38:33] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:38:36] [INFO ] Implicit Places using invariants and state equation in 6013 ms returned []
Implicit Place search using SMT with State Equation took 8538 ms to find 0 implicit places.
Running 8412 sub problems to find dead transitions.
[2024-05-29 17:38:37] [INFO ] Flow matrix only has 8400 transitions (discarded 13 similar events)
[2024-05-29 17:38:37] [INFO ] Invariant cache hit.
[2024-05-29 17:38:37] [INFO ] State equation strengthened by 8201 read => feed constraints.
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 159/8560 variables, and 0 constraints, problems are : Problem set: 0 solved, 8412 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/160 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8412/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 159/8560 variables, and 0 constraints, problems are : Problem set: 0 solved, 8412 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/160 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 196641ms problems are : Problem set: 0 solved, 8412 unsolved
Search for dead transitions found 0 dead transitions in 196725ms
Starting structural reductions in LTL mode, iteration 1 : 160/199 places, 8413/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205559 ms. Remains : 160/199 places, 8413/8461 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 424 ms.
Product exploration explored 100000 steps with 33333 reset in 504 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-11a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-06 finished in 206839 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 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 184 transition count 8445
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 184 transition count 8445
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 184 transition count 8443
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 172 transition count 8431
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 172 transition count 8431
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 172 transition count 8429
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 164 transition count 8421
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 164 transition count 8421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 164 transition count 8420
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 82 place count 157 transition count 8413
Iterating global reduction 3 with 7 rules applied. Total rules applied 89 place count 157 transition count 8413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 157 transition count 8411
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 96 place count 152 transition count 8406
Iterating global reduction 4 with 5 rules applied. Total rules applied 101 place count 152 transition count 8406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 152 transition count 8405
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 105 place count 149 transition count 8402
Iterating global reduction 5 with 3 rules applied. Total rules applied 108 place count 149 transition count 8402
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 149 transition count 8400
Applied a total of 110 rules in 217 ms. Remains 149 /199 variables (removed 50) and now considering 8400/8461 (removed 61) transitions.
[2024-05-29 17:41:55] [INFO ] Flow matrix only has 8387 transitions (discarded 13 similar events)
// Phase 1: matrix 8387 rows 149 cols
[2024-05-29 17:41:55] [INFO ] Computed 1 invariants in 29 ms
[2024-05-29 17:41:57] [INFO ] Implicit Places using invariants in 2550 ms returned []
[2024-05-29 17:41:57] [INFO ] Flow matrix only has 8387 transitions (discarded 13 similar events)
[2024-05-29 17:41:57] [INFO ] Invariant cache hit.
[2024-05-29 17:42:00] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:42:03] [INFO ] Implicit Places using invariants and state equation in 5997 ms returned []
Implicit Place search using SMT with State Equation took 8552 ms to find 0 implicit places.
Running 8399 sub problems to find dead transitions.
[2024-05-29 17:42:03] [INFO ] Flow matrix only has 8387 transitions (discarded 13 similar events)
[2024-05-29 17:42:03] [INFO ] Invariant cache hit.
[2024-05-29 17:42:04] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 148/8536 variables, and 0 constraints, problems are : Problem set: 0 solved, 8399 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/149 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8399/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 148/8536 variables, and 0 constraints, problems are : Problem set: 0 solved, 8399 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/149 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/172 constraints, Known Traps: 0/0 constraints]
After SMT, in 202832ms problems are : Problem set: 0 solved, 8399 unsolved
Search for dead transitions found 0 dead transitions in 202916ms
Starting structural reductions in LTL mode, iteration 1 : 149/199 places, 8400/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211716 ms. Remains : 149/199 places, 8400/8461 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 430 ms.
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [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-11a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-07 finished in 212790 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 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 198 transition count 8380
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 87 rules applied. Total rules applied 167 place count 118 transition count 8373
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 172 place count 116 transition count 8370
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 176 place count 115 transition count 8367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 178 place count 113 transition count 8367
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 178 place count 113 transition count 8356
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 200 place count 102 transition count 8356
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 100 transition count 8354
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 100 transition count 8354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 205 place count 100 transition count 8353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 205 place count 100 transition count 8352
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 207 place count 99 transition count 8352
Performed 47 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 301 place count 52 transition count 8290
Ensure Unique test removed 2060 transitions
Reduce isomorphic transitions removed 2060 transitions.
Iterating post reduction 6 with 2060 rules applied. Total rules applied 2361 place count 52 transition count 6230
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2377 place count 44 transition count 6222
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 2385 place count 44 transition count 6214
Drop transitions (Redundant composition of simpler transitions.) removed 6091 transitions
Redundant transition composition rules discarded 6091 transitions
Iterating global reduction 8 with 6091 rules applied. Total rules applied 8476 place count 44 transition count 123
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 8500 place count 32 transition count 111
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 8504 place count 28 transition count 107
Applied a total of 8504 rules in 3793 ms. Remains 28 /199 variables (removed 171) and now considering 107/8461 (removed 8354) transitions.
[2024-05-29 17:45:31] [INFO ] Flow matrix only has 94 transitions (discarded 13 similar events)
// Phase 1: matrix 94 rows 28 cols
[2024-05-29 17:45:31] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 17:45:31] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 17:45:31] [INFO ] Flow matrix only has 94 transitions (discarded 13 similar events)
[2024-05-29 17:45:31] [INFO ] Invariant cache hit.
[2024-05-29 17:45:31] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-29 17:45:31] [INFO ] Redundant transitions in 3 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-29 17:45:31] [INFO ] Flow matrix only has 94 transitions (discarded 13 similar events)
[2024-05-29 17:45:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 12/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 17:45:31] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-29 17:45:31] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 17:45:31] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:45:31] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 93/121 variables, 28/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/121 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/122 variables, and 71 constraints, problems are : Problem set: 0 solved, 29 unsolved in 2402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 12/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 5 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 5 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 7/130 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 93/121 variables, 28/158 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 29/187 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/121 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/122 variables, and 187 constraints, problems are : Problem set: 0 solved, 29 unsolved in 4614 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 129/129 constraints]
After SMT, in 7036ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 7037ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/199 places, 107/8461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10972 ms. Remains : 28/199 places, 107/8461 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-12
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-11a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-12 finished in 11076 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(X(X(X(F(p0))))))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 185 transition count 8446
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 185 transition count 8446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 185 transition count 8445
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 174 transition count 8434
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 174 transition count 8434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 174 transition count 8432
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 166 transition count 8424
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 166 transition count 8424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 166 transition count 8423
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 77 place count 159 transition count 8416
Iterating global reduction 3 with 7 rules applied. Total rules applied 84 place count 159 transition count 8416
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 159 transition count 8414
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 91 place count 154 transition count 8409
Iterating global reduction 4 with 5 rules applied. Total rules applied 96 place count 154 transition count 8409
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 154 transition count 8408
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 100 place count 151 transition count 8405
Iterating global reduction 5 with 3 rules applied. Total rules applied 103 place count 151 transition count 8405
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 105 place count 151 transition count 8403
Applied a total of 105 rules in 263 ms. Remains 151 /199 variables (removed 48) and now considering 8403/8461 (removed 58) transitions.
[2024-05-29 17:45:39] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
// Phase 1: matrix 8390 rows 151 cols
[2024-05-29 17:45:39] [INFO ] Computed 1 invariants in 31 ms
[2024-05-29 17:45:41] [INFO ] Implicit Places using invariants in 2740 ms returned []
[2024-05-29 17:45:41] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-05-29 17:45:41] [INFO ] Invariant cache hit.
[2024-05-29 17:45:44] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:45:47] [INFO ] Implicit Places using invariants and state equation in 5974 ms returned []
Implicit Place search using SMT with State Equation took 8716 ms to find 0 implicit places.
Running 8402 sub problems to find dead transitions.
[2024-05-29 17:45:47] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-05-29 17:45:47] [INFO ] Invariant cache hit.
[2024-05-29 17:45:48] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8402/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 196900ms problems are : Problem set: 0 solved, 8402 unsolved
Search for dead transitions found 0 dead transitions in 196983ms
Starting structural reductions in LTL mode, iteration 1 : 151/199 places, 8403/8461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205997 ms. Remains : 151/199 places, 8403/8461 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-13
Product exploration explored 100000 steps with 13403 reset in 454 ms.
Product exploration explored 100000 steps with 13423 reset in 450 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 98 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 8403/8403 transitions.
Applied a total of 0 rules in 26 ms. Remains 151 /151 variables (removed 0) and now considering 8403/8403 (removed 0) transitions.
[2024-05-29 17:49:06] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-05-29 17:49:06] [INFO ] Invariant cache hit.
[2024-05-29 17:49:09] [INFO ] Implicit Places using invariants in 2573 ms returned []
[2024-05-29 17:49:09] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-05-29 17:49:09] [INFO ] Invariant cache hit.
[2024-05-29 17:49:11] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:49:15] [INFO ] Implicit Places using invariants and state equation in 5976 ms returned []
Implicit Place search using SMT with State Equation took 8554 ms to find 0 implicit places.
Running 8402 sub problems to find dead transitions.
[2024-05-29 17:49:15] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-05-29 17:49:15] [INFO ] Invariant cache hit.
[2024-05-29 17:49:16] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8402/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 197462ms problems are : Problem set: 0 solved, 8402 unsolved
Search for dead transitions found 0 dead transitions in 197546ms
Finished structural reductions in LTL mode , in 1 iterations and 206157 ms. Remains : 151/151 places, 8403/8403 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13401 reset in 474 ms.
Product exploration explored 100000 steps with 13258 reset in 498 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 8403/8403 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 151 transition count 8403
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 36 place count 151 transition count 8415
Deduced a syphon composed of 48 places in 2 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 151 transition count 8415
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 70 place count 129 transition count 8393
Deduced a syphon composed of 26 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 92 place count 129 transition count 8393
Performed 61 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 87 places in 2 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 153 place count 129 transition count 8404
Ensure Unique test removed 4130 transitions
Reduce isomorphic transitions removed 4130 transitions.
Iterating post reduction 1 with 4130 rules applied. Total rules applied 4283 place count 129 transition count 4274
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 4323 place count 89 transition count 4234
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 4363 place count 89 transition count 4234
Deduced a syphon composed of 47 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4119 transitions
Redundant transition composition rules discarded 4119 transitions
Iterating global reduction 2 with 4119 rules applied. Total rules applied 8482 place count 89 transition count 115
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 8494 place count 89 transition count 115
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 8518 place count 65 transition count 91
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 8542 place count 65 transition count 91
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 8542 rules in 2853 ms. Remains 65 /151 variables (removed 86) and now considering 91/8403 (removed 8312) transitions.
[2024-05-29 17:52:38] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-29 17:52:38] [INFO ] Flow matrix only has 79 transitions (discarded 12 similar events)
// Phase 1: matrix 79 rows 65 cols
[2024-05-29 17:52:38] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 17:52:38] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 2 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 3 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 17:52:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:52:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 9 (OVERLAPS) 78/143 variables, 65/154 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 12/166 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/166 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 1/144 variables, 1/167 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/167 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 14 (OVERLAPS) 0/144 variables, 0/167 constraints. Problems are: Problem set: 46 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 167 constraints, problems are : Problem set: 46 solved, 44 unsolved in 5870 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 46 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 36/65 variables, 1/1 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 88/89 constraints. Problems are: Problem set: 46 solved, 44 unsolved
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:52:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 20/109 constraints. Problems are: Problem set: 46 solved, 44 unsolved
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 8/117 constraints. Problems are: Problem set: 46 solved, 44 unsolved
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/119 constraints. Problems are: Problem set: 46 solved, 44 unsolved
[2024-05-29 17:52:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/120 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/120 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 78/143 variables, 65/185 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 12/197 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 44/241 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/241 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 1/144 variables, 1/242 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/242 constraints. Problems are: Problem set: 46 solved, 44 unsolved
At refinement iteration 14 (OVERLAPS) 0/144 variables, 0/242 constraints. Problems are: Problem set: 46 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 242 constraints, problems are : Problem set: 46 solved, 44 unsolved in 6385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 44/90 constraints, Known Traps: 119/119 constraints]
After SMT, in 12279ms problems are : Problem set: 46 solved, 44 unsolved
Search for dead transitions found 46 dead transitions in 12280ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 65/151 places, 45/8403 transitions.
Graph (complete) has 355 edges and 65 vertex of which 30 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 30 /65 variables (removed 35) and now considering 45/45 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/151 places, 45/8403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15151 ms. Remains : 30/151 places, 45/8403 transitions.
Built C files in :
/tmp/ltsmin17873098922853422538
[2024-05-29 17:52:50] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17873098922853422538
Running compilation step : cd /tmp/ltsmin17873098922853422538;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17873098922853422538;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17873098922853422538;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 8403/8403 transitions.
Applied a total of 0 rules in 24 ms. Remains 151 /151 variables (removed 0) and now considering 8403/8403 (removed 0) transitions.
[2024-05-29 17:52:53] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
// Phase 1: matrix 8390 rows 151 cols
[2024-05-29 17:52:53] [INFO ] Computed 1 invariants in 32 ms
[2024-05-29 17:52:56] [INFO ] Implicit Places using invariants in 2583 ms returned []
[2024-05-29 17:52:56] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-05-29 17:52:56] [INFO ] Invariant cache hit.
[2024-05-29 17:52:58] [INFO ] State equation strengthened by 8201 read => feed constraints.
[2024-05-29 17:53:02] [INFO ] Implicit Places using invariants and state equation in 6006 ms returned []
Implicit Place search using SMT with State Equation took 8591 ms to find 0 implicit places.
Running 8402 sub problems to find dead transitions.
[2024-05-29 17:53:02] [INFO ] Flow matrix only has 8390 transitions (discarded 13 similar events)
[2024-05-29 17:53:02] [INFO ] Invariant cache hit.
[2024-05-29 17:53:03] [INFO ] State equation strengthened by 8201 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8402/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/8541 variables, and 0 constraints, problems are : Problem set: 0 solved, 8402 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/151 constraints, ReadFeed: 0/8201 constraints, PredecessorRefiner: 8227/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 198187ms problems are : Problem set: 0 solved, 8402 unsolved
Search for dead transitions found 0 dead transitions in 198272ms
Finished structural reductions in LTL mode , in 1 iterations and 206913 ms. Remains : 151/151 places, 8403/8403 transitions.
Built C files in :
/tmp/ltsmin7429341964397758266
[2024-05-29 17:56:20] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7429341964397758266
Running compilation step : cd /tmp/ltsmin7429341964397758266;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7429341964397758266;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7429341964397758266;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 17:56:25] [INFO ] Flatten gal took : 589 ms
[2024-05-29 17:56:25] [INFO ] Flatten gal took : 567 ms
[2024-05-29 17:56:25] [INFO ] Time to serialize gal into /tmp/LTL3000215305490648513.gal : 175 ms
[2024-05-29 17:56:25] [INFO ] Time to serialize properties into /tmp/LTL9069907196199675270.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3000215305490648513.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12346377463268075195.hoa' '-atoms' '/tmp/LTL9069907196199675270.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9069907196199675270.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12346377463268075195.hoa
Detected timeout of ITS tools.
[2024-05-29 17:56:41] [INFO ] Flatten gal took : 575 ms
[2024-05-29 17:56:42] [INFO ] Flatten gal took : 566 ms
[2024-05-29 17:56:42] [INFO ] Time to serialize gal into /tmp/LTL13869103168971422184.gal : 110 ms
[2024-05-29 17:56:42] [INFO ] Time to serialize properties into /tmp/LTL6896744885547117583.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13869103168971422184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6896744885547117583.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("((p35==0)||(p164==1))")))))))
Formula 0 simplified : XXXXG!"((p35==0)||(p164==1))"
Detected timeout of ITS tools.
[2024-05-29 17:56:58] [INFO ] Flatten gal took : 563 ms
[2024-05-29 17:56:58] [INFO ] Applying decomposition
[2024-05-29 17:56:58] [INFO ] Flatten gal took : 559 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15314908578939261927.txt' '-o' '/tmp/graph15314908578939261927.bin' '-w' '/tmp/graph15314908578939261927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15314908578939261927.bin' '-l' '-1' '-v' '-w' '/tmp/graph15314908578939261927.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:57:01] [INFO ] Decomposing Gal with order
[2024-05-29 17:57:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:57:04] [INFO ] Removed a total of 98414 redundant transitions.
[2024-05-29 17:57:04] [INFO ] Flatten gal took : 2296 ms
[2024-05-29 17:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 860 ms.
[2024-05-29 17:57:05] [INFO ] Time to serialize gal into /tmp/LTL3345295295986045044.gal : 105 ms
[2024-05-29 17:57:05] [INFO ] Time to serialize properties into /tmp/LTL8555638206764115557.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3345295295986045044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8555638206764115557.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("((i1.i0.u4.p35==0)||(i1.i4.u23.p164==1))")))))))
Formula 0 simplified : XXXXG!"((i1.i0.u4.p35==0)||(i1.i4.u23.p164==1))"
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-13 finished in 701958 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(p0))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 199 transition count 8386
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 82 rules applied. Total rules applied 157 place count 124 transition count 8379
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 162 place count 122 transition count 8376
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 167 place count 121 transition count 8372
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 170 place count 118 transition count 8372
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 170 place count 118 transition count 8359
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 196 place count 105 transition count 8359
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 198 place count 103 transition count 8356
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 103 transition count 8356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 201 place count 103 transition count 8355
Performed 59 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 319 place count 44 transition count 8271
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 6 with 2058 rules applied. Total rules applied 2377 place count 44 transition count 6213
Drop transitions (Redundant composition of simpler transitions.) removed 6091 transitions
Redundant transition composition rules discarded 6091 transitions
Iterating global reduction 7 with 6091 rules applied. Total rules applied 8468 place count 44 transition count 122
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 8492 place count 32 transition count 110
Applied a total of 8492 rules in 4351 ms. Remains 32 /199 variables (removed 167) and now considering 110/8461 (removed 8351) transitions.
[2024-05-29 17:57:25] [INFO ] Flow matrix only has 98 transitions (discarded 12 similar events)
// Phase 1: matrix 98 rows 32 cols
[2024-05-29 17:57:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 17:57:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 17:57:25] [INFO ] Flow matrix only has 98 transitions (discarded 12 similar events)
[2024-05-29 17:57:25] [INFO ] Invariant cache hit.
[2024-05-29 17:57:25] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-29 17:57:25] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-29 17:57:25] [INFO ] Redundant transitions in 8 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-29 17:57:25] [INFO ] Flow matrix only has 98 transitions (discarded 12 similar events)
[2024-05-29 17:57:25] [INFO ] Invariant cache hit.
[2024-05-29 17:57:25] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:57:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:57:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:57:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-29 17:57:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:57:29] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:57:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:57:29] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:57:29] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 97/129 variables, 32/109 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 76/185 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 1/130 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/130 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 186 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:57:32] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:57:33] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:57:34] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:57:34] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:57:34] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 97/129 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 76/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 109/334 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 1/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 109 unsolved in 14665 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 117/117 constraints]
After SMT, in 21460ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 21461ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/199 places, 110/8461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25987 ms. Remains : 32/199 places, 110/8461 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-11a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-15 finished in 26078 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(X(X(X(F(p0))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-11a-LTLCardinality-13
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 199/199 places, 8461/8461 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 198 transition count 8380
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 87 rules applied. Total rules applied 167 place count 118 transition count 8373
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 172 place count 116 transition count 8370
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 174 place count 115 transition count 8369
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 174 place count 115 transition count 8357
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 198 place count 103 transition count 8357
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 201 place count 100 transition count 8353
Iterating global reduction 4 with 3 rules applied. Total rules applied 204 place count 100 transition count 8353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 207 place count 100 transition count 8350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 207 place count 100 transition count 8349
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 99 transition count 8349
Performed 47 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 303 place count 52 transition count 8286
Ensure Unique test removed 4104 transitions
Reduce isomorphic transitions removed 4104 transitions.
Iterating post reduction 5 with 4104 rules applied. Total rules applied 4407 place count 52 transition count 4182
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 4423 place count 44 transition count 4174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 4431 place count 44 transition count 4166
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 4433 place count 44 transition count 4166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4434 place count 44 transition count 4165
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4437 place count 41 transition count 4162
Applied a total of 4437 rules in 1073 ms. Remains 41 /199 variables (removed 158) and now considering 4162/8461 (removed 4299) transitions.
[2024-05-29 17:57:48] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
// Phase 1: matrix 4149 rows 41 cols
[2024-05-29 17:57:48] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 17:57:49] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2024-05-29 17:57:49] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-05-29 17:57:49] [INFO ] Invariant cache hit.
[2024-05-29 17:57:50] [INFO ] State equation strengthened by 2060 read => feed constraints.
[2024-05-29 17:57:51] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
Running 4161 sub problems to find dead transitions.
[2024-05-29 17:57:51] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-05-29 17:57:51] [INFO ] Invariant cache hit.
[2024-05-29 17:57:51] [INFO ] State equation strengthened by 2060 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-05-29 17:59:17] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-29 17:59:17] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 17:59:17] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 17:59:17] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-29 17:59:18] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 0 ms to minimize.
[2024-05-29 17:59:18] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2024-05-29 17:59:18] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 1 ms to minimize.
[2024-05-29 17:59:19] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 0 ms to minimize.
[2024-05-29 17:59:19] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2024-05-29 17:59:19] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2024-05-29 17:59:20] [INFO ] Deduced a trap composed of 4 places in 563 ms of which 1 ms to minimize.
[2024-05-29 17:59:21] [INFO ] Deduced a trap composed of 4 places in 887 ms of which 1 ms to minimize.
[2024-05-29 17:59:21] [INFO ] Deduced a trap composed of 4 places in 762 ms of which 0 ms to minimize.
[2024-05-29 17:59:22] [INFO ] Deduced a trap composed of 4 places in 773 ms of which 0 ms to minimize.
[2024-05-29 17:59:23] [INFO ] Deduced a trap composed of 4 places in 660 ms of which 0 ms to minimize.
[2024-05-29 17:59:23] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 1 ms to minimize.
[2024-05-29 17:59:24] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 0 ms to minimize.
[2024-05-29 17:59:24] [INFO ] Deduced a trap composed of 4 places in 585 ms of which 0 ms to minimize.
[2024-05-29 17:59:25] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 1 ms to minimize.
[2024-05-29 17:59:25] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-05-29 17:59:26] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2024-05-29 17:59:26] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 17:59:27] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 17:59:27] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
SMT process timed out in 95360ms, After SMT, problems are : Problem set: 0 solved, 4161 unsolved
Search for dead transitions found 0 dead transitions in 95402ms
Starting structural reductions in LI_LTL mode, iteration 1 : 41/199 places, 4162/8461 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 100152 ms. Remains : 41/199 places, 4162/8461 transitions.
Running random walk in product with property : StigmergyCommit-PT-11a-LTLCardinality-13
Product exploration timeout after 13090 steps with 2618 reset in 10004 ms.
Product exploration timeout after 13330 steps with 2666 reset in 10006 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 4162/4162 transitions.
Applied a total of 0 rules in 14 ms. Remains 41 /41 variables (removed 0) and now considering 4162/4162 (removed 0) transitions.
[2024-05-29 17:59:48] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-05-29 17:59:48] [INFO ] Invariant cache hit.
[2024-05-29 17:59:49] [INFO ] Implicit Places using invariants in 1309 ms returned []
[2024-05-29 17:59:49] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-05-29 17:59:49] [INFO ] Invariant cache hit.
[2024-05-29 17:59:50] [INFO ] State equation strengthened by 2060 read => feed constraints.
[2024-05-29 17:59:51] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 3523 ms to find 0 implicit places.
Running 4161 sub problems to find dead transitions.
[2024-05-29 17:59:51] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-05-29 17:59:51] [INFO ] Invariant cache hit.
[2024-05-29 17:59:51] [INFO ] State equation strengthened by 2060 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-05-29 18:01:16] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 18:01:16] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 18:01:16] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 18:01:16] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 4 places in 554 ms of which 1 ms to minimize.
[2024-05-29 18:01:20] [INFO ] Deduced a trap composed of 4 places in 877 ms of which 0 ms to minimize.
[2024-05-29 18:01:20] [INFO ] Deduced a trap composed of 4 places in 771 ms of which 1 ms to minimize.
[2024-05-29 18:01:21] [INFO ] Deduced a trap composed of 4 places in 756 ms of which 1 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 4 places in 657 ms of which 0 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 4 places in 560 ms of which 1 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 4 places in 537 ms of which 0 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 1 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 1 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
SMT process timed out in 95065ms, After SMT, problems are : Problem set: 0 solved, 4161 unsolved
Search for dead transitions found 0 dead transitions in 95106ms
Finished structural reductions in LTL mode , in 1 iterations and 98657 ms. Remains : 41/41 places, 4162/4162 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 707 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 13260 steps with 2652 reset in 10002 ms.
Product exploration timeout after 13220 steps with 2644 reset in 10003 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 4162/4162 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4107 transitions
Redundant transition composition rules discarded 4107 transitions
Iterating global reduction 0 with 4107 rules applied. Total rules applied 4107 place count 41 transition count 55
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 4119 place count 41 transition count 55
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 4119 rules in 1029 ms. Remains 41 /41 variables (removed 0) and now considering 55/4162 (removed 4107) transitions.
[2024-05-29 18:01:49] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 18:01:49] [INFO ] Flow matrix only has 43 transitions (discarded 12 similar events)
// Phase 1: matrix 43 rows 41 cols
[2024-05-29 18:01:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:01:49] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 5 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:01:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 10 (OVERLAPS) 42/83 variables, 41/149 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 12/161 constraints. Problems are: Problem set: 12 solved, 42 unsolved
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:01:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/83 variables, 5/166 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/83 variables, 0/166 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 14 (OVERLAPS) 1/84 variables, 1/167 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 0/167 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 16 (OVERLAPS) 0/84 variables, 0/167 constraints. Problems are: Problem set: 12 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 167 constraints, problems are : Problem set: 12 solved, 42 unsolved in 3976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 112/112 constraints]
Escalating to Integer solving :Problem set: 12 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 110/110 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/110 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 13/41 variables, 1/111 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/113 constraints. Problems are: Problem set: 12 solved, 42 unsolved
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:01:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 13/126 constraints. Problems are: Problem set: 12 solved, 42 unsolved
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 6/132 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/132 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 42/83 variables, 41/173 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 12/185 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 42/227 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/227 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 1/84 variables, 1/228 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/228 constraints. Problems are: Problem set: 12 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/84 variables, 0/228 constraints. Problems are: Problem set: 12 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 228 constraints, problems are : Problem set: 12 solved, 42 unsolved in 2281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 42/54 constraints, Known Traps: 131/131 constraints]
After SMT, in 6270ms problems are : Problem set: 12 solved, 42 unsolved
Search for dead transitions found 12 dead transitions in 6271ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 43/4162 transitions.
Graph (complete) has 341 edges and 41 vertex of which 29 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 29 /41 variables (removed 12) and now considering 43/43 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/41 places, 43/4162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7317 ms. Remains : 29/41 places, 43/4162 transitions.
Built C files in :
/tmp/ltsmin17022096201127314093
[2024-05-29 18:01:55] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17022096201127314093
Running compilation step : cd /tmp/ltsmin17022096201127314093;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17022096201127314093;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17022096201127314093;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 4162/4162 transitions.
Applied a total of 0 rules in 18 ms. Remains 41 /41 variables (removed 0) and now considering 4162/4162 (removed 0) transitions.
[2024-05-29 18:01:58] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
// Phase 1: matrix 4149 rows 41 cols
[2024-05-29 18:01:58] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 18:02:00] [INFO ] Implicit Places using invariants in 1354 ms returned []
[2024-05-29 18:02:00] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-05-29 18:02:00] [INFO ] Invariant cache hit.
[2024-05-29 18:02:01] [INFO ] State equation strengthened by 2060 read => feed constraints.
[2024-05-29 18:02:02] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 3586 ms to find 0 implicit places.
Running 4161 sub problems to find dead transitions.
[2024-05-29 18:02:02] [INFO ] Flow matrix only has 4149 transitions (discarded 13 similar events)
[2024-05-29 18:02:02] [INFO ] Invariant cache hit.
[2024-05-29 18:02:02] [INFO ] State equation strengthened by 2060 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-05-29 18:03:27] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 18:03:27] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 18:03:27] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 18:03:27] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-05-29 18:03:28] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2024-05-29 18:03:28] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2024-05-29 18:03:28] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 0 ms to minimize.
[2024-05-29 18:03:28] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 0 ms to minimize.
[2024-05-29 18:03:29] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2024-05-29 18:03:29] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2024-05-29 18:03:30] [INFO ] Deduced a trap composed of 4 places in 536 ms of which 1 ms to minimize.
[2024-05-29 18:03:30] [INFO ] Deduced a trap composed of 4 places in 884 ms of which 0 ms to minimize.
[2024-05-29 18:03:31] [INFO ] Deduced a trap composed of 4 places in 772 ms of which 0 ms to minimize.
[2024-05-29 18:03:32] [INFO ] Deduced a trap composed of 4 places in 762 ms of which 0 ms to minimize.
[2024-05-29 18:03:33] [INFO ] Deduced a trap composed of 4 places in 659 ms of which 1 ms to minimize.
[2024-05-29 18:03:33] [INFO ] Deduced a trap composed of 4 places in 649 ms of which 0 ms to minimize.
[2024-05-29 18:03:34] [INFO ] Deduced a trap composed of 4 places in 546 ms of which 0 ms to minimize.
[2024-05-29 18:03:34] [INFO ] Deduced a trap composed of 4 places in 578 ms of which 0 ms to minimize.
[2024-05-29 18:03:35] [INFO ] Deduced a trap composed of 4 places in 477 ms of which 0 ms to minimize.
[2024-05-29 18:03:35] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4161 unsolved
[2024-05-29 18:03:36] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2024-05-29 18:03:36] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 18:03:37] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 18:03:37] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 18:03:37] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 18:03:37] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
SMT process timed out in 95060ms, After SMT, problems are : Problem set: 0 solved, 4161 unsolved
Search for dead transitions found 0 dead transitions in 95100ms
Finished structural reductions in LTL mode , in 1 iterations and 98720 ms. Remains : 41/41 places, 4162/4162 transitions.
Built C files in :
/tmp/ltsmin2533986642134088319
[2024-05-29 18:03:37] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2533986642134088319
Running compilation step : cd /tmp/ltsmin2533986642134088319;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2533986642134088319;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2533986642134088319;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 18:03:41] [INFO ] Flatten gal took : 278 ms
[2024-05-29 18:03:41] [INFO ] Flatten gal took : 279 ms
[2024-05-29 18:03:41] [INFO ] Time to serialize gal into /tmp/LTL5281219494047673274.gal : 113 ms
[2024-05-29 18:03:41] [INFO ] Time to serialize properties into /tmp/LTL3771126419729849477.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5281219494047673274.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3356833309300400256.hoa' '-atoms' '/tmp/LTL3771126419729849477.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3771126419729849477.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3356833309300400256.hoa
Detected timeout of ITS tools.
[2024-05-29 18:03:57] [INFO ] Flatten gal took : 273 ms
[2024-05-29 18:03:57] [INFO ] Flatten gal took : 274 ms
[2024-05-29 18:03:57] [INFO ] Time to serialize gal into /tmp/LTL3098463452634373015.gal : 56 ms
[2024-05-29 18:03:57] [INFO ] Time to serialize properties into /tmp/LTL13456581142508652614.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3098463452634373015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13456581142508652614.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("((p35==0)||(p164==1))")))))))
Formula 0 simplified : XXXXG!"((p35==0)||(p164==1))"
Detected timeout of ITS tools.
[2024-05-29 18:04:13] [INFO ] Flatten gal took : 279 ms
[2024-05-29 18:04:13] [INFO ] Applying decomposition
[2024-05-29 18:04:13] [INFO ] Flatten gal took : 281 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4053710491229529145.txt' '-o' '/tmp/graph4053710491229529145.bin' '-w' '/tmp/graph4053710491229529145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4053710491229529145.bin' '-l' '-1' '-v' '-w' '/tmp/graph4053710491229529145.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:04:14] [INFO ] Decomposing Gal with order
[2024-05-29 18:04:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:04:15] [INFO ] Removed a total of 49271 redundant transitions.
[2024-05-29 18:04:15] [INFO ] Flatten gal took : 578 ms
[2024-05-29 18:04:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 96 ms.
[2024-05-29 18:04:15] [INFO ] Time to serialize gal into /tmp/LTL12311176452891229009.gal : 35 ms
[2024-05-29 18:04:15] [INFO ] Time to serialize properties into /tmp/LTL16817084461000677821.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12311176452891229009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16817084461000677821.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("((i0.u1.p35==0)||(i4.u5.p164==1))")))))))
Formula 0 simplified : XXXXG!"((i0.u1.p35==0)||(i4.u5.p164==1))"
Reverse transition relation is NOT exact ! Due to transitions u2.t55, u2.t57.t56, u3.t50, u3.t52.t51, u4.t45, u4.t67.t47.t46, u7.t35, u7.t37.t36, u8.t30, u...492
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
151 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.93581,45760,1,0,9894,131,37958,1534,140,249,45484
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property StigmergyCommit-PT-11a-LTLCardinality-13 finished in 391040 ms.
FORMULA StigmergyCommit-PT-11a-LTLCardinality-13 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-29 18:04:18] [INFO ] Flatten gal took : 560 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 2067204 ms.
BK_STOP 1717005858594
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-11a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-11a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531900235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-11a.tgz
mv StigmergyCommit-PT-11a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;