About the Execution of 2020-gold for ASLink-PT-09b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4302.588 | 3600000.00 | 1782699.00 | 5132.00 | TFFTTFTTFTTTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r011-tall-162038005900076.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ASLink-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038005900076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.3M May 5 16:51 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 ASLink-PT-09b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1620414991106
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 19:16:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-07 19:16:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 19:16:33] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2021-05-07 19:16:33] [INFO ] Transformed 4014 places.
[2021-05-07 19:16:33] [INFO ] Transformed 4932 transitions.
[2021-05-07 19:16:33] [INFO ] Found NUPN structural information;
[2021-05-07 19:16:33] [INFO ] Parsed PT model containing 4014 places and 4932 transitions in 441 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 199 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 192 ms. (steps per millisecond=52 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1]
FORMULA ASLink-PT-09b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA ASLink-PT-09b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-09b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4932 rows 4014 cols
[2021-05-07 19:16:34] [INFO ] Computed 394 place invariants in 566 ms
[2021-05-07 19:16:35] [INFO ] [Real]Absence check using 93 positive place invariants in 286 ms returned sat
[2021-05-07 19:16:36] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 664 ms returned sat
[2021-05-07 19:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:16:39] [INFO ] [Real]Absence check using state equation in 3264 ms returned (error "Failed to check-sat")
[2021-05-07 19:16:40] [INFO ] [Real]Absence check using 93 positive place invariants in 264 ms returned sat
[2021-05-07 19:16:41] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 756 ms returned sat
[2021-05-07 19:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:44] [INFO ] [Real]Absence check using state equation in 3461 ms returned (error "Solver has unexpectedly terminated")
[2021-05-07 19:16:45] [INFO ] [Real]Absence check using 93 positive place invariants in 254 ms returned sat
[2021-05-07 19:16:46] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 658 ms returned sat
[2021-05-07 19:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:49] [INFO ] [Real]Absence check using state equation in 3618 ms returned (error "Solver has unexpectedly terminated")
[2021-05-07 19:16:50] [INFO ] [Real]Absence check using 93 positive place invariants in 257 ms returned sat
[2021-05-07 19:16:51] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 516 ms returned unsat
[2021-05-07 19:16:51] [INFO ] [Real]Absence check using 93 positive place invariants in 257 ms returned sat
[2021-05-07 19:16:52] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 754 ms returned sat
[2021-05-07 19:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:16:56] [INFO ] [Real]Absence check using state equation in 3525 ms returned (error "Failed to check-sat")
[2021-05-07 19:16:56] [INFO ] [Real]Absence check using 93 positive place invariants in 251 ms returned sat
[2021-05-07 19:16:57] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 654 ms returned sat
[2021-05-07 19:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:01] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:17:01] [INFO ] [Real]Absence check using state equation in 3638 ms returned (error "Failed to check-sat")
[2021-05-07 19:17:01] [INFO ] [Real]Absence check using 93 positive place invariants in 252 ms returned sat
[2021-05-07 19:17:02] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 648 ms returned sat
[2021-05-07 19:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:17:06] [INFO ] [Real]Absence check using state equation in 3645 ms returned (error "Failed to check-sat")
[2021-05-07 19:17:06] [INFO ] [Real]Absence check using 93 positive place invariants in 257 ms returned sat
[2021-05-07 19:17:07] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 769 ms returned sat
[2021-05-07 19:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:17:11] [INFO ] [Real]Absence check using state equation in 3500 ms returned (error "Failed to check-sat")
[2021-05-07 19:17:11] [INFO ] [Real]Absence check using 93 positive place invariants in 249 ms returned sat
[2021-05-07 19:17:12] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 654 ms returned sat
[2021-05-07 19:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:17:16] [INFO ] [Real]Absence check using state equation in 3636 ms returned (error "Failed to check-sat")
[2021-05-07 19:17:16] [INFO ] [Real]Absence check using 93 positive place invariants in 250 ms returned sat
[2021-05-07 19:17:17] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 657 ms returned sat
[2021-05-07 19:17:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:21] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:17:21] [INFO ] [Real]Absence check using state equation in 3628 ms returned (error "Failed to check-sat")
[2021-05-07 19:17:21] [INFO ] [Real]Absence check using 93 positive place invariants in 257 ms returned sat
[2021-05-07 19:17:22] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 759 ms returned sat
[2021-05-07 19:17:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:17:26] [INFO ] [Real]Absence check using state equation in 3523 ms returned (error "Failed to check-sat")
FORMULA ASLink-PT-09b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 40 out of 4014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Performed 925 Post agglomeration using F-continuation condition.Transition count delta: 925
Iterating post reduction 0 with 925 rules applied. Total rules applied 925 place count 4014 transition count 4007
Reduce places removed 925 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 967 rules applied. Total rules applied 1892 place count 3089 transition count 3965
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1903 place count 3078 transition count 3965
Performed 930 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 930 Pre rules applied. Total rules applied 1903 place count 3078 transition count 3035
Deduced a syphon composed of 930 places in 8 ms
Ensure Unique test removed 90 places
Reduce places removed 1020 places and 0 transitions.
Iterating global reduction 3 with 1950 rules applied. Total rules applied 3853 place count 2058 transition count 3035
Discarding 10 places :
Implicit places reduction removed 10 places
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 3 with 67 rules applied. Total rules applied 3920 place count 2048 transition count 2978
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 3977 place count 1991 transition count 2978
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3977 place count 1991 transition count 2945
Deduced a syphon composed of 33 places in 26 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 4076 place count 1925 transition count 2945
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 4076 place count 1925 transition count 2912
Deduced a syphon composed of 33 places in 28 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 4142 place count 1892 transition count 2912
Symmetric choice reduction at 5 with 127 rule applications. Total rules 4269 place count 1892 transition count 2912
Deduced a syphon composed of 127 places in 7 ms
Reduce places removed 127 places and 127 transitions.
Iterating global reduction 5 with 254 rules applied. Total rules applied 4523 place count 1765 transition count 2785
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4524 place count 1765 transition count 2784
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 4524 place count 1765 transition count 2743
Deduced a syphon composed of 41 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 83 rules applied. Total rules applied 4607 place count 1723 transition count 2743
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4607 place count 1723 transition count 2742
Deduced a syphon composed of 1 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 4610 place count 1721 transition count 2742
Symmetric choice reduction at 6 with 9 rule applications. Total rules 4619 place count 1721 transition count 2742
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 57 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 4637 place count 1712 transition count 2685
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 4637 place count 1712 transition count 2678
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 4651 place count 1705 transition count 2678
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4652 place count 1705 transition count 2678
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4654 place count 1704 transition count 2670
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4655 place count 1704 transition count 2670
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4657 place count 1703 transition count 2662
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4658 place count 1703 transition count 2662
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4660 place count 1702 transition count 2654
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4661 place count 1702 transition count 2654
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4663 place count 1701 transition count 2646
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4664 place count 1701 transition count 2646
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4666 place count 1700 transition count 2638
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4667 place count 1700 transition count 2638
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4669 place count 1699 transition count 2630
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: 228
Deduced a syphon composed of 228 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 229 places and 0 transitions.
Iterating global reduction 6 with 457 rules applied. Total rules applied 5126 place count 1470 transition count 2402
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5127 place count 1470 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5129 place count 1469 transition count 2401
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 5130 place count 1468 transition count 2401
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5131 place count 1468 transition count 2401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 5133 place count 1467 transition count 2400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 5135 place count 1467 transition count 2398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5136 place count 1466 transition count 2398
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 5138 place count 1465 transition count 2407
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 5148 place count 1465 transition count 2397
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 5158 place count 1455 transition count 2397
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 5168 place count 1455 transition count 2387
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 5178 place count 1445 transition count 2387
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 5179 place count 1445 transition count 2387
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 5180 place count 1445 transition count 2387
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 5181 place count 1444 transition count 2386
Reduce places removed 18 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 11 with 25 rules applied. Total rules applied 5206 place count 1426 transition count 2379
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 5213 place count 1419 transition count 2379
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 27 Pre rules applied. Total rules applied 5213 place count 1419 transition count 2352
Deduced a syphon composed of 27 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 13 with 55 rules applied. Total rules applied 5268 place count 1391 transition count 2352
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 13 with 10 rules applied. Total rules applied 5278 place count 1381 transition count 2352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 5278 place count 1381 transition count 2351
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 5280 place count 1380 transition count 2351
Symmetric choice reduction at 14 with 2 rule applications. Total rules 5282 place count 1380 transition count 2351
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 5286 place count 1378 transition count 2349
Symmetric choice reduction at 14 with 2 rule applications. Total rules 5288 place count 1378 transition count 2349
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 5292 place count 1376 transition count 2347
Symmetric choice reduction at 14 with 1 rule applications. Total rules 5293 place count 1376 transition count 2347
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 5295 place count 1375 transition count 2346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 5296 place count 1375 transition count 2345
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 15 with 34 rules applied. Total rules applied 5330 place count 1358 transition count 2328
Symmetric choice reduction at 15 with 7 rule applications. Total rules 5337 place count 1358 transition count 2328
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 15 with 14 rules applied. Total rules applied 5351 place count 1351 transition count 2321
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 5358 place count 1351 transition count 2314
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 5365 place count 1344 transition count 2314
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 5366 place count 1344 transition count 2314
Applied a total of 5366 rules in 2440 ms. Remains 1344 /4014 variables (removed 2670) and now considering 2314/4932 (removed 2618) transitions.
Finished structural reductions, in 1 iterations. Remains : 1344/4014 places, 2314/4932 transitions.
Incomplete random walk after 1000000 steps, including 8908 resets, run finished after 5778 ms. (steps per millisecond=173 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 923 resets, run finished after 1791 ms. (steps per millisecond=558 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 812 resets, run finished after 1986 ms. (steps per millisecond=503 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 918 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA ASLink-PT-09b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 901 resets, run finished after 1932 ms. (steps per millisecond=517 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 927 resets, run finished after 1834 ms. (steps per millisecond=545 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 928 resets, run finished after 1826 ms. (steps per millisecond=547 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 906 resets, run finished after 1995 ms. (steps per millisecond=501 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 859 resets, run finished after 1779 ms. (steps per millisecond=562 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 925 resets, run finished after 1952 ms. (steps per millisecond=512 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2314 rows 1344 cols
[2021-05-07 19:17:51] [INFO ] Computed 228 place invariants in 147 ms
[2021-05-07 19:17:51] [INFO ] [Real]Absence check using 54 positive place invariants in 66 ms returned sat
[2021-05-07 19:17:51] [INFO ] [Real]Absence check using 54 positive and 174 generalized place invariants in 139 ms returned sat
[2021-05-07 19:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:57] [INFO ] [Real]Absence check using state equation in 5692 ms returned sat
[2021-05-07 19:17:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:17:57] [INFO ] [Nat]Absence check using 54 positive place invariants in 71 ms returned sat
[2021-05-07 19:17:58] [INFO ] [Nat]Absence check using 54 positive and 174 generalized place invariants in 139 ms returned sat
[2021-05-07 19:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:18:04] [INFO ] [Nat]Absence check using state equation in 6189 ms returned sat
[2021-05-07 19:18:04] [INFO ] Computed and/alt/rep : 2267/25628/2267 causal constraints in 194 ms.
[2021-05-07 19:18:27] [INFO ] Added : 410 causal constraints over 82 iterations in 23389 ms.(timeout) Result :sat
[2021-05-07 19:18:28] [INFO ] Deduced a trap composed of 22 places in 352 ms
[2021-05-07 19:18:29] [INFO ] Deduced a trap composed of 41 places in 132 ms
[2021-05-07 19:18:30] [INFO ] Deduced a trap composed of 30 places in 139 ms
[2021-05-07 19:18:30] [INFO ] Deduced a trap composed of 26 places in 331 ms
[2021-05-07 19:18:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3009 ms
Attempting to minimize the solution found.
Minimization took 80 ms.
[2021-05-07 19:18:31] [INFO ] [Real]Absence check using 54 positive place invariants in 75 ms returned sat
[2021-05-07 19:18:31] [INFO ] [Real]Absence check using 54 positive and 174 generalized place invariants in 155 ms returned sat
[2021-05-07 19:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:18:36] [INFO ] [Real]Absence check using state equation in 5612 ms returned sat
[2021-05-07 19:18:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:18:37] [INFO ] [Nat]Absence check using 54 positive place invariants in 69 ms returned sat
[2021-05-07 19:18:37] [INFO ] [Nat]Absence check using 54 positive and 174 generalized place invariants in 146 ms returned sat
[2021-05-07 19:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:18:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:18:49] [INFO ] [Nat]Absence check using state equation in 12552 ms returned unknown
[2021-05-07 19:18:50] [INFO ] [Real]Absence check using 54 positive place invariants in 93 ms returned sat
[2021-05-07 19:18:50] [INFO ] [Real]Absence check using 54 positive and 174 generalized place invariants in 142 ms returned sat
[2021-05-07 19:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:18:56] [INFO ] [Real]Absence check using state equation in 5871 ms returned sat
[2021-05-07 19:18:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:18:56] [INFO ] [Nat]Absence check using 54 positive place invariants in 66 ms returned sat
[2021-05-07 19:18:56] [INFO ] [Nat]Absence check using 54 positive and 174 generalized place invariants in 139 ms returned sat
[2021-05-07 19:18:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:19:03] [INFO ] [Nat]Absence check using state equation in 6933 ms returned sat
[2021-05-07 19:19:03] [INFO ] Computed and/alt/rep : 2267/25628/2267 causal constraints in 141 ms.
[2021-05-07 19:19:23] [INFO ] Added : 420 causal constraints over 84 iterations in 20195 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 92 ms.
[2021-05-07 19:19:24] [INFO ] [Real]Absence check using 54 positive place invariants in 66 ms returned sat
[2021-05-07 19:19:24] [INFO ] [Real]Absence check using 54 positive and 174 generalized place invariants in 152 ms returned sat
[2021-05-07 19:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:19:30] [INFO ] [Real]Absence check using state equation in 6229 ms returned sat
[2021-05-07 19:19:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:19:30] [INFO ] [Nat]Absence check using 54 positive place invariants in 64 ms returned sat
[2021-05-07 19:19:31] [INFO ] [Nat]Absence check using 54 positive and 174 generalized place invariants in 149 ms returned sat
[2021-05-07 19:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:19:37] [INFO ] [Nat]Absence check using state equation in 6435 ms returned sat
[2021-05-07 19:19:37] [INFO ] Computed and/alt/rep : 2267/25628/2267 causal constraints in 126 ms.
[2021-05-07 19:19:57] [INFO ] Added : 500 causal constraints over 100 iterations in 20277 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 96 ms.
[2021-05-07 19:19:58] [INFO ] [Real]Absence check using 54 positive place invariants in 64 ms returned sat
[2021-05-07 19:19:58] [INFO ] [Real]Absence check using 54 positive and 174 generalized place invariants in 142 ms returned sat
[2021-05-07 19:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:04] [INFO ] [Real]Absence check using state equation in 6228 ms returned sat
[2021-05-07 19:20:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:20:04] [INFO ] [Nat]Absence check using 54 positive place invariants in 66 ms returned sat
[2021-05-07 19:20:05] [INFO ] [Nat]Absence check using 54 positive and 174 generalized place invariants in 141 ms returned sat
[2021-05-07 19:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:11] [INFO ] [Nat]Absence check using state equation in 6592 ms returned sat
[2021-05-07 19:20:11] [INFO ] Computed and/alt/rep : 2267/25628/2267 causal constraints in 159 ms.
[2021-05-07 19:20:31] [INFO ] Added : 510 causal constraints over 102 iterations in 20240 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 112 ms.
[2021-05-07 19:20:32] [INFO ] [Real]Absence check using 54 positive place invariants in 79 ms returned sat
[2021-05-07 19:20:32] [INFO ] [Real]Absence check using 54 positive and 174 generalized place invariants in 144 ms returned sat
[2021-05-07 19:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:39] [INFO ] [Real]Absence check using state equation in 6662 ms returned sat
[2021-05-07 19:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:20:39] [INFO ] [Nat]Absence check using 54 positive place invariants in 68 ms returned sat
[2021-05-07 19:20:39] [INFO ] [Nat]Absence check using 54 positive and 174 generalized place invariants in 143 ms returned sat
[2021-05-07 19:20:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:41] [INFO ] [Nat]Absence check using state equation in 2181 ms returned unsat
[2021-05-07 19:20:42] [INFO ] [Real]Absence check using 54 positive place invariants in 68 ms returned sat
[2021-05-07 19:20:42] [INFO ] [Real]Absence check using 54 positive and 174 generalized place invariants in 156 ms returned sat
[2021-05-07 19:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:48] [INFO ] [Real]Absence check using state equation in 6193 ms returned sat
[2021-05-07 19:20:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:20:48] [INFO ] [Nat]Absence check using 54 positive place invariants in 68 ms returned sat
[2021-05-07 19:20:48] [INFO ] [Nat]Absence check using 54 positive and 174 generalized place invariants in 156 ms returned sat
[2021-05-07 19:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:53] [INFO ] [Nat]Absence check using state equation in 4560 ms returned unsat
[2021-05-07 19:20:53] [INFO ] [Real]Absence check using 54 positive place invariants in 66 ms returned sat
[2021-05-07 19:20:53] [INFO ] [Real]Absence check using 54 positive and 174 generalized place invariants in 144 ms returned sat
[2021-05-07 19:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:21:00] [INFO ] [Real]Absence check using state equation in 6126 ms returned sat
[2021-05-07 19:21:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:21:00] [INFO ] [Nat]Absence check using 54 positive place invariants in 65 ms returned sat
[2021-05-07 19:21:00] [INFO ] [Nat]Absence check using 54 positive and 174 generalized place invariants in 141 ms returned sat
[2021-05-07 19:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:21:07] [INFO ] [Nat]Absence check using state equation in 7279 ms returned sat
[2021-05-07 19:21:07] [INFO ] Computed and/alt/rep : 2267/25628/2267 causal constraints in 128 ms.
[2021-05-07 19:21:29] [INFO ] Added : 415 causal constraints over 83 iterations in 22241 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 91 ms.
[2021-05-07 19:21:30] [INFO ] [Real]Absence check using 54 positive place invariants in 67 ms returned sat
[2021-05-07 19:21:30] [INFO ] [Real]Absence check using 54 positive and 174 generalized place invariants in 154 ms returned sat
[2021-05-07 19:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:21:37] [INFO ] [Real]Absence check using state equation in 6776 ms returned sat
[2021-05-07 19:21:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:21:37] [INFO ] [Nat]Absence check using 54 positive place invariants in 67 ms returned sat
[2021-05-07 19:21:37] [INFO ] [Nat]Absence check using 54 positive and 174 generalized place invariants in 152 ms returned sat
[2021-05-07 19:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:21:38] [INFO ] [Nat]Absence check using state equation in 452 ms returned unsat
FORMULA ASLink-PT-09b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 577300 steps, including 7268 resets, run finished after 3612 ms. (steps per millisecond=159 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 601900 steps, including 7528 resets, run finished after 3755 ms. (steps per millisecond=160 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 678600 steps, including 8457 resets, run finished after 4120 ms. (steps per millisecond=164 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 446600 steps, including 5850 resets, run finished after 2719 ms. (steps per millisecond=164 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 792600 steps, including 9678 resets, run finished after 4775 ms. (steps per millisecond=165 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 23 out of 1344 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1344/1344 places, 2314/2314 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1344 transition count 2313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1343 transition count 2313
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 1343 transition count 2308
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 1338 transition count 2308
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 1334 transition count 2304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 1333 transition count 2303
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 1333 transition count 2301
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 1331 transition count 2301
Applied a total of 26 rules in 176 ms. Remains 1331 /1344 variables (removed 13) and now considering 2301/2314 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 1331/1344 places, 2301/2314 transitions.
Incomplete random walk after 1000000 steps, including 8955 resets, run finished after 5379 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 926 resets, run finished after 1706 ms. (steps per millisecond=586 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 805 resets, run finished after 1890 ms. (steps per millisecond=529 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 917 resets, run finished after 1761 ms. (steps per millisecond=567 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 902 resets, run finished after 1841 ms. (steps per millisecond=543 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 921 resets, run finished after 1738 ms. (steps per millisecond=575 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 848 resets, run finished after 1687 ms. (steps per millisecond=592 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 2763378 steps, run timeout after 30001 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 2763378 steps, saw 446827 distinct states, run finished after 30001 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2301 rows 1331 cols
[2021-05-07 19:22:43] [INFO ] Computed 228 place invariants in 46 ms
[2021-05-07 19:22:43] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2021-05-07 19:22:43] [INFO ] [Real]Absence check using 60 positive and 168 generalized place invariants in 128 ms returned sat
[2021-05-07 19:22:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:22:50] [INFO ] [Real]Absence check using state equation in 6248 ms returned sat
[2021-05-07 19:22:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:22:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 63 ms returned sat
[2021-05-07 19:22:50] [INFO ] [Nat]Absence check using 60 positive and 168 generalized place invariants in 129 ms returned sat
[2021-05-07 19:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:22:57] [INFO ] [Nat]Absence check using state equation in 7113 ms returned sat
[2021-05-07 19:22:57] [INFO ] Computed and/alt/rep : 2251/25669/2251 causal constraints in 109 ms.
[2021-05-07 19:23:18] [INFO ] Added : 460 causal constraints over 92 iterations in 20543 ms.(timeout) Result :sat
[2021-05-07 19:23:18] [INFO ] Deduced a trap composed of 98 places in 523 ms
[2021-05-07 19:23:19] [INFO ] Deduced a trap composed of 104 places in 520 ms
[2021-05-07 19:23:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1478 ms
Attempting to minimize the solution found.
Minimization took 107 ms.
[2021-05-07 19:23:20] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2021-05-07 19:23:20] [INFO ] [Real]Absence check using 60 positive and 168 generalized place invariants in 135 ms returned sat
[2021-05-07 19:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:26] [INFO ] [Real]Absence check using state equation in 6039 ms returned sat
[2021-05-07 19:23:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:23:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 64 ms returned sat
[2021-05-07 19:23:26] [INFO ] [Nat]Absence check using 60 positive and 168 generalized place invariants in 133 ms returned sat
[2021-05-07 19:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:23:39] [INFO ] [Nat]Absence check using state equation in 12724 ms returned unknown
[2021-05-07 19:23:39] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2021-05-07 19:23:39] [INFO ] [Real]Absence check using 60 positive and 168 generalized place invariants in 126 ms returned sat
[2021-05-07 19:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:45] [INFO ] [Real]Absence check using state equation in 5787 ms returned sat
[2021-05-07 19:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:23:45] [INFO ] [Nat]Absence check using 60 positive place invariants in 62 ms returned sat
[2021-05-07 19:23:45] [INFO ] [Nat]Absence check using 60 positive and 168 generalized place invariants in 126 ms returned sat
[2021-05-07 19:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:52] [INFO ] [Nat]Absence check using state equation in 6166 ms returned sat
[2021-05-07 19:23:52] [INFO ] Deduced a trap composed of 57 places in 142 ms
[2021-05-07 19:23:52] [INFO ] Deduced a trap composed of 38 places in 140 ms
[2021-05-07 19:23:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2021-05-07 19:23:52] [INFO ] Computed and/alt/rep : 2251/25669/2251 causal constraints in 119 ms.
[2021-05-07 19:24:13] [INFO ] Added : 460 causal constraints over 92 iterations in 20688 ms.(timeout) Result :sat
[2021-05-07 19:24:13] [INFO ] Deduced a trap composed of 32 places in 176 ms
[2021-05-07 19:24:13] [INFO ] Deduced a trap composed of 48 places in 166 ms
[2021-05-07 19:24:14] [INFO ] Deduced a trap composed of 45 places in 164 ms
[2021-05-07 19:24:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1102 ms
Attempting to minimize the solution found.
Minimization took 106 ms.
[2021-05-07 19:24:14] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2021-05-07 19:24:14] [INFO ] [Real]Absence check using 60 positive and 168 generalized place invariants in 133 ms returned sat
[2021-05-07 19:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:24:21] [INFO ] [Real]Absence check using state equation in 6179 ms returned sat
[2021-05-07 19:24:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:24:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 64 ms returned sat
[2021-05-07 19:24:21] [INFO ] [Nat]Absence check using 60 positive and 168 generalized place invariants in 134 ms returned sat
[2021-05-07 19:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:24:27] [INFO ] [Nat]Absence check using state equation in 5811 ms returned sat
[2021-05-07 19:24:27] [INFO ] Deduced a trap composed of 21 places in 118 ms
[2021-05-07 19:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2021-05-07 19:24:27] [INFO ] Computed and/alt/rep : 2251/25669/2251 causal constraints in 110 ms.
[2021-05-07 19:24:47] [INFO ] Added : 460 causal constraints over 92 iterations in 20215 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 104 ms.
[2021-05-07 19:24:48] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2021-05-07 19:24:48] [INFO ] [Real]Absence check using 60 positive and 168 generalized place invariants in 140 ms returned sat
[2021-05-07 19:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:24:54] [INFO ] [Real]Absence check using state equation in 5894 ms returned sat
[2021-05-07 19:24:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:24:54] [INFO ] [Nat]Absence check using 60 positive place invariants in 63 ms returned sat
[2021-05-07 19:24:54] [INFO ] [Nat]Absence check using 60 positive and 168 generalized place invariants in 127 ms returned sat
[2021-05-07 19:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:25:00] [INFO ] [Nat]Absence check using state equation in 6321 ms returned sat
[2021-05-07 19:25:01] [INFO ] Computed and/alt/rep : 2251/25669/2251 causal constraints in 110 ms.
[2021-05-07 19:25:21] [INFO ] Added : 435 causal constraints over 87 iterations in 20212 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 92 ms.
[2021-05-07 19:25:21] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2021-05-07 19:25:21] [INFO ] [Real]Absence check using 60 positive and 168 generalized place invariants in 125 ms returned sat
[2021-05-07 19:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:25:27] [INFO ] [Real]Absence check using state equation in 5731 ms returned sat
[2021-05-07 19:25:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:25:27] [INFO ] [Nat]Absence check using 60 positive place invariants in 62 ms returned sat
[2021-05-07 19:25:27] [INFO ] [Nat]Absence check using 60 positive and 168 generalized place invariants in 127 ms returned sat
[2021-05-07 19:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:25:34] [INFO ] [Nat]Absence check using state equation in 6900 ms returned sat
[2021-05-07 19:25:34] [INFO ] Computed and/alt/rep : 2251/25669/2251 causal constraints in 121 ms.
[2021-05-07 19:25:54] [INFO ] Added : 400 causal constraints over 80 iterations in 19203 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 102 ms.
Incomplete Parikh walk after 1697300 steps, including 20292 resets, run finished after 10254 ms. (steps per millisecond=165 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 437200 steps, including 5778 resets, run finished after 2644 ms. (steps per millisecond=165 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 452500 steps, including 5724 resets, run finished after 2723 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 699700 steps, including 8874 resets, run finished after 4207 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 344400 steps, including 4604 resets, run finished after 2079 ms. (steps per millisecond=165 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 23 out of 1331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1331/1331 places, 2301/2301 transitions.
Applied a total of 0 rules in 41 ms. Remains 1331 /1331 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1331/1331 places, 2301/2301 transitions.
Starting structural reductions, iteration 0 : 1331/1331 places, 2301/2301 transitions.
Applied a total of 0 rules in 39 ms. Remains 1331 /1331 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
// Phase 1: matrix 2301 rows 1331 cols
[2021-05-07 19:26:16] [INFO ] Computed 228 place invariants in 49 ms
[2021-05-07 19:26:21] [INFO ] Implicit Places using invariants in 4956 ms returned [1, 18, 32, 49, 67, 136, 140, 150, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 382, 386, 387, 398, 399, 440, 460, 509, 514, 515, 526, 527, 529, 546, 564, 634, 638, 639, 650, 651, 653, 670, 688, 757, 761, 762, 773, 774, 776, 794, 812, 870, 890, 894, 895, 906, 907, 909, 926, 944, 1014, 1018, 1019, 1030, 1031, 1034, 1142, 1144, 1148, 1149, 1152, 1163, 1164, 1198, 1202, 1220, 1221, 1222, 1223, 1235, 1241, 1247, 1253, 1259, 1265, 1271, 1277, 1283, 1289, 1295]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 4960 ms to find 89 implicit places.
[2021-05-07 19:26:21] [INFO ] Redundant transitions in 181 ms returned []
// Phase 1: matrix 2301 rows 1242 cols
[2021-05-07 19:26:21] [INFO ] Computed 139 place invariants in 30 ms
[2021-05-07 19:26:28] [INFO ] Dead Transitions using invariants and state equation in 7499 ms returned []
Starting structural reductions, iteration 1 : 1242/1331 places, 2301/2301 transitions.
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1242 transition count 2159
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 289 place count 1100 transition count 2154
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 289 place count 1100 transition count 2114
Deduced a syphon composed of 40 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 370 place count 1059 transition count 2114
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 374 place count 1055 transition count 2114
Symmetric choice reduction at 3 with 16 rule applications. Total rules 390 place count 1055 transition count 2114
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 422 place count 1039 transition count 2098
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 422 place count 1039 transition count 2097
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 424 place count 1038 transition count 2097
Symmetric choice reduction at 3 with 7 rule applications. Total rules 431 place count 1038 transition count 2097
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 445 place count 1031 transition count 2090
Symmetric choice reduction at 3 with 6 rule applications. Total rules 451 place count 1031 transition count 2090
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 9 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 463 place count 1025 transition count 2081
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 466 place count 1025 transition count 2078
Symmetric choice reduction at 4 with 1 rule applications. Total rules 467 place count 1025 transition count 2078
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 469 place count 1024 transition count 2077
Symmetric choice reduction at 4 with 1 rule applications. Total rules 470 place count 1024 transition count 2077
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 472 place count 1023 transition count 2076
Symmetric choice reduction at 4 with 1 rule applications. Total rules 473 place count 1023 transition count 2076
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 475 place count 1022 transition count 2074
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 591 place count 964 transition count 2016
Symmetric choice reduction at 4 with 7 rule applications. Total rules 598 place count 964 transition count 2016
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 612 place count 957 transition count 2009
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 619 place count 957 transition count 2002
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 622 place count 957 transition count 1999
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 625 place count 954 transition count 1999
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 647 place count 954 transition count 1977
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 670 place count 932 transition count 1976
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 691 place count 932 transition count 1976
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 692 place count 932 transition count 1975
Applied a total of 692 rules in 546 ms. Remains 932 /1242 variables (removed 310) and now considering 1975/2301 (removed 326) transitions.
// Phase 1: matrix 1975 rows 932 cols
[2021-05-07 19:26:29] [INFO ] Computed 134 place invariants in 27 ms
[2021-05-07 19:26:31] [INFO ] Implicit Places using invariants in 2398 ms returned [75, 104, 110, 111, 165, 182, 188, 191, 193, 198, 199, 252, 269, 275, 278, 280, 285, 286, 369, 377, 383, 389, 390, 442, 460, 466, 469, 471, 476, 477, 529, 546, 552, 555, 557, 562, 563, 616, 647, 650, 652, 657, 658, 711, 728, 734, 737, 739, 744, 745, 802, 824, 832, 928]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 2400 ms to find 54 implicit places.
Starting structural reductions, iteration 2 : 878/1331 places, 1975/2301 transitions.
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 878 transition count 1975
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 57 place count 859 transition count 1956
Symmetric choice reduction at 0 with 8 rule applications. Total rules 65 place count 859 transition count 1956
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 81 place count 851 transition count 1948
Symmetric choice reduction at 0 with 3 rule applications. Total rules 84 place count 851 transition count 1948
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 848 transition count 1945
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 848 transition count 1945
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 846 transition count 1943
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 846 transition count 1943
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 844 transition count 1941
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 136 place count 827 transition count 1924
Free-agglomeration rule applied 22 times.
Iterating global reduction 0 with 22 rules applied. Total rules applied 158 place count 827 transition count 1902
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 180 place count 805 transition count 1902
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 187 place count 805 transition count 1895
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 194 place count 798 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 195 place count 798 transition count 1895
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 798 transition count 1895
Applied a total of 201 rules in 246 ms. Remains 798 /878 variables (removed 80) and now considering 1895/1975 (removed 80) transitions.
// Phase 1: matrix 1895 rows 798 cols
[2021-05-07 19:26:32] [INFO ] Computed 80 place invariants in 21 ms
[2021-05-07 19:26:34] [INFO ] Implicit Places using invariants in 2016 ms returned []
// Phase 1: matrix 1895 rows 798 cols
[2021-05-07 19:26:34] [INFO ] Computed 80 place invariants in 21 ms
[2021-05-07 19:26:45] [INFO ] Implicit Places using invariants and state equation in 10914 ms returned []
Implicit Place search using SMT with State Equation took 12931 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 798/1331 places, 1895/2301 transitions.
Incomplete random walk after 1000000 steps, including 13227 resets, run finished after 4173 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1822 resets, run finished after 1109 ms. (steps per millisecond=901 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1471 resets, run finished after 1255 ms. (steps per millisecond=796 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1809 resets, run finished after 1164 ms. (steps per millisecond=859 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1578 resets, run finished after 1174 ms. (steps per millisecond=851 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1821 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1585 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 3462343 steps, run timeout after 30001 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 3462343 steps, saw 752582 distinct states, run finished after 30001 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1895 rows 798 cols
[2021-05-07 19:27:26] [INFO ] Computed 80 place invariants in 21 ms
[2021-05-07 19:27:26] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 19:27:26] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 38 ms returned sat
[2021-05-07 19:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:27:29] [INFO ] [Real]Absence check using state equation in 2993 ms returned sat
[2021-05-07 19:27:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:27:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:27:29] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 39 ms returned sat
[2021-05-07 19:27:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:27:32] [INFO ] [Nat]Absence check using state equation in 2650 ms returned sat
[2021-05-07 19:27:32] [INFO ] Deduced a trap composed of 29 places in 75 ms
[2021-05-07 19:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2021-05-07 19:27:32] [INFO ] Computed and/alt/rep : 1852/24490/1852 causal constraints in 102 ms.
[2021-05-07 19:27:51] [INFO ] Added : 400 causal constraints over 80 iterations in 19334 ms. Result :sat
[2021-05-07 19:27:51] [INFO ] Deduced a trap composed of 64 places in 123 ms
[2021-05-07 19:27:54] [INFO ] Deduced a trap composed of 70 places in 162 ms
[2021-05-07 19:27:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2589 ms
Attempting to minimize the solution found.
Minimization took 99 ms.
[2021-05-07 19:27:54] [INFO ] [Real]Absence check using 19 positive place invariants in 30 ms returned sat
[2021-05-07 19:27:54] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 45 ms returned sat
[2021-05-07 19:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:27:57] [INFO ] [Real]Absence check using state equation in 2423 ms returned sat
[2021-05-07 19:27:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:27:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:27:57] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 44 ms returned sat
[2021-05-07 19:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:28:02] [INFO ] [Nat]Absence check using state equation in 5018 ms returned unsat
[2021-05-07 19:28:02] [INFO ] [Real]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:28:02] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 37 ms returned sat
[2021-05-07 19:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:28:04] [INFO ] [Real]Absence check using state equation in 2278 ms returned sat
[2021-05-07 19:28:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:28:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 27 ms returned sat
[2021-05-07 19:28:04] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 37 ms returned sat
[2021-05-07 19:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:28:07] [INFO ] [Nat]Absence check using state equation in 2368 ms returned sat
[2021-05-07 19:28:07] [INFO ] Computed and/alt/rep : 1852/24490/1852 causal constraints in 111 ms.
[2021-05-07 19:28:24] [INFO ] Added : 500 causal constraints over 100 iterations in 17602 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 100 ms.
[2021-05-07 19:28:25] [INFO ] [Real]Absence check using 19 positive place invariants in 30 ms returned sat
[2021-05-07 19:28:25] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 45 ms returned sat
[2021-05-07 19:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:28:27] [INFO ] [Real]Absence check using state equation in 2472 ms returned sat
[2021-05-07 19:28:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:28:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 19:28:27] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 44 ms returned sat
[2021-05-07 19:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:28:30] [INFO ] [Nat]Absence check using state equation in 2474 ms returned sat
[2021-05-07 19:28:30] [INFO ] Computed and/alt/rep : 1852/24490/1852 causal constraints in 98 ms.
[2021-05-07 19:28:49] [INFO ] Added : 530 causal constraints over 106 iterations in 18706 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 127 ms.
[2021-05-07 19:28:49] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 19:28:49] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 38 ms returned sat
[2021-05-07 19:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:28:52] [INFO ] [Real]Absence check using state equation in 2705 ms returned sat
[2021-05-07 19:28:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:28:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:28:52] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 38 ms returned sat
[2021-05-07 19:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:28:55] [INFO ] [Nat]Absence check using state equation in 2858 ms returned sat
[2021-05-07 19:28:55] [INFO ] Computed and/alt/rep : 1852/24490/1852 causal constraints in 99 ms.
[2021-05-07 19:29:15] [INFO ] Added : 495 causal constraints over 99 iterations in 20145 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 136 ms.
[2021-05-07 19:29:15] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 19:29:15] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 39 ms returned sat
[2021-05-07 19:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:29:18] [INFO ] [Real]Absence check using state equation in 2515 ms returned sat
[2021-05-07 19:29:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:29:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:29:18] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 37 ms returned sat
[2021-05-07 19:29:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:29:21] [INFO ] [Nat]Absence check using state equation in 2599 ms returned sat
[2021-05-07 19:29:21] [INFO ] Computed and/alt/rep : 1852/24490/1852 causal constraints in 99 ms.
[2021-05-07 19:29:41] [INFO ] Added : 540 causal constraints over 108 iterations in 20196 ms.(timeout) Result :sat
[2021-05-07 19:29:41] [INFO ] Deduced a trap composed of 51 places in 182 ms
[2021-05-07 19:29:41] [INFO ] Deduced a trap composed of 23 places in 122 ms
[2021-05-07 19:29:43] [INFO ] Deduced a trap composed of 96 places in 206 ms
[2021-05-07 19:29:43] [INFO ] Deduced a trap composed of 73 places in 104 ms
[2021-05-07 19:29:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2303 ms
Attempting to minimize the solution found.
Minimization took 122 ms.
FORMULA ASLink-PT-09b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 240000 steps, including 4065 resets, run finished after 1164 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 243500 steps, including 4316 resets, run finished after 1158 ms. (steps per millisecond=210 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 236800 steps, including 4197 resets, run finished after 1076 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 371100 steps, including 5889 resets, run finished after 1708 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 274300 steps, including 4604 resets, run finished after 1254 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 798 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 798/798 places, 1895/1895 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 798 transition count 1891
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 794 transition count 1891
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 794 transition count 1886
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 789 transition count 1886
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 788 transition count 1885
Applied a total of 19 rules in 57 ms. Remains 788 /798 variables (removed 10) and now considering 1885/1895 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 788/798 places, 1885/1895 transitions.
Incomplete random walk after 1000000 steps, including 13909 resets, run finished after 4028 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2023 resets, run finished after 1113 ms. (steps per millisecond=898 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2029 resets, run finished after 1174 ms. (steps per millisecond=851 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1742 resets, run finished after 1185 ms. (steps per millisecond=843 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2011 resets, run finished after 1156 ms. (steps per millisecond=865 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1781 resets, run finished after 1076 ms. (steps per millisecond=929 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 3890148 steps, run timeout after 30001 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 3890148 steps, saw 749156 distinct states, run finished after 30001 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1885 rows 788 cols
[2021-05-07 19:30:30] [INFO ] Computed 80 place invariants in 21 ms
[2021-05-07 19:30:30] [INFO ] [Real]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:30:30] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 36 ms returned sat
[2021-05-07 19:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:30:33] [INFO ] [Real]Absence check using state equation in 2749 ms returned sat
[2021-05-07 19:30:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:30:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 19:30:33] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 36 ms returned sat
[2021-05-07 19:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:30:36] [INFO ] [Nat]Absence check using state equation in 3077 ms returned sat
[2021-05-07 19:30:36] [INFO ] Computed and/alt/rep : 1843/24455/1843 causal constraints in 102 ms.
[2021-05-07 19:30:56] [INFO ] Added : 480 causal constraints over 96 iterations in 20198 ms.(timeout) Result :sat
[2021-05-07 19:30:56] [INFO ] Deduced a trap composed of 31 places in 72 ms
[2021-05-07 19:30:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2834 ms
Attempting to minimize the solution found.
Minimization took 167 ms.
[2021-05-07 19:30:59] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 19:30:59] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 37 ms returned sat
[2021-05-07 19:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:31:02] [INFO ] [Real]Absence check using state equation in 2672 ms returned sat
[2021-05-07 19:31:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:31:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 19:31:02] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 38 ms returned sat
[2021-05-07 19:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:31:05] [INFO ] [Nat]Absence check using state equation in 3071 ms returned sat
[2021-05-07 19:31:05] [INFO ] Computed and/alt/rep : 1843/24455/1843 causal constraints in 99 ms.
[2021-05-07 19:31:25] [INFO ] Added : 560 causal constraints over 112 iterations in 20275 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 132 ms.
[2021-05-07 19:31:26] [INFO ] [Real]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:31:26] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 43 ms returned sat
[2021-05-07 19:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:31:28] [INFO ] [Real]Absence check using state equation in 2569 ms returned sat
[2021-05-07 19:31:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:31:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:31:29] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 42 ms returned sat
[2021-05-07 19:31:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:31:32] [INFO ] [Nat]Absence check using state equation in 3700 ms returned sat
[2021-05-07 19:31:33] [INFO ] Computed and/alt/rep : 1843/24455/1843 causal constraints in 125 ms.
[2021-05-07 19:31:53] [INFO ] Added : 535 causal constraints over 107 iterations in 20447 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 128 ms.
[2021-05-07 19:32:08] [INFO ] [Real]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:32:08] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 36 ms returned sat
[2021-05-07 19:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:32:11] [INFO ] [Real]Absence check using state equation in 2587 ms returned sat
[2021-05-07 19:32:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:32:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:32:11] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 36 ms returned sat
[2021-05-07 19:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:32:14] [INFO ] [Nat]Absence check using state equation in 2842 ms returned sat
[2021-05-07 19:32:14] [INFO ] Computed and/alt/rep : 1843/24455/1843 causal constraints in 97 ms.
[2021-05-07 19:32:34] [INFO ] Added : 580 causal constraints over 116 iterations in 20359 ms.(timeout) Result :sat
[2021-05-07 19:32:34] [INFO ] Deduced a trap composed of 23 places in 92 ms
[2021-05-07 19:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
Attempting to minimize the solution found.
Minimization took 125 ms.
[2021-05-07 19:32:35] [INFO ] [Real]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 19:32:35] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 38 ms returned sat
[2021-05-07 19:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:32:37] [INFO ] [Real]Absence check using state equation in 2580 ms returned sat
[2021-05-07 19:32:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:32:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 19:32:38] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 36 ms returned sat
[2021-05-07 19:32:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:32:41] [INFO ] [Nat]Absence check using state equation in 2936 ms returned sat
[2021-05-07 19:32:41] [INFO ] Deduced a trap composed of 75 places in 111 ms
[2021-05-07 19:32:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2021-05-07 19:32:41] [INFO ] Computed and/alt/rep : 1843/24455/1843 causal constraints in 98 ms.
[2021-05-07 19:33:00] [INFO ] Added : 520 causal constraints over 104 iterations in 19533 ms. Result :sat
[2021-05-07 19:33:00] [INFO ] Deduced a trap composed of 34 places in 50 ms
[2021-05-07 19:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
Attempting to minimize the solution found.
Minimization took 122 ms.
Incomplete Parikh walk after 244100 steps, including 4381 resets, run finished after 1127 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 179900 steps, including 3478 resets, run finished after 833 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 182800 steps, including 3340 resets, run finished after 826 ms. (steps per millisecond=221 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 191600 steps, including 3616 resets, run finished after 891 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 349900 steps, including 6020 resets, run finished after 1596 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 788 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 788/788 places, 1885/1885 transitions.
Applied a total of 0 rules in 26 ms. Remains 788 /788 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 788/788 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 788/788 places, 1885/1885 transitions.
Applied a total of 0 rules in 23 ms. Remains 788 /788 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 788 cols
[2021-05-07 19:33:06] [INFO ] Computed 80 place invariants in 21 ms
[2021-05-07 19:33:08] [INFO ] Implicit Places using invariants in 1832 ms returned [266, 540, 698]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1834 ms to find 3 implicit places.
[2021-05-07 19:33:08] [INFO ] Redundant transitions in 116 ms returned []
// Phase 1: matrix 1885 rows 785 cols
[2021-05-07 19:33:08] [INFO ] Computed 77 place invariants in 21 ms
[2021-05-07 19:33:12] [INFO ] Dead Transitions using invariants and state equation in 4089 ms returned []
Starting structural reductions, iteration 1 : 785/788 places, 1885/1885 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 785 transition count 1884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 784 transition count 1884
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 784 transition count 1884
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 783 transition count 1883
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 783 transition count 1883
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 782 transition count 1882
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 777 transition count 1877
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 777 transition count 1877
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 776 transition count 1876
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 776 transition count 1876
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 775 transition count 1875
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 775 transition count 1873
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 773 transition count 1873
Applied a total of 28 rules in 122 ms. Remains 773 /785 variables (removed 12) and now considering 1873/1885 (removed 12) transitions.
// Phase 1: matrix 1873 rows 773 cols
[2021-05-07 19:33:12] [INFO ] Computed 77 place invariants in 19 ms
[2021-05-07 19:33:14] [INFO ] Implicit Places using invariants in 1784 ms returned []
// Phase 1: matrix 1873 rows 773 cols
[2021-05-07 19:33:14] [INFO ] Computed 77 place invariants in 20 ms
[2021-05-07 19:33:23] [INFO ] Implicit Places using invariants and state equation in 8461 ms returned []
Implicit Place search using SMT with State Equation took 10245 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 773/788 places, 1873/1885 transitions.
Incomplete random walk after 1000000 steps, including 14155 resets, run finished after 4026 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2049 resets, run finished after 1116 ms. (steps per millisecond=896 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2074 resets, run finished after 1160 ms. (steps per millisecond=862 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1778 resets, run finished after 1172 ms. (steps per millisecond=853 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2079 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1802 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 3859924 steps, run timeout after 30001 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 3859924 steps, saw 746307 distinct states, run finished after 30001 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1873 rows 773 cols
[2021-05-07 19:34:02] [INFO ] Computed 77 place invariants in 19 ms
[2021-05-07 19:34:03] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-07 19:34:03] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 35 ms returned sat
[2021-05-07 19:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:34:05] [INFO ] [Real]Absence check using state equation in 2643 ms returned sat
[2021-05-07 19:34:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:34:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-07 19:34:05] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2021-05-07 19:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:34:08] [INFO ] [Nat]Absence check using state equation in 2927 ms returned sat
[2021-05-07 19:34:08] [INFO ] Computed and/alt/rep : 1831/24428/1831 causal constraints in 97 ms.
[2021-05-07 19:34:32] [INFO ] Added : 530 causal constraints over 106 iterations in 23203 ms.(timeout) Result :unknown
[2021-05-07 19:34:32] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-07 19:34:32] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2021-05-07 19:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:34:34] [INFO ] [Real]Absence check using state equation in 2461 ms returned sat
[2021-05-07 19:34:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:34:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-07 19:34:34] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2021-05-07 19:34:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:34:37] [INFO ] [Nat]Absence check using state equation in 2754 ms returned sat
[2021-05-07 19:34:37] [INFO ] Computed and/alt/rep : 1831/24428/1831 causal constraints in 94 ms.
[2021-05-07 19:34:57] [INFO ] Added : 440 causal constraints over 88 iterations in 20283 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 127 ms.
[2021-05-07 19:34:58] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-07 19:34:58] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 38 ms returned sat
[2021-05-07 19:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:35:00] [INFO ] [Real]Absence check using state equation in 2327 ms returned sat
[2021-05-07 19:35:00] [INFO ] Computed and/alt/rep : 1831/24428/1831 causal constraints in 97 ms.
[2021-05-07 19:35:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:35:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-07 19:35:01] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 37 ms returned sat
[2021-05-07 19:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:35:03] [INFO ] [Nat]Absence check using state equation in 2260 ms returned sat
[2021-05-07 19:35:03] [INFO ] Computed and/alt/rep : 1831/24428/1831 causal constraints in 112 ms.
[2021-05-07 19:35:24] [INFO ] Added : 410 causal constraints over 82 iterations in 20886 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 125 ms.
[2021-05-07 19:35:24] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-07 19:35:24] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2021-05-07 19:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:35:27] [INFO ] [Real]Absence check using state equation in 2429 ms returned sat
[2021-05-07 19:35:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:35:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-07 19:35:27] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 34 ms returned sat
[2021-05-07 19:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:35:29] [INFO ] [Nat]Absence check using state equation in 2555 ms returned sat
[2021-05-07 19:35:30] [INFO ] Computed and/alt/rep : 1831/24428/1831 causal constraints in 100 ms.
[2021-05-07 19:35:47] [INFO ] Added : 445 causal constraints over 89 iterations in 18009 ms. Result :unknown
[2021-05-07 19:35:48] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-07 19:35:48] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2021-05-07 19:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:35:50] [INFO ] [Real]Absence check using state equation in 2474 ms returned sat
[2021-05-07 19:35:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:35:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-07 19:35:50] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2021-05-07 19:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:35:53] [INFO ] [Nat]Absence check using state equation in 3074 ms returned sat
[2021-05-07 19:35:53] [INFO ] Computed and/alt/rep : 1831/24428/1831 causal constraints in 98 ms.
[2021-05-07 19:36:14] [INFO ] Added : 525 causal constraints over 105 iterations in 20220 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 123 ms.
Incomplete Parikh walk after 386900 steps, including 7759 resets, run finished after 1800 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 241500 steps, including 5041 resets, run finished after 1112 ms. (steps per millisecond=217 ) properties seen :[0, 0, 1, 0, 0] could not realise parikh vector
FORMULA ASLink-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 509800 steps, including 9941 resets, run finished after 2281 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 212300 steps, including 4359 resets, run finished after 955 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 245200 steps, including 5182 resets, run finished after 1132 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 8 out of 773 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 773/773 places, 1873/1873 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 773 transition count 1871
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 771 transition count 1871
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 771 transition count 1871
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 770 transition count 1863
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 770 transition count 1863
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 769 transition count 1855
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 769 transition count 1855
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 768 transition count 1847
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 768 transition count 1847
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 767 transition count 1839
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 767 transition count 1839
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 766 transition count 1831
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 766 transition count 1831
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 765 transition count 1823
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 765 transition count 1823
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 25 place count 764 transition count 1815
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 764 transition count 1815
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 763 transition count 1807
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 763 transition count 1807
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 762 transition count 1799
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 762 transition count 1799
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 761 transition count 1791
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 759 transition count 1789
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 759 transition count 1794
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 50 place count 757 transition count 1786
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 756 transition count 1785
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 755 transition count 1784
Applied a total of 52 rules in 250 ms. Remains 755 /773 variables (removed 18) and now considering 1784/1873 (removed 89) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/773 places, 1784/1873 transitions.
Incomplete random walk after 1000000 steps, including 15436 resets, run finished after 3908 ms. (steps per millisecond=255 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2269 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2250 resets, run finished after 1167 ms. (steps per millisecond=856 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2248 resets, run finished after 1151 ms. (steps per millisecond=868 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1924 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 3871357 steps, run timeout after 30001 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 3871357 steps, saw 832656 distinct states, run finished after 30001 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1784 rows 755 cols
[2021-05-07 19:37:00] [INFO ] Computed 77 place invariants in 19 ms
[2021-05-07 19:37:00] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-07 19:37:00] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2021-05-07 19:37:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:37:02] [INFO ] [Real]Absence check using state equation in 2352 ms returned sat
[2021-05-07 19:37:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:37:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-07 19:37:02] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 32 ms returned sat
[2021-05-07 19:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:37:05] [INFO ] [Nat]Absence check using state equation in 2653 ms returned sat
[2021-05-07 19:37:05] [INFO ] Computed and/alt/rep : 1741/22012/1741 causal constraints in 115 ms.
[2021-05-07 19:37:24] [INFO ] Added : 480 causal constraints over 96 iterations in 18893 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 117 ms.
[2021-05-07 19:37:24] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-07 19:37:24] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 32 ms returned sat
[2021-05-07 19:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:37:26] [INFO ] [Real]Absence check using state equation in 2081 ms returned sat
[2021-05-07 19:37:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:37:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-07 19:37:27] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2021-05-07 19:37:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:37:29] [INFO ] [Nat]Absence check using state equation in 2279 ms returned sat
[2021-05-07 19:37:29] [INFO ] Computed and/alt/rep : 1741/22012/1741 causal constraints in 92 ms.
[2021-05-07 19:37:49] [INFO ] Added : 555 causal constraints over 111 iterations in 20114 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 112 ms.
[2021-05-07 19:37:49] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-07 19:37:49] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 32 ms returned sat
[2021-05-07 19:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:37:52] [INFO ] [Real]Absence check using state equation in 2121 ms returned sat
[2021-05-07 19:37:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:37:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-07 19:37:52] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 32 ms returned sat
[2021-05-07 19:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:37:54] [INFO ] [Nat]Absence check using state equation in 2158 ms returned sat
[2021-05-07 19:37:54] [INFO ] Computed and/alt/rep : 1741/22012/1741 causal constraints in 91 ms.
[2021-05-07 19:38:01] [INFO ] Added : 110 causal constraints over 22 iterations in 7384 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 50 ms.
[2021-05-07 19:38:02] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-07 19:38:02] [INFO ] [Real]Absence check using 20 positive and 57 generalized place invariants in 33 ms returned sat
[2021-05-07 19:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:38:04] [INFO ] [Real]Absence check using state equation in 2313 ms returned sat
[2021-05-07 19:38:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:38:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-07 19:38:04] [INFO ] [Nat]Absence check using 20 positive and 57 generalized place invariants in 32 ms returned sat
[2021-05-07 19:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:38:07] [INFO ] [Nat]Absence check using state equation in 2738 ms returned sat
[2021-05-07 19:38:07] [INFO ] Computed and/alt/rep : 1741/22012/1741 causal constraints in 89 ms.
[2021-05-07 19:38:27] [INFO ] Added : 570 causal constraints over 114 iterations in 20188 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 122 ms.
Incomplete Parikh walk after 278800 steps, including 4180 resets, run finished after 1276 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 233700 steps, including 3635 resets, run finished after 1075 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 237800 steps, including 3631 resets, run finished after 1094 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 459000 steps, including 6352 resets, run finished after 2078 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 8 out of 755 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 755/755 places, 1784/1784 transitions.
Applied a total of 0 rules in 21 ms. Remains 755 /755 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 1784/1784 transitions.
Starting structural reductions, iteration 0 : 755/755 places, 1784/1784 transitions.
Applied a total of 0 rules in 22 ms. Remains 755 /755 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
// Phase 1: matrix 1784 rows 755 cols
[2021-05-07 19:38:33] [INFO ] Computed 77 place invariants in 19 ms
[2021-05-07 19:38:35] [INFO ] Implicit Places using invariants in 1677 ms returned [625, 643, 689, 707]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1678 ms to find 4 implicit places.
[2021-05-07 19:38:35] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 1784 rows 751 cols
[2021-05-07 19:38:35] [INFO ] Computed 73 place invariants in 18 ms
[2021-05-07 19:38:38] [INFO ] Dead Transitions using invariants and state equation in 3598 ms returned []
Starting structural reductions, iteration 1 : 751/755 places, 1784/1784 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 751 transition count 1779
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 746 transition count 1779
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 738 transition count 1771
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 736 transition count 1772
Applied a total of 30 rules in 55 ms. Remains 736 /751 variables (removed 15) and now considering 1772/1784 (removed 12) transitions.
// Phase 1: matrix 1772 rows 736 cols
[2021-05-07 19:38:38] [INFO ] Computed 73 place invariants in 17 ms
[2021-05-07 19:38:40] [INFO ] Implicit Places using invariants in 1638 ms returned []
// Phase 1: matrix 1772 rows 736 cols
[2021-05-07 19:38:40] [INFO ] Computed 73 place invariants in 17 ms
[2021-05-07 19:38:49] [INFO ] Implicit Places using invariants and state equation in 8973 ms returned []
Implicit Place search using SMT with State Equation took 10612 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 736/755 places, 1772/1784 transitions.
Incomplete random walk after 1000000 steps, including 15624 resets, run finished after 3849 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2226 resets, run finished after 1066 ms. (steps per millisecond=938 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2217 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2205 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1902 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 3957010 steps, run timeout after 30001 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 3957010 steps, saw 838823 distinct states, run finished after 30001 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1772 rows 736 cols
[2021-05-07 19:39:27] [INFO ] Computed 73 place invariants in 17 ms
[2021-05-07 19:39:27] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-07 19:39:27] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:39:29] [INFO ] [Real]Absence check using state equation in 2160 ms returned sat
[2021-05-07 19:39:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:39:29] [INFO ] [Nat]Absence check using 18 positive place invariants in 29 ms returned sat
[2021-05-07 19:39:29] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:39:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:39:32] [INFO ] [Nat]Absence check using state equation in 2313 ms returned sat
[2021-05-07 19:39:32] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 92 ms.
[2021-05-07 19:39:52] [INFO ] Added : 505 causal constraints over 101 iterations in 20116 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 108 ms.
[2021-05-07 19:39:52] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-07 19:39:52] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:39:54] [INFO ] [Real]Absence check using state equation in 1971 ms returned sat
[2021-05-07 19:39:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:39:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 19:39:54] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:39:57] [INFO ] [Nat]Absence check using state equation in 2078 ms returned sat
[2021-05-07 19:39:57] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 92 ms.
[2021-05-07 19:40:12] [INFO ] Added : 470 causal constraints over 94 iterations in 15758 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 98 ms.
[2021-05-07 19:40:13] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-07 19:40:13] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:40:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:40:15] [INFO ] [Real]Absence check using state equation in 2018 ms returned sat
[2021-05-07 19:40:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:40:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 19:40:15] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:40:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:40:17] [INFO ] [Nat]Absence check using state equation in 2174 ms returned sat
[2021-05-07 19:40:17] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 89 ms.
[2021-05-07 19:40:37] [INFO ] Added : 555 causal constraints over 111 iterations in 20212 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 114 ms.
[2021-05-07 19:40:38] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-07 19:40:38] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:40:40] [INFO ] [Real]Absence check using state equation in 2080 ms returned sat
[2021-05-07 19:40:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:40:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 19:40:40] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:40:43] [INFO ] [Nat]Absence check using state equation in 3417 ms returned sat
[2021-05-07 19:40:43] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 91 ms.
[2021-05-07 19:41:04] [INFO ] Added : 535 causal constraints over 107 iterations in 20180 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 123 ms.
Incomplete Parikh walk after 271100 steps, including 6140 resets, run finished after 1236 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 241700 steps, including 5616 resets, run finished after 1108 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 271100 steps, including 6165 resets, run finished after 1228 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 247400 steps, including 5729 resets, run finished after 1130 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 8 out of 736 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 736/736 places, 1772/1772 transitions.
Applied a total of 0 rules in 22 ms. Remains 736 /736 variables (removed 0) and now considering 1772/1772 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 736/736 places, 1772/1772 transitions.
Starting structural reductions, iteration 0 : 736/736 places, 1772/1772 transitions.
Applied a total of 0 rules in 21 ms. Remains 736 /736 variables (removed 0) and now considering 1772/1772 (removed 0) transitions.
// Phase 1: matrix 1772 rows 736 cols
[2021-05-07 19:41:09] [INFO ] Computed 73 place invariants in 18 ms
[2021-05-07 19:41:10] [INFO ] Implicit Places using invariants in 1623 ms returned []
// Phase 1: matrix 1772 rows 736 cols
[2021-05-07 19:41:10] [INFO ] Computed 73 place invariants in 17 ms
[2021-05-07 19:41:19] [INFO ] Implicit Places using invariants and state equation in 8974 ms returned []
Implicit Place search using SMT with State Equation took 10597 ms to find 0 implicit places.
[2021-05-07 19:41:19] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1772 rows 736 cols
[2021-05-07 19:41:19] [INFO ] Computed 73 place invariants in 18 ms
[2021-05-07 19:41:23] [INFO ] Dead Transitions using invariants and state equation in 3503 ms returned []
Finished structural reductions, in 1 iterations. Remains : 736/736 places, 1772/1772 transitions.
Incomplete random walk after 100000 steps, including 1566 resets, run finished after 385 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1772 rows 736 cols
[2021-05-07 19:41:23] [INFO ] Computed 73 place invariants in 18 ms
[2021-05-07 19:41:23] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-07 19:41:23] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:41:25] [INFO ] [Real]Absence check using state equation in 2190 ms returned sat
[2021-05-07 19:41:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:41:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 28 ms returned sat
[2021-05-07 19:41:26] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:41:28] [INFO ] [Nat]Absence check using state equation in 2339 ms returned sat
[2021-05-07 19:41:28] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 89 ms.
[2021-05-07 19:41:45] [INFO ] Added : 495 causal constraints over 99 iterations in 17493 ms. Result :unknown
[2021-05-07 19:41:46] [INFO ] [Real]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 19:41:46] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:41:48] [INFO ] [Real]Absence check using state equation in 1972 ms returned sat
[2021-05-07 19:41:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:41:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 19:41:48] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:41:50] [INFO ] [Nat]Absence check using state equation in 2069 ms returned sat
[2021-05-07 19:41:50] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 90 ms.
[2021-05-07 19:42:06] [INFO ] Added : 470 causal constraints over 94 iterations in 15870 ms. Result :sat
[2021-05-07 19:42:06] [INFO ] [Real]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 19:42:06] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:42:08] [INFO ] [Real]Absence check using state equation in 2023 ms returned sat
[2021-05-07 19:42:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:42:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 19:42:08] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:42:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:42:10] [INFO ] [Nat]Absence check using state equation in 2208 ms returned sat
[2021-05-07 19:42:10] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 89 ms.
[2021-05-07 19:42:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t36 0) (and (or (and (> t986 0) (< o986 o36)) (and (> t1001 0) (< o1001 o36)) (and (> t1007 0) (< o1007 o36)) (and (> t1015 0) (< o1015 o36)) (and (> t1021 0) (< o1021 o36)) (and (> t1029 0) (< o1029 o36)) (and (> t1035 0) (< o1035 o36)) (and (> t1729 0) (< o1729 o36))) (or (and (> t1002 0) (< o1002 o36)) (and (> t1003 0) (< o1003 o36)) (and (> t1004 0) (< o1004 o36)) (and (> t1005 0) (< o1005 o36)) (and (> t1006 0) (< o1006 o36)) (and (> t1007 0) (< o1007 o36)) (and (> t1008 0) (< o1008 o36)) (and (> t1009 0) (< o1009 o36)))))") while checking expression at index 2
[2021-05-07 19:42:28] [INFO ] [Real]Absence check using 18 positive place invariants in 34 ms returned sat
[2021-05-07 19:42:28] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:42:30] [INFO ] [Real]Absence check using state equation in 2073 ms returned sat
[2021-05-07 19:42:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:42:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 19:42:30] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:42:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:42:34] [INFO ] [Nat]Absence check using state equation in 3393 ms returned sat
[2021-05-07 19:42:34] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 93 ms.
[2021-05-07 19:42:50] [INFO ] Added : 490 causal constraints over 98 iterations in 16433 ms. Result :unknown
Applied a total of 0 rules in 22 ms. Remains 736 /736 variables (removed 0) and now considering 1772/1772 (removed 0) transitions.
// Phase 1: matrix 1772 rows 736 cols
[2021-05-07 19:42:50] [INFO ] Computed 73 place invariants in 17 ms
[2021-05-07 19:42:50] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-07 19:42:50] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:42:53] [INFO ] [Real]Absence check using state equation in 2144 ms returned sat
[2021-05-07 19:42:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:42:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 29 ms returned sat
[2021-05-07 19:42:53] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:42:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:42:55] [INFO ] [Nat]Absence check using state equation in 2328 ms returned sat
[2021-05-07 19:42:55] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 88 ms.
[2021-05-07 19:43:15] [INFO ] Added : 510 causal constraints over 102 iterations in 20188 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 109 ms.
[2021-05-07 19:43:16] [INFO ] [Real]Absence check using 18 positive place invariants in 28 ms returned sat
[2021-05-07 19:43:16] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:43:18] [INFO ] [Real]Absence check using state equation in 1982 ms returned sat
[2021-05-07 19:43:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:43:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 19:43:18] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:43:20] [INFO ] [Nat]Absence check using state equation in 2097 ms returned sat
[2021-05-07 19:43:20] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 88 ms.
[2021-05-07 19:43:36] [INFO ] Added : 470 causal constraints over 94 iterations in 16506 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 100 ms.
[2021-05-07 19:43:37] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-07 19:43:37] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:43:39] [INFO ] [Real]Absence check using state equation in 2006 ms returned sat
[2021-05-07 19:43:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:43:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 28 ms returned sat
[2021-05-07 19:43:39] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 29 ms returned sat
[2021-05-07 19:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:43:41] [INFO ] [Nat]Absence check using state equation in 2152 ms returned sat
[2021-05-07 19:43:41] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 93 ms.
[2021-05-07 19:44:01] [INFO ] Added : 555 causal constraints over 111 iterations in 20126 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 116 ms.
[2021-05-07 19:44:02] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-07 19:44:02] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 31 ms returned sat
[2021-05-07 19:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:44:04] [INFO ] [Real]Absence check using state equation in 2131 ms returned sat
[2021-05-07 19:44:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:44:04] [INFO ] [Nat]Absence check using 18 positive place invariants in 28 ms returned sat
[2021-05-07 19:44:04] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 30 ms returned sat
[2021-05-07 19:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:44:07] [INFO ] [Nat]Absence check using state equation in 3490 ms returned sat
[2021-05-07 19:44:08] [INFO ] Computed and/alt/rep : 1726/22075/1726 causal constraints in 90 ms.
[2021-05-07 19:44:28] [INFO ] Added : 535 causal constraints over 107 iterations in 20185 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 119 ms.
[2021-05-07 19:44:28] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-07 19:44:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
[2021-05-07 19:44:28] [INFO ] Flatten gal took : 186 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-09b @ 3570 seconds
FORMULA ASLink-PT-09b-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ASLink-PT-09b-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ASLink-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ASLink-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3507
rslt: Output for ReachabilityFireability @ ASLink-PT-09b
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 7 19:44:29 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 876
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p18) OR (p18 <= 0))))",
"processed_size": 35,
"rewrites": 2
},
"result":
{
"edges": 330,
"markings": 331,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1169
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p247) AND (p299 <= 1) AND (1 <= p299))))",
"processed_size": 53,
"rewrites": 1
},
"result":
{
"edges": 117,
"markings": 118,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1753
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p79) AND (1 <= p107))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 599,
"markings": 600,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p523 <= 1) AND (1 <= p523) AND (p525 <= 1) AND (1 <= p525) AND (p527 <= 1) AND (1 <= p527))))",
"processed_size": 101,
"rewrites": 1
},
"result":
{
"edges": 204,
"markings": 205,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 42196,
"runtime": 63.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 7218,
"conflict_clusters": 66,
"places": 736,
"places_significant": 663,
"singleton_clusters": 0,
"transitions": 1772
},
"result":
{
"preliminary_value": "no yes yes yes ",
"value": "no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2508/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 736
lola: finding significant places
lola: 736 places, 1772 transitions, 663 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: A (G (((2 <= p18) OR (p18 <= 0)))) : E (F (((p523 <= 1) AND (1 <= p523) AND (p525 <= 1) AND (1 <= p525) AND (p527 <= 1) AND (1 <= p527)))) : E (F (((1 <= p247) AND (p299 <= 1) AND (1 <= p299)))) : E (F (((1 <= p79) AND (1 <= p107))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 876 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p18) OR (p18 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= p18) OR (p18 <= 0))))
lola: processed formula length: 35
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p18 <= 1) AND (1 <= p18))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 331 markings, 330 edges
lola: ========================================
lola: subprocess 1 will run for 1169 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p247) AND (p299 <= 1) AND (1 <= p299))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p247) AND (p299 <= 1) AND (1 <= p299))))
lola: processed formula length: 53
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p247) AND (p299 <= 1) AND (1 <= p299))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 118 markings, 117 edges
lola: ========================================
lola: subprocess 2 will run for 1753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p79) AND (1 <= p107))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p79) AND (1 <= p107))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p79) AND (1 <= p107))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 600 markings, 599 edges
lola: ========================================
lola: subprocess 3 will run for 3507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p523 <= 1) AND (1 <= p523) AND (p525 <= 1) AND (1 <= p525) AND (p527 <= 1) AND (1 <= p527))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p523 <= 1) AND (1 <= p523) AND (p525 <= 1) AND (1 <= p525) AND (p527 <= 1) AND (1 <= p527))))
lola: processed formula length: 101
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p523 <= 1) AND (1 <= p523) AND (p525 <= 1) AND (1 <= p525) AND (p527 <= 1) AND (1 <= p527))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 205 markings, 204 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes
lola:
preliminary result: no yes yes yes
lola: memory consumption: 42196 KB
lola: time consumption: 63 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
--------------------
content from stderr:
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="ASLink-PT-09b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is ASLink-PT-09b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r011-tall-162038005900076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09b.tgz
mv ASLink-PT-09b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;