About the Execution of ITS-Tools for Peterson-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.172 | 3600000.00 | 11677517.00 | 11087.40 | FF?FTTFFFTFTTFFF | 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.r268-smll-171654407200228.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 Peterson-COL-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407200228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.0K Apr 12 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 45K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-5-LTLFireability-00
FORMULA_NAME Peterson-COL-5-LTLFireability-01
FORMULA_NAME Peterson-COL-5-LTLFireability-02
FORMULA_NAME Peterson-COL-5-LTLFireability-03
FORMULA_NAME Peterson-COL-5-LTLFireability-04
FORMULA_NAME Peterson-COL-5-LTLFireability-05
FORMULA_NAME Peterson-COL-5-LTLFireability-06
FORMULA_NAME Peterson-COL-5-LTLFireability-07
FORMULA_NAME Peterson-COL-5-LTLFireability-08
FORMULA_NAME Peterson-COL-5-LTLFireability-09
FORMULA_NAME Peterson-COL-5-LTLFireability-10
FORMULA_NAME Peterson-COL-5-LTLFireability-11
FORMULA_NAME Peterson-COL-5-LTLFireability-12
FORMULA_NAME Peterson-COL-5-LTLFireability-13
FORMULA_NAME Peterson-COL-5-LTLFireability-14
FORMULA_NAME Peterson-COL-5-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716740651879
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-26 16:24:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 16:24:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 16:24:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 16:24:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 16:24:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1304 ms
[2024-05-26 16:24:16] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 16:24:16] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-05-26 16:24:16] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-COL-5-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 683 steps (0 resets) in 31 ms. (21 steps per ms) remains 0/10 properties
[2024-05-26 16:24:16] [INFO ] Flatten gal took : 29 ms
[2024-05-26 16:24:16] [INFO ] Flatten gal took : 6 ms
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 16:24:16] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 125 ms.
[2024-05-26 16:24:16] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 30 places in 24 ms
Reduce places removed 30 places and 60 transitions.
FORMULA Peterson-COL-5-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 834 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 27 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:24:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 16:24:17] [INFO ] Computed 23 invariants in 48 ms
[2024-05-26 16:24:17] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-26 16:24:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:24:17] [INFO ] Invariant cache hit.
[2024-05-26 16:24:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:24:18] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-05-26 16:24:18] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:24:18] [INFO ] Invariant cache hit.
[2024-05-26 16:24:18] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
SMT process timed out in 30950ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 31028ms
Finished structural reductions in LTL mode , in 1 iterations and 32655 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 834 out of 834 places after structural reductions.
[2024-05-26 16:24:50] [INFO ] Flatten gal took : 222 ms
[2024-05-26 16:24:50] [INFO ] Flatten gal took : 213 ms
[2024-05-26 16:24:50] [INFO ] Input system was already deterministic with 1242 transitions.
Reduction of identical properties reduced properties to check from 18 to 14
RANDOM walk for 40000 steps (8 resets) in 1677 ms. (23 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 605 ms. (66 steps per ms) remains 1/1 properties
[2024-05-26 16:24:51] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:24:51] [INFO ] Invariant cache hit.
[2024-05-26 16:24:51] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 768/798 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/804 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1926 variables, 804/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1926 variables, 205/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1926 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1956 variables, 30/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 5/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 768/798 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/804 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1926 variables, 804/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1926 variables, 205/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1926 variables, 1/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1926 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/1956 variables, 30/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 5/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:24:53] [INFO ] Deduced a trap composed of 24 places in 805 ms of which 111 ms to minimize.
[2024-05-26 16:24:54] [INFO ] Deduced a trap composed of 22 places in 787 ms of which 11 ms to minimize.
[2024-05-26 16:24:55] [INFO ] Deduced a trap composed of 180 places in 456 ms of which 7 ms to minimize.
[2024-05-26 16:24:55] [INFO ] Deduced a trap composed of 45 places in 592 ms of which 10 ms to minimize.
[2024-05-26 16:24:56] [INFO ] Deduced a trap composed of 48 places in 391 ms of which 6 ms to minimize.
[2024-05-26 16:24:57] [INFO ] Deduced a trap composed of 11 places in 685 ms of which 7 ms to minimize.
[2024-05-26 16:24:57] [INFO ] Deduced a trap composed of 176 places in 483 ms of which 9 ms to minimize.
SMT process timed out in 6126ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 834 transition count 892
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 484 transition count 892
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 185 Pre rules applied. Total rules applied 700 place count 484 transition count 707
Deduced a syphon composed of 185 places in 2 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 1070 place count 299 transition count 707
Applied a total of 1070 rules in 228 ms. Remains 299 /834 variables (removed 535) and now considering 707/1242 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 299/834 places, 707/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 570 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 61 steps, run visited all 1 properties in 9 ms. (steps per millisecond=6 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 18 ms. (steps per millisecond=3 ) properties seen :1
FORMULA Peterson-COL-5-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(G(p0)) U p1)))'
Support contains 240 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 834 transition count 1036
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 628 transition count 1036
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 412 place count 628 transition count 876
Deduced a syphon composed of 160 places in 2 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 732 place count 468 transition count 876
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 744 place count 462 transition count 870
Applied a total of 744 rules in 155 ms. Remains 462 /834 variables (removed 372) and now considering 870/1242 (removed 372) transitions.
[2024-05-26 16:24:58] [INFO ] Flow matrix only has 750 transitions (discarded 120 similar events)
// Phase 1: matrix 750 rows 462 cols
[2024-05-26 16:24:58] [INFO ] Computed 23 invariants in 14 ms
[2024-05-26 16:24:59] [INFO ] Implicit Places using invariants in 262 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 266 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 456/834 places, 870/1242 transitions.
Applied a total of 0 rules in 37 ms. Remains 456 /456 variables (removed 0) and now considering 870/870 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 458 ms. Remains : 456/834 places, 870/1242 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-00
Product exploration explored 100000 steps with 11277 reset in 1578 ms.
Stack based approach found an accepted trace after 550 steps with 61 reset with depth 7 and stack size 7 in 7 ms.
FORMULA Peterson-COL-5-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-00 finished in 2539 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 24 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 712 place count 478 transition count 726
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1032 place count 318 transition count 726
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 1044 place count 312 transition count 720
Applied a total of 1044 rules in 57 ms. Remains 312 /834 variables (removed 522) and now considering 720/1242 (removed 522) transitions.
[2024-05-26 16:25:01] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
// Phase 1: matrix 600 rows 312 cols
[2024-05-26 16:25:01] [INFO ] Computed 23 invariants in 6 ms
[2024-05-26 16:25:01] [INFO ] Implicit Places using invariants in 326 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 329 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 306/834 places, 720/1242 transitions.
Applied a total of 0 rules in 20 ms. Remains 306 /306 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 407 ms. Remains : 306/834 places, 720/1242 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-01
Product exploration explored 100000 steps with 8460 reset in 451 ms.
Stack based approach found an accepted trace after 150 steps with 12 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-01 finished in 960 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(F(((F(!p0) U p1)&&X(G(!p1)))))))'
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:25:02] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 16:25:02] [INFO ] Computed 23 invariants in 13 ms
[2024-05-26 16:25:02] [INFO ] Implicit Places using invariants in 512 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 514 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 555 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 630 ms.
Product exploration explored 100000 steps with 0 reset in 575 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 1138 ms. (35 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1048 ms. (38 steps per ms) remains 2/2 properties
[2024-05-26 16:25:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 16:25:05] [INFO ] Computed 17 invariants in 8 ms
[2024-05-26 16:25:05] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1920 variables, 798/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 205/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1950 variables, 30/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 5/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1050 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 16:25:07] [INFO ] Deduced a trap composed of 79 places in 450 ms of which 6 ms to minimize.
[2024-05-26 16:25:08] [INFO ] Deduced a trap composed of 119 places in 513 ms of which 5 ms to minimize.
[2024-05-26 16:25:08] [INFO ] Deduced a trap composed of 207 places in 236 ms of which 4 ms to minimize.
[2024-05-26 16:25:08] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 3 ms to minimize.
[2024-05-26 16:25:08] [INFO ] Deduced a trap composed of 159 places in 280 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 16:25:09] [INFO ] Deduced a trap composed of 179 places in 334 ms of which 5 ms to minimize.
[2024-05-26 16:25:09] [INFO ] Deduced a trap composed of 139 places in 446 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/798 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 16:25:10] [INFO ] Deduced a trap composed of 146 places in 341 ms of which 6 ms to minimize.
[2024-05-26 16:25:10] [INFO ] Deduced a trap composed of 144 places in 368 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 16:25:11] [INFO ] Deduced a trap composed of 207 places in 680 ms of which 10 ms to minimize.
[2024-05-26 16:25:12] [INFO ] Deduced a trap composed of 139 places in 637 ms of which 9 ms to minimize.
SMT process timed out in 6617ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 828 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 753 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 753 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 593 transition count 1007
Applied a total of 470 rules in 87 ms. Remains 593 /828 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 593/828 places, 1007/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 637 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 646 ms. (61 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 357889 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :1 out of 2
Probabilistic random walk after 357889 steps, saw 132769 distinct states, run finished after 3005 ms. (steps per millisecond=119 ) properties seen :1
[2024-05-26 16:25:15] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 16:25:15] [INFO ] Computed 17 invariants in 4 ms
[2024-05-26 16:25:15] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:25:17] [INFO ] Deduced a trap composed of 114 places in 251 ms of which 5 ms to minimize.
[2024-05-26 16:25:17] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-05-26 16:25:17] [INFO ] Deduced a trap composed of 156 places in 163 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:25:17] [INFO ] Deduced a trap composed of 103 places in 363 ms of which 6 ms to minimize.
[2024-05-26 16:25:18] [INFO ] Deduced a trap composed of 144 places in 273 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/563 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 887/1450 variables, 563/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 205/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1480 variables, 30/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 5/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:25:20] [INFO ] Deduced a trap composed of 16 places in 475 ms of which 8 ms to minimize.
[2024-05-26 16:25:20] [INFO ] Deduced a trap composed of 32 places in 443 ms of which 7 ms to minimize.
[2024-05-26 16:25:21] [INFO ] Deduced a trap composed of 20 places in 535 ms of which 8 ms to minimize.
[2024-05-26 16:25:22] [INFO ] Deduced a trap composed of 13 places in 539 ms of which 13 ms to minimize.
[2024-05-26 16:25:23] [INFO ] Deduced a trap composed of 60 places in 475 ms of which 7 ms to minimize.
[2024-05-26 16:25:23] [INFO ] Deduced a trap composed of 55 places in 534 ms of which 8 ms to minimize.
[2024-05-26 16:25:24] [INFO ] Deduced a trap composed of 55 places in 496 ms of which 8 ms to minimize.
[2024-05-26 16:25:25] [INFO ] Deduced a trap composed of 17 places in 480 ms of which 8 ms to minimize.
[2024-05-26 16:25:25] [INFO ] Deduced a trap composed of 47 places in 372 ms of which 7 ms to minimize.
[2024-05-26 16:25:26] [INFO ] Deduced a trap composed of 50 places in 368 ms of which 7 ms to minimize.
[2024-05-26 16:25:26] [INFO ] Deduced a trap composed of 126 places in 445 ms of which 7 ms to minimize.
[2024-05-26 16:25:27] [INFO ] Deduced a trap composed of 24 places in 443 ms of which 9 ms to minimize.
[2024-05-26 16:25:27] [INFO ] Deduced a trap composed of 66 places in 344 ms of which 10 ms to minimize.
[2024-05-26 16:25:28] [INFO ] Deduced a trap composed of 19 places in 603 ms of which 9 ms to minimize.
[2024-05-26 16:25:29] [INFO ] Deduced a trap composed of 41 places in 594 ms of which 8 ms to minimize.
[2024-05-26 16:25:30] [INFO ] Deduced a trap composed of 38 places in 534 ms of which 8 ms to minimize.
[2024-05-26 16:25:30] [INFO ] Deduced a trap composed of 42 places in 612 ms of which 9 ms to minimize.
[2024-05-26 16:25:31] [INFO ] Deduced a trap composed of 127 places in 415 ms of which 6 ms to minimize.
[2024-05-26 16:25:32] [INFO ] Deduced a trap composed of 80 places in 408 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 19/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:25:33] [INFO ] Deduced a trap composed of 67 places in 487 ms of which 7 ms to minimize.
[2024-05-26 16:25:33] [INFO ] Deduced a trap composed of 33 places in 489 ms of which 7 ms to minimize.
[2024-05-26 16:25:34] [INFO ] Deduced a trap composed of 34 places in 520 ms of which 7 ms to minimize.
[2024-05-26 16:25:35] [INFO ] Deduced a trap composed of 16 places in 518 ms of which 7 ms to minimize.
[2024-05-26 16:25:36] [INFO ] Deduced a trap composed of 16 places in 517 ms of which 8 ms to minimize.
[2024-05-26 16:25:37] [INFO ] Deduced a trap composed of 90 places in 499 ms of which 7 ms to minimize.
[2024-05-26 16:25:37] [INFO ] Deduced a trap composed of 79 places in 406 ms of which 6 ms to minimize.
[2024-05-26 16:25:38] [INFO ] Deduced a trap composed of 35 places in 493 ms of which 7 ms to minimize.
[2024-05-26 16:25:38] [INFO ] Deduced a trap composed of 82 places in 386 ms of which 7 ms to minimize.
[2024-05-26 16:25:39] [INFO ] Deduced a trap composed of 88 places in 388 ms of which 6 ms to minimize.
[2024-05-26 16:25:40] [INFO ] Deduced a trap composed of 97 places in 464 ms of which 8 ms to minimize.
[2024-05-26 16:25:40] [INFO ] Deduced a trap composed of 83 places in 452 ms of which 7 ms to minimize.
[2024-05-26 16:25:41] [INFO ] Deduced a trap composed of 57 places in 466 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 13/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 constraints]
After SMT, in 27929ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 161 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 42 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 601 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 626 ms. (63 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 362726 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 362726 steps, saw 133021 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-26 16:25:47] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:25:47] [INFO ] Invariant cache hit.
[2024-05-26 16:25:47] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:25:48] [INFO ] Deduced a trap composed of 84 places in 304 ms of which 5 ms to minimize.
[2024-05-26 16:25:48] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:25:48] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 5 ms to minimize.
[2024-05-26 16:25:49] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:25:49] [INFO ] Deduced a trap composed of 89 places in 220 ms of which 4 ms to minimize.
[2024-05-26 16:25:49] [INFO ] Deduced a trap composed of 105 places in 262 ms of which 5 ms to minimize.
[2024-05-26 16:25:49] [INFO ] Deduced a trap composed of 117 places in 179 ms of which 4 ms to minimize.
[2024-05-26 16:25:50] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:25:52] [INFO ] Deduced a trap composed of 47 places in 471 ms of which 7 ms to minimize.
[2024-05-26 16:25:52] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 6 ms to minimize.
[2024-05-26 16:25:53] [INFO ] Deduced a trap composed of 30 places in 410 ms of which 7 ms to minimize.
[2024-05-26 16:25:54] [INFO ] Deduced a trap composed of 74 places in 350 ms of which 6 ms to minimize.
[2024-05-26 16:25:54] [INFO ] Deduced a trap composed of 65 places in 489 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7962 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 8666ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 32 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 34 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 16:25:56] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:25:56] [INFO ] Invariant cache hit.
[2024-05-26 16:25:56] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-26 16:25:56] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:25:56] [INFO ] Invariant cache hit.
[2024-05-26 16:25:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:25:58] [INFO ] Implicit Places using invariants and state equation in 2362 ms returned []
Implicit Place search using SMT with State Equation took 2847 ms to find 0 implicit places.
[2024-05-26 16:25:59] [INFO ] Redundant transitions in 97 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 16:25:59] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:25:59] [INFO ] Invariant cache hit.
[2024-05-26 16:25:59] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:26:18] [INFO ] Deduced a trap composed of 74 places in 567 ms of which 8 ms to minimize.
[2024-05-26 16:26:19] [INFO ] Deduced a trap composed of 35 places in 491 ms of which 8 ms to minimize.
[2024-05-26 16:26:19] [INFO ] Deduced a trap composed of 41 places in 512 ms of which 8 ms to minimize.
[2024-05-26 16:26:20] [INFO ] Deduced a trap composed of 55 places in 476 ms of which 7 ms to minimize.
[2024-05-26 16:26:20] [INFO ] Deduced a trap composed of 38 places in 446 ms of which 5 ms to minimize.
[2024-05-26 16:26:21] [INFO ] Deduced a trap composed of 29 places in 382 ms of which 6 ms to minimize.
[2024-05-26 16:26:21] [INFO ] Deduced a trap composed of 17 places in 348 ms of which 9 ms to minimize.
[2024-05-26 16:26:21] [INFO ] Deduced a trap composed of 82 places in 434 ms of which 6 ms to minimize.
[2024-05-26 16:26:22] [INFO ] Deduced a trap composed of 53 places in 475 ms of which 7 ms to minimize.
[2024-05-26 16:26:22] [INFO ] Deduced a trap composed of 16 places in 409 ms of which 7 ms to minimize.
[2024-05-26 16:26:23] [INFO ] Deduced a trap composed of 29 places in 419 ms of which 7 ms to minimize.
[2024-05-26 16:26:23] [INFO ] Deduced a trap composed of 29 places in 484 ms of which 8 ms to minimize.
[2024-05-26 16:26:24] [INFO ] Deduced a trap composed of 16 places in 476 ms of which 7 ms to minimize.
[2024-05-26 16:26:24] [INFO ] Deduced a trap composed of 30 places in 550 ms of which 8 ms to minimize.
[2024-05-26 16:26:25] [INFO ] Deduced a trap composed of 24 places in 515 ms of which 8 ms to minimize.
[2024-05-26 16:26:25] [INFO ] Deduced a trap composed of 29 places in 526 ms of which 8 ms to minimize.
[2024-05-26 16:26:26] [INFO ] Deduced a trap composed of 29 places in 520 ms of which 8 ms to minimize.
[2024-05-26 16:26:26] [INFO ] Deduced a trap composed of 26 places in 452 ms of which 6 ms to minimize.
[2024-05-26 16:26:27] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 5 ms to minimize.
[2024-05-26 16:26:27] [INFO ] Deduced a trap composed of 11 places in 352 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:26:28] [INFO ] Deduced a trap composed of 53 places in 380 ms of which 6 ms to minimize.
[2024-05-26 16:26:29] [INFO ] Deduced a trap composed of 14 places in 472 ms of which 7 ms to minimize.
[2024-05-26 16:26:29] [INFO ] Deduced a trap composed of 20 places in 483 ms of which 7 ms to minimize.
SMT process timed out in 30499ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30521ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33518 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 6 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 241 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-05-26 16:26:29] [INFO ] Computed 6 invariants in 4 ms
[2024-05-26 16:26:30] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-26 16:26:30] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 16:26:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-26 16:26:30] [INFO ] After 744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 16:26:31] [INFO ] After 1214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 16:26:31] [INFO ] After 1783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2252 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 234 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 368 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-26 16:26:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 16:26:32] [INFO ] Computed 17 invariants in 8 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 29 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:26:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:26:34] [INFO ] Invariant cache hit.
[2024-05-26 16:26:35] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-26 16:26:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:26:35] [INFO ] Invariant cache hit.
[2024-05-26 16:26:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:26:37] [INFO ] Implicit Places using invariants and state equation in 2244 ms returned []
Implicit Place search using SMT with State Equation took 2971 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-05-26 16:26:37] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:26:37] [INFO ] Invariant cache hit.
[2024-05-26 16:26:37] [INFO ] State equation strengthened by 205 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1950 variables, and 17 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/828 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 16:27:10] [INFO ] Deduced a trap composed of 41 places in 680 ms of which 12 ms to minimize.
[2024-05-26 16:27:11] [INFO ] Deduced a trap composed of 77 places in 643 ms of which 7 ms to minimize.
[2024-05-26 16:27:11] [INFO ] Deduced a trap composed of 51 places in 497 ms of which 7 ms to minimize.
[2024-05-26 16:27:12] [INFO ] Deduced a trap composed of 49 places in 523 ms of which 11 ms to minimize.
[2024-05-26 16:27:12] [INFO ] Deduced a trap composed of 45 places in 693 ms of which 7 ms to minimize.
[2024-05-26 16:27:13] [INFO ] Deduced a trap composed of 52 places in 751 ms of which 10 ms to minimize.
[2024-05-26 16:27:14] [INFO ] Deduced a trap composed of 22 places in 821 ms of which 12 ms to minimize.
[2024-05-26 16:27:15] [INFO ] Deduced a trap composed of 35 places in 809 ms of which 11 ms to minimize.
[2024-05-26 16:27:16] [INFO ] Deduced a trap composed of 20 places in 799 ms of which 10 ms to minimize.
[2024-05-26 16:27:16] [INFO ] Deduced a trap composed of 78 places in 735 ms of which 10 ms to minimize.
[2024-05-26 16:27:17] [INFO ] Deduced a trap composed of 63 places in 725 ms of which 10 ms to minimize.
[2024-05-26 16:27:18] [INFO ] Deduced a trap composed of 62 places in 602 ms of which 9 ms to minimize.
[2024-05-26 16:27:19] [INFO ] Deduced a trap composed of 119 places in 719 ms of which 9 ms to minimize.
[2024-05-26 16:27:19] [INFO ] Deduced a trap composed of 38 places in 683 ms of which 10 ms to minimize.
[2024-05-26 16:27:20] [INFO ] Deduced a trap composed of 35 places in 553 ms of which 9 ms to minimize.
[2024-05-26 16:27:21] [INFO ] Deduced a trap composed of 58 places in 659 ms of which 9 ms to minimize.
[2024-05-26 16:27:21] [INFO ] Deduced a trap composed of 34 places in 715 ms of which 10 ms to minimize.
[2024-05-26 16:27:22] [INFO ] Deduced a trap composed of 18 places in 715 ms of which 10 ms to minimize.
[2024-05-26 16:27:23] [INFO ] Deduced a trap composed of 51 places in 703 ms of which 10 ms to minimize.
[2024-05-26 16:27:24] [INFO ] Deduced a trap composed of 105 places in 785 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 16:27:25] [INFO ] Deduced a trap composed of 72 places in 864 ms of which 11 ms to minimize.
[2024-05-26 16:27:26] [INFO ] Deduced a trap composed of 40 places in 878 ms of which 11 ms to minimize.
[2024-05-26 16:27:27] [INFO ] Deduced a trap composed of 16 places in 818 ms of which 11 ms to minimize.
[2024-05-26 16:27:28] [INFO ] Deduced a trap composed of 27 places in 787 ms of which 10 ms to minimize.
[2024-05-26 16:27:29] [INFO ] Deduced a trap composed of 38 places in 830 ms of which 11 ms to minimize.
[2024-05-26 16:27:30] [INFO ] Deduced a trap composed of 79 places in 813 ms of which 10 ms to minimize.
[2024-05-26 16:27:30] [INFO ] Deduced a trap composed of 47 places in 790 ms of which 10 ms to minimize.
[2024-05-26 16:27:31] [INFO ] Deduced a trap composed of 77 places in 842 ms of which 11 ms to minimize.
[2024-05-26 16:27:32] [INFO ] Deduced a trap composed of 50 places in 754 ms of which 10 ms to minimize.
[2024-05-26 16:27:33] [INFO ] Deduced a trap composed of 72 places in 651 ms of which 10 ms to minimize.
[2024-05-26 16:27:33] [INFO ] Deduced a trap composed of 14 places in 734 ms of which 10 ms to minimize.
[2024-05-26 16:27:34] [INFO ] Deduced a trap composed of 61 places in 694 ms of which 9 ms to minimize.
[2024-05-26 16:27:35] [INFO ] Deduced a trap composed of 26 places in 714 ms of which 9 ms to minimize.
[2024-05-26 16:27:35] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 3 ms to minimize.
[2024-05-26 16:27:36] [INFO ] Deduced a trap composed of 64 places in 912 ms of which 11 ms to minimize.
[2024-05-26 16:27:37] [INFO ] Deduced a trap composed of 115 places in 890 ms of which 11 ms to minimize.
[2024-05-26 16:27:38] [INFO ] Deduced a trap composed of 35 places in 750 ms of which 6 ms to minimize.
SMT process timed out in 60893ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 60910ms
Finished structural reductions in LTL mode , in 1 iterations and 63915 ms. Remains : 828/828 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 678 ms. (58 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 2/2 properties
[2024-05-26 16:27:39] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:27:39] [INFO ] Invariant cache hit.
[2024-05-26 16:27:39] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1920 variables, 798/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 205/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1950 variables, 30/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 5/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1050 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1635 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 16:27:41] [INFO ] Deduced a trap composed of 79 places in 656 ms of which 9 ms to minimize.
[2024-05-26 16:27:42] [INFO ] Deduced a trap composed of 163 places in 518 ms of which 8 ms to minimize.
[2024-05-26 16:27:42] [INFO ] Deduced a trap composed of 159 places in 522 ms of which 8 ms to minimize.
[2024-05-26 16:27:43] [INFO ] Deduced a trap composed of 119 places in 359 ms of which 6 ms to minimize.
[2024-05-26 16:27:43] [INFO ] Deduced a trap composed of 227 places in 373 ms of which 6 ms to minimize.
[2024-05-26 16:27:44] [INFO ] Deduced a trap composed of 255 places in 256 ms of which 5 ms to minimize.
[2024-05-26 16:27:44] [INFO ] Deduced a trap composed of 199 places in 251 ms of which 4 ms to minimize.
[2024-05-26 16:27:44] [INFO ] Deduced a trap composed of 139 places in 515 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 16:27:45] [INFO ] Deduced a trap composed of 99 places in 411 ms of which 6 ms to minimize.
[2024-05-26 16:27:45] [INFO ] Deduced a trap composed of 182 places in 235 ms of which 4 ms to minimize.
[2024-05-26 16:27:45] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 792/1950 variables, and 17 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/17 constraints, State Equation: 0/828 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 6740ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 828 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 753 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 753 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 593 transition count 1007
Applied a total of 470 rules in 71 ms. Remains 593 /828 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 593/828 places, 1007/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 575 ms. (69 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 695 ms. (57 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 401436 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :1 out of 2
Probabilistic random walk after 401436 steps, saw 138584 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :1
[2024-05-26 16:27:49] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 16:27:49] [INFO ] Computed 17 invariants in 6 ms
[2024-05-26 16:27:49] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:27:51] [INFO ] Deduced a trap composed of 114 places in 246 ms of which 5 ms to minimize.
[2024-05-26 16:27:51] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 3 ms to minimize.
[2024-05-26 16:27:51] [INFO ] Deduced a trap composed of 156 places in 164 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:27:51] [INFO ] Deduced a trap composed of 103 places in 339 ms of which 7 ms to minimize.
[2024-05-26 16:27:52] [INFO ] Deduced a trap composed of 144 places in 246 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/563 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 887/1450 variables, 563/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 205/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1480 variables, 30/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 5/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:27:54] [INFO ] Deduced a trap composed of 16 places in 554 ms of which 8 ms to minimize.
[2024-05-26 16:27:55] [INFO ] Deduced a trap composed of 32 places in 533 ms of which 8 ms to minimize.
[2024-05-26 16:27:55] [INFO ] Deduced a trap composed of 20 places in 569 ms of which 8 ms to minimize.
[2024-05-26 16:27:56] [INFO ] Deduced a trap composed of 13 places in 551 ms of which 8 ms to minimize.
[2024-05-26 16:27:57] [INFO ] Deduced a trap composed of 60 places in 398 ms of which 6 ms to minimize.
[2024-05-26 16:27:57] [INFO ] Deduced a trap composed of 55 places in 545 ms of which 8 ms to minimize.
[2024-05-26 16:27:58] [INFO ] Deduced a trap composed of 55 places in 466 ms of which 7 ms to minimize.
[2024-05-26 16:27:59] [INFO ] Deduced a trap composed of 17 places in 501 ms of which 7 ms to minimize.
[2024-05-26 16:27:59] [INFO ] Deduced a trap composed of 47 places in 335 ms of which 6 ms to minimize.
[2024-05-26 16:28:00] [INFO ] Deduced a trap composed of 50 places in 451 ms of which 7 ms to minimize.
[2024-05-26 16:28:00] [INFO ] Deduced a trap composed of 126 places in 443 ms of which 7 ms to minimize.
[2024-05-26 16:28:01] [INFO ] Deduced a trap composed of 24 places in 461 ms of which 7 ms to minimize.
[2024-05-26 16:28:01] [INFO ] Deduced a trap composed of 66 places in 328 ms of which 5 ms to minimize.
[2024-05-26 16:28:02] [INFO ] Deduced a trap composed of 19 places in 594 ms of which 8 ms to minimize.
[2024-05-26 16:28:03] [INFO ] Deduced a trap composed of 41 places in 562 ms of which 6 ms to minimize.
[2024-05-26 16:28:04] [INFO ] Deduced a trap composed of 38 places in 395 ms of which 6 ms to minimize.
[2024-05-26 16:28:04] [INFO ] Deduced a trap composed of 42 places in 498 ms of which 8 ms to minimize.
[2024-05-26 16:28:05] [INFO ] Deduced a trap composed of 127 places in 419 ms of which 6 ms to minimize.
[2024-05-26 16:28:05] [INFO ] Deduced a trap composed of 80 places in 400 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 19/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:28:07] [INFO ] Deduced a trap composed of 67 places in 456 ms of which 7 ms to minimize.
[2024-05-26 16:28:07] [INFO ] Deduced a trap composed of 33 places in 467 ms of which 7 ms to minimize.
[2024-05-26 16:28:08] [INFO ] Deduced a trap composed of 34 places in 464 ms of which 7 ms to minimize.
[2024-05-26 16:28:08] [INFO ] Deduced a trap composed of 16 places in 499 ms of which 7 ms to minimize.
[2024-05-26 16:28:09] [INFO ] Deduced a trap composed of 16 places in 489 ms of which 8 ms to minimize.
[2024-05-26 16:28:10] [INFO ] Deduced a trap composed of 90 places in 480 ms of which 7 ms to minimize.
[2024-05-26 16:28:11] [INFO ] Deduced a trap composed of 79 places in 384 ms of which 6 ms to minimize.
[2024-05-26 16:28:11] [INFO ] Deduced a trap composed of 35 places in 480 ms of which 7 ms to minimize.
[2024-05-26 16:28:12] [INFO ] Deduced a trap composed of 82 places in 372 ms of which 6 ms to minimize.
[2024-05-26 16:28:12] [INFO ] Deduced a trap composed of 88 places in 339 ms of which 6 ms to minimize.
[2024-05-26 16:28:13] [INFO ] Deduced a trap composed of 97 places in 455 ms of which 7 ms to minimize.
[2024-05-26 16:28:14] [INFO ] Deduced a trap composed of 83 places in 429 ms of which 7 ms to minimize.
[2024-05-26 16:28:14] [INFO ] Deduced a trap composed of 57 places in 440 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 13/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26097 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 constraints]
After SMT, in 27198ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 24 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 397 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 406861 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 406861 steps, saw 139320 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2024-05-26 16:28:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:28:20] [INFO ] Invariant cache hit.
[2024-05-26 16:28:20] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:28:21] [INFO ] Deduced a trap composed of 84 places in 449 ms of which 7 ms to minimize.
[2024-05-26 16:28:21] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:28:22] [INFO ] Deduced a trap composed of 54 places in 332 ms of which 6 ms to minimize.
[2024-05-26 16:28:22] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:28:22] [INFO ] Deduced a trap composed of 89 places in 248 ms of which 4 ms to minimize.
[2024-05-26 16:28:23] [INFO ] Deduced a trap composed of 105 places in 244 ms of which 5 ms to minimize.
[2024-05-26 16:28:23] [INFO ] Deduced a trap composed of 117 places in 159 ms of which 3 ms to minimize.
[2024-05-26 16:28:23] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:28:25] [INFO ] Deduced a trap composed of 47 places in 451 ms of which 7 ms to minimize.
[2024-05-26 16:28:26] [INFO ] Deduced a trap composed of 11 places in 470 ms of which 7 ms to minimize.
[2024-05-26 16:28:26] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 6 ms to minimize.
[2024-05-26 16:28:27] [INFO ] Deduced a trap composed of 74 places in 381 ms of which 6 ms to minimize.
[2024-05-26 16:28:28] [INFO ] Deduced a trap composed of 65 places in 471 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8297 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9199ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 25 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 24 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 16:28:29] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:28:29] [INFO ] Invariant cache hit.
[2024-05-26 16:28:30] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-26 16:28:30] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:28:30] [INFO ] Invariant cache hit.
[2024-05-26 16:28:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:28:32] [INFO ] Implicit Places using invariants and state equation in 2104 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
[2024-05-26 16:28:32] [INFO ] Redundant transitions in 72 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 16:28:32] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:28:32] [INFO ] Invariant cache hit.
[2024-05-26 16:28:32] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:28:51] [INFO ] Deduced a trap composed of 74 places in 535 ms of which 7 ms to minimize.
[2024-05-26 16:28:52] [INFO ] Deduced a trap composed of 35 places in 419 ms of which 7 ms to minimize.
[2024-05-26 16:28:52] [INFO ] Deduced a trap composed of 41 places in 536 ms of which 8 ms to minimize.
[2024-05-26 16:28:53] [INFO ] Deduced a trap composed of 55 places in 456 ms of which 8 ms to minimize.
[2024-05-26 16:28:53] [INFO ] Deduced a trap composed of 38 places in 555 ms of which 8 ms to minimize.
[2024-05-26 16:28:54] [INFO ] Deduced a trap composed of 29 places in 456 ms of which 7 ms to minimize.
[2024-05-26 16:28:54] [INFO ] Deduced a trap composed of 17 places in 531 ms of which 8 ms to minimize.
[2024-05-26 16:28:55] [INFO ] Deduced a trap composed of 82 places in 527 ms of which 7 ms to minimize.
[2024-05-26 16:28:55] [INFO ] Deduced a trap composed of 53 places in 538 ms of which 8 ms to minimize.
[2024-05-26 16:28:56] [INFO ] Deduced a trap composed of 16 places in 479 ms of which 7 ms to minimize.
[2024-05-26 16:28:56] [INFO ] Deduced a trap composed of 29 places in 502 ms of which 7 ms to minimize.
[2024-05-26 16:28:57] [INFO ] Deduced a trap composed of 29 places in 478 ms of which 8 ms to minimize.
[2024-05-26 16:28:57] [INFO ] Deduced a trap composed of 16 places in 464 ms of which 7 ms to minimize.
[2024-05-26 16:28:58] [INFO ] Deduced a trap composed of 30 places in 514 ms of which 8 ms to minimize.
[2024-05-26 16:28:58] [INFO ] Deduced a trap composed of 24 places in 495 ms of which 7 ms to minimize.
[2024-05-26 16:28:59] [INFO ] Deduced a trap composed of 29 places in 464 ms of which 7 ms to minimize.
[2024-05-26 16:28:59] [INFO ] Deduced a trap composed of 29 places in 499 ms of which 7 ms to minimize.
[2024-05-26 16:29:00] [INFO ] Deduced a trap composed of 26 places in 541 ms of which 7 ms to minimize.
[2024-05-26 16:29:00] [INFO ] Deduced a trap composed of 32 places in 365 ms of which 6 ms to minimize.
[2024-05-26 16:29:01] [INFO ] Deduced a trap composed of 11 places in 377 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:29:02] [INFO ] Deduced a trap composed of 53 places in 384 ms of which 5 ms to minimize.
[2024-05-26 16:29:02] [INFO ] Deduced a trap composed of 14 places in 450 ms of which 7 ms to minimize.
[2024-05-26 16:29:03] [INFO ] Deduced a trap composed of 20 places in 435 ms of which 7 ms to minimize.
SMT process timed out in 30863ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30885ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33651 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 1 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 130 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-05-26 16:29:03] [INFO ] Computed 6 invariants in 3 ms
[2024-05-26 16:29:03] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-26 16:29:03] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 16:29:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-26 16:29:04] [INFO ] After 722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 16:29:04] [INFO ] After 1195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 16:29:05] [INFO ] After 1767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2102 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 214 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 437 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-26 16:29:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 16:29:06] [INFO ] Computed 17 invariants in 6 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 366 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 1 reset in 612 ms.
Product exploration explored 100000 steps with 7 reset in 625 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 325 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 828 transition count 1242
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 50 place count 828 transition count 1242
Deduced a syphon composed of 211 places in 2 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 211 place count 828 transition count 1242
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 286 place count 753 transition count 1167
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 361 place count 753 transition count 1167
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 160 places in 2 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 385 place count 753 transition count 1167
Deduced a syphon composed of 160 places in 1 ms
Applied a total of 385 rules in 151 ms. Remains 753 /828 variables (removed 75) and now considering 1167/1242 (removed 75) transitions.
[2024-05-26 16:29:10] [INFO ] Redundant transitions in 41 ms returned []
Running 1161 sub problems to find dead transitions.
[2024-05-26 16:29:10] [INFO ] Flow matrix only has 1047 transitions (discarded 120 similar events)
// Phase 1: matrix 1047 rows 753 cols
[2024-05-26 16:29:10] [INFO ] Computed 17 invariants in 6 ms
[2024-05-26 16:29:10] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/753 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-05-26 16:29:37] [INFO ] Deduced a trap composed of 35 places in 854 ms of which 11 ms to minimize.
[2024-05-26 16:29:38] [INFO ] Deduced a trap composed of 55 places in 847 ms of which 10 ms to minimize.
[2024-05-26 16:29:39] [INFO ] Deduced a trap composed of 29 places in 759 ms of which 10 ms to minimize.
[2024-05-26 16:29:39] [INFO ] Deduced a trap composed of 16 places in 623 ms of which 9 ms to minimize.
[2024-05-26 16:29:40] [INFO ] Deduced a trap composed of 16 places in 586 ms of which 8 ms to minimize.
[2024-05-26 16:29:40] [INFO ] Deduced a trap composed of 16 places in 581 ms of which 8 ms to minimize.
[2024-05-26 16:29:41] [INFO ] Deduced a trap composed of 29 places in 452 ms of which 5 ms to minimize.
SMT process timed out in 30933ms, After SMT, problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 30959ms
Starting structural reductions in SI_LTL mode, iteration 1 : 753/828 places, 1167/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31168 ms. Remains : 753/828 places, 1167/1242 transitions.
Built C files in :
/tmp/ltsmin10848517379142408289
[2024-05-26 16:29:41] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10848517379142408289
Running compilation step : cd /tmp/ltsmin10848517379142408289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10848517379142408289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10848517379142408289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 22 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:29:44] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 16:29:44] [INFO ] Computed 17 invariants in 3 ms
[2024-05-26 16:29:44] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-26 16:29:44] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:29:44] [INFO ] Invariant cache hit.
[2024-05-26 16:29:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:29:48] [INFO ] Implicit Places using invariants and state equation in 3336 ms returned []
Implicit Place search using SMT with State Equation took 3716 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-05-26 16:29:48] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:29:48] [INFO ] Invariant cache hit.
[2024-05-26 16:29:48] [INFO ] State equation strengthened by 205 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1950 variables, and 17 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/828 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 16:30:21] [INFO ] Deduced a trap composed of 41 places in 808 ms of which 13 ms to minimize.
[2024-05-26 16:30:21] [INFO ] Deduced a trap composed of 77 places in 833 ms of which 11 ms to minimize.
[2024-05-26 16:30:22] [INFO ] Deduced a trap composed of 51 places in 811 ms of which 11 ms to minimize.
[2024-05-26 16:30:23] [INFO ] Deduced a trap composed of 49 places in 833 ms of which 11 ms to minimize.
[2024-05-26 16:30:24] [INFO ] Deduced a trap composed of 45 places in 784 ms of which 11 ms to minimize.
[2024-05-26 16:30:25] [INFO ] Deduced a trap composed of 52 places in 837 ms of which 11 ms to minimize.
[2024-05-26 16:30:26] [INFO ] Deduced a trap composed of 22 places in 825 ms of which 12 ms to minimize.
[2024-05-26 16:30:27] [INFO ] Deduced a trap composed of 35 places in 821 ms of which 11 ms to minimize.
[2024-05-26 16:30:27] [INFO ] Deduced a trap composed of 20 places in 821 ms of which 11 ms to minimize.
[2024-05-26 16:30:28] [INFO ] Deduced a trap composed of 78 places in 808 ms of which 11 ms to minimize.
[2024-05-26 16:30:29] [INFO ] Deduced a trap composed of 63 places in 796 ms of which 10 ms to minimize.
[2024-05-26 16:30:30] [INFO ] Deduced a trap composed of 62 places in 777 ms of which 11 ms to minimize.
[2024-05-26 16:30:31] [INFO ] Deduced a trap composed of 119 places in 770 ms of which 10 ms to minimize.
[2024-05-26 16:30:31] [INFO ] Deduced a trap composed of 38 places in 783 ms of which 11 ms to minimize.
[2024-05-26 16:30:32] [INFO ] Deduced a trap composed of 35 places in 736 ms of which 10 ms to minimize.
[2024-05-26 16:30:33] [INFO ] Deduced a trap composed of 58 places in 732 ms of which 10 ms to minimize.
[2024-05-26 16:30:34] [INFO ] Deduced a trap composed of 34 places in 727 ms of which 10 ms to minimize.
[2024-05-26 16:30:34] [INFO ] Deduced a trap composed of 18 places in 731 ms of which 9 ms to minimize.
[2024-05-26 16:30:35] [INFO ] Deduced a trap composed of 51 places in 771 ms of which 10 ms to minimize.
[2024-05-26 16:30:36] [INFO ] Deduced a trap composed of 105 places in 756 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-05-26 16:30:38] [INFO ] Deduced a trap composed of 72 places in 816 ms of which 11 ms to minimize.
[2024-05-26 16:30:38] [INFO ] Deduced a trap composed of 40 places in 785 ms of which 10 ms to minimize.
[2024-05-26 16:30:39] [INFO ] Deduced a trap composed of 16 places in 776 ms of which 10 ms to minimize.
[2024-05-26 16:30:40] [INFO ] Deduced a trap composed of 27 places in 609 ms of which 9 ms to minimize.
[2024-05-26 16:30:41] [INFO ] Deduced a trap composed of 38 places in 686 ms of which 10 ms to minimize.
[2024-05-26 16:30:41] [INFO ] Deduced a trap composed of 79 places in 827 ms of which 11 ms to minimize.
[2024-05-26 16:30:42] [INFO ] Deduced a trap composed of 47 places in 822 ms of which 11 ms to minimize.
[2024-05-26 16:30:43] [INFO ] Deduced a trap composed of 77 places in 810 ms of which 10 ms to minimize.
[2024-05-26 16:30:44] [INFO ] Deduced a trap composed of 50 places in 771 ms of which 11 ms to minimize.
[2024-05-26 16:30:45] [INFO ] Deduced a trap composed of 72 places in 739 ms of which 10 ms to minimize.
[2024-05-26 16:30:45] [INFO ] Deduced a trap composed of 14 places in 762 ms of which 10 ms to minimize.
[2024-05-26 16:30:46] [INFO ] Deduced a trap composed of 61 places in 743 ms of which 10 ms to minimize.
[2024-05-26 16:30:47] [INFO ] Deduced a trap composed of 26 places in 833 ms of which 11 ms to minimize.
[2024-05-26 16:30:47] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 3 ms to minimize.
[2024-05-26 16:30:48] [INFO ] Deduced a trap composed of 64 places in 772 ms of which 11 ms to minimize.
SMT process timed out in 60645ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 60672ms
Finished structural reductions in LTL mode , in 1 iterations and 64417 ms. Remains : 828/828 places, 1242/1242 transitions.
Built C files in :
/tmp/ltsmin9615913635661504150
[2024-05-26 16:30:48] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9615913635661504150
Running compilation step : cd /tmp/ltsmin9615913635661504150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9615913635661504150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9615913635661504150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-26 16:30:52] [INFO ] Flatten gal took : 68 ms
[2024-05-26 16:30:52] [INFO ] Flatten gal took : 64 ms
[2024-05-26 16:30:52] [INFO ] Time to serialize gal into /tmp/LTL7908466261800969226.gal : 20 ms
[2024-05-26 16:30:52] [INFO ] Time to serialize properties into /tmp/LTL14281597942242247272.prop : 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/LTL7908466261800969226.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14540198769137288452.hoa' '-atoms' '/tmp/LTL14281597942242247272.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/LTL14281597942242247272.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14540198769137288452.hoa
Detected timeout of ITS tools.
[2024-05-26 16:31:07] [INFO ] Flatten gal took : 50 ms
[2024-05-26 16:31:07] [INFO ] Flatten gal took : 48 ms
[2024-05-26 16:31:07] [INFO ] Time to serialize gal into /tmp/LTL15829915462961979512.gal : 11 ms
[2024-05-26 16:31:07] [INFO ] Time to serialize properties into /tmp/LTL12173837011684996689.ltl : 4 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/LTL15829915462961979512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12173837011684996689.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 : !((X(X(F(((F(!("(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75...4967
Formula 0 simplified : XXG((G"(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75>=1)||(...4950
Detected timeout of ITS tools.
[2024-05-26 16:31:22] [INFO ] Flatten gal took : 45 ms
[2024-05-26 16:31:22] [INFO ] Applying decomposition
[2024-05-26 16:31:22] [INFO ] Flatten gal took : 43 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/graph17982423743390063338.txt' '-o' '/tmp/graph17982423743390063338.bin' '-w' '/tmp/graph17982423743390063338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17982423743390063338.bin' '-l' '-1' '-v' '-w' '/tmp/graph17982423743390063338.weights' '-q' '0' '-e' '0.001'
[2024-05-26 16:31:22] [INFO ] Decomposing Gal with order
[2024-05-26 16:31:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 16:31:23] [INFO ] Removed a total of 1038 redundant transitions.
[2024-05-26 16:31:23] [INFO ] Flatten gal took : 170 ms
[2024-05-26 16:31:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2024-05-26 16:31:23] [INFO ] Time to serialize gal into /tmp/LTL16468103986472166882.gal : 25 ms
[2024-05-26 16:31:23] [INFO ] Time to serialize properties into /tmp/LTL12387078387980741640.ltl : 3 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/LTL16468103986472166882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12387078387980741640.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((F(!("(((((((((i8.u189.TestIdentity_67>=1)||(i18.u22.TestIdentity_2>=1))||((i12.u94.TestIdentity_128>=1)||(i19.u186.TestIden...6854
Formula 0 simplified : XXG((G"(((((((((i8.u189.TestIdentity_67>=1)||(i18.u22.TestIdentity_2>=1))||((i12.u94.TestIdentity_128>=1)||(i19.u186.TestIdentity_63...6837
Detected timeout of ITS tools.
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 396284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1)||(F(G(p3))&&p2))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:31:38] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 16:31:38] [INFO ] Computed 23 invariants in 5 ms
[2024-05-26 16:31:38] [INFO ] Implicit Places using invariants in 482 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 485 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 21 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 522 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 427 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-03
Product exploration explored 100000 steps with 121 reset in 531 ms.
Product exploration explored 100000 steps with 120 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 111 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 2134 steps (0 resets) in 57 ms. (36 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p3)))), (F (NOT p1)), (F (NOT p3)), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 18 factoid took 424 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 192 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 828 transition count 1117
Reduce places removed 125 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 155 rules applied. Total rules applied 280 place count 703 transition count 1087
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 310 place count 673 transition count 1087
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 174 Pre rules applied. Total rules applied 310 place count 673 transition count 913
Deduced a syphon composed of 174 places in 0 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 658 place count 499 transition count 913
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 708 place count 474 transition count 888
Applied a total of 708 rules in 70 ms. Remains 474 /828 variables (removed 354) and now considering 888/1242 (removed 354) transitions.
[2024-05-26 16:31:41] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 474 cols
[2024-05-26 16:31:41] [INFO ] Computed 17 invariants in 5 ms
[2024-05-26 16:31:41] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-26 16:31:41] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-05-26 16:31:41] [INFO ] Invariant cache hit.
[2024-05-26 16:31:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:31:42] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2024-05-26 16:31:42] [INFO ] Redundant transitions in 15 ms returned []
Running 882 sub problems to find dead transitions.
[2024-05-26 16:31:42] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-05-26 16:31:42] [INFO ] Invariant cache hit.
[2024-05-26 16:31:42] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-26 16:31:56] [INFO ] Deduced a trap composed of 16 places in 491 ms of which 7 ms to minimize.
[2024-05-26 16:31:57] [INFO ] Deduced a trap composed of 36 places in 450 ms of which 7 ms to minimize.
[2024-05-26 16:31:57] [INFO ] Deduced a trap composed of 46 places in 431 ms of which 7 ms to minimize.
[2024-05-26 16:31:58] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 7 ms to minimize.
[2024-05-26 16:31:58] [INFO ] Deduced a trap composed of 26 places in 437 ms of which 7 ms to minimize.
[2024-05-26 16:31:58] [INFO ] Deduced a trap composed of 28 places in 449 ms of which 6 ms to minimize.
[2024-05-26 16:31:59] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 6 ms to minimize.
[2024-05-26 16:31:59] [INFO ] Deduced a trap composed of 26 places in 434 ms of which 6 ms to minimize.
[2024-05-26 16:32:00] [INFO ] Deduced a trap composed of 12 places in 445 ms of which 6 ms to minimize.
[2024-05-26 16:32:00] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 5 ms to minimize.
[2024-05-26 16:32:01] [INFO ] Deduced a trap composed of 38 places in 379 ms of which 6 ms to minimize.
[2024-05-26 16:32:01] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 3 ms to minimize.
[2024-05-26 16:32:01] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 5 ms to minimize.
[2024-05-26 16:32:02] [INFO ] Deduced a trap composed of 32 places in 416 ms of which 6 ms to minimize.
[2024-05-26 16:32:02] [INFO ] Deduced a trap composed of 45 places in 441 ms of which 6 ms to minimize.
[2024-05-26 16:32:03] [INFO ] Deduced a trap composed of 65 places in 359 ms of which 5 ms to minimize.
[2024-05-26 16:32:03] [INFO ] Deduced a trap composed of 46 places in 344 ms of which 5 ms to minimize.
[2024-05-26 16:32:03] [INFO ] Deduced a trap composed of 46 places in 346 ms of which 5 ms to minimize.
[2024-05-26 16:32:04] [INFO ] Deduced a trap composed of 46 places in 366 ms of which 6 ms to minimize.
[2024-05-26 16:32:04] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-26 16:32:05] [INFO ] Deduced a trap composed of 44 places in 508 ms of which 7 ms to minimize.
[2024-05-26 16:32:06] [INFO ] Deduced a trap composed of 63 places in 467 ms of which 7 ms to minimize.
[2024-05-26 16:32:06] [INFO ] Deduced a trap composed of 42 places in 472 ms of which 7 ms to minimize.
[2024-05-26 16:32:07] [INFO ] Deduced a trap composed of 16 places in 470 ms of which 7 ms to minimize.
[2024-05-26 16:32:07] [INFO ] Deduced a trap composed of 44 places in 420 ms of which 6 ms to minimize.
[2024-05-26 16:32:07] [INFO ] Deduced a trap composed of 65 places in 344 ms of which 5 ms to minimize.
[2024-05-26 16:32:08] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 5 ms to minimize.
[2024-05-26 16:32:08] [INFO ] Deduced a trap composed of 34 places in 387 ms of which 6 ms to minimize.
[2024-05-26 16:32:08] [INFO ] Deduced a trap composed of 34 places in 349 ms of which 5 ms to minimize.
[2024-05-26 16:32:09] [INFO ] Deduced a trap composed of 34 places in 395 ms of which 6 ms to minimize.
[2024-05-26 16:32:09] [INFO ] Deduced a trap composed of 20 places in 395 ms of which 6 ms to minimize.
[2024-05-26 16:32:10] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 5 ms to minimize.
[2024-05-26 16:32:10] [INFO ] Deduced a trap composed of 34 places in 376 ms of which 6 ms to minimize.
[2024-05-26 16:32:10] [INFO ] Deduced a trap composed of 31 places in 412 ms of which 7 ms to minimize.
[2024-05-26 16:32:11] [INFO ] Deduced a trap composed of 45 places in 378 ms of which 6 ms to minimize.
[2024-05-26 16:32:11] [INFO ] Deduced a trap composed of 12 places in 412 ms of which 6 ms to minimize.
[2024-05-26 16:32:12] [INFO ] Deduced a trap composed of 26 places in 411 ms of which 6 ms to minimize.
(s423 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.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 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/1242 variables, and 54 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/474 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-26 16:32:14] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 4 ms to minimize.
[2024-05-26 16:32:15] [INFO ] Deduced a trap composed of 32 places in 428 ms of which 6 ms to minimize.
[2024-05-26 16:32:15] [INFO ] Deduced a trap composed of 46 places in 360 ms of which 6 ms to minimize.
[2024-05-26 16:32:16] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 5 ms to minimize.
[2024-05-26 16:32:16] [INFO ] Deduced a trap composed of 18 places in 379 ms of which 6 ms to minimize.
[2024-05-26 16:32:16] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 6 ms to minimize.
[2024-05-26 16:32:17] [INFO ] Deduced a trap composed of 16 places in 420 ms of which 6 ms to minimize.
[2024-05-26 16:32:17] [INFO ] Deduced a trap composed of 30 places in 344 ms of which 5 ms to minimize.
[2024-05-26 16:32:18] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 5 ms to minimize.
[2024-05-26 16:32:18] [INFO ] Deduced a trap composed of 30 places in 354 ms of which 5 ms to minimize.
[2024-05-26 16:32:18] [INFO ] Deduced a trap composed of 48 places in 337 ms of which 5 ms to minimize.
[2024-05-26 16:32:19] [INFO ] Deduced a trap composed of 30 places in 340 ms of which 5 ms to minimize.
[2024-05-26 16:32:19] [INFO ] Deduced a trap composed of 52 places in 363 ms of which 5 ms to minimize.
[2024-05-26 16:32:20] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 6 ms to minimize.
[2024-05-26 16:32:20] [INFO ] Deduced a trap composed of 32 places in 361 ms of which 5 ms to minimize.
[2024-05-26 16:32:21] [INFO ] Deduced a trap composed of 18 places in 399 ms of which 6 ms to minimize.
[2024-05-26 16:32:22] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 6 ms to minimize.
[2024-05-26 16:32:22] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 6 ms to minimize.
[2024-05-26 16:32:22] [INFO ] Deduced a trap composed of 61 places in 340 ms of which 5 ms to minimize.
[2024-05-26 16:32:23] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-26 16:32:24] [INFO ] Deduced a trap composed of 32 places in 447 ms of which 6 ms to minimize.
[2024-05-26 16:32:24] [INFO ] Deduced a trap composed of 60 places in 295 ms of which 5 ms to minimize.
[2024-05-26 16:32:25] [INFO ] Deduced a trap composed of 60 places in 294 ms of which 5 ms to minimize.
[2024-05-26 16:32:25] [INFO ] Deduced a trap composed of 60 places in 292 ms of which 5 ms to minimize.
[2024-05-26 16:32:25] [INFO ] Deduced a trap composed of 90 places in 297 ms of which 5 ms to minimize.
[2024-05-26 16:32:26] [INFO ] Deduced a trap composed of 74 places in 305 ms of which 5 ms to minimize.
[2024-05-26 16:32:26] [INFO ] Deduced a trap composed of 74 places in 292 ms of which 5 ms to minimize.
[2024-05-26 16:32:26] [INFO ] Deduced a trap composed of 79 places in 303 ms of which 5 ms to minimize.
[2024-05-26 16:32:27] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-26 16:32:27] [INFO ] Deduced a trap composed of 24 places in 361 ms of which 6 ms to minimize.
[2024-05-26 16:32:28] [INFO ] Deduced a trap composed of 20 places in 381 ms of which 6 ms to minimize.
[2024-05-26 16:32:28] [INFO ] Deduced a trap composed of 14 places in 409 ms of which 6 ms to minimize.
[2024-05-26 16:32:28] [INFO ] Deduced a trap composed of 12 places in 402 ms of which 6 ms to minimize.
[2024-05-26 16:32:29] [INFO ] Deduced a trap composed of 52 places in 435 ms of which 7 ms to minimize.
[2024-05-26 16:32:29] [INFO ] Deduced a trap composed of 26 places in 435 ms of which 7 ms to minimize.
[2024-05-26 16:32:30] [INFO ] Deduced a trap composed of 14 places in 431 ms of which 7 ms to minimize.
[2024-05-26 16:32:30] [INFO ] Deduced a trap composed of 62 places in 447 ms of which 6 ms to minimize.
[2024-05-26 16:32:31] [INFO ] Deduced a trap composed of 28 places in 341 ms of which 6 ms to minimize.
[2024-05-26 16:32:32] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 5 ms to minimize.
[2024-05-26 16:32:32] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-05-26 16:32:34] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 6 ms to minimize.
[2024-05-26 16:32:34] [INFO ] Deduced a trap composed of 74 places in 391 ms of which 6 ms to minimize.
[2024-05-26 16:32:34] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 6 ms to minimize.
[2024-05-26 16:32:35] [INFO ] Deduced a trap composed of 96 places in 418 ms of which 7 ms to minimize.
[2024-05-26 16:32:35] [INFO ] Deduced a trap composed of 36 places in 396 ms of which 6 ms to minimize.
[2024-05-26 16:32:37] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 5 ms to minimize.
[2024-05-26 16:32:37] [INFO ] Deduced a trap composed of 30 places in 342 ms of which 6 ms to minimize.
[2024-05-26 16:32:37] [INFO ] Deduced a trap composed of 16 places in 340 ms of which 5 ms to minimize.
[2024-05-26 16:32:38] [INFO ] Deduced a trap composed of 18 places in 386 ms of which 5 ms to minimize.
[2024-05-26 16:32:38] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 5 ms to minimize.
[2024-05-26 16:32:38] [INFO ] Deduced a trap composed of 30 places in 362 ms of which 5 ms to minimize.
[2024-05-26 16:32:39] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 6 ms to minimize.
[2024-05-26 16:32:39] [INFO ] Deduced a trap composed of 24 places in 345 ms of which 6 ms to minimize.
[2024-05-26 16:32:40] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 5 ms to minimize.
[2024-05-26 16:32:40] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 5 ms to minimize.
[2024-05-26 16:32:40] [INFO ] Deduced a trap composed of 56 places in 306 ms of which 5 ms to minimize.
[2024-05-26 16:32:41] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 4 ms to minimize.
[2024-05-26 16:32:41] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 4 ms to minimize.
[2024-05-26 16:32:41] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 4 ms to minimize.
[2024-05-26 16:32:41] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/1242 variables, and 114 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/474 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 97/97 constraints]
After SMT, in 60435ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in SI_LTL mode, iteration 1 : 474/828 places, 888/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61761 ms. Remains : 474/828 places, 888/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p3), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 193 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
RANDOM walk for 897 steps (0 resets) in 25 ms. (34 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0 p3), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p3 p0 p1))), (F (NOT p1)), (F (NOT (OR p3 p0))), (F (NOT (OR (NOT p3) p0))), (F (NOT p3))]
Knowledge based reduction with 13 factoid took 565 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 217 reset in 621 ms.
Stack based approach found an accepted trace after 946 steps with 1 reset with depth 682 and stack size 666 in 6 ms.
FORMULA Peterson-COL-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-03 finished in 66755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 18 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:32:45] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 16:32:45] [INFO ] Computed 23 invariants in 7 ms
[2024-05-26 16:32:45] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-26 16:32:45] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:32:45] [INFO ] Invariant cache hit.
[2024-05-26 16:32:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:32:49] [INFO ] Implicit Places using invariants and state equation in 3739 ms returned []
Implicit Place search using SMT with State Equation took 4470 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-05-26 16:32:49] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:32:49] [INFO ] Invariant cache hit.
[2024-05-26 16:32:49] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
SMT process timed out in 30481ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 30502ms
Finished structural reductions in LTL mode , in 1 iterations and 35000 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 619 ms.
Product exploration explored 100000 steps with 50000 reset in 412 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-04 finished in 36237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:33:21] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:33:21] [INFO ] Invariant cache hit.
[2024-05-26 16:33:22] [INFO ] Implicit Places using invariants in 672 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 674 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 699 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-5-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-07 finished in 827 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 150 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 834 transition count 1082
Reduce places removed 160 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 310 rules applied. Total rules applied 470 place count 674 transition count 932
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 620 place count 524 transition count 932
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 620 place count 524 transition count 872
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 740 place count 464 transition count 872
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 790 place count 439 transition count 847
Applied a total of 790 rules in 61 ms. Remains 439 /834 variables (removed 395) and now considering 847/1242 (removed 395) transitions.
[2024-05-26 16:33:22] [INFO ] Flow matrix only has 727 transitions (discarded 120 similar events)
// Phase 1: matrix 727 rows 439 cols
[2024-05-26 16:33:22] [INFO ] Computed 23 invariants in 5 ms
[2024-05-26 16:33:22] [INFO ] Implicit Places using invariants in 667 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 669 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/834 places, 847/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 433 /433 variables (removed 0) and now considering 847/847 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 746 ms. Remains : 433/834 places, 847/1242 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-10
Product exploration explored 100000 steps with 3295 reset in 1049 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-10 finished in 1889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||X((F(p2)||p1)))))'
Support contains 186 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:33:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 16:33:24] [INFO ] Computed 23 invariants in 6 ms
[2024-05-26 16:33:24] [INFO ] Implicit Places using invariants in 318 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 320 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 346 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 1210 ms.
Product exploration explored 100000 steps with 33333 reset in 877 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-11 finished in 2670 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 60 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 30 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2024-05-26 16:33:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2024-05-26 16:33:26] [INFO ] Computed 23 invariants in 1 ms
[2024-05-26 16:33:27] [INFO ] Implicit Places using invariants in 302 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 303 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 347 ms. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 528 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA Peterson-COL-5-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-13 finished in 940 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)&&X((!p0 U !p1)))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:33:27] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-05-26 16:33:27] [INFO ] Computed 23 invariants in 6 ms
[2024-05-26 16:33:28] [INFO ] Implicit Places using invariants in 693 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 696 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 727 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Peterson-COL-5-LTLFireability-14
Product exploration explored 100000 steps with 133 reset in 1300 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-14 finished in 2210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(((p2 U G(p3))||p1))&&p0))))'
Support contains 270 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-05-26 16:33:29] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-05-26 16:33:29] [INFO ] Invariant cache hit.
[2024-05-26 16:33:30] [INFO ] Implicit Places using invariants in 547 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 549 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 572 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-15
Product exploration explored 100000 steps with 2401 reset in 1552 ms.
Product exploration explored 100000 steps with 2364 reset in 1238 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
[2024-05-26 16:33:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-05-26 16:33:34] [INFO ] Computed 17 invariants in 5 ms
[2024-05-26 16:33:34] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 762/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1920 variables, 798/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 205/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1950 variables, 30/1045 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 5/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1050 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1079 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 762/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:33:35] [INFO ] Deduced a trap composed of 119 places in 603 ms of which 10 ms to minimize.
[2024-05-26 16:33:36] [INFO ] Deduced a trap composed of 155 places in 541 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:33:37] [INFO ] Deduced a trap composed of 99 places in 458 ms of which 9 ms to minimize.
[2024-05-26 16:33:37] [INFO ] Deduced a trap composed of 79 places in 579 ms of which 8 ms to minimize.
[2024-05-26 16:33:37] [INFO ] Deduced a trap composed of 160 places in 249 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/798 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:33:38] [INFO ] Deduced a trap composed of 202 places in 255 ms of which 5 ms to minimize.
[2024-05-26 16:33:38] [INFO ] Deduced a trap composed of 179 places in 247 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1122/1920 variables, 798/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1920 variables, 205/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1920 variables, 1/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1920 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1950 variables, 30/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1950 variables, 5/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:33:40] [INFO ] Deduced a trap composed of 31 places in 790 ms of which 10 ms to minimize.
SMT process timed out in 6182ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 828 transition count 892
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 478 transition count 892
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 185 Pre rules applied. Total rules applied 700 place count 478 transition count 707
Deduced a syphon composed of 185 places in 0 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 1070 place count 293 transition count 707
Applied a total of 1070 rules in 42 ms. Remains 293 /828 variables (removed 535) and now considering 707/1242 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 293/828 places, 707/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 61 steps, run visited all 1 properties in 4 ms. (steps per millisecond=15 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 5 ms. (steps per millisecond=12 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (AND (NOT p3) p0 (NOT p1)))), (F (NOT (OR (NOT p3) p1))), (F p3)]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 7 factoid took 568 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-15 finished in 11094 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(F(((F(!p0) U p1)&&X(G(!p1)))))))'
Found a Shortening insensitive property : Peterson-COL-5-LTLFireability-02
Stuttering acceptance computed with spot in 355 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 834 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 759 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 759 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 599 transition count 1007
Applied a total of 470 rules in 55 ms. Remains 599 /834 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
[2024-05-26 16:33:41] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 599 cols
[2024-05-26 16:33:41] [INFO ] Computed 23 invariants in 5 ms
[2024-05-26 16:33:42] [INFO ] Implicit Places using invariants in 580 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 583 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 593/834 places, 1007/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 655 ms. Remains : 593/834 places, 1007/1242 transitions.
Running random walk in product with property : Peterson-COL-5-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 623 ms.
Product exploration explored 100000 steps with 2 reset in 494 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 1393 ms. (28 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 619 ms. (64 steps per ms) remains 2/2 properties
[2024-05-26 16:33:44] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 16:33:44] [INFO ] Computed 17 invariants in 4 ms
[2024-05-26 16:33:44] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 16:33:46] [INFO ] Deduced a trap composed of 114 places in 460 ms of which 8 ms to minimize.
[2024-05-26 16:33:46] [INFO ] Deduced a trap composed of 140 places in 373 ms of which 5 ms to minimize.
[2024-05-26 16:33:47] [INFO ] Deduced a trap composed of 131 places in 470 ms of which 8 ms to minimize.
[2024-05-26 16:33:47] [INFO ] Deduced a trap composed of 54 places in 497 ms of which 7 ms to minimize.
[2024-05-26 16:33:48] [INFO ] Deduced a trap composed of 112 places in 287 ms of which 5 ms to minimize.
[2024-05-26 16:33:48] [INFO ] Deduced a trap composed of 129 places in 370 ms of which 6 ms to minimize.
[2024-05-26 16:33:48] [INFO ] Deduced a trap composed of 84 places in 364 ms of which 6 ms to minimize.
[2024-05-26 16:33:49] [INFO ] Deduced a trap composed of 99 places in 266 ms of which 4 ms to minimize.
[2024-05-26 16:33:49] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 887/1450 variables, 563/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 2/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6248ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 21 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 1692 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 629 ms. (63 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 396326 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :1 out of 2
Probabilistic random walk after 396326 steps, saw 138125 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :1
[2024-05-26 16:33:54] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:33:54] [INFO ] Invariant cache hit.
[2024-05-26 16:33:54] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 922 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:33:56] [INFO ] Deduced a trap composed of 84 places in 519 ms of which 7 ms to minimize.
[2024-05-26 16:33:56] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:33:57] [INFO ] Deduced a trap composed of 54 places in 328 ms of which 6 ms to minimize.
[2024-05-26 16:33:57] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:33:57] [INFO ] Deduced a trap composed of 89 places in 257 ms of which 5 ms to minimize.
[2024-05-26 16:33:57] [INFO ] Deduced a trap composed of 105 places in 250 ms of which 5 ms to minimize.
[2024-05-26 16:33:58] [INFO ] Deduced a trap composed of 117 places in 165 ms of which 3 ms to minimize.
[2024-05-26 16:33:58] [INFO ] Deduced a trap composed of 111 places in 158 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:34:00] [INFO ] Deduced a trap composed of 47 places in 424 ms of which 7 ms to minimize.
[2024-05-26 16:34:01] [INFO ] Deduced a trap composed of 11 places in 445 ms of which 7 ms to minimize.
[2024-05-26 16:34:01] [INFO ] Deduced a trap composed of 30 places in 405 ms of which 6 ms to minimize.
[2024-05-26 16:34:02] [INFO ] Deduced a trap composed of 74 places in 405 ms of which 6 ms to minimize.
[2024-05-26 16:34:02] [INFO ] Deduced a trap composed of 65 places in 484 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8406 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9378ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 17 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 434 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 387982 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 387982 steps, saw 136629 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2024-05-26 16:34:07] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:34:07] [INFO ] Invariant cache hit.
[2024-05-26 16:34:07] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:34:09] [INFO ] Deduced a trap composed of 84 places in 496 ms of which 8 ms to minimize.
[2024-05-26 16:34:09] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:34:09] [INFO ] Deduced a trap composed of 54 places in 365 ms of which 5 ms to minimize.
[2024-05-26 16:34:09] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:34:10] [INFO ] Deduced a trap composed of 89 places in 256 ms of which 4 ms to minimize.
[2024-05-26 16:34:10] [INFO ] Deduced a trap composed of 105 places in 278 ms of which 4 ms to minimize.
[2024-05-26 16:34:10] [INFO ] Deduced a trap composed of 117 places in 173 ms of which 3 ms to minimize.
[2024-05-26 16:34:10] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:34:13] [INFO ] Deduced a trap composed of 47 places in 427 ms of which 8 ms to minimize.
[2024-05-26 16:34:13] [INFO ] Deduced a trap composed of 11 places in 502 ms of which 7 ms to minimize.
[2024-05-26 16:34:14] [INFO ] Deduced a trap composed of 30 places in 406 ms of which 7 ms to minimize.
[2024-05-26 16:34:14] [INFO ] Deduced a trap composed of 74 places in 408 ms of which 6 ms to minimize.
[2024-05-26 16:34:15] [INFO ] Deduced a trap composed of 65 places in 487 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8559 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9390ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 17 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 17 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 16:34:17] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:34:17] [INFO ] Invariant cache hit.
[2024-05-26 16:34:17] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-05-26 16:34:17] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:34:17] [INFO ] Invariant cache hit.
[2024-05-26 16:34:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:34:20] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 3112 ms to find 0 implicit places.
[2024-05-26 16:34:20] [INFO ] Redundant transitions in 16 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 16:34:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:34:20] [INFO ] Invariant cache hit.
[2024-05-26 16:34:20] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:34:39] [INFO ] Deduced a trap composed of 74 places in 561 ms of which 8 ms to minimize.
[2024-05-26 16:34:40] [INFO ] Deduced a trap composed of 35 places in 518 ms of which 8 ms to minimize.
[2024-05-26 16:34:40] [INFO ] Deduced a trap composed of 41 places in 523 ms of which 8 ms to minimize.
[2024-05-26 16:34:41] [INFO ] Deduced a trap composed of 55 places in 511 ms of which 8 ms to minimize.
[2024-05-26 16:34:41] [INFO ] Deduced a trap composed of 38 places in 475 ms of which 8 ms to minimize.
[2024-05-26 16:34:42] [INFO ] Deduced a trap composed of 29 places in 538 ms of which 8 ms to minimize.
[2024-05-26 16:34:42] [INFO ] Deduced a trap composed of 17 places in 498 ms of which 8 ms to minimize.
[2024-05-26 16:34:43] [INFO ] Deduced a trap composed of 82 places in 475 ms of which 7 ms to minimize.
[2024-05-26 16:34:43] [INFO ] Deduced a trap composed of 53 places in 462 ms of which 8 ms to minimize.
[2024-05-26 16:34:44] [INFO ] Deduced a trap composed of 16 places in 476 ms of which 7 ms to minimize.
[2024-05-26 16:34:44] [INFO ] Deduced a trap composed of 29 places in 458 ms of which 6 ms to minimize.
[2024-05-26 16:34:45] [INFO ] Deduced a trap composed of 29 places in 470 ms of which 7 ms to minimize.
[2024-05-26 16:34:45] [INFO ] Deduced a trap composed of 16 places in 474 ms of which 7 ms to minimize.
[2024-05-26 16:34:46] [INFO ] Deduced a trap composed of 30 places in 543 ms of which 8 ms to minimize.
[2024-05-26 16:34:46] [INFO ] Deduced a trap composed of 24 places in 533 ms of which 8 ms to minimize.
[2024-05-26 16:34:47] [INFO ] Deduced a trap composed of 29 places in 530 ms of which 7 ms to minimize.
[2024-05-26 16:34:47] [INFO ] Deduced a trap composed of 29 places in 519 ms of which 7 ms to minimize.
[2024-05-26 16:34:48] [INFO ] Deduced a trap composed of 26 places in 515 ms of which 7 ms to minimize.
[2024-05-26 16:34:48] [INFO ] Deduced a trap composed of 32 places in 379 ms of which 6 ms to minimize.
[2024-05-26 16:34:49] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:34:50] [INFO ] Deduced a trap composed of 53 places in 396 ms of which 6 ms to minimize.
[2024-05-26 16:34:50] [INFO ] Deduced a trap composed of 14 places in 457 ms of which 7 ms to minimize.
[2024-05-26 16:34:51] [INFO ] Deduced a trap composed of 20 places in 506 ms of which 7 ms to minimize.
SMT process timed out in 30899ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30917ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34074 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 1 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 107 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-05-26 16:34:51] [INFO ] Computed 6 invariants in 3 ms
[2024-05-26 16:34:51] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-26 16:34:51] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 16:34:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-26 16:34:52] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 16:34:52] [INFO ] After 1224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 16:34:53] [INFO ] After 1818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2129 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 362 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-26 16:34:54] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 16:34:54] [INFO ] Computed 17 invariants in 7 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 6 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 16:34:55] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:34:55] [INFO ] Invariant cache hit.
[2024-05-26 16:34:56] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-26 16:34:56] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:34:56] [INFO ] Invariant cache hit.
[2024-05-26 16:34:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:34:58] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 3096 ms to find 0 implicit places.
Running 1001 sub problems to find dead transitions.
[2024-05-26 16:34:58] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:34:58] [INFO ] Invariant cache hit.
[2024-05-26 16:34:58] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:35:18] [INFO ] Deduced a trap composed of 74 places in 562 ms of which 8 ms to minimize.
[2024-05-26 16:35:19] [INFO ] Deduced a trap composed of 35 places in 513 ms of which 7 ms to minimize.
[2024-05-26 16:35:19] [INFO ] Deduced a trap composed of 41 places in 547 ms of which 8 ms to minimize.
[2024-05-26 16:35:20] [INFO ] Deduced a trap composed of 55 places in 562 ms of which 8 ms to minimize.
[2024-05-26 16:35:21] [INFO ] Deduced a trap composed of 38 places in 554 ms of which 8 ms to minimize.
[2024-05-26 16:35:21] [INFO ] Deduced a trap composed of 29 places in 580 ms of which 8 ms to minimize.
[2024-05-26 16:35:22] [INFO ] Deduced a trap composed of 17 places in 555 ms of which 8 ms to minimize.
[2024-05-26 16:35:22] [INFO ] Deduced a trap composed of 82 places in 516 ms of which 7 ms to minimize.
[2024-05-26 16:35:23] [INFO ] Deduced a trap composed of 53 places in 511 ms of which 7 ms to minimize.
[2024-05-26 16:35:23] [INFO ] Deduced a trap composed of 16 places in 523 ms of which 7 ms to minimize.
[2024-05-26 16:35:24] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 7 ms to minimize.
[2024-05-26 16:35:24] [INFO ] Deduced a trap composed of 29 places in 485 ms of which 7 ms to minimize.
[2024-05-26 16:35:25] [INFO ] Deduced a trap composed of 16 places in 493 ms of which 6 ms to minimize.
[2024-05-26 16:35:25] [INFO ] Deduced a trap composed of 30 places in 514 ms of which 8 ms to minimize.
[2024-05-26 16:35:26] [INFO ] Deduced a trap composed of 24 places in 523 ms of which 8 ms to minimize.
[2024-05-26 16:35:26] [INFO ] Deduced a trap composed of 29 places in 519 ms of which 7 ms to minimize.
[2024-05-26 16:35:27] [INFO ] Deduced a trap composed of 29 places in 559 ms of which 8 ms to minimize.
[2024-05-26 16:35:28] [INFO ] Deduced a trap composed of 26 places in 536 ms of which 7 ms to minimize.
[2024-05-26 16:35:28] [INFO ] Deduced a trap composed of 32 places in 384 ms of which 6 ms to minimize.
[2024-05-26 16:35:28] [INFO ] Deduced a trap composed of 11 places in 379 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1480 variables, and 37 constraints, problems are : Problem set: 0 solved, 1001 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/593 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1001/1001 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1001 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:35:31] [INFO ] Deduced a trap composed of 14 places in 439 ms of which 7 ms to minimize.
[2024-05-26 16:35:31] [INFO ] Deduced a trap composed of 20 places in 498 ms of which 8 ms to minimize.
[2024-05-26 16:35:32] [INFO ] Deduced a trap composed of 23 places in 462 ms of which 7 ms to minimize.
[2024-05-26 16:35:33] [INFO ] Deduced a trap composed of 28 places in 568 ms of which 8 ms to minimize.
[2024-05-26 16:35:33] [INFO ] Deduced a trap composed of 14 places in 471 ms of which 7 ms to minimize.
[2024-05-26 16:35:34] [INFO ] Deduced a trap composed of 56 places in 527 ms of which 8 ms to minimize.
[2024-05-26 16:35:34] [INFO ] Deduced a trap composed of 151 places in 509 ms of which 7 ms to minimize.
[2024-05-26 16:35:35] [INFO ] Deduced a trap composed of 157 places in 521 ms of which 8 ms to minimize.
[2024-05-26 16:35:35] [INFO ] Deduced a trap composed of 63 places in 531 ms of which 7 ms to minimize.
[2024-05-26 16:35:36] [INFO ] Deduced a trap composed of 101 places in 411 ms of which 7 ms to minimize.
[2024-05-26 16:35:36] [INFO ] Deduced a trap composed of 71 places in 301 ms of which 5 ms to minimize.
[2024-05-26 16:35:36] [INFO ] Deduced a trap composed of 113 places in 381 ms of which 6 ms to minimize.
[2024-05-26 16:35:37] [INFO ] Deduced a trap composed of 17 places in 447 ms of which 6 ms to minimize.
[2024-05-26 16:35:37] [INFO ] Deduced a trap composed of 23 places in 450 ms of which 6 ms to minimize.
[2024-05-26 16:35:38] [INFO ] Deduced a trap composed of 20 places in 539 ms of which 7 ms to minimize.
[2024-05-26 16:35:39] [INFO ] Deduced a trap composed of 59 places in 468 ms of which 7 ms to minimize.
[2024-05-26 16:35:39] [INFO ] Deduced a trap composed of 78 places in 508 ms of which 7 ms to minimize.
[2024-05-26 16:35:40] [INFO ] Deduced a trap composed of 139 places in 424 ms of which 7 ms to minimize.
[2024-05-26 16:35:40] [INFO ] Deduced a trap composed of 23 places in 586 ms of which 8 ms to minimize.
[2024-05-26 16:35:41] [INFO ] Deduced a trap composed of 77 places in 605 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:35:42] [INFO ] Deduced a trap composed of 92 places in 451 ms of which 7 ms to minimize.
[2024-05-26 16:35:43] [INFO ] Deduced a trap composed of 61 places in 436 ms of which 7 ms to minimize.
[2024-05-26 16:35:43] [INFO ] Deduced a trap composed of 87 places in 515 ms of which 7 ms to minimize.
[2024-05-26 16:35:44] [INFO ] Deduced a trap composed of 56 places in 461 ms of which 8 ms to minimize.
[2024-05-26 16:35:44] [INFO ] Deduced a trap composed of 38 places in 493 ms of which 7 ms to minimize.
[2024-05-26 16:35:45] [INFO ] Deduced a trap composed of 61 places in 469 ms of which 8 ms to minimize.
[2024-05-26 16:35:45] [INFO ] Deduced a trap composed of 50 places in 525 ms of which 7 ms to minimize.
[2024-05-26 16:35:46] [INFO ] Deduced a trap composed of 129 places in 414 ms of which 7 ms to minimize.
[2024-05-26 16:35:46] [INFO ] Deduced a trap composed of 114 places in 480 ms of which 7 ms to minimize.
[2024-05-26 16:35:47] [INFO ] Deduced a trap composed of 95 places in 497 ms of which 8 ms to minimize.
[2024-05-26 16:35:47] [INFO ] Deduced a trap composed of 161 places in 519 ms of which 8 ms to minimize.
[2024-05-26 16:35:48] [INFO ] Deduced a trap composed of 71 places in 476 ms of which 7 ms to minimize.
[2024-05-26 16:35:48] [INFO ] Deduced a trap composed of 129 places in 491 ms of which 7 ms to minimize.
[2024-05-26 16:35:49] [INFO ] Deduced a trap composed of 42 places in 419 ms of which 6 ms to minimize.
[2024-05-26 16:35:49] [INFO ] Deduced a trap composed of 42 places in 436 ms of which 7 ms to minimize.
[2024-05-26 16:35:50] [INFO ] Deduced a trap composed of 83 places in 514 ms of which 8 ms to minimize.
[2024-05-26 16:35:50] [INFO ] Deduced a trap composed of 75 places in 492 ms of which 6 ms to minimize.
[2024-05-26 16:35:51] [INFO ] Deduced a trap composed of 111 places in 423 ms of which 7 ms to minimize.
[2024-05-26 16:35:51] [INFO ] Deduced a trap composed of 62 places in 394 ms of which 6 ms to minimize.
[2024-05-26 16:35:51] [INFO ] Deduced a trap composed of 76 places in 447 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:35:53] [INFO ] Deduced a trap composed of 63 places in 561 ms of which 7 ms to minimize.
[2024-05-26 16:35:53] [INFO ] Deduced a trap composed of 99 places in 415 ms of which 7 ms to minimize.
[2024-05-26 16:35:54] [INFO ] Deduced a trap composed of 119 places in 492 ms of which 7 ms to minimize.
[2024-05-26 16:35:55] [INFO ] Deduced a trap composed of 119 places in 476 ms of which 7 ms to minimize.
[2024-05-26 16:35:55] [INFO ] Deduced a trap composed of 65 places in 441 ms of which 6 ms to minimize.
[2024-05-26 16:35:55] [INFO ] Deduced a trap composed of 70 places in 454 ms of which 6 ms to minimize.
[2024-05-26 16:35:56] [INFO ] Deduced a trap composed of 56 places in 389 ms of which 6 ms to minimize.
[2024-05-26 16:35:56] [INFO ] Deduced a trap composed of 42 places in 438 ms of which 7 ms to minimize.
[2024-05-26 16:35:57] [INFO ] Deduced a trap composed of 56 places in 585 ms of which 9 ms to minimize.
[2024-05-26 16:35:58] [INFO ] Deduced a trap composed of 17 places in 595 ms of which 8 ms to minimize.
[2024-05-26 16:35:58] [INFO ] Deduced a trap composed of 61 places in 548 ms of which 8 ms to minimize.
[2024-05-26 16:35:59] [INFO ] Deduced a trap composed of 57 places in 462 ms of which 8 ms to minimize.
[2024-05-26 16:35:59] [INFO ] Deduced a trap composed of 38 places in 572 ms of which 8 ms to minimize.
SMT process timed out in 61047ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 61067ms
Finished structural reductions in LTL mode , in 1 iterations and 64177 ms. Remains : 593/593 places, 1007/1007 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 1571 ms. (25 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
[2024-05-26 16:36:01] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:36:01] [INFO ] Invariant cache hit.
[2024-05-26 16:36:01] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 2 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 16:36:02] [INFO ] Deduced a trap composed of 84 places in 369 ms of which 6 ms to minimize.
[2024-05-26 16:36:02] [INFO ] Deduced a trap composed of 105 places in 342 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 887/1450 variables, 563/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 205/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 30/1480 variables, 30/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1480 variables, 5/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 16:36:04] [INFO ] Deduced a trap composed of 50 places in 403 ms of which 6 ms to minimize.
[2024-05-26 16:36:05] [INFO ] Deduced a trap composed of 68 places in 451 ms of which 7 ms to minimize.
[2024-05-26 16:36:05] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 7 ms to minimize.
[2024-05-26 16:36:06] [INFO ] Deduced a trap composed of 58 places in 507 ms of which 7 ms to minimize.
[2024-05-26 16:36:06] [INFO ] Deduced a trap composed of 53 places in 478 ms of which 7 ms to minimize.
[2024-05-26 16:36:07] [INFO ] Deduced a trap composed of 29 places in 507 ms of which 7 ms to minimize.
SMT process timed out in 6345ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 18 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 1621 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 603 ms. (66 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 419300 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :1 out of 2
Probabilistic random walk after 419300 steps, saw 141027 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :1
[2024-05-26 16:36:11] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:36:11] [INFO ] Invariant cache hit.
[2024-05-26 16:36:11] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:36:12] [INFO ] Deduced a trap composed of 84 places in 362 ms of which 7 ms to minimize.
[2024-05-26 16:36:12] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:36:13] [INFO ] Deduced a trap composed of 54 places in 359 ms of which 6 ms to minimize.
[2024-05-26 16:36:13] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:36:13] [INFO ] Deduced a trap composed of 89 places in 255 ms of which 4 ms to minimize.
[2024-05-26 16:36:14] [INFO ] Deduced a trap composed of 105 places in 262 ms of which 4 ms to minimize.
[2024-05-26 16:36:14] [INFO ] Deduced a trap composed of 117 places in 164 ms of which 4 ms to minimize.
[2024-05-26 16:36:14] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:36:16] [INFO ] Deduced a trap composed of 47 places in 408 ms of which 6 ms to minimize.
[2024-05-26 16:36:17] [INFO ] Deduced a trap composed of 11 places in 467 ms of which 7 ms to minimize.
[2024-05-26 16:36:17] [INFO ] Deduced a trap composed of 30 places in 376 ms of which 6 ms to minimize.
[2024-05-26 16:36:18] [INFO ] Deduced a trap composed of 74 places in 392 ms of which 6 ms to minimize.
[2024-05-26 16:36:18] [INFO ] Deduced a trap composed of 65 places in 479 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8074 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 8870ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 16 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 509 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 431718 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 431718 steps, saw 142815 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-26 16:36:23] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:36:23] [INFO ] Invariant cache hit.
[2024-05-26 16:36:23] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:36:24] [INFO ] Deduced a trap composed of 84 places in 439 ms of which 6 ms to minimize.
[2024-05-26 16:36:25] [INFO ] Deduced a trap composed of 121 places in 155 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:36:25] [INFO ] Deduced a trap composed of 54 places in 343 ms of which 5 ms to minimize.
[2024-05-26 16:36:25] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:36:26] [INFO ] Deduced a trap composed of 89 places in 206 ms of which 4 ms to minimize.
[2024-05-26 16:36:26] [INFO ] Deduced a trap composed of 105 places in 248 ms of which 4 ms to minimize.
[2024-05-26 16:36:26] [INFO ] Deduced a trap composed of 117 places in 165 ms of which 3 ms to minimize.
[2024-05-26 16:36:26] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 16:36:28] [INFO ] Deduced a trap composed of 47 places in 456 ms of which 7 ms to minimize.
[2024-05-26 16:36:29] [INFO ] Deduced a trap composed of 11 places in 484 ms of which 8 ms to minimize.
[2024-05-26 16:36:30] [INFO ] Deduced a trap composed of 30 places in 395 ms of which 7 ms to minimize.
[2024-05-26 16:36:30] [INFO ] Deduced a trap composed of 74 places in 407 ms of which 6 ms to minimize.
[2024-05-26 16:36:31] [INFO ] Deduced a trap composed of 65 places in 471 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8217 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9013ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 14 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 14 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 16:36:32] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:36:32] [INFO ] Invariant cache hit.
[2024-05-26 16:36:33] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-26 16:36:33] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:36:33] [INFO ] Invariant cache hit.
[2024-05-26 16:36:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:36:35] [INFO ] Implicit Places using invariants and state equation in 2357 ms returned []
Implicit Place search using SMT with State Equation took 2894 ms to find 0 implicit places.
[2024-05-26 16:36:35] [INFO ] Redundant transitions in 14 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 16:36:35] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:36:35] [INFO ] Invariant cache hit.
[2024-05-26 16:36:35] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:36:54] [INFO ] Deduced a trap composed of 74 places in 540 ms of which 8 ms to minimize.
[2024-05-26 16:36:55] [INFO ] Deduced a trap composed of 35 places in 530 ms of which 7 ms to minimize.
[2024-05-26 16:36:55] [INFO ] Deduced a trap composed of 41 places in 517 ms of which 8 ms to minimize.
[2024-05-26 16:36:56] [INFO ] Deduced a trap composed of 55 places in 517 ms of which 8 ms to minimize.
[2024-05-26 16:36:56] [INFO ] Deduced a trap composed of 38 places in 512 ms of which 7 ms to minimize.
[2024-05-26 16:36:57] [INFO ] Deduced a trap composed of 29 places in 510 ms of which 8 ms to minimize.
[2024-05-26 16:36:57] [INFO ] Deduced a trap composed of 17 places in 496 ms of which 7 ms to minimize.
[2024-05-26 16:36:58] [INFO ] Deduced a trap composed of 82 places in 487 ms of which 7 ms to minimize.
[2024-05-26 16:36:58] [INFO ] Deduced a trap composed of 53 places in 505 ms of which 7 ms to minimize.
[2024-05-26 16:36:59] [INFO ] Deduced a trap composed of 16 places in 457 ms of which 7 ms to minimize.
[2024-05-26 16:36:59] [INFO ] Deduced a trap composed of 29 places in 460 ms of which 7 ms to minimize.
[2024-05-26 16:37:00] [INFO ] Deduced a trap composed of 29 places in 449 ms of which 7 ms to minimize.
[2024-05-26 16:37:00] [INFO ] Deduced a trap composed of 16 places in 482 ms of which 6 ms to minimize.
[2024-05-26 16:37:01] [INFO ] Deduced a trap composed of 30 places in 491 ms of which 7 ms to minimize.
[2024-05-26 16:37:01] [INFO ] Deduced a trap composed of 24 places in 520 ms of which 8 ms to minimize.
[2024-05-26 16:37:02] [INFO ] Deduced a trap composed of 29 places in 516 ms of which 8 ms to minimize.
[2024-05-26 16:37:02] [INFO ] Deduced a trap composed of 29 places in 516 ms of which 8 ms to minimize.
[2024-05-26 16:37:03] [INFO ] Deduced a trap composed of 26 places in 505 ms of which 7 ms to minimize.
[2024-05-26 16:37:03] [INFO ] Deduced a trap composed of 32 places in 377 ms of which 6 ms to minimize.
[2024-05-26 16:37:04] [INFO ] Deduced a trap composed of 11 places in 377 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:37:05] [INFO ] Deduced a trap composed of 53 places in 393 ms of which 6 ms to minimize.
[2024-05-26 16:37:05] [INFO ] Deduced a trap composed of 14 places in 471 ms of which 7 ms to minimize.
[2024-05-26 16:37:06] [INFO ] Deduced a trap composed of 20 places in 492 ms of which 7 ms to minimize.
SMT process timed out in 30588ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30603ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33534 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 98 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-05-26 16:37:06] [INFO ] Computed 6 invariants in 3 ms
[2024-05-26 16:37:06] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-26 16:37:06] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 16:37:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-26 16:37:07] [INFO ] After 591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 16:37:07] [INFO ] After 880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 16:37:07] [INFO ] After 1273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1566 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 344 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-05-26 16:37:08] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-05-26 16:37:08] [INFO ] Computed 17 invariants in 5 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 343 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 0 reset in 613 ms.
Product exploration explored 100000 steps with 0 reset in 410 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 352 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 16 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 16:37:11] [INFO ] Redundant transitions in 18 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-05-26 16:37:11] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:37:11] [INFO ] Invariant cache hit.
[2024-05-26 16:37:11] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:37:30] [INFO ] Deduced a trap composed of 74 places in 554 ms of which 8 ms to minimize.
[2024-05-26 16:37:31] [INFO ] Deduced a trap composed of 35 places in 523 ms of which 8 ms to minimize.
[2024-05-26 16:37:31] [INFO ] Deduced a trap composed of 41 places in 555 ms of which 8 ms to minimize.
[2024-05-26 16:37:32] [INFO ] Deduced a trap composed of 55 places in 538 ms of which 7 ms to minimize.
[2024-05-26 16:37:33] [INFO ] Deduced a trap composed of 38 places in 540 ms of which 7 ms to minimize.
[2024-05-26 16:37:33] [INFO ] Deduced a trap composed of 29 places in 592 ms of which 8 ms to minimize.
[2024-05-26 16:37:34] [INFO ] Deduced a trap composed of 17 places in 527 ms of which 7 ms to minimize.
[2024-05-26 16:37:34] [INFO ] Deduced a trap composed of 82 places in 493 ms of which 7 ms to minimize.
[2024-05-26 16:37:35] [INFO ] Deduced a trap composed of 53 places in 450 ms of which 7 ms to minimize.
[2024-05-26 16:37:35] [INFO ] Deduced a trap composed of 16 places in 480 ms of which 7 ms to minimize.
[2024-05-26 16:37:36] [INFO ] Deduced a trap composed of 29 places in 425 ms of which 7 ms to minimize.
[2024-05-26 16:37:36] [INFO ] Deduced a trap composed of 29 places in 484 ms of which 7 ms to minimize.
[2024-05-26 16:37:37] [INFO ] Deduced a trap composed of 16 places in 491 ms of which 7 ms to minimize.
[2024-05-26 16:37:37] [INFO ] Deduced a trap composed of 30 places in 526 ms of which 7 ms to minimize.
[2024-05-26 16:37:38] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 7 ms to minimize.
[2024-05-26 16:37:38] [INFO ] Deduced a trap composed of 29 places in 527 ms of which 7 ms to minimize.
[2024-05-26 16:37:39] [INFO ] Deduced a trap composed of 29 places in 520 ms of which 7 ms to minimize.
[2024-05-26 16:37:39] [INFO ] Deduced a trap composed of 26 places in 525 ms of which 7 ms to minimize.
[2024-05-26 16:37:40] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 6 ms to minimize.
[2024-05-26 16:37:40] [INFO ] Deduced a trap composed of 11 places in 397 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:37:41] [INFO ] Deduced a trap composed of 53 places in 342 ms of which 5 ms to minimize.
[2024-05-26 16:37:41] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 6 ms to minimize.
[2024-05-26 16:37:42] [INFO ] Deduced a trap composed of 20 places in 484 ms of which 7 ms to minimize.
SMT process timed out in 30539ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30558ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30602 ms. Remains : 593/593 places, 1007/1007 transitions.
Built C files in :
/tmp/ltsmin11442458508255576042
[2024-05-26 16:37:42] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11442458508255576042
Running compilation step : cd /tmp/ltsmin11442458508255576042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11442458508255576042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11442458508255576042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 4 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-05-26 16:37:45] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:37:45] [INFO ] Invariant cache hit.
[2024-05-26 16:37:45] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-26 16:37:45] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:37:45] [INFO ] Invariant cache hit.
[2024-05-26 16:37:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-26 16:37:48] [INFO ] Implicit Places using invariants and state equation in 2206 ms returned []
Implicit Place search using SMT with State Equation took 2581 ms to find 0 implicit places.
Running 1001 sub problems to find dead transitions.
[2024-05-26 16:37:48] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-05-26 16:37:48] [INFO ] Invariant cache hit.
[2024-05-26 16:37:48] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:38:06] [INFO ] Deduced a trap composed of 74 places in 534 ms of which 7 ms to minimize.
[2024-05-26 16:38:07] [INFO ] Deduced a trap composed of 35 places in 505 ms of which 7 ms to minimize.
[2024-05-26 16:38:08] [INFO ] Deduced a trap composed of 41 places in 525 ms of which 7 ms to minimize.
[2024-05-26 16:38:08] [INFO ] Deduced a trap composed of 55 places in 489 ms of which 7 ms to minimize.
[2024-05-26 16:38:09] [INFO ] Deduced a trap composed of 38 places in 497 ms of which 7 ms to minimize.
[2024-05-26 16:38:09] [INFO ] Deduced a trap composed of 29 places in 528 ms of which 8 ms to minimize.
[2024-05-26 16:38:10] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 7 ms to minimize.
[2024-05-26 16:38:10] [INFO ] Deduced a trap composed of 82 places in 474 ms of which 7 ms to minimize.
[2024-05-26 16:38:11] [INFO ] Deduced a trap composed of 53 places in 513 ms of which 7 ms to minimize.
[2024-05-26 16:38:11] [INFO ] Deduced a trap composed of 16 places in 485 ms of which 7 ms to minimize.
[2024-05-26 16:38:12] [INFO ] Deduced a trap composed of 29 places in 456 ms of which 7 ms to minimize.
[2024-05-26 16:38:12] [INFO ] Deduced a trap composed of 29 places in 472 ms of which 7 ms to minimize.
[2024-05-26 16:38:13] [INFO ] Deduced a trap composed of 16 places in 481 ms of which 7 ms to minimize.
[2024-05-26 16:38:13] [INFO ] Deduced a trap composed of 30 places in 523 ms of which 8 ms to minimize.
[2024-05-26 16:38:14] [INFO ] Deduced a trap composed of 24 places in 531 ms of which 7 ms to minimize.
[2024-05-26 16:38:14] [INFO ] Deduced a trap composed of 29 places in 527 ms of which 8 ms to minimize.
[2024-05-26 16:38:15] [INFO ] Deduced a trap composed of 29 places in 495 ms of which 8 ms to minimize.
[2024-05-26 16:38:15] [INFO ] Deduced a trap composed of 26 places in 492 ms of which 8 ms to minimize.
[2024-05-26 16:38:16] [INFO ] Deduced a trap composed of 32 places in 377 ms of which 6 ms to minimize.
[2024-05-26 16:38:16] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-05-26 16:38:17] [INFO ] Deduced a trap composed of 53 places in 396 ms of which 6 ms to minimize.
[2024-05-26 16:38:17] [INFO ] Deduced a trap composed of 14 places in 477 ms of which 7 ms to minimize.
[2024-05-26 16:38:18] [INFO ] Deduced a trap composed of 20 places in 513 ms of which 7 ms to minimize.
[2024-05-26 16:38:18] [INFO ] Deduced a trap composed of 105 places in 392 ms of which 6 ms to minimize.
SMT process timed out in 30801ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30822ms
Finished structural reductions in LTL mode , in 1 iterations and 33411 ms. Remains : 593/593 places, 1007/1007 transitions.
Built C files in :
/tmp/ltsmin9285532818678589238
[2024-05-26 16:38:18] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9285532818678589238
Running compilation step : cd /tmp/ltsmin9285532818678589238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9285532818678589238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9285532818678589238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-26 16:38:22] [INFO ] Flatten gal took : 30 ms
[2024-05-26 16:38:22] [INFO ] Flatten gal took : 29 ms
[2024-05-26 16:38:22] [INFO ] Time to serialize gal into /tmp/LTL17921601112451853615.gal : 6 ms
[2024-05-26 16:38:22] [INFO ] Time to serialize properties into /tmp/LTL18149748430400459768.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/LTL17921601112451853615.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4102054032952777639.hoa' '-atoms' '/tmp/LTL18149748430400459768.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/LTL18149748430400459768.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4102054032952777639.hoa
Detected timeout of ITS tools.
[2024-05-26 16:38:37] [INFO ] Flatten gal took : 25 ms
[2024-05-26 16:38:37] [INFO ] Flatten gal took : 26 ms
[2024-05-26 16:38:37] [INFO ] Time to serialize gal into /tmp/LTL17180652663899329425.gal : 5 ms
[2024-05-26 16:38:37] [INFO ] Time to serialize properties into /tmp/LTL7526715006856299926.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17180652663899329425.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7526715006856299926.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((F(!("(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75...4967
Formula 0 simplified : XXG((G"(((((((((TestIdentity_67>=1)||(TestIdentity_2>=1))||((TestIdentity_128>=1)||(TestIdentity_63>=1)))||(((TestIdentity_75>=1)||(...4950
Detected timeout of ITS tools.
[2024-05-26 16:38:52] [INFO ] Flatten gal took : 25 ms
[2024-05-26 16:38:52] [INFO ] Applying decomposition
[2024-05-26 16:38:52] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2698820959451641078.txt' '-o' '/tmp/graph2698820959451641078.bin' '-w' '/tmp/graph2698820959451641078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2698820959451641078.bin' '-l' '-1' '-v' '-w' '/tmp/graph2698820959451641078.weights' '-q' '0' '-e' '0.001'
[2024-05-26 16:38:52] [INFO ] Decomposing Gal with order
[2024-05-26 16:38:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 16:38:52] [INFO ] Removed a total of 1206 redundant transitions.
[2024-05-26 16:38:52] [INFO ] Flatten gal took : 64 ms
[2024-05-26 16:38:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-26 16:38:52] [INFO ] Time to serialize gal into /tmp/LTL828871135231544750.gal : 12 ms
[2024-05-26 16:38:52] [INFO ] Time to serialize properties into /tmp/LTL12861911977014454191.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/LTL828871135231544750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12861911977014454191.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((F(!("(((((((((i4.u80.TestIdentity_67>=1)||(i14.i0.u145.TestIdentity_2>=1))||((i12.u115.TestIdentity_128>=1)||(i16.u78.TestI...6713
Formula 0 simplified : XXG((G"(((((((((i4.u80.TestIdentity_67>=1)||(i14.i0.u145.TestIdentity_2>=1))||((i12.u115.TestIdentity_128>=1)||(i16.u78.TestIdentity...6696
Detected timeout of ITS tools.
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 326573 ms.
[2024-05-26 16:39:07] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7698348524149197663
[2024-05-26 16:39:07] [INFO ] Computing symmetric may disable matrix : 1242 transitions.
[2024-05-26 16:39:07] [INFO ] Applying decomposition
[2024-05-26 16:39:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 16:39:07] [INFO ] Computing symmetric may enable matrix : 1242 transitions.
[2024-05-26 16:39:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 16:39:07] [INFO ] Flatten gal took : 34 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/graph6364849458366285518.txt' '-o' '/tmp/graph6364849458366285518.bin' '-w' '/tmp/graph6364849458366285518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6364849458366285518.bin' '-l' '-1' '-v' '-w' '/tmp/graph6364849458366285518.weights' '-q' '0' '-e' '0.001'
[2024-05-26 16:39:07] [INFO ] Decomposing Gal with order
[2024-05-26 16:39:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 16:39:07] [INFO ] Removed a total of 1034 redundant transitions.
[2024-05-26 16:39:07] [INFO ] Flatten gal took : 78 ms
[2024-05-26 16:39:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-26 16:39:07] [INFO ] Time to serialize gal into /tmp/LTLFireability15497533351233692803.gal : 12 ms
[2024-05-26 16:39:07] [INFO ] Time to serialize properties into /tmp/LTLFireability12146428663727556236.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/LTLFireability15497533351233692803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12146428663727556236.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...278
Read 1 LTL properties
[2024-05-26 16:39:08] [INFO ] Computing Do-Not-Accords matrix : 1242 transitions.
[2024-05-26 16:39:08] [INFO ] Computation of Completed DNA matrix. took 91 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 16:39:08] [INFO ] Built C files in 478ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7698348524149197663
Running compilation step : cd /tmp/ltsmin7698348524149197663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
Checking formula 0 : !((X(X(F(((F(!("(((((((((i31.u193.TestIdentity_67>=1)||(i2.i1.u182.TestIdentity_2>=1))||((i2.i0.u157.TestIdentity_128>=1)||(i25.i0.u12...7082
Formula 0 simplified : XXG((G"(((((((((i31.u193.TestIdentity_67>=1)||(i2.i1.u182.TestIdentity_2>=1))||((i2.i0.u157.TestIdentity_128>=1)||(i25.i0.u127.TestI...7061
Compilation finished in 7530 ms.
Running link step : cd /tmp/ltsmin7698348524149197663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 189 ms.
Running LTSmin : cd /tmp/ltsmin7698348524149197663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((<>(!(LTLAPp0==true)) U (LTLAPp1==true))&&X([](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-26 17:03:17] [INFO ] Applying decomposition
[2024-05-26 17:03:17] [INFO ] Flatten gal took : 67 ms
[2024-05-26 17:03:17] [INFO ] Decomposing Gal with order
[2024-05-26 17:03:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 17:03:17] [INFO ] Removed a total of 1098 redundant transitions.
[2024-05-26 17:03:17] [INFO ] Flatten gal took : 126 ms
[2024-05-26 17:03:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-26 17:03:17] [INFO ] Time to serialize gal into /tmp/LTLFireability4776169731471554411.gal : 11 ms
[2024-05-26 17:03:17] [INFO ] Time to serialize properties into /tmp/LTLFireability3544064400989048453.ltl : 10 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/LTLFireability4776169731471554411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3544064400989048453.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((F(!("(((((((((ProcessTourProcess67.TestIdentity_67>=1)||(ProcessTourProcess2.TestIdentity_2>=1))||((ProcessTourProcess128.T...9495
Formula 0 simplified : XXG((G"(((((((((ProcessTourProcess67.TestIdentity_67>=1)||(ProcessTourProcess2.TestIdentity_2>=1))||((ProcessTourProcess128.TestIden...9474
BK_TIME_CONFINEMENT_REACHED
--------------------
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="Peterson-COL-5"
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 Peterson-COL-5, 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 r268-smll-171654407200228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 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 ;