About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S16C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15673.600 | 3596899.00 | 9965171.00 | 4534.70 | ?FF??FFFFFFFFFFT | 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.r245-tall-171654349000028.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 greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000028
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6M 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 MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716567367125
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 16:16:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 16:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:16:08] [INFO ] Load time of PNML (sax parser for PT used): 362 ms
[2024-05-24 16:16:08] [INFO ] Transformed 4914 places.
[2024-05-24 16:16:08] [INFO ] Transformed 6913 transitions.
[2024-05-24 16:16:08] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1347 places :
Symmetric choice reduction at 1 with 1347 rule applications. Total rules 1377 place count 3537 transition count 5566
Iterating global reduction 1 with 1347 rules applied. Total rules applied 2724 place count 3537 transition count 5566
Discarding 1178 places :
Symmetric choice reduction at 1 with 1178 rule applications. Total rules 3902 place count 2359 transition count 4388
Iterating global reduction 1 with 1178 rules applied. Total rules applied 5080 place count 2359 transition count 4388
Discarding 219 places :
Symmetric choice reduction at 1 with 219 rule applications. Total rules 5299 place count 2140 transition count 3293
Iterating global reduction 1 with 219 rules applied. Total rules applied 5518 place count 2140 transition count 3293
Applied a total of 5518 rules in 954 ms. Remains 2140 /4914 variables (removed 2774) and now considering 3293/6913 (removed 3620) transitions.
[2024-05-24 16:16:10] [INFO ] Flow matrix only has 3021 transitions (discarded 272 similar events)
// Phase 1: matrix 3021 rows 2140 cols
[2024-05-24 16:16:10] [INFO ] Computed 505 invariants in 141 ms
[2024-05-24 16:16:12] [INFO ] Implicit Places using invariants in 2720 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 27, 34, 43, 54, 67, 82, 98, 114, 116, 118, 120, 122, 124, 137, 148, 157, 164, 169, 172, 195, 202, 205, 206, 207, 208, 209, 210, 213, 218, 225, 234, 245, 258, 272, 286, 288, 289, 290, 291, 304, 313, 320, 325, 328, 330, 353, 360, 363, 365, 366, 367, 368, 370, 373, 380, 387, 396, 407, 419, 431, 432, 433, 434, 436, 445, 452, 457, 461, 465, 467, 497, 500, 501, 502, 503, 504, 505, 507, 509, 513, 518, 525, 534, 544, 554, 555, 556, 557, 558, 559, 566, 571, 574, 576, 578, 580, 603, 610, 613, 614, 616, 617, 618, 620, 622, 624, 630, 635, 642, 650, 658, 659, 660, 661, 662, 663, 668, 671, 673, 675, 677, 679, 702, 709, 712, 713, 714, 715, 716, 717, 719, 721, 723, 725, 728, 733, 739, 745, 746, 747, 748, 749, 750, 754, 756, 758, 760, 762, 764, 787, 794, 797, 798, 799, 800, 801, 802, 804, 806, 808, 810, 812, 815, 819, 823, 824, 825, 826, 827, 828, 830, 832, 834, 836, 838, 841, 864, 871, 874, 876, 877, 878, 879, 883, 885, 887, 889, 891, 893, 895, 898, 901, 902, 903, 907, 909, 911, 913, 915, 917, 942, 944, 948, 951, 952, 953, 954, 955, 956, 958, 960, 962, 964, 966, 968, 970, 973, 974, 975, 976, 977, 978, 980, 982, 984, 986, 988, 990, 1013, 1020, 1023, 1024, 1025, 1026, 1027, 1028, 1032, 1034, 1036, 1038, 1040, 1042, 1045, 1046, 1047, 1048, 1049, 1050, 1052, 1054, 1056, 1058, 1060, 1062, 1085, 1092, 1097, 1098, 1099, 1100, 1102, 1107, 1109, 1111, 1113, 1115, 1120, 1125, 1126, 1127, 1128, 1129, 1130, 1133, 1135, 1137, 1139, 1141, 1143, 1166, 1173, 1176, 1177, 1178, 1179, 1180, 1181, 1183, 1185, 1187, 1189, 1191, 1194, 1199, 1206, 1207, 1208, 1209, 1210, 1211, 1217, 1221, 1223, 1225, 1227, 1229, 1252, 1259, 1262, 1263, 1264, 1265, 1266, 1267, 1269, 1271, 1273, 1275, 1278, 1283, 1290, 1299, 1300, 1301, 1302, 1303, 1304, 1311, 1316, 1319, 1321, 1323, 1325, 1348, 1355, 1358, 1359, 1360, 1361, 1362, 1363, 1365, 1367, 1369, 1372, 1377, 1384, 1393, 1404, 1405, 1406, 1407, 1408, 1409, 1418, 1425, 1430, 1433, 1435, 1437, 1460, 1467, 1471, 1472, 1473, 1475, 1477, 1482, 1485, 1490, 1497, 1508, 1519, 1532, 1533, 1534, 1535, 1536, 1537, 1548, 1557, 1564, 1569, 1572, 1574, 1597, 1604, 1607, 1608, 1609, 1610, 1611, 1612, 1614, 1617, 1622, 1629, 1638, 1649, 1662, 1677, 1678, 1679, 1680, 1681, 1682, 1696, 1707, 1716, 1723, 1728, 1731, 1754, 1756, 1760, 1763, 1764, 1765, 1767, 1768, 1771, 1776, 1783, 1794, 1805, 1818, 1833, 1850, 1851, 1852, 1853, 1854, 1855, 1870, 1883, 1894, 1903, 1910, 1915, 1939]
[2024-05-24 16:16:12] [INFO ] Actually due to overlaps returned [195, 353, 603, 702, 787, 864, 942, 1013, 1085, 1166, 1252, 1348, 1460, 1597, 1754, 1939, 4, 12, 14, 16, 18, 20, 22, 114, 116, 118, 120, 122, 205, 206, 207, 208, 209, 210, 286, 288, 289, 290, 363, 365, 366, 367, 431, 432, 433, 434, 500, 501, 502, 503, 504, 507, 554, 555, 556, 557, 558, 613, 614, 616, 617, 620, 658, 659, 660, 661, 662, 712, 713, 714, 715, 716, 719, 745, 746, 747, 748, 749, 797, 798, 799, 800, 801, 804, 823, 824, 825, 826, 827, 874, 876, 877, 878, 883, 898, 901, 902, 944, 951, 952, 953, 954, 955, 958, 973, 974, 975, 976, 977, 1023, 1024, 1025, 1026, 1027, 1045, 1046, 1047, 1048, 1049, 1097, 1098, 1099, 1102, 1125, 1126, 1127, 1128, 1129, 1176, 1177, 1178, 1179, 1180, 1183, 1206, 1207, 1208, 1209, 1210, 1262, 1263, 1264, 1265, 1266, 1269, 1299, 1300, 1301, 1302, 1303, 1358, 1359, 1360, 1361, 1362, 1365, 1404, 1405, 1406, 1407, 1408, 1471, 1472, 1473, 1477, 1532, 1533, 1534, 1535, 1536, 1607, 1608, 1609, 1610, 1611, 1614, 1677, 1678, 1679, 1680, 1681, 1756, 1763, 1764, 1765, 1767, 1771, 1850, 1851, 1852, 1853, 1854]
Discarding 192 places :
Implicit Place search using SMT only with invariants took 2760 ms to find 192 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1948/4914 places, 3293/6913 transitions.
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 148 place count 1800 transition count 3145
Iterating global reduction 0 with 148 rules applied. Total rules applied 296 place count 1800 transition count 3145
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 444 place count 1652 transition count 2997
Iterating global reduction 0 with 148 rules applied. Total rules applied 592 place count 1652 transition count 2997
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 738 place count 1506 transition count 2851
Iterating global reduction 0 with 146 rules applied. Total rules applied 884 place count 1506 transition count 2851
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 906 place count 1484 transition count 2741
Iterating global reduction 0 with 22 rules applied. Total rules applied 928 place count 1484 transition count 2741
Applied a total of 928 rules in 340 ms. Remains 1484 /1948 variables (removed 464) and now considering 2741/3293 (removed 552) transitions.
[2024-05-24 16:16:13] [INFO ] Flow matrix only has 2469 transitions (discarded 272 similar events)
// Phase 1: matrix 2469 rows 1484 cols
[2024-05-24 16:16:13] [INFO ] Computed 313 invariants in 55 ms
[2024-05-24 16:16:14] [INFO ] Implicit Places using invariants in 1401 ms returned [7, 20, 27, 36, 47, 60, 75, 91, 112, 125, 136, 145, 152, 157, 160, 189, 193, 198, 205, 214, 225, 238, 252, 267, 280, 289, 296, 301, 304, 306, 317, 321, 323, 326, 333, 340, 349, 360, 372, 385, 394, 401, 406, 410, 414, 416, 430, 432, 435, 439, 444, 451, 460, 470, 479, 486, 491, 494, 496, 498, 500, 509, 513, 516, 518, 524, 529, 536, 544, 551, 556, 559, 561, 563, 565, 567, 578, 580, 583, 585, 587, 590, 595, 601, 607, 610, 612, 614, 616, 618, 620, 629, 631, 634, 636, 638, 640, 643, 647, 650, 652, 654, 656, 658, 660, 663, 672, 676, 681, 683, 685, 687, 689, 691, 696, 700, 702, 704, 706, 708, 710, 726, 728, 731, 733, 735, 737, 739, 741, 743, 745, 747, 749, 751, 753, 755, 764, 766, 770, 772, 774, 776, 778, 780, 782, 784, 786, 788, 790, 792, 794, 803, 808, 814, 816, 818, 820, 822, 827, 831, 834, 836, 838, 840, 842, 844, 857, 859, 862, 864, 866, 868, 871, 876, 882, 888, 892, 894, 896, 898, 900, 909, 911, 914, 916, 918, 921, 926, 933, 941, 948, 953, 956, 958, 960, 962, 971, 974, 977, 979, 982, 987, 994, 1003, 1013, 1022, 1029, 1034, 1037, 1039, 1041, 1051, 1056, 1062, 1065, 1070, 1077, 1088, 1099, 1111, 1122, 1131, 1138, 1143, 1146, 1148, 1161, 1163, 1167, 1172, 1179, 1188, 1199, 1212, 1227, 1240, 1251, 1260, 1267, 1272, 1275, 1282, 1286, 1293, 1300, 1311, 1322, 1335, 1350, 1366, 1381, 1394, 1405, 1414, 1421, 1426]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 1405 ms to find 256 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1228/4914 places, 2741/6913 transitions.
Applied a total of 0 rules in 48 ms. Remains 1228 /1228 variables (removed 0) and now considering 2741/2741 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5526 ms. Remains : 1228/4914 places, 2741/6913 transitions.
Support contains 58 out of 1228 places after structural reductions.
[2024-05-24 16:16:14] [INFO ] Flatten gal took : 196 ms
[2024-05-24 16:16:15] [INFO ] Flatten gal took : 135 ms
[2024-05-24 16:16:15] [INFO ] Input system was already deterministic with 2741 transitions.
RANDOM walk for 40000 steps (768 resets) in 3020 ms. (13 steps per ms) remains 9/27 properties
BEST_FIRST walk for 40001 steps (200 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (200 resets) in 238 ms. (167 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (200 resets) in 206 ms. (193 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (200 resets) in 202 ms. (197 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (200 resets) in 209 ms. (190 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (200 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (200 resets) in 168 ms. (236 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (200 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
[2024-05-24 16:16:16] [INFO ] Flow matrix only has 2469 transitions (discarded 272 similar events)
// Phase 1: matrix 2469 rows 1228 cols
[2024-05-24 16:16:16] [INFO ] Computed 57 invariants in 33 ms
[2024-05-24 16:16:16] [INFO ] State equation strengthened by 942 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1116/1131 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 16:16:17] [INFO ] Deduced a trap composed of 1014 places in 555 ms of which 21 ms to minimize.
[2024-05-24 16:16:18] [INFO ] Deduced a trap composed of 1044 places in 542 ms of which 55 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1131 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/1132 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 65/1197 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 16:16:19] [INFO ] Deduced a trap composed of 152 places in 556 ms of which 9 ms to minimize.
[2024-05-24 16:16:20] [INFO ] Deduced a trap composed of 166 places in 613 ms of which 20 ms to minimize.
[2024-05-24 16:16:20] [INFO ] Deduced a trap composed of 98 places in 248 ms of which 4 ms to minimize.
[2024-05-24 16:16:21] [INFO ] Deduced a trap composed of 177 places in 618 ms of which 9 ms to minimize.
[2024-05-24 16:16:22] [INFO ] Deduced a trap composed of 250 places in 605 ms of which 8 ms to minimize.
SMT process timed out in 5336ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1213 transition count 2708
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1195 transition count 2708
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 82 place count 1179 transition count 2668
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 1179 transition count 2668
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 98 place count 1179 transition count 2664
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 1175 transition count 2664
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 115 place count 1166 transition count 2619
Iterating global reduction 2 with 9 rules applied. Total rules applied 124 place count 1166 transition count 2619
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 166 place count 1145 transition count 2598
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 169 place count 1142 transition count 2595
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 1142 transition count 2595
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 1139 transition count 2580
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 1139 transition count 2580
Free-agglomeration rule (complex) applied 127 times.
Iterating global reduction 2 with 127 rules applied. Total rules applied 305 place count 1139 transition count 3141
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 432 place count 1012 transition count 3141
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 438 place count 1012 transition count 3141
Applied a total of 438 rules in 1052 ms. Remains 1012 /1228 variables (removed 216) and now considering 3141/2741 (removed -400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1053 ms. Remains : 1012/1228 places, 3141/2741 transitions.
RANDOM walk for 40000 steps (1290 resets) in 990 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (184 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (137 resets) in 133 ms. (298 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (155 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (184 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (160 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (159 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (138 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
[2024-05-24 16:16:23] [INFO ] Flow matrix only has 2756 transitions (discarded 385 similar events)
// Phase 1: matrix 2756 rows 1012 cols
[2024-05-24 16:16:23] [INFO ] Computed 57 invariants in 23 ms
[2024-05-24 16:16:23] [INFO ] State equation strengthened by 1558 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 927/940 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 16:16:24] [INFO ] Deduced a trap composed of 144 places in 483 ms of which 6 ms to minimize.
[2024-05-24 16:16:25] [INFO ] Deduced a trap composed of 149 places in 505 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/940 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/940 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/941 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/941 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 38/979 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 16:16:26] [INFO ] Deduced a trap composed of 6 places in 511 ms of which 7 ms to minimize.
[2024-05-24 16:16:26] [INFO ] Deduced a trap composed of 78 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:16:27] [INFO ] Deduced a trap composed of 28 places in 495 ms of which 6 ms to minimize.
[2024-05-24 16:16:27] [INFO ] Deduced a trap composed of 77 places in 532 ms of which 8 ms to minimize.
[2024-05-24 16:16:28] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/979 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 24/1003 variables, 24/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1003 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 9/1012 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1012 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2756/3768 variables, 1012/1076 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/3768 variables, 1558/2634 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 16:16:30] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3768 variables, 1/2635 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3768 variables, 0/2635 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 16:16:31] [INFO ] Deduced a trap composed of 114 places in 202 ms of which 4 ms to minimize.
[2024-05-24 16:16:31] [INFO ] Deduced a trap composed of 85 places in 197 ms of which 4 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/3768 variables, 2/2637 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3768 variables, 0/2637 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/3768 variables, 0/2637 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3768/3768 variables, and 2637 constraints, problems are : Problem set: 1 solved, 5 unsolved in 9747 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 1012/1012 constraints, ReadFeed: 1558/1558 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 928/939 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/939 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/939 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/941 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/941 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 38/979 variables, 15/26 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 8/34 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 16:16:34] [INFO ] Deduced a trap composed of 86 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:16:34] [INFO ] Deduced a trap composed of 100 places in 205 ms of which 4 ms to minimize.
[2024-05-24 16:16:35] [INFO ] Deduced a trap composed of 87 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:16:35] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 3 ms to minimize.
[2024-05-24 16:16:36] [INFO ] Deduced a trap composed of 47 places in 497 ms of which 6 ms to minimize.
[2024-05-24 16:16:36] [INFO ] Deduced a trap composed of 95 places in 543 ms of which 7 ms to minimize.
[2024-05-24 16:16:36] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 4 ms to minimize.
[2024-05-24 16:16:37] [INFO ] Deduced a trap composed of 85 places in 565 ms of which 7 ms to minimize.
[2024-05-24 16:16:38] [INFO ] Deduced a trap composed of 78 places in 555 ms of which 7 ms to minimize.
[2024-05-24 16:16:38] [INFO ] Deduced a trap composed of 97 places in 202 ms of which 4 ms to minimize.
[2024-05-24 16:16:38] [INFO ] Deduced a trap composed of 90 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:16:39] [INFO ] Deduced a trap composed of 72 places in 553 ms of which 7 ms to minimize.
[2024-05-24 16:16:39] [INFO ] Deduced a trap composed of 100 places in 211 ms of which 4 ms to minimize.
[2024-05-24 16:16:40] [INFO ] Deduced a trap composed of 85 places in 502 ms of which 7 ms to minimize.
[2024-05-24 16:16:40] [INFO ] Deduced a trap composed of 77 places in 551 ms of which 6 ms to minimize.
[2024-05-24 16:16:41] [INFO ] Deduced a trap composed of 94 places in 538 ms of which 7 ms to minimize.
[2024-05-24 16:16:41] [INFO ] Deduced a trap composed of 189 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:16:42] [INFO ] Deduced a trap composed of 77 places in 531 ms of which 9 ms to minimize.
[2024-05-24 16:16:42] [INFO ] Deduced a trap composed of 77 places in 499 ms of which 6 ms to minimize.
[2024-05-24 16:16:43] [INFO ] Deduced a trap composed of 76 places in 531 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 20/54 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 16:16:43] [INFO ] Deduced a trap composed of 95 places in 476 ms of which 7 ms to minimize.
[2024-05-24 16:16:44] [INFO ] Deduced a trap composed of 91 places in 556 ms of which 7 ms to minimize.
[2024-05-24 16:16:45] [INFO ] Deduced a trap composed of 88 places in 518 ms of which 8 ms to minimize.
[2024-05-24 16:16:45] [INFO ] Deduced a trap composed of 74 places in 479 ms of which 6 ms to minimize.
[2024-05-24 16:16:46] [INFO ] Deduced a trap composed of 90 places in 526 ms of which 9 ms to minimize.
[2024-05-24 16:16:46] [INFO ] Deduced a trap composed of 88 places in 493 ms of which 7 ms to minimize.
[2024-05-24 16:16:47] [INFO ] Deduced a trap composed of 100 places in 532 ms of which 7 ms to minimize.
[2024-05-24 16:16:47] [INFO ] Deduced a trap composed of 89 places in 532 ms of which 7 ms to minimize.
[2024-05-24 16:16:48] [INFO ] Deduced a trap composed of 201 places in 489 ms of which 7 ms to minimize.
[2024-05-24 16:16:48] [INFO ] Deduced a trap composed of 187 places in 471 ms of which 7 ms to minimize.
[2024-05-24 16:16:49] [INFO ] Deduced a trap composed of 201 places in 448 ms of which 6 ms to minimize.
[2024-05-24 16:16:49] [INFO ] Deduced a trap composed of 197 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:16:50] [INFO ] Deduced a trap composed of 205 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:16:50] [INFO ] Deduced a trap composed of 101 places in 504 ms of which 7 ms to minimize.
[2024-05-24 16:16:51] [INFO ] Deduced a trap composed of 207 places in 435 ms of which 5 ms to minimize.
[2024-05-24 16:16:51] [INFO ] Deduced a trap composed of 87 places in 499 ms of which 7 ms to minimize.
[2024-05-24 16:16:52] [INFO ] Deduced a trap composed of 154 places in 464 ms of which 7 ms to minimize.
[2024-05-24 16:16:52] [INFO ] Deduced a trap composed of 164 places in 446 ms of which 7 ms to minimize.
[2024-05-24 16:16:53] [INFO ] Deduced a trap composed of 176 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:16:53] [INFO ] Deduced a trap composed of 174 places in 445 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/979 variables, 20/74 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 16:16:54] [INFO ] Deduced a trap composed of 87 places in 511 ms of which 7 ms to minimize.
[2024-05-24 16:16:54] [INFO ] Deduced a trap composed of 92 places in 200 ms of which 4 ms to minimize.
[2024-05-24 16:16:54] [INFO ] Deduced a trap composed of 82 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:16:55] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 4 ms to minimize.
[2024-05-24 16:16:55] [INFO ] Deduced a trap composed of 107 places in 190 ms of which 4 ms to minimize.
[2024-05-24 16:16:55] [INFO ] Deduced a trap composed of 165 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:16:56] [INFO ] Deduced a trap composed of 187 places in 438 ms of which 6 ms to minimize.
[2024-05-24 16:16:56] [INFO ] Deduced a trap composed of 199 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:16:57] [INFO ] Deduced a trap composed of 185 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:16:57] [INFO ] Deduced a trap composed of 179 places in 463 ms of which 7 ms to minimize.
[2024-05-24 16:16:58] [INFO ] Deduced a trap composed of 193 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:16:58] [INFO ] Deduced a trap composed of 187 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:16:59] [INFO ] Deduced a trap composed of 171 places in 450 ms of which 7 ms to minimize.
[2024-05-24 16:16:59] [INFO ] Deduced a trap composed of 171 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:17:00] [INFO ] Deduced a trap composed of 190 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:17:00] [INFO ] Deduced a trap composed of 194 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:17:01] [INFO ] Deduced a trap composed of 207 places in 429 ms of which 6 ms to minimize.
[2024-05-24 16:17:01] [INFO ] Deduced a trap composed of 210 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:17:02] [INFO ] Deduced a trap composed of 194 places in 438 ms of which 7 ms to minimize.
[2024-05-24 16:17:02] [INFO ] Deduced a trap composed of 210 places in 458 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 20/94 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 16:17:02] [INFO ] Deduced a trap composed of 97 places in 190 ms of which 3 ms to minimize.
[2024-05-24 16:17:03] [INFO ] Deduced a trap composed of 93 places in 488 ms of which 6 ms to minimize.
[2024-05-24 16:17:03] [INFO ] Deduced a trap composed of 93 places in 500 ms of which 6 ms to minimize.
[2024-05-24 16:17:04] [INFO ] Deduced a trap composed of 75 places in 521 ms of which 7 ms to minimize.
[2024-05-24 16:17:05] [INFO ] Deduced a trap composed of 73 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:17:05] [INFO ] Deduced a trap composed of 99 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:17:06] [INFO ] Deduced a trap composed of 92 places in 538 ms of which 6 ms to minimize.
[2024-05-24 16:17:06] [INFO ] Deduced a trap composed of 91 places in 500 ms of which 6 ms to minimize.
[2024-05-24 16:17:07] [INFO ] Deduced a trap composed of 84 places in 510 ms of which 7 ms to minimize.
[2024-05-24 16:17:07] [INFO ] Deduced a trap composed of 192 places in 427 ms of which 6 ms to minimize.
[2024-05-24 16:17:08] [INFO ] Deduced a trap composed of 210 places in 435 ms of which 6 ms to minimize.
[2024-05-24 16:17:08] [INFO ] Deduced a trap composed of 76 places in 518 ms of which 6 ms to minimize.
[2024-05-24 16:17:09] [INFO ] Deduced a trap composed of 205 places in 431 ms of which 6 ms to minimize.
[2024-05-24 16:17:09] [INFO ] Deduced a trap composed of 206 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:17:10] [INFO ] Deduced a trap composed of 84 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:17:10] [INFO ] Deduced a trap composed of 74 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:17:11] [INFO ] Deduced a trap composed of 85 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:17:11] [INFO ] Deduced a trap composed of 90 places in 519 ms of which 6 ms to minimize.
[2024-05-24 16:17:12] [INFO ] Deduced a trap composed of 80 places in 495 ms of which 7 ms to minimize.
[2024-05-24 16:17:12] [INFO ] Deduced a trap composed of 122 places in 529 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 20/114 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 16:17:13] [INFO ] Deduced a trap composed of 91 places in 496 ms of which 6 ms to minimize.
[2024-05-24 16:17:14] [INFO ] Deduced a trap composed of 203 places in 556 ms of which 6 ms to minimize.
[2024-05-24 16:17:14] [INFO ] Deduced a trap composed of 209 places in 551 ms of which 6 ms to minimize.
[2024-05-24 16:17:15] [INFO ] Deduced a trap composed of 199 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:17:15] [INFO ] Deduced a trap composed of 91 places in 520 ms of which 7 ms to minimize.
[2024-05-24 16:17:16] [INFO ] Deduced a trap composed of 202 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:17:16] [INFO ] Deduced a trap composed of 82 places in 488 ms of which 6 ms to minimize.
[2024-05-24 16:17:16] [INFO ] Deduced a trap composed of 95 places in 191 ms of which 4 ms to minimize.
[2024-05-24 16:17:17] [INFO ] Deduced a trap composed of 89 places in 533 ms of which 7 ms to minimize.
[2024-05-24 16:17:18] [INFO ] Deduced a trap composed of 201 places in 520 ms of which 7 ms to minimize.
[2024-05-24 16:17:18] [INFO ] Deduced a trap composed of 211 places in 491 ms of which 7 ms to minimize.
[2024-05-24 16:17:19] [INFO ] Deduced a trap composed of 209 places in 481 ms of which 6 ms to minimize.
SMT process timed out in 55171ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 1012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1012/1012 places, 3141/3141 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1012 transition count 3140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1011 transition count 3140
Applied a total of 2 rules in 202 ms. Remains 1011 /1012 variables (removed 1) and now considering 3140/3141 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 1011/1012 places, 3140/3141 transitions.
RANDOM walk for 40000 steps (1289 resets) in 918 ms. (43 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (184 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (156 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (184 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (159 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (160 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 60796 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 5
Probabilistic random walk after 60796 steps, saw 25733 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 16:17:22] [INFO ] Flow matrix only has 2754 transitions (discarded 386 similar events)
// Phase 1: matrix 2754 rows 1011 cols
[2024-05-24 16:17:22] [INFO ] Computed 57 invariants in 26 ms
[2024-05-24 16:17:22] [INFO ] State equation strengthened by 1558 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 927/938 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/938 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/940 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/940 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/978 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:17:23] [INFO ] Deduced a trap composed of 5 places in 535 ms of which 7 ms to minimize.
[2024-05-24 16:17:24] [INFO ] Deduced a trap composed of 27 places in 544 ms of which 6 ms to minimize.
[2024-05-24 16:17:24] [INFO ] Deduced a trap composed of 46 places in 509 ms of which 6 ms to minimize.
[2024-05-24 16:17:25] [INFO ] Deduced a trap composed of 81 places in 560 ms of which 6 ms to minimize.
[2024-05-24 16:17:25] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 3 ms to minimize.
[2024-05-24 16:17:26] [INFO ] Deduced a trap composed of 84 places in 518 ms of which 6 ms to minimize.
[2024-05-24 16:17:26] [INFO ] Deduced a trap composed of 87 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:17:27] [INFO ] Deduced a trap composed of 79 places in 522 ms of which 7 ms to minimize.
[2024-05-24 16:17:27] [INFO ] Deduced a trap composed of 84 places in 515 ms of which 6 ms to minimize.
[2024-05-24 16:17:28] [INFO ] Deduced a trap composed of 69 places in 525 ms of which 6 ms to minimize.
[2024-05-24 16:17:28] [INFO ] Deduced a trap composed of 96 places in 202 ms of which 4 ms to minimize.
[2024-05-24 16:17:28] [INFO ] Deduced a trap composed of 94 places in 187 ms of which 3 ms to minimize.
[2024-05-24 16:17:29] [INFO ] Deduced a trap composed of 104 places in 201 ms of which 3 ms to minimize.
[2024-05-24 16:17:29] [INFO ] Deduced a trap composed of 106 places in 529 ms of which 8 ms to minimize.
[2024-05-24 16:17:30] [INFO ] Deduced a trap composed of 93 places in 546 ms of which 7 ms to minimize.
[2024-05-24 16:17:30] [INFO ] Deduced a trap composed of 88 places in 560 ms of which 6 ms to minimize.
[2024-05-24 16:17:31] [INFO ] Deduced a trap composed of 105 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:17:31] [INFO ] Deduced a trap composed of 98 places in 519 ms of which 7 ms to minimize.
[2024-05-24 16:17:32] [INFO ] Deduced a trap composed of 88 places in 519 ms of which 6 ms to minimize.
[2024-05-24 16:17:32] [INFO ] Deduced a trap composed of 92 places in 515 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:17:33] [INFO ] Deduced a trap composed of 69 places in 550 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 24/1002 variables, 24/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1002 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 9/1011 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2754/3765 variables, 1011/1089 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3765 variables, 1558/2647 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:17:35] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/3765 variables, 1/2648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3765 variables, 0/2648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:17:36] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 4 ms to minimize.
[2024-05-24 16:17:37] [INFO ] Deduced a trap composed of 84 places in 211 ms of which 3 ms to minimize.
[2024-05-24 16:17:37] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 4 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/3765 variables, 3/2651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3765 variables, 0/2651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/3765 variables, 0/2651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3765/3765 variables, and 2651 constraints, problems are : Problem set: 0 solved, 5 unsolved in 17171 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1558/1558 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 927/938 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/938 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/940 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/940 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/978 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:17:40] [INFO ] Deduced a trap composed of 94 places in 557 ms of which 6 ms to minimize.
[2024-05-24 16:17:41] [INFO ] Deduced a trap composed of 83 places in 550 ms of which 7 ms to minimize.
[2024-05-24 16:17:41] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 3 ms to minimize.
[2024-05-24 16:17:42] [INFO ] Deduced a trap composed of 83 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:17:42] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 4 ms to minimize.
[2024-05-24 16:17:43] [INFO ] Deduced a trap composed of 87 places in 550 ms of which 7 ms to minimize.
[2024-05-24 16:17:43] [INFO ] Deduced a trap composed of 89 places in 505 ms of which 7 ms to minimize.
[2024-05-24 16:17:44] [INFO ] Deduced a trap composed of 91 places in 539 ms of which 7 ms to minimize.
[2024-05-24 16:17:44] [INFO ] Deduced a trap composed of 91 places in 193 ms of which 4 ms to minimize.
[2024-05-24 16:17:44] [INFO ] Deduced a trap composed of 94 places in 206 ms of which 4 ms to minimize.
[2024-05-24 16:17:45] [INFO ] Deduced a trap composed of 76 places in 497 ms of which 6 ms to minimize.
[2024-05-24 16:17:45] [INFO ] Deduced a trap composed of 96 places in 206 ms of which 4 ms to minimize.
[2024-05-24 16:17:45] [INFO ] Deduced a trap composed of 91 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:17:46] [INFO ] Deduced a trap composed of 92 places in 492 ms of which 6 ms to minimize.
[2024-05-24 16:17:46] [INFO ] Deduced a trap composed of 104 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:17:47] [INFO ] Deduced a trap composed of 93 places in 498 ms of which 6 ms to minimize.
[2024-05-24 16:17:47] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 4 ms to minimize.
[2024-05-24 16:17:48] [INFO ] Deduced a trap composed of 83 places in 542 ms of which 6 ms to minimize.
[2024-05-24 16:17:48] [INFO ] Deduced a trap composed of 74 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:17:48] [INFO ] Deduced a trap composed of 99 places in 191 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:17:49] [INFO ] Deduced a trap composed of 88 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:17:50] [INFO ] Deduced a trap composed of 78 places in 518 ms of which 7 ms to minimize.
[2024-05-24 16:17:50] [INFO ] Deduced a trap composed of 144 places in 480 ms of which 7 ms to minimize.
[2024-05-24 16:17:51] [INFO ] Deduced a trap composed of 151 places in 483 ms of which 6 ms to minimize.
[2024-05-24 16:17:51] [INFO ] Deduced a trap composed of 142 places in 466 ms of which 7 ms to minimize.
[2024-05-24 16:17:52] [INFO ] Deduced a trap composed of 147 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:17:52] [INFO ] Deduced a trap composed of 152 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:17:53] [INFO ] Deduced a trap composed of 171 places in 448 ms of which 6 ms to minimize.
[2024-05-24 16:17:53] [INFO ] Deduced a trap composed of 165 places in 455 ms of which 6 ms to minimize.
[2024-05-24 16:17:54] [INFO ] Deduced a trap composed of 163 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:17:54] [INFO ] Deduced a trap composed of 168 places in 411 ms of which 6 ms to minimize.
[2024-05-24 16:17:54] [INFO ] Deduced a trap composed of 176 places in 447 ms of which 6 ms to minimize.
[2024-05-24 16:17:55] [INFO ] Deduced a trap composed of 164 places in 400 ms of which 5 ms to minimize.
[2024-05-24 16:17:55] [INFO ] Deduced a trap composed of 167 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:17:56] [INFO ] Deduced a trap composed of 168 places in 404 ms of which 6 ms to minimize.
[2024-05-24 16:17:56] [INFO ] Deduced a trap composed of 160 places in 418 ms of which 6 ms to minimize.
[2024-05-24 16:17:57] [INFO ] Deduced a trap composed of 173 places in 407 ms of which 6 ms to minimize.
[2024-05-24 16:17:57] [INFO ] Deduced a trap composed of 180 places in 405 ms of which 5 ms to minimize.
[2024-05-24 16:17:57] [INFO ] Deduced a trap composed of 179 places in 412 ms of which 6 ms to minimize.
[2024-05-24 16:17:58] [INFO ] Deduced a trap composed of 184 places in 406 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:17:58] [INFO ] Deduced a trap composed of 94 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:17:59] [INFO ] Deduced a trap composed of 84 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:17:59] [INFO ] Deduced a trap composed of 78 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:18:00] [INFO ] Deduced a trap composed of 95 places in 467 ms of which 6 ms to minimize.
[2024-05-24 16:18:00] [INFO ] Deduced a trap composed of 80 places in 470 ms of which 5 ms to minimize.
[2024-05-24 16:18:01] [INFO ] Deduced a trap composed of 178 places in 460 ms of which 6 ms to minimize.
[2024-05-24 16:18:01] [INFO ] Deduced a trap composed of 185 places in 485 ms of which 6 ms to minimize.
[2024-05-24 16:18:02] [INFO ] Deduced a trap composed of 86 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:18:02] [INFO ] Deduced a trap composed of 108 places in 512 ms of which 6 ms to minimize.
[2024-05-24 16:18:03] [INFO ] Deduced a trap composed of 135 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:18:03] [INFO ] Deduced a trap composed of 76 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:18:04] [INFO ] Deduced a trap composed of 90 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:18:04] [INFO ] Deduced a trap composed of 164 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:18:05] [INFO ] Deduced a trap composed of 78 places in 468 ms of which 5 ms to minimize.
[2024-05-24 16:18:05] [INFO ] Deduced a trap composed of 82 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:18:06] [INFO ] Deduced a trap composed of 118 places in 474 ms of which 5 ms to minimize.
[2024-05-24 16:18:06] [INFO ] Deduced a trap composed of 99 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:18:07] [INFO ] Deduced a trap composed of 115 places in 493 ms of which 7 ms to minimize.
[2024-05-24 16:18:07] [INFO ] Deduced a trap composed of 92 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:18:08] [INFO ] Deduced a trap composed of 100 places in 475 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:18:08] [INFO ] Deduced a trap composed of 93 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:18:09] [INFO ] Deduced a trap composed of 186 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:18:09] [INFO ] Deduced a trap composed of 83 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:18:10] [INFO ] Deduced a trap composed of 80 places in 455 ms of which 6 ms to minimize.
[2024-05-24 16:18:10] [INFO ] Deduced a trap composed of 81 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:18:11] [INFO ] Deduced a trap composed of 78 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:18:11] [INFO ] Deduced a trap composed of 88 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:18:12] [INFO ] Deduced a trap composed of 189 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:18:12] [INFO ] Deduced a trap composed of 184 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:18:13] [INFO ] Deduced a trap composed of 208 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:18:13] [INFO ] Deduced a trap composed of 205 places in 513 ms of which 7 ms to minimize.
[2024-05-24 16:18:14] [INFO ] Deduced a trap composed of 209 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:18:14] [INFO ] Deduced a trap composed of 179 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:18:15] [INFO ] Deduced a trap composed of 182 places in 411 ms of which 6 ms to minimize.
[2024-05-24 16:18:15] [INFO ] Deduced a trap composed of 194 places in 408 ms of which 6 ms to minimize.
[2024-05-24 16:18:16] [INFO ] Deduced a trap composed of 200 places in 403 ms of which 6 ms to minimize.
[2024-05-24 16:18:16] [INFO ] Deduced a trap composed of 203 places in 429 ms of which 6 ms to minimize.
[2024-05-24 16:18:16] [INFO ] Deduced a trap composed of 213 places in 413 ms of which 5 ms to minimize.
[2024-05-24 16:18:17] [INFO ] Deduced a trap composed of 222 places in 425 ms of which 6 ms to minimize.
[2024-05-24 16:18:17] [INFO ] Deduced a trap composed of 219 places in 436 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/978 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:18:18] [INFO ] Deduced a trap composed of 167 places in 443 ms of which 6 ms to minimize.
[2024-05-24 16:18:18] [INFO ] Deduced a trap composed of 166 places in 434 ms of which 6 ms to minimize.
[2024-05-24 16:18:19] [INFO ] Deduced a trap composed of 187 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:18:19] [INFO ] Deduced a trap composed of 184 places in 420 ms of which 6 ms to minimize.
[2024-05-24 16:18:20] [INFO ] Deduced a trap composed of 171 places in 413 ms of which 6 ms to minimize.
[2024-05-24 16:18:20] [INFO ] Deduced a trap composed of 183 places in 414 ms of which 6 ms to minimize.
[2024-05-24 16:18:21] [INFO ] Deduced a trap composed of 198 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:18:21] [INFO ] Deduced a trap composed of 199 places in 409 ms of which 6 ms to minimize.
[2024-05-24 16:18:21] [INFO ] Deduced a trap composed of 202 places in 409 ms of which 6 ms to minimize.
[2024-05-24 16:18:22] [INFO ] Deduced a trap composed of 162 places in 421 ms of which 6 ms to minimize.
[2024-05-24 16:18:22] [INFO ] Deduced a trap composed of 161 places in 421 ms of which 6 ms to minimize.
[2024-05-24 16:18:23] [INFO ] Deduced a trap composed of 162 places in 427 ms of which 6 ms to minimize.
[2024-05-24 16:18:23] [INFO ] Deduced a trap composed of 185 places in 417 ms of which 6 ms to minimize.
[2024-05-24 16:18:24] [INFO ] Deduced a trap composed of 183 places in 427 ms of which 6 ms to minimize.
[2024-05-24 16:18:24] [INFO ] Deduced a trap composed of 188 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:18:25] [INFO ] Deduced a trap composed of 181 places in 419 ms of which 6 ms to minimize.
[2024-05-24 16:18:25] [INFO ] Deduced a trap composed of 197 places in 415 ms of which 6 ms to minimize.
[2024-05-24 16:18:25] [INFO ] Deduced a trap composed of 188 places in 411 ms of which 6 ms to minimize.
[2024-05-24 16:18:26] [INFO ] Deduced a trap composed of 197 places in 427 ms of which 6 ms to minimize.
[2024-05-24 16:18:26] [INFO ] Deduced a trap composed of 215 places in 413 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:18:27] [INFO ] Deduced a trap composed of 93 places in 494 ms of which 6 ms to minimize.
[2024-05-24 16:18:27] [INFO ] Deduced a trap composed of 91 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:18:28] [INFO ] Deduced a trap composed of 91 places in 491 ms of which 6 ms to minimize.
[2024-05-24 16:18:28] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 3 ms to minimize.
[2024-05-24 16:18:28] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 3 ms to minimize.
[2024-05-24 16:18:29] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 3 ms to minimize.
[2024-05-24 16:18:29] [INFO ] Deduced a trap composed of 77 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:18:30] [INFO ] Deduced a trap composed of 91 places in 475 ms of which 5 ms to minimize.
[2024-05-24 16:18:30] [INFO ] Deduced a trap composed of 96 places in 186 ms of which 3 ms to minimize.
[2024-05-24 16:18:30] [INFO ] Deduced a trap composed of 82 places in 527 ms of which 7 ms to minimize.
[2024-05-24 16:18:31] [INFO ] Deduced a trap composed of 94 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:18:31] [INFO ] Deduced a trap composed of 90 places in 514 ms of which 7 ms to minimize.
[2024-05-24 16:18:32] [INFO ] Deduced a trap composed of 186 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:18:32] [INFO ] Deduced a trap composed of 189 places in 405 ms of which 6 ms to minimize.
[2024-05-24 16:18:33] [INFO ] Deduced a trap composed of 182 places in 480 ms of which 7 ms to minimize.
[2024-05-24 16:18:33] [INFO ] Deduced a trap composed of 77 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:18:34] [INFO ] Deduced a trap composed of 172 places in 431 ms of which 6 ms to minimize.
[2024-05-24 16:18:34] [INFO ] Deduced a trap composed of 183 places in 412 ms of which 6 ms to minimize.
[2024-05-24 16:18:35] [INFO ] Deduced a trap composed of 195 places in 504 ms of which 6 ms to minimize.
[2024-05-24 16:18:35] [INFO ] Deduced a trap composed of 99 places in 500 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/978 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:18:36] [INFO ] Deduced a trap composed of 81 places in 494 ms of which 6 ms to minimize.
[2024-05-24 16:18:36] [INFO ] Deduced a trap composed of 77 places in 494 ms of which 7 ms to minimize.
[2024-05-24 16:18:37] [INFO ] Deduced a trap composed of 76 places in 480 ms of which 5 ms to minimize.
[2024-05-24 16:18:37] [INFO ] Deduced a trap composed of 211 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:18:38] [INFO ] Deduced a trap composed of 217 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:18:38] [INFO ] Deduced a trap composed of 88 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:18:39] [INFO ] Deduced a trap composed of 83 places in 502 ms of which 6 ms to minimize.
[2024-05-24 16:18:39] [INFO ] Deduced a trap composed of 91 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:18:40] [INFO ] Deduced a trap composed of 247 places in 511 ms of which 7 ms to minimize.
[2024-05-24 16:18:40] [INFO ] Deduced a trap composed of 99 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:18:41] [INFO ] Deduced a trap composed of 88 places in 468 ms of which 6 ms to minimize.
[2024-05-24 16:18:41] [INFO ] Deduced a trap composed of 89 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:18:42] [INFO ] Deduced a trap composed of 250 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:18:42] [INFO ] Deduced a trap composed of 76 places in 470 ms of which 5 ms to minimize.
[2024-05-24 16:18:43] [INFO ] Deduced a trap composed of 89 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:18:43] [INFO ] Deduced a trap composed of 193 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:18:44] [INFO ] Deduced a trap composed of 95 places in 461 ms of which 5 ms to minimize.
[2024-05-24 16:18:44] [INFO ] Deduced a trap composed of 83 places in 467 ms of which 6 ms to minimize.
[2024-05-24 16:18:45] [INFO ] Deduced a trap composed of 200 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:18:45] [INFO ] Deduced a trap composed of 90 places in 467 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/978 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:18:46] [INFO ] Deduced a trap composed of 202 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:18:46] [INFO ] Deduced a trap composed of 205 places in 467 ms of which 5 ms to minimize.
[2024-05-24 16:18:47] [INFO ] Deduced a trap composed of 177 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:18:47] [INFO ] Deduced a trap composed of 79 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:18:48] [INFO ] Deduced a trap composed of 186 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:18:48] [INFO ] Deduced a trap composed of 187 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:18:49] [INFO ] Deduced a trap composed of 184 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:18:49] [INFO ] Deduced a trap composed of 193 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:18:50] [INFO ] Deduced a trap composed of 185 places in 452 ms of which 5 ms to minimize.
[2024-05-24 16:18:50] [INFO ] Deduced a trap composed of 100 places in 460 ms of which 5 ms to minimize.
[2024-05-24 16:18:51] [INFO ] Deduced a trap composed of 191 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:18:51] [INFO ] Deduced a trap composed of 77 places in 467 ms of which 5 ms to minimize.
[2024-05-24 16:18:52] [INFO ] Deduced a trap composed of 188 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:18:52] [INFO ] Deduced a trap composed of 209 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:18:53] [INFO ] Deduced a trap composed of 182 places in 419 ms of which 6 ms to minimize.
[2024-05-24 16:18:53] [INFO ] Deduced a trap composed of 181 places in 398 ms of which 5 ms to minimize.
[2024-05-24 16:18:54] [INFO ] Deduced a trap composed of 186 places in 396 ms of which 6 ms to minimize.
[2024-05-24 16:18:54] [INFO ] Deduced a trap composed of 203 places in 405 ms of which 6 ms to minimize.
[2024-05-24 16:18:54] [INFO ] Deduced a trap composed of 201 places in 403 ms of which 5 ms to minimize.
[2024-05-24 16:18:55] [INFO ] Deduced a trap composed of 202 places in 391 ms of which 6 ms to minimize.
SMT process timed out in 92643ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 3140/3140 transitions.
Applied a total of 0 rules in 81 ms. Remains 1011 /1011 variables (removed 0) and now considering 3140/3140 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1011/1011 places, 3140/3140 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 3140/3140 transitions.
Applied a total of 0 rules in 80 ms. Remains 1011 /1011 variables (removed 0) and now considering 3140/3140 (removed 0) transitions.
[2024-05-24 16:18:55] [INFO ] Flow matrix only has 2754 transitions (discarded 386 similar events)
[2024-05-24 16:18:55] [INFO ] Invariant cache hit.
[2024-05-24 16:18:56] [INFO ] Implicit Places using invariants in 1100 ms returned [201, 237, 284, 307, 369, 462, 471, 472, 510, 532, 533, 682, 853]
[2024-05-24 16:18:56] [INFO ] Actually due to overlaps returned [307, 201, 237, 284, 369, 462, 471, 472, 532, 533, 682, 853]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1104 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 999/1011 places, 3140/3140 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 991 transition count 3132
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 991 transition count 3132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 983 transition count 3124
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 983 transition count 3124
Applied a total of 32 rules in 145 ms. Remains 983 /999 variables (removed 16) and now considering 3124/3140 (removed 16) transitions.
[2024-05-24 16:18:56] [INFO ] Flow matrix only has 2738 transitions (discarded 386 similar events)
// Phase 1: matrix 2738 rows 983 cols
[2024-05-24 16:18:56] [INFO ] Computed 45 invariants in 53 ms
[2024-05-24 16:18:57] [INFO ] Implicit Places using invariants in 957 ms returned [497]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 962 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 982/1011 places, 3124/3140 transitions.
Applied a total of 0 rules in 77 ms. Remains 982 /982 variables (removed 0) and now considering 3124/3124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2369 ms. Remains : 982/1011 places, 3124/3140 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 396 stabilizing places and 1108 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' '!(F(G(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1213 transition count 2708
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1195 transition count 2708
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 83 place count 1178 transition count 2663
Iterating global reduction 2 with 17 rules applied. Total rules applied 100 place count 1178 transition count 2663
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 100 place count 1178 transition count 2659
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 1174 transition count 2659
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 117 place count 1165 transition count 2614
Iterating global reduction 2 with 9 rules applied. Total rules applied 126 place count 1165 transition count 2614
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 174 place count 1141 transition count 2590
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1138 transition count 2587
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1138 transition count 2587
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 1135 transition count 2572
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 1135 transition count 2572
Applied a total of 186 rules in 459 ms. Remains 1135 /1228 variables (removed 93) and now considering 2572/2741 (removed 169) transitions.
[2024-05-24 16:18:58] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1135 cols
[2024-05-24 16:18:58] [INFO ] Computed 57 invariants in 23 ms
[2024-05-24 16:18:59] [INFO ] Implicit Places using invariants in 1016 ms returned [222, 264, 348, 418, 527, 537, 538, 577, 600, 601, 773, 774, 964]
[2024-05-24 16:18:59] [INFO ] Actually due to overlaps returned [348, 222, 264, 418, 527, 537, 538, 600, 601, 773, 774, 964]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1123/1228 places, 2572/2741 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1115 transition count 2564
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1115 transition count 2564
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1107 transition count 2556
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1107 transition count 2556
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1103 transition count 2536
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1103 transition count 2536
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 1100 transition count 2533
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1097 transition count 2530
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1097 transition count 2530
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1093 transition count 2510
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1093 transition count 2510
Applied a total of 60 rules in 374 ms. Remains 1093 /1123 variables (removed 30) and now considering 2510/2572 (removed 62) transitions.
[2024-05-24 16:18:59] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1093 cols
[2024-05-24 16:19:00] [INFO ] Computed 45 invariants in 29 ms
[2024-05-24 16:19:00] [INFO ] Implicit Places using invariants in 954 ms returned [559]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 955 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1228 places, 2510/2741 transitions.
Applied a total of 0 rules in 73 ms. Remains 1092 /1092 variables (removed 0) and now considering 2510/2510 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2880 ms. Remains : 1092/1228 places, 2510/2741 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00
Product exploration explored 100000 steps with 2722 reset in 614 ms.
Product exploration explored 100000 steps with 2726 reset in 548 ms.
Computed a total of 277 stabilizing places and 894 stable transitions
Computed a total of 277 stabilizing places and 894 stable transitions
Detected a total of 277/1092 stabilizing places and 894/2510 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1087 resets) in 397 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39276 steps (215 resets) in 199 ms. (196 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 1092 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1092/1092 places, 2510/2510 transitions.
Applied a total of 0 rules in 80 ms. Remains 1092 /1092 variables (removed 0) and now considering 2510/2510 (removed 0) transitions.
[2024-05-24 16:19:03] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2024-05-24 16:19:03] [INFO ] Computed 44 invariants in 19 ms
[2024-05-24 16:19:03] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-24 16:19:04] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2024-05-24 16:19:04] [INFO ] Invariant cache hit.
[2024-05-24 16:19:04] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-24 16:19:13] [INFO ] Implicit Places using invariants and state equation in 9682 ms returned [1071]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10649 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1092 places, 2510/2510 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2509
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2509
Applied a total of 2 rules in 87 ms. Remains 1090 /1091 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2024-05-24 16:19:13] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2024-05-24 16:19:13] [INFO ] Computed 43 invariants in 26 ms
[2024-05-24 16:19:14] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-05-24 16:19:14] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-24 16:19:14] [INFO ] Invariant cache hit.
[2024-05-24 16:19:15] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-24 16:19:25] [INFO ] Implicit Places using invariants and state equation in 10531 ms returned []
Implicit Place search using SMT with State Equation took 11529 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1090/1092 places, 2509/2510 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22346 ms. Remains : 1090/1092 places, 2509/2510 transitions.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 stable transitions
Detected a total of 275/1090 stabilizing places and 893/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 36172 steps (983 resets) in 365 ms. (98 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2728 reset in 517 ms.
Product exploration explored 100000 steps with 2726 reset in 522 ms.
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Applied a total of 0 rules in 73 ms. Remains 1090 /1090 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-24 16:19:26] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-24 16:19:26] [INFO ] Invariant cache hit.
[2024-05-24 16:19:27] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-24 16:19:27] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-24 16:19:27] [INFO ] Invariant cache hit.
[2024-05-24 16:19:28] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-24 16:19:37] [INFO ] Implicit Places using invariants and state equation in 10050 ms returned []
Implicit Place search using SMT with State Equation took 11004 ms to find 0 implicit places.
[2024-05-24 16:19:38] [INFO ] Redundant transitions in 124 ms returned []
Running 2492 sub problems to find dead transitions.
[2024-05-24 16:19:38] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-24 16:19:38] [INFO ] Invariant cache hit.
[2024-05-24 16:19:38] [INFO ] State equation strengthened by 834 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/1088 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2492 unsolved
SMT process timed out in 33051ms, After SMT, problems are : Problem set: 0 solved, 2492 unsolved
Search for dead transitions found 0 dead transitions in 33080ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44299 ms. Remains : 1090/1090 places, 2509/2509 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00 finished in 73298 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 3 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 30 place count 1213 transition count 2707
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 68 place count 1194 transition count 2707
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 86 place count 1176 transition count 2661
Iterating global reduction 2 with 18 rules applied. Total rules applied 104 place count 1176 transition count 2661
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 104 place count 1176 transition count 2656
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 1171 transition count 2656
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 124 place count 1161 transition count 2606
Iterating global reduction 2 with 10 rules applied. Total rules applied 134 place count 1161 transition count 2606
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 178 place count 1139 transition count 2584
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 181 place count 1136 transition count 2581
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 1136 transition count 2581
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 187 place count 1133 transition count 2566
Iterating global reduction 2 with 3 rules applied. Total rules applied 190 place count 1133 transition count 2566
Applied a total of 190 rules in 376 ms. Remains 1133 /1228 variables (removed 95) and now considering 2566/2741 (removed 175) transitions.
[2024-05-24 16:20:11] [INFO ] Flow matrix only has 2294 transitions (discarded 272 similar events)
// Phase 1: matrix 2294 rows 1133 cols
[2024-05-24 16:20:11] [INFO ] Computed 57 invariants in 50 ms
[2024-05-24 16:20:12] [INFO ] Implicit Places using invariants in 1034 ms returned [221, 263, 317, 344, 414, 523, 533, 534, 573, 596, 597, 769, 770, 961]
[2024-05-24 16:20:12] [INFO ] Actually due to overlaps returned [344, 221, 263, 317, 414, 523, 533, 534, 596, 597, 769, 770, 961]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1036 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1120/1228 places, 2566/2741 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1111 transition count 2557
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1111 transition count 2557
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1102 transition count 2548
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1102 transition count 2548
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1097 transition count 2523
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1097 transition count 2523
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1094 transition count 2520
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1091 transition count 2517
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1091 transition count 2517
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1087 transition count 2497
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1087 transition count 2497
Applied a total of 66 rules in 394 ms. Remains 1087 /1120 variables (removed 33) and now considering 2497/2566 (removed 69) transitions.
[2024-05-24 16:20:13] [INFO ] Flow matrix only has 2225 transitions (discarded 272 similar events)
// Phase 1: matrix 2225 rows 1087 cols
[2024-05-24 16:20:13] [INFO ] Computed 44 invariants in 28 ms
[2024-05-24 16:20:14] [INFO ] Implicit Places using invariants in 967 ms returned [552]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 970 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1086/1228 places, 2497/2741 transitions.
Applied a total of 0 rules in 79 ms. Remains 1086 /1086 variables (removed 0) and now considering 2497/2497 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2857 ms. Remains : 1086/1228 places, 2497/2741 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01 finished in 3027 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||G(p1)))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1213 transition count 2708
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1195 transition count 2708
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 83 place count 1178 transition count 2663
Iterating global reduction 2 with 17 rules applied. Total rules applied 100 place count 1178 transition count 2663
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 100 place count 1178 transition count 2658
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 1173 transition count 2658
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 119 place count 1164 transition count 2613
Iterating global reduction 2 with 9 rules applied. Total rules applied 128 place count 1164 transition count 2613
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 174 place count 1141 transition count 2590
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1138 transition count 2587
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1138 transition count 2587
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 1135 transition count 2572
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 1135 transition count 2572
Applied a total of 186 rules in 371 ms. Remains 1135 /1228 variables (removed 93) and now considering 2572/2741 (removed 169) transitions.
[2024-05-24 16:20:14] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1135 cols
[2024-05-24 16:20:14] [INFO ] Computed 57 invariants in 34 ms
[2024-05-24 16:20:15] [INFO ] Implicit Places using invariants in 1038 ms returned [221, 263, 317, 344, 414, 523, 533, 534, 573, 597, 772, 773, 963]
[2024-05-24 16:20:15] [INFO ] Actually due to overlaps returned [344, 221, 263, 317, 414, 523, 533, 534, 597, 772, 773, 963]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1040 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1123/1228 places, 2572/2741 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1115 transition count 2564
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1115 transition count 2564
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1107 transition count 2556
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1107 transition count 2556
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 1102 transition count 2531
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 1102 transition count 2531
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1099 transition count 2528
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 1096 transition count 2525
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 1096 transition count 2525
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1093 transition count 2510
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1093 transition count 2510
Applied a total of 60 rules in 369 ms. Remains 1093 /1123 variables (removed 30) and now considering 2510/2572 (removed 62) transitions.
[2024-05-24 16:20:16] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1093 cols
[2024-05-24 16:20:16] [INFO ] Computed 45 invariants in 20 ms
[2024-05-24 16:20:17] [INFO ] Implicit Places using invariants in 961 ms returned [552]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 963 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1228 places, 2510/2741 transitions.
Applied a total of 0 rules in 72 ms. Remains 1092 /1092 variables (removed 0) and now considering 2510/2510 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2819 ms. Remains : 1092/1228 places, 2510/2741 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 finished in 2954 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(G(p0))||G(p1))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1209 transition count 2698
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1209 transition count 2698
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1197 transition count 2650
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1197 transition count 2650
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1194 transition count 2635
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1194 transition count 2635
Applied a total of 68 rules in 195 ms. Remains 1194 /1228 variables (removed 34) and now considering 2635/2741 (removed 106) transitions.
[2024-05-24 16:20:17] [INFO ] Flow matrix only has 2363 transitions (discarded 272 similar events)
// Phase 1: matrix 2363 rows 1194 cols
[2024-05-24 16:20:17] [INFO ] Computed 57 invariants in 26 ms
[2024-05-24 16:20:18] [INFO ] Implicit Places using invariants in 1070 ms returned [243, 287, 341, 370, 442, 556, 566, 613, 637, 638, 816, 817, 1011]
[2024-05-24 16:20:18] [INFO ] Actually due to overlaps returned [370, 243, 287, 341, 442, 556, 566, 637, 638, 816, 817, 1011]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1073 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1182/1228 places, 2635/2741 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1171 transition count 2624
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1171 transition count 2624
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1160 transition count 2613
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1160 transition count 2613
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1149 transition count 2602
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1149 transition count 2602
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1141 transition count 2562
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1141 transition count 2562
Applied a total of 82 rules in 243 ms. Remains 1141 /1182 variables (removed 41) and now considering 2562/2635 (removed 73) transitions.
[2024-05-24 16:20:18] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1141 cols
[2024-05-24 16:20:18] [INFO ] Computed 45 invariants in 46 ms
[2024-05-24 16:20:19] [INFO ] Implicit Places using invariants in 988 ms returned [589]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 990 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1140/1228 places, 2562/2741 transitions.
Applied a total of 0 rules in 44 ms. Remains 1140 /1140 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2548 ms. Remains : 1140/1228 places, 2562/2741 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03
Product exploration explored 100000 steps with 1918 reset in 449 ms.
Product exploration explored 100000 steps with 1923 reset in 447 ms.
Computed a total of 308 stabilizing places and 929 stable transitions
Computed a total of 308 stabilizing places and 929 stable transitions
Detected a total of 308/1140 stabilizing places and 929/2562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (768 resets) in 338 ms. (117 steps per ms) remains 1/2 properties
BEST_FIRST walk for 34721 steps (173 resets) in 99 ms. (347 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1140 transition count 2543
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1121 transition count 2543
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 38 place count 1121 transition count 2533
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 58 place count 1111 transition count 2533
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 94 place count 1093 transition count 2515
Applied a total of 94 rules in 151 ms. Remains 1093 /1140 variables (removed 47) and now considering 2515/2562 (removed 47) transitions.
[2024-05-24 16:20:21] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2024-05-24 16:20:21] [INFO ] Computed 44 invariants in 22 ms
[2024-05-24 16:20:22] [INFO ] Implicit Places using invariants in 976 ms returned []
[2024-05-24 16:20:22] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-24 16:20:22] [INFO ] Invariant cache hit.
[2024-05-24 16:20:23] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 16:20:33] [INFO ] Implicit Places using invariants and state equation in 10910 ms returned [1075]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11889 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1092/1140 places, 2515/2562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1092 transition count 2514
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1091 transition count 2514
Applied a total of 2 rules in 88 ms. Remains 1091 /1092 variables (removed 1) and now considering 2514/2515 (removed 1) transitions.
[2024-05-24 16:20:33] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
// Phase 1: matrix 2242 rows 1091 cols
[2024-05-24 16:20:33] [INFO ] Computed 43 invariants in 28 ms
[2024-05-24 16:20:34] [INFO ] Implicit Places using invariants in 963 ms returned []
[2024-05-24 16:20:34] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 16:20:34] [INFO ] Invariant cache hit.
[2024-05-24 16:20:35] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 16:20:45] [INFO ] Implicit Places using invariants and state equation in 10927 ms returned []
Implicit Place search using SMT with State Equation took 11893 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1140 places, 2514/2562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24024 ms. Remains : 1091/1140 places, 2514/2562 transitions.
Computed a total of 276 stabilizing places and 898 stable transitions
Computed a total of 276 stabilizing places and 898 stable transitions
Detected a total of 276/1091 stabilizing places and 898/2514 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 121 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 35456 steps (964 resets) in 300 ms. (117 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 2724 reset in 496 ms.
Product exploration explored 100000 steps with 2726 reset in 516 ms.
Support contains 4 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2514/2514 transitions.
Applied a total of 0 rules in 73 ms. Remains 1091 /1091 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2024-05-24 16:20:47] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 16:20:47] [INFO ] Invariant cache hit.
[2024-05-24 16:20:48] [INFO ] Implicit Places using invariants in 923 ms returned []
[2024-05-24 16:20:48] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 16:20:48] [INFO ] Invariant cache hit.
[2024-05-24 16:20:49] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 16:20:59] [INFO ] Implicit Places using invariants and state equation in 10901 ms returned []
Implicit Place search using SMT with State Equation took 11826 ms to find 0 implicit places.
[2024-05-24 16:20:59] [INFO ] Redundant transitions in 115 ms returned []
Running 2497 sub problems to find dead transitions.
[2024-05-24 16:20:59] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 16:20:59] [INFO ] Invariant cache hit.
[2024-05-24 16:20:59] [INFO ] State equation strengthened by 838 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2497 unsolved
SMT process timed out in 32992ms, After SMT, problems are : Problem set: 0 solved, 2497 unsolved
Search for dead transitions found 0 dead transitions in 33019ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45050 ms. Remains : 1091/1091 places, 2514/2514 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 finished in 75394 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) U X(X(X((G(p1) U !p2))))))'
Support contains 6 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1209 transition count 2698
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1209 transition count 2698
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1197 transition count 2650
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1197 transition count 2650
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1194 transition count 2635
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1194 transition count 2635
Applied a total of 68 rules in 193 ms. Remains 1194 /1228 variables (removed 34) and now considering 2635/2741 (removed 106) transitions.
[2024-05-24 16:21:32] [INFO ] Flow matrix only has 2363 transitions (discarded 272 similar events)
// Phase 1: matrix 2363 rows 1194 cols
[2024-05-24 16:21:33] [INFO ] Computed 57 invariants in 34 ms
[2024-05-24 16:21:34] [INFO ] Implicit Places using invariants in 1087 ms returned [243, 287, 341, 370, 442, 567, 568, 612, 636, 637, 815, 816, 1011]
[2024-05-24 16:21:34] [INFO ] Actually due to overlaps returned [370, 243, 287, 341, 442, 567, 568, 636, 637, 815, 816, 1011]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1089 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1182/1228 places, 2635/2741 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1171 transition count 2624
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1171 transition count 2624
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1160 transition count 2613
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1160 transition count 2613
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1149 transition count 2602
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1149 transition count 2602
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1141 transition count 2562
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1141 transition count 2562
Applied a total of 82 rules in 246 ms. Remains 1141 /1182 variables (removed 41) and now considering 2562/2635 (removed 73) transitions.
[2024-05-24 16:21:34] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1141 cols
[2024-05-24 16:21:34] [INFO ] Computed 45 invariants in 27 ms
[2024-05-24 16:21:35] [INFO ] Implicit Places using invariants in 1017 ms returned [588]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1019 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1140/1228 places, 2562/2741 transitions.
Applied a total of 0 rules in 93 ms. Remains 1140 /1140 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2641 ms. Remains : 1140/1228 places, 2562/2741 transitions.
Stuttering acceptance computed with spot in 497 ms :[p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 823 ms.
Product exploration explored 100000 steps with 25000 reset in 825 ms.
Computed a total of 308 stabilizing places and 929 stable transitions
Computed a total of 308 stabilizing places and 929 stable transitions
Detected a total of 308/1140 stabilizing places and 929/2562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 12 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[p2, p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (767 resets) in 369 ms. (108 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (200 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (200 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (200 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (200 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
[2024-05-24 16:21:38] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2024-05-24 16:21:38] [INFO ] Computed 44 invariants in 30 ms
[2024-05-24 16:21:38] [INFO ] State equation strengthened by 838 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 1051/1057 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1057 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/1105 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 16:21:39] [INFO ] Deduced a trap composed of 90 places in 494 ms of which 7 ms to minimize.
[2024-05-24 16:21:39] [INFO ] Deduced a trap composed of 88 places in 503 ms of which 7 ms to minimize.
[2024-05-24 16:21:40] [INFO ] Deduced a trap composed of 91 places in 506 ms of which 7 ms to minimize.
[2024-05-24 16:21:40] [INFO ] Deduced a trap composed of 98 places in 503 ms of which 7 ms to minimize.
[2024-05-24 16:21:41] [INFO ] Deduced a trap composed of 50 places in 478 ms of which 8 ms to minimize.
[2024-05-24 16:21:41] [INFO ] Deduced a trap composed of 98 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:21:42] [INFO ] Deduced a trap composed of 228 places in 530 ms of which 8 ms to minimize.
[2024-05-24 16:21:43] [INFO ] Deduced a trap composed of 84 places in 511 ms of which 7 ms to minimize.
[2024-05-24 16:21:43] [INFO ] Deduced a trap composed of 115 places in 519 ms of which 8 ms to minimize.
[2024-05-24 16:21:44] [INFO ] Deduced a trap composed of 112 places in 537 ms of which 8 ms to minimize.
SMT process timed out in 5590ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1140 transition count 2543
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1121 transition count 2543
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 38 place count 1121 transition count 2533
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 58 place count 1111 transition count 2533
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 92 place count 1094 transition count 2516
Free-agglomeration rule (complex) applied 130 times.
Iterating global reduction 2 with 130 rules applied. Total rules applied 222 place count 1094 transition count 2946
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 2 with 130 rules applied. Total rules applied 352 place count 964 transition count 2946
Applied a total of 352 rules in 263 ms. Remains 964 /1140 variables (removed 176) and now considering 2946/2562 (removed -384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 964/1140 places, 2946/2562 transitions.
RANDOM walk for 40000 steps (1252 resets) in 683 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (157 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (159 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (159 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 71973 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 3
Probabilistic random walk after 71973 steps, saw 30194 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:21:47] [INFO ] Flow matrix only has 2550 transitions (discarded 396 similar events)
// Phase 1: matrix 2550 rows 964 cols
[2024-05-24 16:21:47] [INFO ] Computed 44 invariants in 24 ms
[2024-05-24 16:21:47] [INFO ] State equation strengthened by 1398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 875/881 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/929 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/929 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/957 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/957 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/964 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/964 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2550/3514 variables, 964/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3514 variables, 1398/2406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3514 variables, 0/2406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3514 variables, 0/2406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3514/3514 variables, and 2406 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1274 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 964/964 constraints, ReadFeed: 1398/1398 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 875/881 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/929 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:21:49] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 6 ms to minimize.
[2024-05-24 16:21:50] [INFO ] Deduced a trap composed of 63 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:21:50] [INFO ] Deduced a trap composed of 71 places in 465 ms of which 5 ms to minimize.
[2024-05-24 16:21:51] [INFO ] Deduced a trap composed of 27 places in 476 ms of which 5 ms to minimize.
[2024-05-24 16:21:51] [INFO ] Deduced a trap composed of 27 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:21:52] [INFO ] Deduced a trap composed of 69 places in 468 ms of which 6 ms to minimize.
[2024-05-24 16:21:52] [INFO ] Deduced a trap composed of 68 places in 467 ms of which 6 ms to minimize.
[2024-05-24 16:21:53] [INFO ] Deduced a trap composed of 71 places in 468 ms of which 5 ms to minimize.
[2024-05-24 16:21:53] [INFO ] Deduced a trap composed of 62 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:21:54] [INFO ] Deduced a trap composed of 82 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:21:54] [INFO ] Deduced a trap composed of 66 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:21:55] [INFO ] Deduced a trap composed of 71 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:21:55] [INFO ] Deduced a trap composed of 67 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:21:56] [INFO ] Deduced a trap composed of 73 places in 464 ms of which 6 ms to minimize.
[2024-05-24 16:21:56] [INFO ] Deduced a trap composed of 76 places in 460 ms of which 5 ms to minimize.
[2024-05-24 16:21:57] [INFO ] Deduced a trap composed of 63 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:21:57] [INFO ] Deduced a trap composed of 73 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:21:58] [INFO ] Deduced a trap composed of 57 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:21:58] [INFO ] Deduced a trap composed of 70 places in 475 ms of which 7 ms to minimize.
[2024-05-24 16:21:59] [INFO ] Deduced a trap composed of 66 places in 483 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/929 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:21:59] [INFO ] Deduced a trap composed of 60 places in 492 ms of which 6 ms to minimize.
[2024-05-24 16:22:00] [INFO ] Deduced a trap composed of 60 places in 460 ms of which 6 ms to minimize.
[2024-05-24 16:22:00] [INFO ] Deduced a trap composed of 61 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:22:00] [INFO ] Deduced a trap composed of 88 places in 468 ms of which 6 ms to minimize.
[2024-05-24 16:22:01] [INFO ] Deduced a trap composed of 64 places in 480 ms of which 5 ms to minimize.
[2024-05-24 16:22:01] [INFO ] Deduced a trap composed of 75 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:22:02] [INFO ] Deduced a trap composed of 72 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:22:02] [INFO ] Deduced a trap composed of 73 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:22:03] [INFO ] Deduced a trap composed of 73 places in 454 ms of which 5 ms to minimize.
[2024-05-24 16:22:03] [INFO ] Deduced a trap composed of 117 places in 448 ms of which 5 ms to minimize.
[2024-05-24 16:22:04] [INFO ] Deduced a trap composed of 62 places in 452 ms of which 6 ms to minimize.
[2024-05-24 16:22:04] [INFO ] Deduced a trap composed of 71 places in 455 ms of which 5 ms to minimize.
[2024-05-24 16:22:05] [INFO ] Deduced a trap composed of 60 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:22:05] [INFO ] Deduced a trap composed of 60 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:22:06] [INFO ] Deduced a trap composed of 60 places in 482 ms of which 6 ms to minimize.
[2024-05-24 16:22:06] [INFO ] Deduced a trap composed of 72 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:22:07] [INFO ] Deduced a trap composed of 92 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:22:07] [INFO ] Deduced a trap composed of 76 places in 446 ms of which 6 ms to minimize.
[2024-05-24 16:22:08] [INFO ] Deduced a trap composed of 178 places in 477 ms of which 6 ms to minimize.
[2024-05-24 16:22:08] [INFO ] Deduced a trap composed of 67 places in 458 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/929 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:22:09] [INFO ] Deduced a trap composed of 62 places in 448 ms of which 6 ms to minimize.
[2024-05-24 16:22:09] [INFO ] Deduced a trap composed of 87 places in 482 ms of which 6 ms to minimize.
[2024-05-24 16:22:10] [INFO ] Deduced a trap composed of 59 places in 464 ms of which 5 ms to minimize.
[2024-05-24 16:22:10] [INFO ] Deduced a trap composed of 73 places in 468 ms of which 6 ms to minimize.
[2024-05-24 16:22:11] [INFO ] Deduced a trap composed of 75 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:22:11] [INFO ] Deduced a trap composed of 61 places in 464 ms of which 6 ms to minimize.
[2024-05-24 16:22:12] [INFO ] Deduced a trap composed of 73 places in 451 ms of which 5 ms to minimize.
[2024-05-24 16:22:12] [INFO ] Deduced a trap composed of 93 places in 462 ms of which 5 ms to minimize.
[2024-05-24 16:22:12] [INFO ] Deduced a trap composed of 261 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:22:13] [INFO ] Deduced a trap composed of 67 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:22:13] [INFO ] Deduced a trap composed of 65 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:22:14] [INFO ] Deduced a trap composed of 70 places in 427 ms of which 6 ms to minimize.
[2024-05-24 16:22:14] [INFO ] Deduced a trap composed of 126 places in 433 ms of which 6 ms to minimize.
[2024-05-24 16:22:15] [INFO ] Deduced a trap composed of 117 places in 417 ms of which 5 ms to minimize.
[2024-05-24 16:22:15] [INFO ] Deduced a trap composed of 82 places in 421 ms of which 5 ms to minimize.
[2024-05-24 16:22:16] [INFO ] Deduced a trap composed of 286 places in 426 ms of which 5 ms to minimize.
[2024-05-24 16:22:16] [INFO ] Deduced a trap composed of 95 places in 418 ms of which 6 ms to minimize.
[2024-05-24 16:22:17] [INFO ] Deduced a trap composed of 73 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:22:17] [INFO ] Deduced a trap composed of 116 places in 435 ms of which 5 ms to minimize.
[2024-05-24 16:22:17] [INFO ] Deduced a trap composed of 156 places in 449 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/929 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:22:18] [INFO ] Deduced a trap composed of 69 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:22:18] [INFO ] Deduced a trap composed of 150 places in 430 ms of which 6 ms to minimize.
[2024-05-24 16:22:19] [INFO ] Deduced a trap composed of 89 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:22:19] [INFO ] Deduced a trap composed of 159 places in 414 ms of which 5 ms to minimize.
[2024-05-24 16:22:20] [INFO ] Deduced a trap composed of 62 places in 434 ms of which 5 ms to minimize.
[2024-05-24 16:22:20] [INFO ] Deduced a trap composed of 72 places in 420 ms of which 5 ms to minimize.
[2024-05-24 16:22:21] [INFO ] Deduced a trap composed of 61 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:22:21] [INFO ] Deduced a trap composed of 131 places in 433 ms of which 6 ms to minimize.
[2024-05-24 16:22:22] [INFO ] Deduced a trap composed of 136 places in 437 ms of which 6 ms to minimize.
[2024-05-24 16:22:22] [INFO ] Deduced a trap composed of 112 places in 429 ms of which 5 ms to minimize.
[2024-05-24 16:22:22] [INFO ] Deduced a trap composed of 78 places in 431 ms of which 6 ms to minimize.
[2024-05-24 16:22:23] [INFO ] Deduced a trap composed of 75 places in 423 ms of which 6 ms to minimize.
[2024-05-24 16:22:23] [INFO ] Deduced a trap composed of 204 places in 438 ms of which 5 ms to minimize.
[2024-05-24 16:22:24] [INFO ] Deduced a trap composed of 201 places in 435 ms of which 5 ms to minimize.
[2024-05-24 16:22:24] [INFO ] Deduced a trap composed of 222 places in 439 ms of which 5 ms to minimize.
[2024-05-24 16:22:25] [INFO ] Deduced a trap composed of 79 places in 432 ms of which 6 ms to minimize.
[2024-05-24 16:22:25] [INFO ] Deduced a trap composed of 72 places in 434 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 28/957 variables, 28/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:22:26] [INFO ] Deduced a trap composed of 74 places in 440 ms of which 6 ms to minimize.
[2024-05-24 16:22:26] [INFO ] Deduced a trap composed of 73 places in 462 ms of which 5 ms to minimize.
[2024-05-24 16:22:27] [INFO ] Deduced a trap composed of 86 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:22:27] [INFO ] Deduced a trap composed of 65 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:22:28] [INFO ] Deduced a trap composed of 100 places in 455 ms of which 6 ms to minimize.
[2024-05-24 16:22:28] [INFO ] Deduced a trap composed of 259 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:22:29] [INFO ] Deduced a trap composed of 108 places in 479 ms of which 6 ms to minimize.
[2024-05-24 16:22:29] [INFO ] Deduced a trap composed of 52 places in 468 ms of which 6 ms to minimize.
[2024-05-24 16:22:30] [INFO ] Deduced a trap composed of 64 places in 452 ms of which 6 ms to minimize.
[2024-05-24 16:22:30] [INFO ] Deduced a trap composed of 92 places in 486 ms of which 6 ms to minimize.
[2024-05-24 16:22:31] [INFO ] Deduced a trap composed of 93 places in 467 ms of which 5 ms to minimize.
[2024-05-24 16:22:31] [INFO ] Deduced a trap composed of 101 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:22:32] [INFO ] Deduced a trap composed of 95 places in 449 ms of which 6 ms to minimize.
[2024-05-24 16:22:32] [INFO ] Deduced a trap composed of 176 places in 386 ms of which 5 ms to minimize.
[2024-05-24 16:22:32] [INFO ] Deduced a trap composed of 179 places in 381 ms of which 5 ms to minimize.
[2024-05-24 16:22:33] [INFO ] Deduced a trap composed of 261 places in 395 ms of which 6 ms to minimize.
[2024-05-24 16:22:33] [INFO ] Deduced a trap composed of 99 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:22:34] [INFO ] Deduced a trap composed of 99 places in 443 ms of which 5 ms to minimize.
SMT process timed out in 46462ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 2946/2946 transitions.
Applied a total of 0 rules in 74 ms. Remains 964 /964 variables (removed 0) and now considering 2946/2946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 964/964 places, 2946/2946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 2946/2946 transitions.
Applied a total of 0 rules in 72 ms. Remains 964 /964 variables (removed 0) and now considering 2946/2946 (removed 0) transitions.
[2024-05-24 16:22:34] [INFO ] Flow matrix only has 2550 transitions (discarded 396 similar events)
[2024-05-24 16:22:34] [INFO ] Invariant cache hit.
[2024-05-24 16:22:35] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-05-24 16:22:35] [INFO ] Flow matrix only has 2550 transitions (discarded 396 similar events)
[2024-05-24 16:22:35] [INFO ] Invariant cache hit.
[2024-05-24 16:22:36] [INFO ] State equation strengthened by 1398 read => feed constraints.
[2024-05-24 16:22:54] [INFO ] Implicit Places using invariants and state equation in 19359 ms returned []
Implicit Place search using SMT with State Equation took 20361 ms to find 0 implicit places.
[2024-05-24 16:22:54] [INFO ] Redundant transitions in 148 ms returned []
Running 2884 sub problems to find dead transitions.
[2024-05-24 16:22:54] [INFO ] Flow matrix only has 2550 transitions (discarded 396 similar events)
[2024-05-24 16:22:54] [INFO ] Invariant cache hit.
[2024-05-24 16:22:54] [INFO ] State equation strengthened by 1398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2884 unsolved
SMT process timed out in 44671ms, After SMT, problems are : Problem set: 0 solved, 2884 unsolved
Search for dead transitions found 0 dead transitions in 44701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65294 ms. Remains : 964/964 places, 2946/2946 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p1) p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[p2, p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0)]
Stuttering acceptance computed with spot in 364 ms :[p2, p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0)]
Support contains 4 out of 1140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Applied a total of 0 rules in 47 ms. Remains 1140 /1140 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
[2024-05-24 16:23:40] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1140 cols
[2024-05-24 16:23:40] [INFO ] Computed 44 invariants in 21 ms
[2024-05-24 16:23:41] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2024-05-24 16:23:41] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2024-05-24 16:23:41] [INFO ] Invariant cache hit.
[2024-05-24 16:23:42] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 16:23:53] [INFO ] Implicit Places using invariants and state equation in 11692 ms returned []
Implicit Place search using SMT with State Equation took 12737 ms to find 0 implicit places.
Running 2545 sub problems to find dead transitions.
[2024-05-24 16:23:53] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2024-05-24 16:23:53] [INFO ] Invariant cache hit.
[2024-05-24 16:23:53] [INFO ] State equation strengthened by 838 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1138 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2545 unsolved
SMT process timed out in 32332ms, After SMT, problems are : Problem set: 0 solved, 2545 unsolved
Search for dead transitions found 0 dead transitions in 32356ms
Finished structural reductions in LTL mode , in 1 iterations and 45153 ms. Remains : 1140/1140 places, 2562/2562 transitions.
Computed a total of 308 stabilizing places and 929 stable transitions
Computed a total of 308 stabilizing places and 929 stable transitions
Detected a total of 308/1140 stabilizing places and 929/2562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[p2, p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0)]
RANDOM walk for 40000 steps (767 resets) in 394 ms. (101 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (200 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (200 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
[2024-05-24 16:24:26] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2024-05-24 16:24:26] [INFO ] Invariant cache hit.
[2024-05-24 16:24:26] [INFO ] State equation strengthened by 838 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1053/1057 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1057 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/1105 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:24:27] [INFO ] Deduced a trap composed of 99 places in 518 ms of which 7 ms to minimize.
[2024-05-24 16:24:27] [INFO ] Deduced a trap composed of 105 places in 524 ms of which 7 ms to minimize.
[2024-05-24 16:24:28] [INFO ] Deduced a trap composed of 84 places in 511 ms of which 7 ms to minimize.
[2024-05-24 16:24:28] [INFO ] Deduced a trap composed of 95 places in 508 ms of which 7 ms to minimize.
[2024-05-24 16:24:29] [INFO ] Deduced a trap composed of 96 places in 521 ms of which 8 ms to minimize.
[2024-05-24 16:24:29] [INFO ] Deduced a trap composed of 143 places in 457 ms of which 7 ms to minimize.
[2024-05-24 16:24:30] [INFO ] Deduced a trap composed of 148 places in 467 ms of which 7 ms to minimize.
[2024-05-24 16:24:30] [INFO ] Deduced a trap composed of 50 places in 482 ms of which 7 ms to minimize.
[2024-05-24 16:24:31] [INFO ] Deduced a trap composed of 105 places in 489 ms of which 7 ms to minimize.
[2024-05-24 16:24:31] [INFO ] Deduced a trap composed of 94 places in 469 ms of which 7 ms to minimize.
SMT process timed out in 5407ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1140 transition count 2543
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1121 transition count 2543
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 38 place count 1121 transition count 2532
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 60 place count 1110 transition count 2532
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1109 transition count 2531
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1109 transition count 2531
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 62 place count 1109 transition count 2530
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1108 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1107 transition count 2525
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1107 transition count 2525
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 98 place count 1091 transition count 2509
Free-agglomeration rule (complex) applied 129 times.
Iterating global reduction 2 with 129 rules applied. Total rules applied 227 place count 1091 transition count 2944
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 2 with 129 rules applied. Total rules applied 356 place count 962 transition count 2944
Applied a total of 356 rules in 340 ms. Remains 962 /1140 variables (removed 178) and now considering 2944/2562 (removed -382) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 962/1140 places, 2944/2562 transitions.
RANDOM walk for 40000 steps (1260 resets) in 836 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (157 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 64077 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 64077 steps, saw 26877 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 16:24:35] [INFO ] Flow matrix only has 2548 transitions (discarded 396 similar events)
// Phase 1: matrix 2548 rows 962 cols
[2024-05-24 16:24:35] [INFO ] Computed 44 invariants in 28 ms
[2024-05-24 16:24:35] [INFO ] State equation strengthened by 1398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:24:36] [INFO ] Deduced a trap composed of 203 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:24:36] [INFO ] Deduced a trap composed of 207 places in 435 ms of which 6 ms to minimize.
[2024-05-24 16:24:37] [INFO ] Deduced a trap composed of 346 places in 443 ms of which 6 ms to minimize.
[2024-05-24 16:24:37] [INFO ] Deduced a trap composed of 90 places in 438 ms of which 6 ms to minimize.
[2024-05-24 16:24:38] [INFO ] Deduced a trap composed of 81 places in 439 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 31/927 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:24:38] [INFO ] Deduced a trap composed of 5 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:24:39] [INFO ] Deduced a trap composed of 67 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:24:39] [INFO ] Deduced a trap composed of 69 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:24:40] [INFO ] Deduced a trap composed of 64 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:24:40] [INFO ] Deduced a trap composed of 70 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:24:41] [INFO ] Deduced a trap composed of 65 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:24:41] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 4 ms to minimize.
[2024-05-24 16:24:41] [INFO ] Deduced a trap composed of 72 places in 482 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/927 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/955 variables, 28/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/962 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2548/3510 variables, 962/1019 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3510 variables, 1398/2417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3510 variables, 0/2417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3510 variables, 0/2417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3510/3510 variables, and 2417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7206 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 962/962 constraints, ReadFeed: 1398/1398 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:24:43] [INFO ] Deduced a trap composed of 314 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:24:43] [INFO ] Deduced a trap composed of 387 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:24:44] [INFO ] Deduced a trap composed of 118 places in 445 ms of which 6 ms to minimize.
[2024-05-24 16:24:44] [INFO ] Deduced a trap composed of 106 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:24:45] [INFO ] Deduced a trap composed of 322 places in 432 ms of which 6 ms to minimize.
[2024-05-24 16:24:45] [INFO ] Deduced a trap composed of 292 places in 445 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/927 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:24:46] [INFO ] Deduced a trap composed of 136 places in 420 ms of which 6 ms to minimize.
[2024-05-24 16:24:46] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 5 ms to minimize.
[2024-05-24 16:24:47] [INFO ] Deduced a trap composed of 120 places in 397 ms of which 5 ms to minimize.
[2024-05-24 16:24:47] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 6 ms to minimize.
[2024-05-24 16:24:47] [INFO ] Deduced a trap composed of 136 places in 399 ms of which 6 ms to minimize.
[2024-05-24 16:24:48] [INFO ] Deduced a trap composed of 136 places in 400 ms of which 6 ms to minimize.
[2024-05-24 16:24:48] [INFO ] Deduced a trap composed of 46 places in 399 ms of which 5 ms to minimize.
[2024-05-24 16:24:49] [INFO ] Deduced a trap composed of 62 places in 418 ms of which 5 ms to minimize.
[2024-05-24 16:24:49] [INFO ] Deduced a trap composed of 132 places in 428 ms of which 6 ms to minimize.
[2024-05-24 16:24:50] [INFO ] Deduced a trap composed of 140 places in 407 ms of which 6 ms to minimize.
[2024-05-24 16:24:50] [INFO ] Deduced a trap composed of 140 places in 408 ms of which 6 ms to minimize.
[2024-05-24 16:24:50] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 4 ms to minimize.
[2024-05-24 16:24:51] [INFO ] Deduced a trap composed of 157 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:24:51] [INFO ] Deduced a trap composed of 173 places in 411 ms of which 6 ms to minimize.
[2024-05-24 16:24:51] [INFO ] Deduced a trap composed of 174 places in 395 ms of which 6 ms to minimize.
[2024-05-24 16:24:52] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 3 ms to minimize.
[2024-05-24 16:24:52] [INFO ] Deduced a trap composed of 118 places in 404 ms of which 5 ms to minimize.
[2024-05-24 16:24:53] [INFO ] Deduced a trap composed of 123 places in 433 ms of which 5 ms to minimize.
[2024-05-24 16:24:53] [INFO ] Deduced a trap composed of 134 places in 405 ms of which 6 ms to minimize.
[2024-05-24 16:24:53] [INFO ] Deduced a trap composed of 138 places in 394 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:24:54] [INFO ] Deduced a trap composed of 46 places in 404 ms of which 5 ms to minimize.
[2024-05-24 16:24:54] [INFO ] Deduced a trap composed of 198 places in 400 ms of which 5 ms to minimize.
[2024-05-24 16:24:55] [INFO ] Deduced a trap composed of 71 places in 407 ms of which 6 ms to minimize.
[2024-05-24 16:24:55] [INFO ] Deduced a trap composed of 132 places in 413 ms of which 6 ms to minimize.
[2024-05-24 16:24:56] [INFO ] Deduced a trap composed of 62 places in 410 ms of which 5 ms to minimize.
[2024-05-24 16:24:56] [INFO ] Deduced a trap composed of 75 places in 417 ms of which 6 ms to minimize.
[2024-05-24 16:24:56] [INFO ] Deduced a trap composed of 75 places in 407 ms of which 6 ms to minimize.
[2024-05-24 16:24:57] [INFO ] Deduced a trap composed of 132 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:24:57] [INFO ] Deduced a trap composed of 62 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:24:58] [INFO ] Deduced a trap composed of 175 places in 407 ms of which 5 ms to minimize.
[2024-05-24 16:24:58] [INFO ] Deduced a trap composed of 182 places in 400 ms of which 5 ms to minimize.
[2024-05-24 16:24:59] [INFO ] Deduced a trap composed of 185 places in 386 ms of which 5 ms to minimize.
[2024-05-24 16:24:59] [INFO ] Deduced a trap composed of 110 places in 183 ms of which 3 ms to minimize.
[2024-05-24 16:24:59] [INFO ] Deduced a trap composed of 173 places in 401 ms of which 6 ms to minimize.
[2024-05-24 16:25:00] [INFO ] Deduced a trap composed of 207 places in 392 ms of which 6 ms to minimize.
[2024-05-24 16:25:00] [INFO ] Deduced a trap composed of 57 places in 404 ms of which 6 ms to minimize.
[2024-05-24 16:25:00] [INFO ] Deduced a trap composed of 213 places in 391 ms of which 5 ms to minimize.
[2024-05-24 16:25:01] [INFO ] Deduced a trap composed of 217 places in 416 ms of which 6 ms to minimize.
[2024-05-24 16:25:01] [INFO ] Deduced a trap composed of 104 places in 406 ms of which 6 ms to minimize.
[2024-05-24 16:25:02] [INFO ] Deduced a trap composed of 169 places in 389 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/927 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:25:02] [INFO ] Deduced a trap composed of 169 places in 401 ms of which 5 ms to minimize.
[2024-05-24 16:25:03] [INFO ] Deduced a trap composed of 149 places in 405 ms of which 6 ms to minimize.
[2024-05-24 16:25:03] [INFO ] Deduced a trap composed of 147 places in 383 ms of which 5 ms to minimize.
[2024-05-24 16:25:03] [INFO ] Deduced a trap composed of 132 places in 398 ms of which 6 ms to minimize.
[2024-05-24 16:25:04] [INFO ] Deduced a trap composed of 62 places in 402 ms of which 6 ms to minimize.
[2024-05-24 16:25:04] [INFO ] Deduced a trap composed of 161 places in 392 ms of which 5 ms to minimize.
[2024-05-24 16:25:05] [INFO ] Deduced a trap composed of 169 places in 388 ms of which 6 ms to minimize.
[2024-05-24 16:25:05] [INFO ] Deduced a trap composed of 82 places in 395 ms of which 5 ms to minimize.
[2024-05-24 16:25:05] [INFO ] Deduced a trap composed of 104 places in 397 ms of which 6 ms to minimize.
[2024-05-24 16:25:06] [INFO ] Deduced a trap composed of 137 places in 402 ms of which 6 ms to minimize.
[2024-05-24 16:25:06] [INFO ] Deduced a trap composed of 177 places in 393 ms of which 6 ms to minimize.
[2024-05-24 16:25:07] [INFO ] Deduced a trap composed of 183 places in 407 ms of which 5 ms to minimize.
[2024-05-24 16:25:07] [INFO ] Deduced a trap composed of 150 places in 406 ms of which 5 ms to minimize.
[2024-05-24 16:25:08] [INFO ] Deduced a trap composed of 151 places in 393 ms of which 5 ms to minimize.
[2024-05-24 16:25:08] [INFO ] Deduced a trap composed of 152 places in 401 ms of which 6 ms to minimize.
[2024-05-24 16:25:08] [INFO ] Deduced a trap composed of 171 places in 378 ms of which 6 ms to minimize.
[2024-05-24 16:25:09] [INFO ] Deduced a trap composed of 85 places in 415 ms of which 5 ms to minimize.
[2024-05-24 16:25:09] [INFO ] Deduced a trap composed of 164 places in 421 ms of which 6 ms to minimize.
[2024-05-24 16:25:10] [INFO ] Deduced a trap composed of 85 places in 390 ms of which 5 ms to minimize.
[2024-05-24 16:25:10] [INFO ] Deduced a trap composed of 171 places in 409 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:25:11] [INFO ] Deduced a trap composed of 169 places in 402 ms of which 6 ms to minimize.
[2024-05-24 16:25:11] [INFO ] Deduced a trap composed of 75 places in 384 ms of which 6 ms to minimize.
[2024-05-24 16:25:11] [INFO ] Deduced a trap composed of 85 places in 396 ms of which 6 ms to minimize.
[2024-05-24 16:25:12] [INFO ] Deduced a trap composed of 180 places in 411 ms of which 6 ms to minimize.
[2024-05-24 16:25:12] [INFO ] Deduced a trap composed of 178 places in 391 ms of which 6 ms to minimize.
[2024-05-24 16:25:13] [INFO ] Deduced a trap composed of 178 places in 388 ms of which 6 ms to minimize.
[2024-05-24 16:25:13] [INFO ] Deduced a trap composed of 178 places in 396 ms of which 5 ms to minimize.
[2024-05-24 16:25:14] [INFO ] Deduced a trap composed of 215 places in 394 ms of which 6 ms to minimize.
[2024-05-24 16:25:14] [INFO ] Deduced a trap composed of 211 places in 377 ms of which 6 ms to minimize.
[2024-05-24 16:25:14] [INFO ] Deduced a trap composed of 186 places in 419 ms of which 5 ms to minimize.
[2024-05-24 16:25:15] [INFO ] Deduced a trap composed of 200 places in 385 ms of which 5 ms to minimize.
[2024-05-24 16:25:15] [INFO ] Deduced a trap composed of 185 places in 364 ms of which 5 ms to minimize.
[2024-05-24 16:25:16] [INFO ] Deduced a trap composed of 220 places in 362 ms of which 6 ms to minimize.
[2024-05-24 16:25:16] [INFO ] Deduced a trap composed of 226 places in 423 ms of which 6 ms to minimize.
[2024-05-24 16:25:17] [INFO ] Deduced a trap composed of 224 places in 448 ms of which 6 ms to minimize.
[2024-05-24 16:25:17] [INFO ] Deduced a trap composed of 189 places in 375 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 28/955 variables, 28/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:25:18] [INFO ] Deduced a trap composed of 189 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:25:18] [INFO ] Deduced a trap composed of 195 places in 381 ms of which 5 ms to minimize.
[2024-05-24 16:25:18] [INFO ] Deduced a trap composed of 192 places in 386 ms of which 6 ms to minimize.
[2024-05-24 16:25:19] [INFO ] Deduced a trap composed of 193 places in 376 ms of which 6 ms to minimize.
[2024-05-24 16:25:19] [INFO ] Deduced a trap composed of 196 places in 382 ms of which 6 ms to minimize.
[2024-05-24 16:25:20] [INFO ] Deduced a trap composed of 197 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:25:20] [INFO ] Deduced a trap composed of 174 places in 389 ms of which 6 ms to minimize.
[2024-05-24 16:25:20] [INFO ] Deduced a trap composed of 187 places in 413 ms of which 8 ms to minimize.
[2024-05-24 16:25:21] [INFO ] Deduced a trap composed of 187 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:25:21] [INFO ] Deduced a trap composed of 188 places in 403 ms of which 6 ms to minimize.
[2024-05-24 16:25:22] [INFO ] Deduced a trap composed of 62 places in 386 ms of which 5 ms to minimize.
[2024-05-24 16:25:22] [INFO ] Deduced a trap composed of 174 places in 423 ms of which 6 ms to minimize.
[2024-05-24 16:25:23] [INFO ] Deduced a trap composed of 97 places in 409 ms of which 6 ms to minimize.
[2024-05-24 16:25:23] [INFO ] Deduced a trap composed of 68 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:25:24] [INFO ] Deduced a trap composed of 67 places in 495 ms of which 6 ms to minimize.
[2024-05-24 16:25:24] [INFO ] Deduced a trap composed of 85 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:25:25] [INFO ] Deduced a trap composed of 67 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:25:25] [INFO ] Deduced a trap composed of 184 places in 425 ms of which 6 ms to minimize.
[2024-05-24 16:25:26] [INFO ] Deduced a trap composed of 83 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:25:26] [INFO ] Deduced a trap composed of 198 places in 463 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/955 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:25:27] [INFO ] Deduced a trap composed of 74 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:25:27] [INFO ] Deduced a trap composed of 188 places in 408 ms of which 6 ms to minimize.
[2024-05-24 16:25:28] [INFO ] Deduced a trap composed of 180 places in 411 ms of which 6 ms to minimize.
SMT process timed out in 52631ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 2944/2944 transitions.
Applied a total of 0 rules in 73 ms. Remains 962 /962 variables (removed 0) and now considering 2944/2944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 962/962 places, 2944/2944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 2944/2944 transitions.
Applied a total of 0 rules in 71 ms. Remains 962 /962 variables (removed 0) and now considering 2944/2944 (removed 0) transitions.
[2024-05-24 16:25:28] [INFO ] Flow matrix only has 2548 transitions (discarded 396 similar events)
[2024-05-24 16:25:28] [INFO ] Invariant cache hit.
[2024-05-24 16:25:29] [INFO ] Implicit Places using invariants in 1017 ms returned [446]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 961/962 places, 2944/2944 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 960 transition count 2943
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 960 transition count 2943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 959 transition count 2942
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 959 transition count 2942
Applied a total of 4 rules in 133 ms. Remains 959 /961 variables (removed 2) and now considering 2942/2944 (removed 2) transitions.
[2024-05-24 16:25:29] [INFO ] Flow matrix only has 2546 transitions (discarded 396 similar events)
// Phase 1: matrix 2546 rows 959 cols
[2024-05-24 16:25:29] [INFO ] Computed 43 invariants in 24 ms
[2024-05-24 16:25:30] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2024-05-24 16:25:30] [INFO ] Flow matrix only has 2546 transitions (discarded 396 similar events)
[2024-05-24 16:25:30] [INFO ] Invariant cache hit.
[2024-05-24 16:25:31] [INFO ] State equation strengthened by 1398 read => feed constraints.
[2024-05-24 16:25:50] [INFO ] Implicit Places using invariants and state equation in 20039 ms returned []
Implicit Place search using SMT with State Equation took 21042 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 959/962 places, 2942/2944 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22269 ms. Remains : 959/962 places, 2942/2944 transitions.
RANDOM walk for 40000 steps (1259 resets) in 450 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (156 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (159 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 71887 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 71887 steps, saw 30064 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:25:53] [INFO ] Flow matrix only has 2546 transitions (discarded 396 similar events)
[2024-05-24 16:25:53] [INFO ] Invariant cache hit.
[2024-05-24 16:25:53] [INFO ] State equation strengthened by 1398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 890/894 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:25:54] [INFO ] Deduced a trap composed of 167 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:25:54] [INFO ] Deduced a trap composed of 209 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:25:55] [INFO ] Deduced a trap composed of 95 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:25:55] [INFO ] Deduced a trap composed of 70 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:25:56] [INFO ] Deduced a trap composed of 129 places in 433 ms of which 5 ms to minimize.
[2024-05-24 16:25:56] [INFO ] Deduced a trap composed of 69 places in 419 ms of which 5 ms to minimize.
[2024-05-24 16:25:57] [INFO ] Deduced a trap composed of 459 places in 420 ms of which 6 ms to minimize.
[2024-05-24 16:25:57] [INFO ] Deduced a trap composed of 76 places in 432 ms of which 5 ms to minimize.
[2024-05-24 16:25:57] [INFO ] Deduced a trap composed of 69 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:25:58] [INFO ] Deduced a trap composed of 76 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:25:58] [INFO ] Deduced a trap composed of 70 places in 432 ms of which 5 ms to minimize.
[2024-05-24 16:25:59] [INFO ] Deduced a trap composed of 118 places in 424 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/894 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/894 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 30/924 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/924 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/952 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/959 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/959 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2546/3505 variables, 959/1014 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3505 variables, 1398/2412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3505 variables, 0/2412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3505 variables, 0/2412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3505/3505 variables, and 2412 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6788 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 959/959 constraints, ReadFeed: 1398/1398 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 890/894 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/894 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:26:01] [INFO ] Deduced a trap composed of 211 places in 433 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/894 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/894 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/924 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:26:01] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:26:02] [INFO ] Deduced a trap composed of 71 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:26:02] [INFO ] Deduced a trap composed of 81 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:26:03] [INFO ] Deduced a trap composed of 89 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:26:03] [INFO ] Deduced a trap composed of 84 places in 446 ms of which 6 ms to minimize.
[2024-05-24 16:26:04] [INFO ] Deduced a trap composed of 78 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:26:04] [INFO ] Deduced a trap composed of 71 places in 449 ms of which 6 ms to minimize.
[2024-05-24 16:26:04] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
[2024-05-24 16:26:05] [INFO ] Deduced a trap composed of 56 places in 451 ms of which 5 ms to minimize.
[2024-05-24 16:26:05] [INFO ] Deduced a trap composed of 62 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:26:06] [INFO ] Deduced a trap composed of 59 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:26:06] [INFO ] Deduced a trap composed of 57 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:26:07] [INFO ] Deduced a trap composed of 62 places in 446 ms of which 5 ms to minimize.
[2024-05-24 16:26:07] [INFO ] Deduced a trap composed of 62 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:26:08] [INFO ] Deduced a trap composed of 57 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:26:08] [INFO ] Deduced a trap composed of 57 places in 462 ms of which 5 ms to minimize.
[2024-05-24 16:26:08] [INFO ] Deduced a trap composed of 60 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:26:09] [INFO ] Deduced a trap composed of 73 places in 454 ms of which 5 ms to minimize.
[2024-05-24 16:26:09] [INFO ] Deduced a trap composed of 64 places in 456 ms of which 5 ms to minimize.
[2024-05-24 16:26:10] [INFO ] Deduced a trap composed of 72 places in 460 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/924 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:26:10] [INFO ] Deduced a trap composed of 79 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:26:11] [INFO ] Deduced a trap composed of 80 places in 447 ms of which 5 ms to minimize.
[2024-05-24 16:26:11] [INFO ] Deduced a trap composed of 133 places in 398 ms of which 6 ms to minimize.
[2024-05-24 16:26:12] [INFO ] Deduced a trap composed of 117 places in 399 ms of which 6 ms to minimize.
[2024-05-24 16:26:12] [INFO ] Deduced a trap composed of 134 places in 386 ms of which 5 ms to minimize.
[2024-05-24 16:26:13] [INFO ] Deduced a trap composed of 62 places in 440 ms of which 5 ms to minimize.
[2024-05-24 16:26:13] [INFO ] Deduced a trap composed of 84 places in 467 ms of which 5 ms to minimize.
[2024-05-24 16:26:14] [INFO ] Deduced a trap composed of 78 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:26:14] [INFO ] Deduced a trap composed of 77 places in 452 ms of which 5 ms to minimize.
[2024-05-24 16:26:15] [INFO ] Deduced a trap composed of 59 places in 473 ms of which 7 ms to minimize.
[2024-05-24 16:26:15] [INFO ] Deduced a trap composed of 72 places in 486 ms of which 6 ms to minimize.
[2024-05-24 16:26:16] [INFO ] Deduced a trap composed of 65 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:26:16] [INFO ] Deduced a trap composed of 103 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:26:17] [INFO ] Deduced a trap composed of 76 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:26:17] [INFO ] Deduced a trap composed of 63 places in 477 ms of which 6 ms to minimize.
[2024-05-24 16:26:18] [INFO ] Deduced a trap composed of 64 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:26:18] [INFO ] Deduced a trap composed of 72 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:26:19] [INFO ] Deduced a trap composed of 73 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:26:19] [INFO ] Deduced a trap composed of 95 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:26:19] [INFO ] Deduced a trap composed of 46 places in 403 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/924 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:26:20] [INFO ] Deduced a trap composed of 73 places in 488 ms of which 6 ms to minimize.
[2024-05-24 16:26:21] [INFO ] Deduced a trap composed of 78 places in 483 ms of which 6 ms to minimize.
[2024-05-24 16:26:21] [INFO ] Deduced a trap composed of 68 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:26:21] [INFO ] Deduced a trap composed of 67 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:26:22] [INFO ] Deduced a trap composed of 63 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:26:22] [INFO ] Deduced a trap composed of 66 places in 464 ms of which 6 ms to minimize.
[2024-05-24 16:26:23] [INFO ] Deduced a trap composed of 65 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:26:23] [INFO ] Deduced a trap composed of 72 places in 464 ms of which 6 ms to minimize.
[2024-05-24 16:26:24] [INFO ] Deduced a trap composed of 72 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:26:24] [INFO ] Deduced a trap composed of 72 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:26:25] [INFO ] Deduced a trap composed of 88 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:26:26] [INFO ] Deduced a trap composed of 61 places in 468 ms of which 5 ms to minimize.
[2024-05-24 16:26:26] [INFO ] Deduced a trap composed of 77 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:26:27] [INFO ] Deduced a trap composed of 70 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:26:27] [INFO ] Deduced a trap composed of 90 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:26:28] [INFO ] Deduced a trap composed of 77 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:26:28] [INFO ] Deduced a trap composed of 59 places in 448 ms of which 5 ms to minimize.
[2024-05-24 16:26:28] [INFO ] Deduced a trap composed of 69 places in 473 ms of which 5 ms to minimize.
[2024-05-24 16:26:29] [INFO ] Deduced a trap composed of 68 places in 455 ms of which 5 ms to minimize.
[2024-05-24 16:26:29] [INFO ] Deduced a trap composed of 73 places in 456 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/924 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:26:30] [INFO ] Deduced a trap composed of 74 places in 488 ms of which 6 ms to minimize.
[2024-05-24 16:26:30] [INFO ] Deduced a trap composed of 46 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:26:31] [INFO ] Deduced a trap composed of 73 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:26:31] [INFO ] Deduced a trap composed of 74 places in 459 ms of which 5 ms to minimize.
[2024-05-24 16:26:32] [INFO ] Deduced a trap composed of 60 places in 448 ms of which 6 ms to minimize.
[2024-05-24 16:26:32] [INFO ] Deduced a trap composed of 74 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:26:33] [INFO ] Deduced a trap composed of 63 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:26:33] [INFO ] Deduced a trap composed of 84 places in 445 ms of which 6 ms to minimize.
[2024-05-24 16:26:34] [INFO ] Deduced a trap composed of 71 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:26:34] [INFO ] Deduced a trap composed of 66 places in 451 ms of which 5 ms to minimize.
[2024-05-24 16:26:35] [INFO ] Deduced a trap composed of 79 places in 450 ms of which 7 ms to minimize.
[2024-05-24 16:26:35] [INFO ] Deduced a trap composed of 66 places in 447 ms of which 6 ms to minimize.
[2024-05-24 16:26:36] [INFO ] Deduced a trap composed of 67 places in 449 ms of which 5 ms to minimize.
[2024-05-24 16:26:36] [INFO ] Deduced a trap composed of 79 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:26:37] [INFO ] Deduced a trap composed of 68 places in 447 ms of which 6 ms to minimize.
[2024-05-24 16:26:37] [INFO ] Deduced a trap composed of 76 places in 471 ms of which 5 ms to minimize.
[2024-05-24 16:26:38] [INFO ] Deduced a trap composed of 86 places in 465 ms of which 5 ms to minimize.
[2024-05-24 16:26:38] [INFO ] Deduced a trap composed of 68 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:26:38] [INFO ] Deduced a trap composed of 75 places in 442 ms of which 5 ms to minimize.
[2024-05-24 16:26:39] [INFO ] Deduced a trap composed of 46 places in 448 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/924 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:26:39] [INFO ] Deduced a trap composed of 88 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:26:40] [INFO ] Deduced a trap composed of 61 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:26:40] [INFO ] Deduced a trap composed of 88 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:26:41] [INFO ] Deduced a trap composed of 68 places in 457 ms of which 5 ms to minimize.
[2024-05-24 16:26:41] [INFO ] Deduced a trap composed of 62 places in 443 ms of which 6 ms to minimize.
[2024-05-24 16:26:42] [INFO ] Deduced a trap composed of 76 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:26:42] [INFO ] Deduced a trap composed of 72 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:26:43] [INFO ] Deduced a trap composed of 70 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:26:43] [INFO ] Deduced a trap composed of 63 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:26:44] [INFO ] Deduced a trap composed of 86 places in 456 ms of which 5 ms to minimize.
[2024-05-24 16:26:44] [INFO ] Deduced a trap composed of 80 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:26:45] [INFO ] Deduced a trap composed of 77 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:26:45] [INFO ] Deduced a trap composed of 164 places in 419 ms of which 6 ms to minimize.
[2024-05-24 16:26:46] [INFO ] Deduced a trap composed of 168 places in 429 ms of which 6 ms to minimize.
[2024-05-24 16:26:46] [INFO ] Deduced a trap composed of 180 places in 393 ms of which 5 ms to minimize.
[2024-05-24 16:26:46] [INFO ] Deduced a trap composed of 62 places in 415 ms of which 6 ms to minimize.
[2024-05-24 16:26:47] [INFO ] Deduced a trap composed of 59 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:26:47] [INFO ] Deduced a trap composed of 80 places in 446 ms of which 6 ms to minimize.
[2024-05-24 16:26:48] [INFO ] Deduced a trap composed of 91 places in 440 ms of which 6 ms to minimize.
[2024-05-24 16:26:48] [INFO ] Deduced a trap composed of 78 places in 455 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/924 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:26:49] [INFO ] Deduced a trap composed of 75 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:26:49] [INFO ] Deduced a trap composed of 78 places in 447 ms of which 5 ms to minimize.
[2024-05-24 16:26:50] [INFO ] Deduced a trap composed of 62 places in 445 ms of which 5 ms to minimize.
[2024-05-24 16:26:50] [INFO ] Deduced a trap composed of 73 places in 440 ms of which 5 ms to minimize.
[2024-05-24 16:26:51] [INFO ] Deduced a trap composed of 62 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:26:51] [INFO ] Deduced a trap composed of 60 places in 432 ms of which 5 ms to minimize.
[2024-05-24 16:26:52] [INFO ] Deduced a trap composed of 196 places in 432 ms of which 5 ms to minimize.
[2024-05-24 16:26:52] [INFO ] Deduced a trap composed of 108 places in 437 ms of which 6 ms to minimize.
[2024-05-24 16:26:53] [INFO ] Deduced a trap composed of 82 places in 439 ms of which 6 ms to minimize.
[2024-05-24 16:26:53] [INFO ] Deduced a trap composed of 93 places in 431 ms of which 6 ms to minimize.
[2024-05-24 16:26:53] [INFO ] Deduced a trap composed of 64 places in 430 ms of which 5 ms to minimize.
[2024-05-24 16:26:54] [INFO ] Deduced a trap composed of 138 places in 476 ms of which 5 ms to minimize.
[2024-05-24 16:26:54] [INFO ] Deduced a trap composed of 82 places in 444 ms of which 5 ms to minimize.
[2024-05-24 16:26:55] [INFO ] Deduced a trap composed of 60 places in 437 ms of which 5 ms to minimize.
[2024-05-24 16:26:55] [INFO ] Deduced a trap composed of 81 places in 429 ms of which 5 ms to minimize.
[2024-05-24 16:26:56] [INFO ] Deduced a trap composed of 206 places in 432 ms of which 6 ms to minimize.
[2024-05-24 16:26:56] [INFO ] Deduced a trap composed of 82 places in 440 ms of which 6 ms to minimize.
[2024-05-24 16:26:57] [INFO ] Deduced a trap composed of 73 places in 457 ms of which 6 ms to minimize.
[2024-05-24 16:26:57] [INFO ] Deduced a trap composed of 90 places in 457 ms of which 5 ms to minimize.
[2024-05-24 16:26:58] [INFO ] Deduced a trap composed of 179 places in 390 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/924 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:26:58] [INFO ] Deduced a trap composed of 186 places in 389 ms of which 5 ms to minimize.
[2024-05-24 16:26:58] [INFO ] Deduced a trap composed of 196 places in 383 ms of which 6 ms to minimize.
[2024-05-24 16:26:59] [INFO ] Deduced a trap composed of 206 places in 388 ms of which 5 ms to minimize.
[2024-05-24 16:27:00] [INFO ] Deduced a trap composed of 74 places in 446 ms of which 6 ms to minimize.
[2024-05-24 16:27:00] [INFO ] Deduced a trap composed of 59 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:27:00] [INFO ] Deduced a trap composed of 87 places in 457 ms of which 6 ms to minimize.
[2024-05-24 16:27:01] [INFO ] Deduced a trap composed of 77 places in 455 ms of which 6 ms to minimize.
[2024-05-24 16:27:01] [INFO ] Deduced a trap composed of 75 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:27:02] [INFO ] Deduced a trap composed of 72 places in 464 ms of which 5 ms to minimize.
[2024-05-24 16:27:02] [INFO ] Deduced a trap composed of 73 places in 460 ms of which 5 ms to minimize.
[2024-05-24 16:27:03] [INFO ] Deduced a trap composed of 64 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:27:03] [INFO ] Deduced a trap composed of 70 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:27:04] [INFO ] Deduced a trap composed of 71 places in 460 ms of which 6 ms to minimize.
[2024-05-24 16:27:04] [INFO ] Deduced a trap composed of 80 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:27:05] [INFO ] Deduced a trap composed of 64 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:27:05] [INFO ] Deduced a trap composed of 72 places in 440 ms of which 6 ms to minimize.
[2024-05-24 16:27:06] [INFO ] Deduced a trap composed of 69 places in 468 ms of which 6 ms to minimize.
[2024-05-24 16:27:06] [INFO ] Deduced a trap composed of 72 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:27:07] [INFO ] Deduced a trap composed of 66 places in 457 ms of which 6 ms to minimize.
[2024-05-24 16:27:07] [INFO ] Deduced a trap composed of 61 places in 468 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/924 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:27:08] [INFO ] Deduced a trap composed of 69 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:27:08] [INFO ] Deduced a trap composed of 69 places in 464 ms of which 6 ms to minimize.
[2024-05-24 16:27:09] [INFO ] Deduced a trap composed of 65 places in 464 ms of which 6 ms to minimize.
[2024-05-24 16:27:09] [INFO ] Deduced a trap composed of 97 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:27:10] [INFO ] Deduced a trap composed of 63 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:27:10] [INFO ] Deduced a trap composed of 75 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:27:11] [INFO ] Deduced a trap composed of 82 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:27:11] [INFO ] Deduced a trap composed of 59 places in 447 ms of which 5 ms to minimize.
[2024-05-24 16:27:12] [INFO ] Deduced a trap composed of 85 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:27:12] [INFO ] Deduced a trap composed of 63 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:27:12] [INFO ] Deduced a trap composed of 60 places in 445 ms of which 5 ms to minimize.
[2024-05-24 16:27:13] [INFO ] Deduced a trap composed of 76 places in 438 ms of which 5 ms to minimize.
[2024-05-24 16:27:13] [INFO ] Deduced a trap composed of 73 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:27:14] [INFO ] Deduced a trap composed of 63 places in 443 ms of which 6 ms to minimize.
[2024-05-24 16:27:14] [INFO ] Deduced a trap composed of 75 places in 459 ms of which 5 ms to minimize.
[2024-05-24 16:27:15] [INFO ] Deduced a trap composed of 59 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:27:15] [INFO ] Deduced a trap composed of 57 places in 441 ms of which 6 ms to minimize.
SMT process timed out in 81948ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 2942/2942 transitions.
Applied a total of 0 rules in 73 ms. Remains 959 /959 variables (removed 0) and now considering 2942/2942 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 959/959 places, 2942/2942 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 2942/2942 transitions.
Applied a total of 0 rules in 70 ms. Remains 959 /959 variables (removed 0) and now considering 2942/2942 (removed 0) transitions.
[2024-05-24 16:27:15] [INFO ] Flow matrix only has 2546 transitions (discarded 396 similar events)
[2024-05-24 16:27:15] [INFO ] Invariant cache hit.
[2024-05-24 16:27:16] [INFO ] Implicit Places using invariants in 966 ms returned []
[2024-05-24 16:27:16] [INFO ] Flow matrix only has 2546 transitions (discarded 396 similar events)
[2024-05-24 16:27:16] [INFO ] Invariant cache hit.
[2024-05-24 16:27:17] [INFO ] State equation strengthened by 1398 read => feed constraints.
[2024-05-24 16:27:36] [INFO ] Implicit Places using invariants and state equation in 19271 ms returned []
Implicit Place search using SMT with State Equation took 20239 ms to find 0 implicit places.
[2024-05-24 16:27:36] [INFO ] Redundant transitions in 96 ms returned []
Running 2880 sub problems to find dead transitions.
[2024-05-24 16:27:36] [INFO ] Flow matrix only has 2546 transitions (discarded 396 similar events)
[2024-05-24 16:27:36] [INFO ] Invariant cache hit.
[2024-05-24 16:27:36] [INFO ] State equation strengthened by 1398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/957 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2880 unsolved
SMT process timed out in 43743ms, After SMT, problems are : Problem set: 0 solved, 2880 unsolved
Search for dead transitions found 0 dead transitions in 43769ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64189 ms. Remains : 959/959 places, 2942/2942 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[p2, p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0)]
Stuttering acceptance computed with spot in 350 ms :[p2, p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0)]
Stuttering acceptance computed with spot in 347 ms :[p2, p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 840 ms.
Product exploration explored 100000 steps with 25000 reset in 879 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 394 ms :[p2, p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0)]
Support contains 4 out of 1140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1140 transition count 2562
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 19 place count 1140 transition count 2563
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 1140 transition count 2563
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 1130 transition count 2552
Deduced a syphon composed of 21 places in 2 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 1130 transition count 2552
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1129 transition count 2547
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1129 transition count 2547
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 1129 transition count 2547
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1128 transition count 2546
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1128 transition count 2546
Deduced a syphon composed of 37 places in 1 ms
Applied a total of 71 rules in 527 ms. Remains 1128 /1140 variables (removed 12) and now considering 2546/2562 (removed 16) transitions.
[2024-05-24 16:28:24] [INFO ] Redundant transitions in 77 ms returned []
Running 2529 sub problems to find dead transitions.
[2024-05-24 16:28:24] [INFO ] Flow matrix only has 2274 transitions (discarded 272 similar events)
// Phase 1: matrix 2274 rows 1128 cols
[2024-05-24 16:28:24] [INFO ] Computed 44 invariants in 55 ms
[2024-05-24 16:28:24] [INFO ] State equation strengthened by 834 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2529 unsolved
SMT process timed out in 32669ms, After SMT, problems are : Problem set: 0 solved, 2529 unsolved
Search for dead transitions found 0 dead transitions in 32691ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1128/1140 places, 2546/2562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33311 ms. Remains : 1128/1140 places, 2546/2562 transitions.
Support contains 4 out of 1140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1140/1140 places, 2562/2562 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1139 transition count 2561
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1139 transition count 2561
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1138 transition count 2556
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1138 transition count 2556
Applied a total of 4 rules in 112 ms. Remains 1138 /1140 variables (removed 2) and now considering 2556/2562 (removed 6) transitions.
[2024-05-24 16:28:56] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
// Phase 1: matrix 2284 rows 1138 cols
[2024-05-24 16:28:56] [INFO ] Computed 44 invariants in 31 ms
[2024-05-24 16:28:57] [INFO ] Implicit Places using invariants in 991 ms returned [538]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 993 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1137/1140 places, 2556/2562 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1136 transition count 2555
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1136 transition count 2555
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1135 transition count 2554
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1135 transition count 2554
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1134 transition count 2553
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1134 transition count 2553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1133 transition count 2548
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1133 transition count 2548
Applied a total of 8 rules in 239 ms. Remains 1133 /1137 variables (removed 4) and now considering 2548/2556 (removed 8) transitions.
[2024-05-24 16:28:58] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1133 cols
[2024-05-24 16:28:58] [INFO ] Computed 43 invariants in 20 ms
[2024-05-24 16:28:59] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-24 16:28:59] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
[2024-05-24 16:28:59] [INFO ] Invariant cache hit.
[2024-05-24 16:28:59] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:29:11] [INFO ] Implicit Places using invariants and state equation in 12414 ms returned [1105]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13397 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1132/1140 places, 2548/2562 transitions.
Applied a total of 0 rules in 45 ms. Remains 1132 /1132 variables (removed 0) and now considering 2548/2548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14787 ms. Remains : 1132/1140 places, 2548/2562 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04 finished in 458899 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((G(p1)&&p0))))'
Support contains 5 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1210 transition count 2703
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1210 transition count 2703
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 1198 transition count 2651
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 1198 transition count 2651
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1196 transition count 2641
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1196 transition count 2641
Applied a total of 64 rules in 186 ms. Remains 1196 /1228 variables (removed 32) and now considering 2641/2741 (removed 100) transitions.
[2024-05-24 16:29:11] [INFO ] Flow matrix only has 2369 transitions (discarded 272 similar events)
// Phase 1: matrix 2369 rows 1196 cols
[2024-05-24 16:29:11] [INFO ] Computed 57 invariants in 31 ms
[2024-05-24 16:29:12] [INFO ] Implicit Places using invariants in 1058 ms returned [243, 287, 341, 370, 443, 556, 566, 567, 611, 635, 818, 819, 1013]
[2024-05-24 16:29:12] [INFO ] Actually due to overlaps returned [370, 243, 287, 341, 443, 556, 566, 567, 635, 818, 819, 1013]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1063 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1184/1228 places, 2641/2741 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1173 transition count 2630
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1173 transition count 2630
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1162 transition count 2619
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1162 transition count 2619
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1151 transition count 2608
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1151 transition count 2608
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1143 transition count 2568
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1143 transition count 2568
Applied a total of 82 rules in 245 ms. Remains 1143 /1184 variables (removed 41) and now considering 2568/2641 (removed 73) transitions.
[2024-05-24 16:29:13] [INFO ] Flow matrix only has 2296 transitions (discarded 272 similar events)
// Phase 1: matrix 2296 rows 1143 cols
[2024-05-24 16:29:13] [INFO ] Computed 45 invariants in 25 ms
[2024-05-24 16:29:14] [INFO ] Implicit Places using invariants in 1004 ms returned [583]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1006 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1142/1228 places, 2568/2741 transitions.
Applied a total of 0 rules in 44 ms. Remains 1142 /1142 variables (removed 0) and now considering 2568/2568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2545 ms. Remains : 1142/1228 places, 2568/2741 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 finished in 2705 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))||F(p1)))'
Support contains 6 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1209 transition count 2694
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1209 transition count 2694
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 1198 transition count 2647
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 1198 transition count 2647
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1196 transition count 2637
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1196 transition count 2637
Applied a total of 64 rules in 179 ms. Remains 1196 /1228 variables (removed 32) and now considering 2637/2741 (removed 104) transitions.
[2024-05-24 16:29:14] [INFO ] Flow matrix only has 2365 transitions (discarded 272 similar events)
// Phase 1: matrix 2365 rows 1196 cols
[2024-05-24 16:29:14] [INFO ] Computed 57 invariants in 37 ms
[2024-05-24 16:29:15] [INFO ] Implicit Places using invariants in 1074 ms returned [243, 287, 341, 370, 442, 555, 566, 612, 636, 637, 816, 1013]
[2024-05-24 16:29:15] [INFO ] Actually due to overlaps returned [370, 243, 287, 341, 442, 555, 566, 636, 637, 816, 1013]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1076 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1185/1228 places, 2637/2741 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1175 transition count 2627
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1175 transition count 2627
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1165 transition count 2617
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1165 transition count 2617
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1155 transition count 2607
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1155 transition count 2607
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 1148 transition count 2572
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 1148 transition count 2572
Applied a total of 74 rules in 237 ms. Remains 1148 /1185 variables (removed 37) and now considering 2572/2637 (removed 65) transitions.
[2024-05-24 16:29:15] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1148 cols
[2024-05-24 16:29:15] [INFO ] Computed 46 invariants in 29 ms
[2024-05-24 16:29:16] [INFO ] Implicit Places using invariants in 1012 ms returned [588]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1014 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1228 places, 2572/2741 transitions.
Applied a total of 0 rules in 42 ms. Remains 1147 /1147 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2548 ms. Remains : 1147/1228 places, 2572/2741 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06 finished in 2685 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 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1207 transition count 2692
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1207 transition count 2692
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 1194 transition count 2639
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 1194 transition count 2639
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 1191 transition count 2624
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 1191 transition count 2624
Applied a total of 74 rules in 191 ms. Remains 1191 /1228 variables (removed 37) and now considering 2624/2741 (removed 117) transitions.
[2024-05-24 16:29:17] [INFO ] Flow matrix only has 2352 transitions (discarded 272 similar events)
// Phase 1: matrix 2352 rows 1191 cols
[2024-05-24 16:29:17] [INFO ] Computed 57 invariants in 34 ms
[2024-05-24 16:29:18] [INFO ] Implicit Places using invariants in 1097 ms returned [243, 287, 341, 370, 442, 555, 565, 566, 610, 634, 635, 813, 814, 1008]
[2024-05-24 16:29:18] [INFO ] Actually due to overlaps returned [370, 243, 287, 341, 442, 555, 565, 566, 634, 635, 813, 814, 1008]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1099 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1178/1228 places, 2624/2741 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1166 transition count 2612
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1166 transition count 2612
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1154 transition count 2600
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1154 transition count 2600
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 1143 transition count 2589
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 1143 transition count 2589
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 1135 transition count 2549
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 1135 transition count 2549
Applied a total of 86 rules in 236 ms. Remains 1135 /1178 variables (removed 43) and now considering 2549/2624 (removed 75) transitions.
[2024-05-24 16:29:18] [INFO ] Flow matrix only has 2277 transitions (discarded 272 similar events)
// Phase 1: matrix 2277 rows 1135 cols
[2024-05-24 16:29:18] [INFO ] Computed 44 invariants in 25 ms
[2024-05-24 16:29:19] [INFO ] Implicit Places using invariants in 976 ms returned [584]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 977 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1134/1228 places, 2549/2741 transitions.
Applied a total of 0 rules in 43 ms. Remains 1134 /1134 variables (removed 0) and now considering 2549/2549 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2546 ms. Remains : 1134/1228 places, 2549/2741 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08
Entered a terminal (fully accepting) state of product in 66 steps with 1 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 finished in 2654 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(p0))))'
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1208 transition count 2693
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1208 transition count 2693
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 1196 transition count 2645
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 1196 transition count 2645
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 1193 transition count 2630
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 1193 transition count 2630
Applied a total of 70 rules in 186 ms. Remains 1193 /1228 variables (removed 35) and now considering 2630/2741 (removed 111) transitions.
[2024-05-24 16:29:19] [INFO ] Flow matrix only has 2358 transitions (discarded 272 similar events)
// Phase 1: matrix 2358 rows 1193 cols
[2024-05-24 16:29:19] [INFO ] Computed 57 invariants in 29 ms
[2024-05-24 16:29:20] [INFO ] Implicit Places using invariants in 1004 ms returned [243, 287, 341, 370, 442, 555, 565, 566, 610, 634, 635, 815, 816, 1010]
[2024-05-24 16:29:20] [INFO ] Actually due to overlaps returned [370, 243, 287, 341, 442, 555, 565, 566, 634, 635, 815, 816, 1010]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1180/1228 places, 2630/2741 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1168 transition count 2618
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1168 transition count 2618
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1156 transition count 2606
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1156 transition count 2606
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1144 transition count 2594
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1144 transition count 2594
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 1135 transition count 2549
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 1135 transition count 2549
Applied a total of 90 rules in 240 ms. Remains 1135 /1180 variables (removed 45) and now considering 2549/2630 (removed 81) transitions.
[2024-05-24 16:29:21] [INFO ] Flow matrix only has 2277 transitions (discarded 272 similar events)
// Phase 1: matrix 2277 rows 1135 cols
[2024-05-24 16:29:21] [INFO ] Computed 44 invariants in 25 ms
[2024-05-24 16:29:22] [INFO ] Implicit Places using invariants in 984 ms returned [582]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 986 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1134/1228 places, 2549/2741 transitions.
Applied a total of 0 rules in 44 ms. Remains 1134 /1134 variables (removed 0) and now considering 2549/2549 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2467 ms. Remains : 1134/1228 places, 2549/2741 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09 finished in 2586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1208 transition count 2697
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1208 transition count 2697
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 1195 transition count 2644
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 1195 transition count 2644
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 1192 transition count 2629
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 1192 transition count 2629
Applied a total of 72 rules in 182 ms. Remains 1192 /1228 variables (removed 36) and now considering 2629/2741 (removed 112) transitions.
[2024-05-24 16:29:22] [INFO ] Flow matrix only has 2357 transitions (discarded 272 similar events)
// Phase 1: matrix 2357 rows 1192 cols
[2024-05-24 16:29:22] [INFO ] Computed 57 invariants in 34 ms
[2024-05-24 16:29:23] [INFO ] Implicit Places using invariants in 1064 ms returned [243, 287, 341, 371, 443, 556, 566, 567, 611, 635, 636, 814, 815, 1009]
[2024-05-24 16:29:23] [INFO ] Actually due to overlaps returned [371, 243, 287, 341, 443, 556, 566, 567, 635, 636, 814, 815, 1009]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1179/1228 places, 2629/2741 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1167 transition count 2617
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1167 transition count 2617
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1155 transition count 2605
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1155 transition count 2605
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1143 transition count 2593
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1143 transition count 2593
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 1134 transition count 2548
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 1134 transition count 2548
Applied a total of 90 rules in 240 ms. Remains 1134 /1179 variables (removed 45) and now considering 2548/2629 (removed 81) transitions.
[2024-05-24 16:29:23] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1134 cols
[2024-05-24 16:29:23] [INFO ] Computed 44 invariants in 28 ms
[2024-05-24 16:29:24] [INFO ] Implicit Places using invariants in 1001 ms returned [583]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1003 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1133/1228 places, 2548/2741 transitions.
Applied a total of 0 rules in 45 ms. Remains 1133 /1133 variables (removed 0) and now considering 2548/2548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2535 ms. Remains : 1133/1228 places, 2548/2741 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 finished in 2681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 30 place count 1213 transition count 2707
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 68 place count 1194 transition count 2707
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 85 place count 1177 transition count 2666
Iterating global reduction 2 with 17 rules applied. Total rules applied 102 place count 1177 transition count 2666
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 102 place count 1177 transition count 2661
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 1172 transition count 2661
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 1162 transition count 2611
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 1162 transition count 2611
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 178 place count 1139 transition count 2588
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 181 place count 1136 transition count 2585
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 1136 transition count 2585
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 187 place count 1133 transition count 2570
Iterating global reduction 2 with 3 rules applied. Total rules applied 190 place count 1133 transition count 2570
Applied a total of 190 rules in 387 ms. Remains 1133 /1228 variables (removed 95) and now considering 2570/2741 (removed 171) transitions.
[2024-05-24 16:29:25] [INFO ] Flow matrix only has 2298 transitions (discarded 272 similar events)
// Phase 1: matrix 2298 rows 1133 cols
[2024-05-24 16:29:25] [INFO ] Computed 57 invariants in 31 ms
[2024-05-24 16:29:26] [INFO ] Implicit Places using invariants in 1051 ms returned [221, 263, 317, 344, 414, 524, 534, 535, 574, 597, 598, 770, 771, 961]
[2024-05-24 16:29:26] [INFO ] Actually due to overlaps returned [344, 221, 263, 317, 414, 524, 534, 535, 597, 598, 770, 771, 961]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1053 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1120/1228 places, 2570/2741 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1111 transition count 2561
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1111 transition count 2561
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1102 transition count 2552
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1102 transition count 2552
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1097 transition count 2527
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1097 transition count 2527
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1094 transition count 2524
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1091 transition count 2521
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1091 transition count 2521
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1087 transition count 2501
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1087 transition count 2501
Applied a total of 66 rules in 368 ms. Remains 1087 /1120 variables (removed 33) and now considering 2501/2570 (removed 69) transitions.
[2024-05-24 16:29:26] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1087 cols
[2024-05-24 16:29:26] [INFO ] Computed 44 invariants in 29 ms
[2024-05-24 16:29:27] [INFO ] Implicit Places using invariants in 965 ms returned [553]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 966 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1086/1228 places, 2501/2741 transitions.
Applied a total of 0 rules in 74 ms. Remains 1086 /1086 variables (removed 0) and now considering 2501/2501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2848 ms. Remains : 1086/1228 places, 2501/2741 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 finished in 2942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(p1)))&&G(p2))))'
Support contains 8 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1209 transition count 2698
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1209 transition count 2698
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1197 transition count 2650
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1197 transition count 2650
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1194 transition count 2635
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1194 transition count 2635
Applied a total of 68 rules in 185 ms. Remains 1194 /1228 variables (removed 34) and now considering 2635/2741 (removed 106) transitions.
[2024-05-24 16:29:28] [INFO ] Flow matrix only has 2363 transitions (discarded 272 similar events)
// Phase 1: matrix 2363 rows 1194 cols
[2024-05-24 16:29:28] [INFO ] Computed 57 invariants in 31 ms
[2024-05-24 16:29:29] [INFO ] Implicit Places using invariants in 982 ms returned [243, 287, 341, 442, 555, 565, 566, 634, 635, 814, 1011]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 985 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1183/1228 places, 2635/2741 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 2624
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 2624
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1161 transition count 2613
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1161 transition count 2613
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1150 transition count 2602
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1150 transition count 2602
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1142 transition count 2562
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1142 transition count 2562
Applied a total of 82 rules in 234 ms. Remains 1142 /1183 variables (removed 41) and now considering 2562/2635 (removed 73) transitions.
[2024-05-24 16:29:29] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1142 cols
[2024-05-24 16:29:29] [INFO ] Computed 46 invariants in 29 ms
[2024-05-24 16:29:30] [INFO ] Implicit Places using invariants in 943 ms returned []
[2024-05-24 16:29:30] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2024-05-24 16:29:30] [INFO ] Invariant cache hit.
[2024-05-24 16:29:30] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 16:29:42] [INFO ] Implicit Places using invariants and state equation in 12170 ms returned []
Implicit Place search using SMT with State Equation took 13116 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1142/1228 places, 2562/2741 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14521 ms. Remains : 1142/1228 places, 2562/2741 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12
Entered a terminal (fully accepting) state of product in 19091 steps with 367 reset in 81 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12 finished in 14791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(p0)'
Support contains 1 out of 1228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1228 transition count 2727
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 1214 transition count 2727
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 28 place count 1214 transition count 2708
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 66 place count 1195 transition count 2708
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 84 place count 1177 transition count 2662
Iterating global reduction 2 with 18 rules applied. Total rules applied 102 place count 1177 transition count 2662
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 102 place count 1177 transition count 2657
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 1172 transition count 2657
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 1162 transition count 2607
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 1162 transition count 2607
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 178 place count 1139 transition count 2584
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 180 place count 1137 transition count 2582
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 1137 transition count 2582
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 184 place count 1135 transition count 2572
Iterating global reduction 2 with 2 rules applied. Total rules applied 186 place count 1135 transition count 2572
Applied a total of 186 rules in 354 ms. Remains 1135 /1228 variables (removed 93) and now considering 2572/2741 (removed 169) transitions.
[2024-05-24 16:29:43] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1135 cols
[2024-05-24 16:29:43] [INFO ] Computed 57 invariants in 32 ms
[2024-05-24 16:29:44] [INFO ] Implicit Places using invariants in 1033 ms returned [221, 263, 317, 344, 526, 536, 537, 576, 599, 600, 772, 773, 963]
[2024-05-24 16:29:44] [INFO ] Actually due to overlaps returned [344, 221, 263, 317, 526, 536, 537, 599, 600, 772, 773, 963]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1036 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1123/1228 places, 2572/2741 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1114 transition count 2563
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1114 transition count 2563
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1105 transition count 2554
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1105 transition count 2554
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1100 transition count 2529
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1100 transition count 2529
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1098 transition count 2527
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1096 transition count 2525
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1096 transition count 2525
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1093 transition count 2510
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1093 transition count 2510
Applied a total of 60 rules in 366 ms. Remains 1093 /1123 variables (removed 30) and now considering 2510/2572 (removed 62) transitions.
[2024-05-24 16:29:44] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1093 cols
[2024-05-24 16:29:44] [INFO ] Computed 45 invariants in 28 ms
[2024-05-24 16:29:45] [INFO ] Implicit Places using invariants in 964 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 966 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1228 places, 2510/2741 transitions.
Applied a total of 0 rules in 75 ms. Remains 1092 /1092 variables (removed 0) and now considering 2510/2510 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2797 ms. Remains : 1092/1228 places, 2510/2741 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 finished in 2931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1207 transition count 2692
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1207 transition count 2692
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 1194 transition count 2639
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 1194 transition count 2639
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 1191 transition count 2624
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 1191 transition count 2624
Applied a total of 74 rules in 185 ms. Remains 1191 /1228 variables (removed 37) and now considering 2624/2741 (removed 117) transitions.
[2024-05-24 16:29:45] [INFO ] Flow matrix only has 2352 transitions (discarded 272 similar events)
// Phase 1: matrix 2352 rows 1191 cols
[2024-05-24 16:29:45] [INFO ] Computed 57 invariants in 31 ms
[2024-05-24 16:29:46] [INFO ] Implicit Places using invariants in 1030 ms returned [243, 287, 341, 370, 442, 555, 565, 566, 610, 634, 635, 813, 814, 1008]
[2024-05-24 16:29:46] [INFO ] Actually due to overlaps returned [370, 243, 287, 341, 442, 555, 565, 566, 634, 635, 813, 814, 1008]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1033 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1178/1228 places, 2624/2741 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1166 transition count 2612
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1166 transition count 2612
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1154 transition count 2600
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1154 transition count 2600
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1142 transition count 2588
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1142 transition count 2588
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 1133 transition count 2543
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 1133 transition count 2543
Applied a total of 90 rules in 232 ms. Remains 1133 /1178 variables (removed 45) and now considering 2543/2624 (removed 81) transitions.
[2024-05-24 16:29:47] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1133 cols
[2024-05-24 16:29:47] [INFO ] Computed 44 invariants in 21 ms
[2024-05-24 16:29:48] [INFO ] Implicit Places using invariants in 967 ms returned [582]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 968 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1132/1228 places, 2543/2741 transitions.
Applied a total of 0 rules in 44 ms. Remains 1132 /1132 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2462 ms. Remains : 1132/1228 places, 2543/2741 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15
Product exploration explored 100000 steps with 48583 reset in 652 ms.
Product exploration explored 100000 steps with 48567 reset in 625 ms.
Computed a total of 300 stabilizing places and 910 stable transitions
Computed a total of 300 stabilizing places and 910 stable transitions
Detected a total of 300/1132 stabilizing places and 910/2543 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 finished in 3861 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)))'
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(G(p0))||G(p1))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1228/1228 places, 2741/2741 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1228 transition count 2726
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1213 transition count 2726
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1213 transition count 2708
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1195 transition count 2708
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 82 place count 1179 transition count 2668
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 1179 transition count 2668
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 98 place count 1179 transition count 2664
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 1175 transition count 2664
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 115 place count 1166 transition count 2619
Iterating global reduction 2 with 9 rules applied. Total rules applied 124 place count 1166 transition count 2619
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 172 place count 1142 transition count 2595
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 1139 transition count 2592
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 1139 transition count 2592
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 181 place count 1136 transition count 2577
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 1136 transition count 2577
Applied a total of 184 rules in 361 ms. Remains 1136 /1228 variables (removed 92) and now considering 2577/2741 (removed 164) transitions.
[2024-05-24 16:29:50] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1136 cols
[2024-05-24 16:29:50] [INFO ] Computed 57 invariants in 35 ms
[2024-05-24 16:29:51] [INFO ] Implicit Places using invariants in 1034 ms returned [222, 264, 318, 345, 415, 525, 535, 578, 601, 602, 774, 775, 965]
[2024-05-24 16:29:51] [INFO ] Actually due to overlaps returned [345, 222, 264, 318, 415, 525, 535, 601, 602, 774, 775, 965]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1037 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1124/1228 places, 2577/2741 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1116 transition count 2569
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1116 transition count 2569
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1108 transition count 2561
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1108 transition count 2561
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1104 transition count 2541
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1104 transition count 2541
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 1101 transition count 2538
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1098 transition count 2535
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1098 transition count 2535
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1094 transition count 2515
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1094 transition count 2515
Applied a total of 60 rules in 352 ms. Remains 1094 /1124 variables (removed 30) and now considering 2515/2577 (removed 62) transitions.
[2024-05-24 16:29:51] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1094 cols
[2024-05-24 16:29:51] [INFO ] Computed 45 invariants in 32 ms
[2024-05-24 16:29:52] [INFO ] Implicit Places using invariants in 991 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 993 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1093/1228 places, 2515/2741 transitions.
Applied a total of 0 rules in 56 ms. Remains 1093 /1093 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2799 ms. Remains : 1093/1228 places, 2515/2741 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03
Product exploration explored 100000 steps with 2720 reset in 494 ms.
Product exploration explored 100000 steps with 2721 reset in 524 ms.
Computed a total of 278 stabilizing places and 899 stable transitions
Computed a total of 278 stabilizing places and 899 stable transitions
Detected a total of 278/1093 stabilizing places and 899/2515 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 39806 steps (1080 resets) in 267 ms. (148 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2515/2515 transitions.
Applied a total of 0 rules in 77 ms. Remains 1093 /1093 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2024-05-24 16:29:54] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1093 cols
[2024-05-24 16:29:54] [INFO ] Computed 44 invariants in 26 ms
[2024-05-24 16:29:55] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-24 16:29:55] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
[2024-05-24 16:29:55] [INFO ] Invariant cache hit.
[2024-05-24 16:29:55] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 16:30:06] [INFO ] Implicit Places using invariants and state equation in 11030 ms returned [1072]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11993 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1092/1093 places, 2515/2515 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1092 transition count 2514
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1091 transition count 2514
Applied a total of 2 rules in 81 ms. Remains 1091 /1092 variables (removed 1) and now considering 2514/2515 (removed 1) transitions.
[2024-05-24 16:30:06] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
// Phase 1: matrix 2242 rows 1091 cols
[2024-05-24 16:30:06] [INFO ] Computed 43 invariants in 26 ms
[2024-05-24 16:30:07] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-24 16:30:07] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 16:30:07] [INFO ] Invariant cache hit.
[2024-05-24 16:30:08] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 16:30:17] [INFO ] Implicit Places using invariants and state equation in 10427 ms returned []
Implicit Place search using SMT with State Equation took 11392 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1093 places, 2514/2515 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23544 ms. Remains : 1091/1093 places, 2514/2515 transitions.
Computed a total of 276 stabilizing places and 898 stable transitions
Computed a total of 276 stabilizing places and 898 stable transitions
Detected a total of 276/1091 stabilizing places and 898/2514 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (1087 resets) in 270 ms. (147 steps per ms) remains 1/2 properties
BEST_FIRST walk for 28843 steps (157 resets) in 60 ms. (472 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 2719 reset in 488 ms.
Product exploration explored 100000 steps with 2722 reset in 511 ms.
Support contains 4 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2514/2514 transitions.
Applied a total of 0 rules in 71 ms. Remains 1091 /1091 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2024-05-24 16:30:19] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 16:30:19] [INFO ] Invariant cache hit.
[2024-05-24 16:30:20] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-24 16:30:20] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 16:30:20] [INFO ] Invariant cache hit.
[2024-05-24 16:30:21] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 16:30:31] [INFO ] Implicit Places using invariants and state equation in 10616 ms returned []
Implicit Place search using SMT with State Equation took 11569 ms to find 0 implicit places.
[2024-05-24 16:30:31] [INFO ] Redundant transitions in 77 ms returned []
Running 2497 sub problems to find dead transitions.
[2024-05-24 16:30:31] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 16:30:31] [INFO ] Invariant cache hit.
[2024-05-24 16:30:31] [INFO ] State equation strengthened by 838 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2497 unsolved
SMT process timed out in 32653ms, After SMT, problems are : Problem set: 0 solved, 2497 unsolved
Search for dead transitions found 0 dead transitions in 32676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44406 ms. Remains : 1091/1091 places, 2514/2514 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 finished in 74575 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) U X(X(X((G(p1) U !p2))))))'
[2024-05-24 16:31:04] [INFO ] Flatten gal took : 98 ms
[2024-05-24 16:31:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-24 16:31:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1228 places, 2741 transitions and 12152 arcs took 20 ms.
Total runtime 896151 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MultiCrashLeafsetExtension-PT-S16C05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1228
TRANSITIONS: 2741
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.059s, Sys 0.011s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.004s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 3782
MODEL NAME: /home/mcc/execution/413/model
1228 places, 2741 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
EXITCODE: 80
----------------------------------------------------------------------
BK_STOP 1716570964024
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
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="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r245-tall-171654349000028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 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 ;