About the Execution of ITS-Tools for MedleyA-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2414.228 | 1007646.00 | 1299119.00 | 2795.50 | TFTFTFFFFFTFTFFT | 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.r576-smll-171734920200172.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 MedleyA-PT-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920200172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-22-LTLFireability-00
FORMULA_NAME MedleyA-PT-22-LTLFireability-01
FORMULA_NAME MedleyA-PT-22-LTLFireability-02
FORMULA_NAME MedleyA-PT-22-LTLFireability-03
FORMULA_NAME MedleyA-PT-22-LTLFireability-04
FORMULA_NAME MedleyA-PT-22-LTLFireability-05
FORMULA_NAME MedleyA-PT-22-LTLFireability-06
FORMULA_NAME MedleyA-PT-22-LTLFireability-07
FORMULA_NAME MedleyA-PT-22-LTLFireability-08
FORMULA_NAME MedleyA-PT-22-LTLFireability-09
FORMULA_NAME MedleyA-PT-22-LTLFireability-10
FORMULA_NAME MedleyA-PT-22-LTLFireability-11
FORMULA_NAME MedleyA-PT-22-LTLFireability-12
FORMULA_NAME MedleyA-PT-22-LTLFireability-13
FORMULA_NAME MedleyA-PT-22-LTLFireability-14
FORMULA_NAME MedleyA-PT-22-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717398740229
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-03 07:12:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 07:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 07:12:23] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2024-06-03 07:12:23] [INFO ] Transformed 307 places.
[2024-06-03 07:12:23] [INFO ] Transformed 740 transitions.
[2024-06-03 07:12:23] [INFO ] Found NUPN structural information;
[2024-06-03 07:12:23] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 576 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-22-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 97 place count 210 transition count 632
Iterating global reduction 1 with 93 rules applied. Total rules applied 190 place count 210 transition count 632
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 198 place count 210 transition count 624
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 220 place count 188 transition count 573
Iterating global reduction 2 with 22 rules applied. Total rules applied 242 place count 188 transition count 573
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 250 place count 180 transition count 554
Iterating global reduction 2 with 8 rules applied. Total rules applied 258 place count 180 transition count 554
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 262 place count 176 transition count 542
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 176 transition count 542
Applied a total of 266 rules in 123 ms. Remains 176 /307 variables (removed 131) and now considering 542/740 (removed 198) transitions.
// Phase 1: matrix 542 rows 176 cols
[2024-06-03 07:12:23] [INFO ] Computed 22 invariants in 38 ms
[2024-06-03 07:12:24] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-03 07:12:24] [INFO ] Invariant cache hit.
[2024-06-03 07:12:24] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-06-03 07:12:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD504 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/176 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 397 unsolved
[2024-06-03 07:12:35] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 36 ms to minimize.
[2024-06-03 07:12:35] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 2 ms to minimize.
[2024-06-03 07:12:35] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-06-03 07:12:35] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-06-03 07:12:36] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-06-03 07:12:36] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-06-03 07:12:36] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-06-03 07:12:36] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-06-03 07:12:36] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 9/31 constraints. Problems are: Problem set: 144 solved, 397 unsolved
[2024-06-03 07:12:42] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/32 constraints. Problems are: Problem set: 144 solved, 397 unsolved
[2024-06-03 07:12:45] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/33 constraints. Problems are: Problem set: 144 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/33 constraints. Problems are: Problem set: 144 solved, 397 unsolved
At refinement iteration 7 (OVERLAPS) 542/718 variables, 176/209 constraints. Problems are: Problem set: 144 solved, 397 unsolved
[2024-06-03 07:12:54] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/718 variables, and 210 constraints, problems are : Problem set: 144 solved, 397 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 144 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 16/16 constraints. Problems are: Problem set: 144 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 144 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 12/34 constraints. Problems are: Problem set: 144 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/34 constraints. Problems are: Problem set: 144 solved, 397 unsolved
At refinement iteration 5 (OVERLAPS) 542/718 variables, 176/210 constraints. Problems are: Problem set: 144 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 397/607 constraints. Problems are: Problem set: 144 solved, 397 unsolved
[2024-06-03 07:13:13] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 4 ms to minimize.
[2024-06-03 07:13:13] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-06-03 07:13:14] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-06-03 07:13:16] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/718 variables, and 611 constraints, problems are : Problem set: 144 solved, 397 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 397/541 constraints, Known Traps: 16/16 constraints]
After SMT, in 63042ms problems are : Problem set: 144 solved, 397 unsolved
Search for dead transitions found 144 dead transitions in 63100ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 176/307 places, 398/740 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64261 ms. Remains : 176/307 places, 398/740 transitions.
Support contains 41 out of 176 places after structural reductions.
[2024-06-03 07:13:28] [INFO ] Flatten gal took : 141 ms
[2024-06-03 07:13:28] [INFO ] Flatten gal took : 80 ms
[2024-06-03 07:13:28] [INFO ] Input system was already deterministic with 398 transitions.
RANDOM walk for 40000 steps (1159 resets) in 3225 ms. (12 steps per ms) remains 19/25 properties
BEST_FIRST walk for 4003 steps (19 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (19 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (24 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 60 ms. (65 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (22 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (20 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (22 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
// Phase 1: matrix 398 rows 176 cols
[2024-06-03 07:13:29] [INFO ] Computed 22 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 56/90 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 3 (OVERLAPS) 64/154 variables, 12/18 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 5/159 variables, 2/20 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/20 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 388/547 variables, 159/179 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/179 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 17/564 variables, 11/190 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 0/190 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/565 variables, 2/192 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 1/193 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/193 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 6/571 variables, 3/196 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/571 variables, 0/196 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 3/574 variables, 2/198 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/574 variables, 0/198 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/574 variables, 0/198 constraints. Problems are: Problem set: 7 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 198 constraints, problems are : Problem set: 7 solved, 12 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 62/87 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 67/154 variables, 12/18 constraints. Problems are: Problem set: 7 solved, 12 unsolved
[2024-06-03 07:13:31] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/19 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 5/159 variables, 2/21 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 388/547 variables, 159/180 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 6/186 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/186 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 17/564 variables, 11/197 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 6/203 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/203 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 1/565 variables, 2/205 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 1/206 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/206 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 6/571 variables, 3/209 constraints. Problems are: Problem set: 7 solved, 12 unsolved
[2024-06-03 07:13:33] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 1/210 constraints. Problems are: Problem set: 7 solved, 12 unsolved
[2024-06-03 07:13:34] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 1/211 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/571 variables, 0/211 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 3/574 variables, 2/213 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/574 variables, 0/213 constraints. Problems are: Problem set: 7 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 213 constraints, problems are : Problem set: 7 solved, 12 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 12/19 constraints, Known Traps: 3/3 constraints]
After SMT, in 6386ms problems are : Problem set: 7 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 175 transition count 377
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 156 transition count 377
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 40 place count 156 transition count 371
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 52 place count 150 transition count 371
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 146 transition count 366
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 146 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 146 transition count 365
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 93 place count 129 transition count 350
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 127 transition count 348
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 127 transition count 348
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 109 place count 121 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 77 transitions
Redundant transition composition rules discarded 77 transitions
Iterating global reduction 3 with 77 rules applied. Total rules applied 186 place count 121 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 120 transition count 342
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 120 transition count 338
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 196 place count 116 transition count 338
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 207 place count 116 transition count 359
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 218 place count 105 transition count 359
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 228 place count 105 transition count 359
Applied a total of 228 rules in 201 ms. Remains 105 /176 variables (removed 71) and now considering 359/398 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 105/176 places, 359/398 transitions.
RANDOM walk for 40000 steps (2613 resets) in 1677 ms. (23 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40003 steps (476 resets) in 100 ms. (396 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (425 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (384 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (485 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (492 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (481 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (416 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (397 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
// Phase 1: matrix 359 rows 105 cols
[2024-06-03 07:13:37] [INFO ] Computed 21 invariants in 3 ms
[2024-06-03 07:13:37] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 54/76 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/82 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 20/102 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/104 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 359/463 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 24/149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1/464 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/464 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 150 constraints, problems are : Problem set: 0 solved, 8 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 54/76 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/82 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 20/102 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/104 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 359/463 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 24/149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/464 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/464 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/464 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 158 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 2466ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 3 properties in 12514 ms.
Support contains 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 359/359 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 357
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 103 transition count 353
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 353
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 100 transition count 350
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 98 transition count 365
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 98 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 96 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 96 transition count 362
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 96 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 94 transition count 375
Applied a total of 23 rules in 60 ms. Remains 94 /105 variables (removed 11) and now considering 375/359 (removed -16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 94/105 places, 375/359 transitions.
RANDOM walk for 40000 steps (2842 resets) in 284 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (461 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (371 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (512 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (486 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (432 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 360869 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :1 out of 5
Probabilistic random walk after 360869 steps, saw 75111 distinct states, run finished after 3013 ms. (steps per millisecond=119 ) properties seen :1
// Phase 1: matrix 375 rows 94 cols
[2024-06-03 07:13:55] [INFO ] Computed 21 invariants in 3 ms
[2024-06-03 07:13:55] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/71 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 20/91 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/93 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 375/468 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 24/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/469 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/469 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/469 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 139 constraints, problems are : Problem set: 0 solved, 4 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/71 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 20/91 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/93 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 375/468 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 24/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/469 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/469 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/469 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 143 constraints, problems are : Problem set: 0 solved, 4 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1444ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 1012 ms.
Support contains 8 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 375/375 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 87 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 86 transition count 368
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 86 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 85 transition count 380
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 85 transition count 377
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 82 transition count 377
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 82 transition count 376
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 82 transition count 464
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 38 place count 79 transition count 456
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 79 transition count 456
Applied a total of 42 rules in 66 ms. Remains 79 /94 variables (removed 15) and now considering 456/375 (removed -81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 79/94 places, 456/375 transitions.
RANDOM walk for 40000 steps (3756 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (586 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (518 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 538795 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 2
Probabilistic random walk after 538795 steps, saw 118467 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 456 rows 79 cols
[2024-06-03 07:14:01] [INFO ] Computed 20 invariants in 9 ms
[2024-06-03 07:14:01] [INFO ] State equation strengthened by 68 read => feed constraints.
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) 37/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/68 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 456/534 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 68/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/535 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/535 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 68/68 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) 37/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/68 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 456/534 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 68/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/535 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/535 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 169 constraints, problems are : Problem set: 0 solved, 2 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 790 ms.
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 456/456 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 79 transition count 455
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 77 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 77 transition count 447
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 77 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 76 transition count 446
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 76 transition count 511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 75 transition count 511
Applied a total of 8 rules in 75 ms. Remains 75 /79 variables (removed 4) and now considering 511/456 (removed -55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 75/79 places, 511/456 transitions.
RANDOM walk for 40000 steps (4355 resets) in 1463 ms. (27 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (589 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 363722 steps, run visited all 1 properties in 1556 ms. (steps per millisecond=233 )
Probabilistic random walk after 363722 steps, saw 84978 distinct states, run finished after 1561 ms. (steps per millisecond=233 ) properties seen :1
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA MedleyA-PT-22-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
FORMULA MedleyA-PT-22-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 174 transition count 369
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 147 transition count 369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 55 place count 147 transition count 363
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 67 place count 141 transition count 363
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 134 transition count 345
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 134 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 81 place count 134 transition count 344
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 133 transition count 344
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 131 transition count 338
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 131 transition count 338
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 129 transition count 332
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 129 transition count 332
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 138 place count 104 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 104 transition count 309
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 100 transition count 303
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 100 transition count 303
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 161 place count 93 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 199 place count 93 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 92 transition count 319
Applied a total of 201 rules in 114 ms. Remains 92 /176 variables (removed 84) and now considering 319/398 (removed 79) transitions.
// Phase 1: matrix 319 rows 92 cols
[2024-06-03 07:14:06] [INFO ] Computed 19 invariants in 3 ms
[2024-06-03 07:14:06] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-03 07:14:06] [INFO ] Invariant cache hit.
[2024-06-03 07:14:06] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-06-03 07:14:06] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2024-06-03 07:14:06] [INFO ] Redundant transitions in 23 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-03 07:14:06] [INFO ] Invariant cache hit.
[2024-06-03 07:14:06] [INFO ] State equation strengthened by 173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 319/410 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 173/283 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 1/411 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 284 constraints, problems are : Problem set: 0 solved, 309 unsolved in 25258 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 319/410 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 173/283 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 309/592 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 1/411 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 593 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
After SMT, in 55808ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 55812ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/176 places, 319/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56548 ms. Remains : 92/176 places, 319/398 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-01 finished in 56888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 174 transition count 369
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 147 transition count 369
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 55 place count 147 transition count 364
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 65 place count 142 transition count 364
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 135 transition count 345
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 135 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 79 place count 135 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 134 transition count 344
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 131 transition count 334
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 131 transition count 334
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 128 transition count 325
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 128 transition count 325
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 140 place count 103 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 103 transition count 302
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 99 transition count 296
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 99 transition count 296
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 161 place count 93 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 181 place count 93 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 92 transition count 315
Applied a total of 183 rules in 75 ms. Remains 92 /176 variables (removed 84) and now considering 315/398 (removed 83) transitions.
// Phase 1: matrix 315 rows 92 cols
[2024-06-03 07:15:02] [INFO ] Computed 19 invariants in 3 ms
[2024-06-03 07:15:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-03 07:15:02] [INFO ] Invariant cache hit.
[2024-06-03 07:15:02] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-03 07:15:03] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-03 07:15:03] [INFO ] Redundant transitions in 6 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-03 07:15:03] [INFO ] Invariant cache hit.
[2024-06-03 07:15:03] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 07:15:06] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 315/406 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 171/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 283 constraints, problems are : Problem set: 0 solved, 305 unsolved in 19805 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 315/406 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 171/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 305/587 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 1/407 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 588 constraints, problems are : Problem set: 0 solved, 305 unsolved in 29984 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints]
After SMT, in 50284ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 50288ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/176 places, 315/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50743 ms. Remains : 92/176 places, 315/398 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-02
Product exploration explored 100000 steps with 12333 reset in 680 ms.
Product exploration explored 100000 steps with 12338 reset in 511 ms.
Computed a total of 13 stabilizing places and 167 stable transitions
Computed a total of 13 stabilizing places and 167 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 3312 steps (412 resets) in 22 ms. (144 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 315/315 transitions.
Applied a total of 0 rules in 9 ms. Remains 92 /92 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-06-03 07:15:55] [INFO ] Invariant cache hit.
[2024-06-03 07:15:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-03 07:15:55] [INFO ] Invariant cache hit.
[2024-06-03 07:15:55] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-03 07:15:55] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-06-03 07:15:55] [INFO ] Redundant transitions in 6 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-03 07:15:55] [INFO ] Invariant cache hit.
[2024-06-03 07:15:55] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 07:15:59] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 315/406 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 171/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 283 constraints, problems are : Problem set: 0 solved, 305 unsolved in 24054 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 315/406 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 171/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 305/587 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 1/407 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 588 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints]
After SMT, in 54547ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 54552ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55000 ms. Remains : 92/92 places, 315/315 transitions.
Computed a total of 13 stabilizing places and 167 stable transitions
Computed a total of 13 stabilizing places and 167 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
RANDOM walk for 6183 steps (763 resets) in 84 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12304 reset in 619 ms.
Product exploration explored 100000 steps with 12332 reset in 529 ms.
Built C files in :
/tmp/ltsmin12677125225197181484
[2024-06-03 07:16:51] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2024-06-03 07:16:51] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:16:51] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2024-06-03 07:16:51] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:16:51] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2024-06-03 07:16:51] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:16:51] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12677125225197181484
Running compilation step : cd /tmp/ltsmin12677125225197181484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2149 ms.
Running link step : cd /tmp/ltsmin12677125225197181484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin12677125225197181484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9928979054946789541.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 315/315 transitions.
Applied a total of 0 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-06-03 07:17:06] [INFO ] Invariant cache hit.
[2024-06-03 07:17:06] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 07:17:06] [INFO ] Invariant cache hit.
[2024-06-03 07:17:07] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-03 07:17:07] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-06-03 07:17:07] [INFO ] Redundant transitions in 3 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-03 07:17:07] [INFO ] Invariant cache hit.
[2024-06-03 07:17:07] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 07:17:11] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 315/406 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 171/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 283 constraints, problems are : Problem set: 0 solved, 305 unsolved in 21237 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 315/406 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 171/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 305/587 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 1/407 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 588 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints]
After SMT, in 51712ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 51716ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52105 ms. Remains : 92/92 places, 315/315 transitions.
Built C files in :
/tmp/ltsmin503819230677876732
[2024-06-03 07:17:58] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2024-06-03 07:17:58] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:17:58] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2024-06-03 07:17:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:17:58] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2024-06-03 07:17:58] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:17:58] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin503819230677876732
Running compilation step : cd /tmp/ltsmin503819230677876732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1365 ms.
Running link step : cd /tmp/ltsmin503819230677876732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin503819230677876732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1339335140177550286.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-03 07:18:14] [INFO ] Flatten gal took : 33 ms
[2024-06-03 07:18:14] [INFO ] Flatten gal took : 33 ms
[2024-06-03 07:18:14] [INFO ] Time to serialize gal into /tmp/LTL7764291010495043536.gal : 6 ms
[2024-06-03 07:18:14] [INFO ] Time to serialize properties into /tmp/LTL13329634729425954121.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/LTL7764291010495043536.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11768833144616016000.hoa' '-atoms' '/tmp/LTL13329634729425954121.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...319
Loading property file /tmp/LTL13329634729425954121.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11768833144616016000.hoa
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t25, t26, t30, t34, t35, t73, t76, t77, t83, t122, t125, t126, t132, t123.t128, t12...1195
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2024-06-03 07:18:29] [INFO ] Flatten gal took : 30 ms
[2024-06-03 07:18:29] [INFO ] Flatten gal took : 28 ms
[2024-06-03 07:18:29] [INFO ] Time to serialize gal into /tmp/LTL5287438062171498190.gal : 7 ms
[2024-06-03 07:18:29] [INFO ] Time to serialize properties into /tmp/LTL138366755166773842.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/LTL5287438062171498190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL138366755166773842.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...274
Read 1 LTL properties
Checking formula 0 : !((F(G("((p189!=1)||(p216!=1))"))))
Formula 0 simplified : GF!"((p189!=1)||(p216!=1))"
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t25, t26, t30, t34, t35, t73, t76, t77, t83, t122, t125, t126, t132, t123.t128, t12...1195
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2024-06-03 07:18:44] [INFO ] Flatten gal took : 24 ms
[2024-06-03 07:18:44] [INFO ] Applying decomposition
[2024-06-03 07:18:44] [INFO ] Flatten gal took : 22 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/graph18342374988545020155.txt' '-o' '/tmp/graph18342374988545020155.bin' '-w' '/tmp/graph18342374988545020155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18342374988545020155.bin' '-l' '-1' '-v' '-w' '/tmp/graph18342374988545020155.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:18:44] [INFO ] Decomposing Gal with order
[2024-06-03 07:18:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:18:44] [INFO ] Removed a total of 554 redundant transitions.
[2024-06-03 07:18:44] [INFO ] Flatten gal took : 93 ms
[2024-06-03 07:18:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 16 ms.
[2024-06-03 07:18:44] [INFO ] Time to serialize gal into /tmp/LTL14915847804617385156.gal : 5 ms
[2024-06-03 07:18:44] [INFO ] Time to serialize properties into /tmp/LTL16685427187566563532.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/LTL14915847804617385156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16685427187566563532.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 : !((F(G("((i5.u10.p189!=1)||(i5.u10.p216!=1))"))))
Formula 0 simplified : GF!"((i5.u10.p189!=1)||(i5.u10.p216!=1))"
Reverse transition relation is NOT exact ! Due to transitions t1_t2_t4_t5_t6_t7_t8, t230_t2_t3, t230_t2_t4_t5_t6_t7_t8, t13_t53_t105_t106_t107_t111_t54_t55...895
Computing Next relation with stutter on 8258 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
487 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,4.8976,152196,1,0,249885,15451,1882,837682,1224,99702,177741
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-22-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-22-LTLFireability-02 finished in 227855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 174 transition count 370
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 148 transition count 370
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 53 place count 148 transition count 365
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 63 place count 143 transition count 365
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 136 transition count 350
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 136 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 77 place count 136 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 135 transition count 349
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 133 transition count 341
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 133 transition count 341
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 131 transition count 335
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 131 transition count 335
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 134 place count 106 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 106 transition count 312
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 102 transition count 306
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 102 transition count 306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 157 place count 95 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 195 place count 95 transition count 312
Applied a total of 195 rules in 34 ms. Remains 95 /176 variables (removed 81) and now considering 312/398 (removed 86) transitions.
// Phase 1: matrix 312 rows 95 cols
[2024-06-03 07:18:50] [INFO ] Computed 19 invariants in 1 ms
[2024-06-03 07:18:50] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-03 07:18:50] [INFO ] Invariant cache hit.
[2024-06-03 07:18:50] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-03 07:18:50] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-03 07:18:50] [INFO ] Redundant transitions in 3 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-03 07:18:50] [INFO ] Invariant cache hit.
[2024-06-03 07:18:50] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/406 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/407 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/407 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 256 constraints, problems are : Problem set: 0 solved, 306 unsolved in 21132 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/406 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 306/561 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 562 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
After SMT, in 51828ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 51831ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/176 places, 312/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52250 ms. Remains : 95/176 places, 312/398 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-03
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-03 finished in 52313 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 8 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 174 transition count 371
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 149 transition count 371
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 51 place count 149 transition count 366
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 61 place count 144 transition count 366
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 135 transition count 345
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 135 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 135 transition count 344
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 131 transition count 331
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 131 transition count 331
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 128 transition count 322
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 128 transition count 322
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 130 place count 109 transition count 305
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 107 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 107 transition count 303
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 146 place count 101 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 166 place count 101 transition count 312
Applied a total of 166 rules in 36 ms. Remains 101 /176 variables (removed 75) and now considering 312/398 (removed 86) transitions.
// Phase 1: matrix 312 rows 101 cols
[2024-06-03 07:19:42] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 07:19:43] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-03 07:19:43] [INFO ] Invariant cache hit.
[2024-06-03 07:19:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-03 07:19:43] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-06-03 07:19:43] [INFO ] Redundant transitions in 4 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-03 07:19:43] [INFO ] Invariant cache hit.
[2024-06-03 07:19:43] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/412 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 75/195 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/413 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 196 constraints, problems are : Problem set: 0 solved, 306 unsolved in 17620 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/412 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 75/195 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 306/501 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-03 07:20:31] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/413 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/413 variables, and 503 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 1/1 constraints]
After SMT, in 48465ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 48471ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/176 places, 312/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49021 ms. Remains : 101/176 places, 312/398 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-04
Product exploration explored 100000 steps with 9048 reset in 504 ms.
Product exploration explored 100000 steps with 9076 reset in 519 ms.
Computed a total of 5 stabilizing places and 60 stable transitions
Computed a total of 5 stabilizing places and 60 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3633 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (482 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1231645 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 1
Probabilistic random walk after 1231645 steps, saw 242503 distinct states, run finished after 3006 ms. (steps per millisecond=409 ) properties seen :0
[2024-06-03 07:20:36] [INFO ] Invariant cache hit.
[2024-06-03 07:20:36] [INFO ] State equation strengthened by 75 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/63 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/88 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/93 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 312/405 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 75/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/413 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/63 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/88 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/93 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 312/405 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 75/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/413 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 311
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 101 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 95 transition count 305
Free-agglomeration rule (complex) applied 20 times with reduction of 8 identical transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 33 place count 95 transition count 492
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 66 place count 75 transition count 479
Applied a total of 66 rules in 39 ms. Remains 75 /101 variables (removed 26) and now considering 479/312 (removed -167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 75/101 places, 479/312 transitions.
RANDOM walk for 40000 steps (4646 resets) in 382 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (856 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 591856 steps, run visited all 1 properties in 1927 ms. (steps per millisecond=307 )
Probabilistic random walk after 591856 steps, saw 116376 distinct states, run finished after 1927 ms. (steps per millisecond=307 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 312/312 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-03 07:20:39] [INFO ] Invariant cache hit.
[2024-06-03 07:20:39] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-03 07:20:39] [INFO ] Invariant cache hit.
[2024-06-03 07:20:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-03 07:20:39] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-03 07:20:39] [INFO ] Redundant transitions in 2 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-03 07:20:39] [INFO ] Invariant cache hit.
[2024-06-03 07:20:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/412 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 75/195 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/413 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 196 constraints, problems are : Problem set: 0 solved, 306 unsolved in 21236 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/412 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 75/195 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 306/501 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/413 variables, and 502 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
After SMT, in 52177ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 52182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52585 ms. Remains : 101/101 places, 312/312 transitions.
Computed a total of 5 stabilizing places and 60 stable transitions
Computed a total of 5 stabilizing places and 60 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3628 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (498 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1287434 steps, run timeout after 3001 ms. (steps per millisecond=429 ) properties seen :0 out of 1
Probabilistic random walk after 1287434 steps, saw 250985 distinct states, run finished after 3001 ms. (steps per millisecond=429 ) properties seen :0
[2024-06-03 07:21:35] [INFO ] Invariant cache hit.
[2024-06-03 07:21:35] [INFO ] State equation strengthened by 75 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/63 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/88 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/93 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 312/405 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 75/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/413 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/63 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/88 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/93 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 312/405 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 75/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/413 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 311
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 101 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 95 transition count 305
Free-agglomeration rule (complex) applied 20 times with reduction of 8 identical transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 33 place count 95 transition count 492
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 66 place count 75 transition count 479
Applied a total of 66 rules in 22 ms. Remains 75 /101 variables (removed 26) and now considering 479/312 (removed -167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 75/101 places, 479/312 transitions.
RANDOM walk for 40000 steps (4585 resets) in 354 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (865 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 591856 steps, run visited all 1 properties in 1736 ms. (steps per millisecond=340 )
Probabilistic random walk after 591856 steps, saw 116376 distinct states, run finished after 1741 ms. (steps per millisecond=339 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9077 reset in 290 ms.
Product exploration explored 100000 steps with 9034 reset in 337 ms.
Built C files in :
/tmp/ltsmin16881852971048607604
[2024-06-03 07:21:38] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2024-06-03 07:21:38] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:21:38] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2024-06-03 07:21:38] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:21:38] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2024-06-03 07:21:38] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:21:38] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16881852971048607604
Running compilation step : cd /tmp/ltsmin16881852971048607604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1621 ms.
Running link step : cd /tmp/ltsmin16881852971048607604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16881852971048607604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4761735712018822950.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 312/312 transitions.
Applied a total of 0 rules in 11 ms. Remains 101 /101 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-03 07:21:54] [INFO ] Invariant cache hit.
[2024-06-03 07:21:54] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-03 07:21:54] [INFO ] Invariant cache hit.
[2024-06-03 07:21:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-03 07:21:54] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-06-03 07:21:54] [INFO ] Redundant transitions in 2 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-03 07:21:54] [INFO ] Invariant cache hit.
[2024-06-03 07:21:54] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/412 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 75/195 constraints. Problems are: Problem set: 0 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/413 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 196 constraints, problems are : Problem set: 0 solved, 306 unsolved in 15091 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/412 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 75/195 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 306/501 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/413 variables, and 502 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 101/101 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
After SMT, in 45881ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 45885ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46202 ms. Remains : 101/101 places, 312/312 transitions.
Built C files in :
/tmp/ltsmin1572640639920538577
[2024-06-03 07:22:40] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2024-06-03 07:22:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:22:40] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2024-06-03 07:22:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:22:40] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2024-06-03 07:22:40] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 07:22:40] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1572640639920538577
Running compilation step : cd /tmp/ltsmin1572640639920538577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1896 ms.
Running link step : cd /tmp/ltsmin1572640639920538577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin1572640639920538577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15699901405913092396.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-03 07:22:55] [INFO ] Flatten gal took : 24 ms
[2024-06-03 07:22:55] [INFO ] Flatten gal took : 22 ms
[2024-06-03 07:22:55] [INFO ] Time to serialize gal into /tmp/LTL35315402918148418.gal : 4 ms
[2024-06-03 07:22:55] [INFO ] Time to serialize properties into /tmp/LTL7361191501945072746.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/LTL35315402918148418.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3771999082555900641.hoa' '-atoms' '/tmp/LTL7361191501945072746.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...315
Loading property file /tmp/LTL7361191501945072746.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3771999082555900641.hoa
Reverse transition relation is NOT exact ! Due to transitions t12, t18, t22, t25, t26, t30, t34, t35, t58, t59, t61, t73, t76, t77, t81, t83, t87, t88, t10...1100
Computing Next relation with stutter on 12044 deadlock states
Detected timeout of ITS tools.
[2024-06-03 07:23:10] [INFO ] Flatten gal took : 20 ms
[2024-06-03 07:23:10] [INFO ] Flatten gal took : 20 ms
[2024-06-03 07:23:10] [INFO ] Time to serialize gal into /tmp/LTL12154001957924699737.gal : 7 ms
[2024-06-03 07:23:10] [INFO ] Time to serialize properties into /tmp/LTL14725179635747515001.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/LTL12154001957924699737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14725179635747515001.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((((p120==0)||(p181==0))||((p210==0)||(p231==0)))||(((p111==1)&&(p125==1))&&((p274==1)&&(p296==1))))"))))
Formula 0 simplified : FG!"((((p120==0)||(p181==0))||((p210==0)||(p231==0)))||(((p111==1)&&(p125==1))&&((p274==1)&&(p296==1))))"
Reverse transition relation is NOT exact ! Due to transitions t12, t18, t22, t25, t26, t30, t34, t35, t58, t59, t61, t73, t76, t77, t81, t83, t87, t88, t10...1100
Computing Next relation with stutter on 12044 deadlock states
Detected timeout of ITS tools.
[2024-06-03 07:23:25] [INFO ] Flatten gal took : 19 ms
[2024-06-03 07:23:25] [INFO ] Applying decomposition
[2024-06-03 07:23:25] [INFO ] Flatten gal took : 18 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/graph5352204085627110795.txt' '-o' '/tmp/graph5352204085627110795.bin' '-w' '/tmp/graph5352204085627110795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5352204085627110795.bin' '-l' '-1' '-v' '-w' '/tmp/graph5352204085627110795.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:23:25] [INFO ] Decomposing Gal with order
[2024-06-03 07:23:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:23:25] [INFO ] Removed a total of 743 redundant transitions.
[2024-06-03 07:23:25] [INFO ] Flatten gal took : 38 ms
[2024-06-03 07:23:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 10 ms.
[2024-06-03 07:23:25] [INFO ] Time to serialize gal into /tmp/LTL13024378184039886313.gal : 4 ms
[2024-06-03 07:23:25] [INFO ] Time to serialize properties into /tmp/LTL5199073776119834007.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/LTL13024378184039886313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5199073776119834007.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((((i3.u5.p120==0)||(i3.u13.p181==0))||((i4.i0.u15.p210==0)||(i4.i1.u18.p231==0)))||(((i1.u6.p111==1)&&(i1.u7.p125==1))&&((i5....193
Formula 0 simplified : FG!"((((i3.u5.p120==0)||(i3.u13.p181==0))||((i4.i0.u15.p210==0)||(i4.i1.u18.p231==0)))||(((i1.u6.p111==1)&&(i1.u7.p125==1))&&((i5.u2...187
Reverse transition relation is NOT exact ! Due to transitions t171, t219, t220, t221, t152_t182, t362_t101, t366_t101, t13_t53_t105_t106_t107_t111_t54_t55_...944
Computing Next relation with stutter on 12044 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
345 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,3.47968,76264,1,0,102665,4299,2488,322501,821,16611,153270
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-22-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property MedleyA-PT-22-LTLFireability-04 finished in 226714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 174 transition count 370
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 148 transition count 370
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 53 place count 148 transition count 363
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 67 place count 141 transition count 363
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 133 transition count 343
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 133 transition count 343
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 130 transition count 333
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 130 transition count 333
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 127 transition count 324
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 127 transition count 324
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 43 rules applied. Total rules applied 138 place count 104 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 104 transition count 303
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 100 transition count 297
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 100 transition count 297
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 159 place count 94 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 179 place count 94 transition count 306
Applied a total of 179 rules in 28 ms. Remains 94 /176 variables (removed 82) and now considering 306/398 (removed 92) transitions.
// Phase 1: matrix 306 rows 94 cols
[2024-06-03 07:23:29] [INFO ] Computed 19 invariants in 4 ms
[2024-06-03 07:23:29] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-03 07:23:29] [INFO ] Invariant cache hit.
[2024-06-03 07:23:29] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-06-03 07:23:30] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-06-03 07:23:30] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-03 07:23:30] [INFO ] Invariant cache hit.
[2024-06-03 07:23:30] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 306/399 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 126/238 constraints. Problems are: Problem set: 0 solved, 300 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 239 constraints, problems are : Problem set: 0 solved, 300 unsolved in 17950 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 306/399 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 126/238 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 300/538 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 539 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 48521ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 48524ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/176 places, 306/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49014 ms. Remains : 94/176 places, 306/398 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-06 finished in 49077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 174 transition count 369
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 147 transition count 369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 55 place count 147 transition count 363
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 67 place count 141 transition count 363
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 134 transition count 345
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 134 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 81 place count 134 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 133 transition count 344
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 131 transition count 338
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 131 transition count 338
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 129 transition count 332
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 129 transition count 332
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 138 place count 104 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 104 transition count 309
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 100 transition count 303
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 100 transition count 303
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 161 place count 93 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 199 place count 93 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 92 transition count 319
Applied a total of 201 rules in 38 ms. Remains 92 /176 variables (removed 84) and now considering 319/398 (removed 79) transitions.
// Phase 1: matrix 319 rows 92 cols
[2024-06-03 07:24:18] [INFO ] Computed 19 invariants in 2 ms
[2024-06-03 07:24:18] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-03 07:24:18] [INFO ] Invariant cache hit.
[2024-06-03 07:24:18] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-06-03 07:24:19] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-06-03 07:24:19] [INFO ] Redundant transitions in 3 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-03 07:24:19] [INFO ] Invariant cache hit.
[2024-06-03 07:24:19] [INFO ] State equation strengthened by 173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 319/410 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 173/283 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 1/411 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 284 constraints, problems are : Problem set: 0 solved, 309 unsolved in 22149 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 319/410 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 173/283 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 309/592 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 1/411 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 593 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
After SMT, in 52619ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 52623ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/176 places, 319/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53109 ms. Remains : 92/176 places, 319/398 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-08 finished in 53160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(F(p1)) U G(p2)))))'
Support contains 3 out of 176 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 174 transition count 372
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 150 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 149 transition count 371
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 51 place count 149 transition count 364
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 65 place count 142 transition count 364
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 72 place count 135 transition count 346
Iterating global reduction 3 with 7 rules applied. Total rules applied 79 place count 135 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 79 place count 135 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 134 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 131 transition count 335
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 131 transition count 335
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 128 transition count 326
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 128 transition count 326
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 138 place count 104 transition count 305
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 101 transition count 302
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 101 transition count 302
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 158 place count 94 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 182 place count 94 transition count 317
Applied a total of 182 rules in 41 ms. Remains 94 /176 variables (removed 82) and now considering 317/398 (removed 81) transitions.
// Phase 1: matrix 317 rows 94 cols
[2024-06-03 07:25:11] [INFO ] Computed 19 invariants in 1 ms
[2024-06-03 07:25:11] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-03 07:25:11] [INFO ] Invariant cache hit.
[2024-06-03 07:25:12] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-03 07:25:12] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-06-03 07:25:12] [INFO ] Redundant transitions in 2 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-03 07:25:12] [INFO ] Invariant cache hit.
[2024-06-03 07:25:12] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-03 07:25:15] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-03 07:25:15] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-03 07:25:15] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 317/410 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 171/286 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 1/411 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 287 constraints, problems are : Problem set: 0 solved, 311 unsolved in 19827 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-03 07:25:35] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 317/410 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 171/287 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 311/598 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (OVERLAPS) 1/411 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 599 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 4/4 constraints]
After SMT, in 50557ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 50560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/176 places, 317/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51081 ms. Remains : 94/176 places, 317/398 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-09 finished in 51158 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)&&F(((p1&&X(!p2))||G(!p2))))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 169 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 169 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 169 transition count 383
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 166 transition count 373
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 166 transition count 373
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 163 transition count 364
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 163 transition count 364
Applied a total of 27 rules in 14 ms. Remains 163 /176 variables (removed 13) and now considering 364/398 (removed 34) transitions.
// Phase 1: matrix 364 rows 163 cols
[2024-06-03 07:26:03] [INFO ] Computed 22 invariants in 5 ms
[2024-06-03 07:26:03] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-03 07:26:03] [INFO ] Invariant cache hit.
[2024-06-03 07:26:03] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-03 07:26:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-03 07:26:09] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-06-03 07:26:09] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2024-06-03 07:26:09] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-06-03 07:26:09] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-03 07:26:09] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/527 variables, 163/190 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-03 07:26:17] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (OVERLAPS) 0/527 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 191 constraints, problems are : Problem set: 0 solved, 363 unsolved in 28584 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/527 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 363/554 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-03 07:26:48] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-03 07:27:02] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 556 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 8/8 constraints]
After SMT, in 59476ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 59485ms
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 364/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60154 ms. Remains : 163/176 places, 364/398 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-11
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-11 finished in 60452 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' '!((p0 U X(G(p1))))'
Support contains 8 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 168 transition count 381
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 168 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 168 transition count 380
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 165 transition count 370
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 165 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 162 transition count 361
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 162 transition count 361
Applied a total of 29 rules in 20 ms. Remains 162 /176 variables (removed 14) and now considering 361/398 (removed 37) transitions.
// Phase 1: matrix 361 rows 162 cols
[2024-06-03 07:27:03] [INFO ] Computed 22 invariants in 4 ms
[2024-06-03 07:27:03] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-03 07:27:03] [INFO ] Invariant cache hit.
[2024-06-03 07:27:04] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-06-03 07:27:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-03 07:27:10] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 3 ms to minimize.
[2024-06-03 07:27:10] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2024-06-03 07:27:10] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-03 07:27:10] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 4 ms to minimize.
[2024-06-03 07:27:11] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 361/523 variables, 162/189 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-03 07:27:19] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 190 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 361/523 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 360/550 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-03 07:27:48] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-06-03 07:27:48] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 552 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 8/8 constraints]
After SMT, in 61017ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 61023ms
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 361/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61677 ms. Remains : 162/176 places, 361/398 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-13 finished in 61832 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((G(p0)||F(p1)))))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 168 transition count 378
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 168 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 168 transition count 377
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 164 transition count 364
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 164 transition count 364
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 161 transition count 355
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 161 transition count 355
Applied a total of 31 rules in 11 ms. Remains 161 /176 variables (removed 15) and now considering 355/398 (removed 43) transitions.
// Phase 1: matrix 355 rows 161 cols
[2024-06-03 07:28:05] [INFO ] Computed 22 invariants in 4 ms
[2024-06-03 07:28:05] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-03 07:28:05] [INFO ] Invariant cache hit.
[2024-06-03 07:28:05] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2024-06-03 07:28:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-03 07:28:11] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
[2024-06-03 07:28:12] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-06-03 07:28:12] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-06-03 07:28:12] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-06-03 07:28:12] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
[2024-06-03 07:28:12] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-06-03 07:28:12] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/190 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-03 07:28:20] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 191 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/191 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 354/545 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-03 07:28:47] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-03 07:29:03] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 3 ms to minimize.
[2024-06-03 07:29:03] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 548 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 11/11 constraints]
After SMT, in 60970ms problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 60978ms
Starting structural reductions in LTL mode, iteration 1 : 161/176 places, 355/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61574 ms. Remains : 161/176 places, 355/398 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 361 ms.
Product exploration explored 100000 steps with 33333 reset in 316 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 683 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-22-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLFireability-15 finished in 62516 ms.
All properties solved by simple procedures.
Total runtime 1005040 ms.
BK_STOP 1717399747875
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-22"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-22, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920200172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;