About the Execution of 2024-gold for SieveSingleMsgMbox-PT-d2m96
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15683.570 | 3571770.00 | 3670498.00 | 12021.50 | 1 0 0 0 0 0 ? 0 0 0 1 0 0 1 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r223-tall-174902009200062.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is SieveSingleMsgMbox-PT-d2m96, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200062
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749107578185
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 07:12:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 07:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:12:59] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-06-05 07:12:59] [INFO ] Transformed 2398 places.
[2025-06-05 07:12:59] [INFO ] Transformed 1954 transitions.
[2025-06-05 07:12:59] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1984 places in 16 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2025-06-05 07:12:59] [INFO ] Computed 6 invariants in 75 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[12, 12, 12, 1, 1, 12]
RANDOM walk for 10000 steps (2212 resets) in 293 ms. (34 steps per ms)
BEST_FIRST walk for 60003 steps (5602 resets) in 327 ms. (182 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0, 0] Max Struct:[12, 12, 12, 1, 1, 12]
[2025-06-05 07:13:00] [INFO ] Invariant cache hit.
[2025-06-05 07:13:00] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2025-06-05 07:13:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-05 07:13:01] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2025-06-05 07:13:01] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2025-06-05 07:13:01] [INFO ] [Real]Added 1674 Read/Feed constraints in 303 ms returned sat
[2025-06-05 07:13:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-05 07:13:01] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:13:02] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2025-06-05 07:13:02] [INFO ] [Nat]Added 1674 Read/Feed constraints in 320 ms returned sat
[2025-06-05 07:13:02] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 20 ms to minimize.
[2025-06-05 07:13:02] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 2 ms to minimize.
[2025-06-05 07:13:03] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2025-06-05 07:13:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 934 ms
[2025-06-05 07:13:03] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 343 ms.
[2025-06-05 07:13:04] [INFO ] Added : 13 causal constraints over 3 iterations in 799 ms. Result :sat
Minimization took 542 ms.
[2025-06-05 07:13:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:13:04] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-05 07:13:05] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-06-05 07:13:05] [INFO ] [Real]Added 1674 Read/Feed constraints in 283 ms returned sat
[2025-06-05 07:13:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 07:13:05] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:13:05] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2025-06-05 07:13:06] [INFO ] [Nat]Added 1674 Read/Feed constraints in 351 ms returned sat
[2025-06-05 07:13:06] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 4 ms to minimize.
[2025-06-05 07:13:06] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 7 ms to minimize.
[2025-06-05 07:13:06] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2025-06-05 07:13:07] [INFO ] Deduced a trap composed of 155 places in 107 ms of which 2 ms to minimize.
[2025-06-05 07:13:07] [INFO ] Deduced a trap composed of 116 places in 101 ms of which 3 ms to minimize.
[2025-06-05 07:13:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1597 ms
[2025-06-05 07:13:07] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 185 ms.
[2025-06-05 07:13:08] [INFO ] Added : 28 causal constraints over 6 iterations in 1014 ms. Result :sat
Minimization took 534 ms.
[2025-06-05 07:13:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-05 07:13:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned unsat
[2025-06-05 07:13:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:13:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:13:09] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2025-06-05 07:13:10] [INFO ] [Real]Added 1674 Read/Feed constraints in 280 ms returned sat
[2025-06-05 07:13:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:13:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 07:13:10] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2025-06-05 07:13:10] [INFO ] [Nat]Added 1674 Read/Feed constraints in 395 ms returned sat
[2025-06-05 07:13:11] [INFO ] Deduced a trap composed of 175 places in 178 ms of which 3 ms to minimize.
[2025-06-05 07:13:11] [INFO ] Deduced a trap composed of 285 places in 179 ms of which 3 ms to minimize.
[2025-06-05 07:13:11] [INFO ] Deduced a trap composed of 256 places in 171 ms of which 3 ms to minimize.
[2025-06-05 07:13:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 932 ms
[2025-06-05 07:13:11] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 174 ms.
[2025-06-05 07:13:12] [INFO ] Added : 12 causal constraints over 3 iterations in 568 ms. Result :sat
Minimization took 540 ms.
[2025-06-05 07:13:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:13:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:13:13] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2025-06-05 07:13:13] [INFO ] [Real]Added 1674 Read/Feed constraints in 298 ms returned sat
[2025-06-05 07:13:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 07:13:13] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 07:13:13] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2025-06-05 07:13:14] [INFO ] [Nat]Added 1674 Read/Feed constraints in 491 ms returned sat
[2025-06-05 07:13:14] [INFO ] Deduced a trap composed of 102 places in 195 ms of which 3 ms to minimize.
[2025-06-05 07:13:14] [INFO ] Deduced a trap composed of 105 places in 205 ms of which 2 ms to minimize.
[2025-06-05 07:13:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 597 ms
[2025-06-05 07:13:15] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 176 ms.
[2025-06-05 07:13:15] [INFO ] Added : 23 causal constraints over 5 iterations in 739 ms. Result :sat
Minimization took 536 ms.
[2025-06-05 07:13:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 07:13:16] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:13:16] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2025-06-05 07:13:17] [INFO ] [Real]Added 1674 Read/Feed constraints in 308 ms returned sat
[2025-06-05 07:13:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 07:13:17] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:13:17] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2025-06-05 07:13:18] [INFO ] [Nat]Added 1674 Read/Feed constraints in 564 ms returned sat
[2025-06-05 07:13:18] [INFO ] Deduced a trap composed of 100 places in 203 ms of which 2 ms to minimize.
[2025-06-05 07:13:18] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 3 ms to minimize.
[2025-06-05 07:13:18] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:13:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 684 ms
[2025-06-05 07:13:18] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 172 ms.
[2025-06-05 07:13:19] [INFO ] Added : 36 causal constraints over 8 iterations in 1195 ms. Result :sat
Minimization took 540 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0, 0] Max Struct:[12, 12, 1, 1, 1, 12]
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[12, 12, 1, 1, 12]
Support contains 5 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.5 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 948 place count 271 transition count 391
Iterating global reduction 1 with 117 rules applied. Total rules applied 1065 place count 271 transition count 391
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1076 place count 271 transition count 380
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1167 place count 180 transition count 289
Iterating global reduction 2 with 91 rules applied. Total rules applied 1258 place count 180 transition count 289
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1294 place count 180 transition count 253
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1330 place count 144 transition count 203
Iterating global reduction 3 with 36 rules applied. Total rules applied 1366 place count 144 transition count 203
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1393 place count 144 transition count 176
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1401 place count 136 transition count 164
Iterating global reduction 4 with 8 rules applied. Total rules applied 1409 place count 136 transition count 164
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1416 place count 129 transition count 157
Iterating global reduction 4 with 7 rules applied. Total rules applied 1423 place count 129 transition count 157
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1426 place count 126 transition count 154
Iterating global reduction 4 with 3 rules applied. Total rules applied 1429 place count 126 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1431 place count 126 transition count 152
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1434 place count 123 transition count 149
Iterating global reduction 5 with 3 rules applied. Total rules applied 1437 place count 123 transition count 149
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1439 place count 121 transition count 147
Iterating global reduction 5 with 2 rules applied. Total rules applied 1441 place count 121 transition count 147
Applied a total of 1441 rules in 107 ms. Remains 121 /414 variables (removed 293) and now considering 147/1954 (removed 1807) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 121/414 places, 147/1954 transitions.
// Phase 1: matrix 147 rows 121 cols
[2025-06-05 07:13:20] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[12, 12, 1, 1, 12]
RANDOM walk for 1000000 steps (224717 resets) in 1052 ms. (949 steps per ms)
BEST_FIRST walk for 5000002 steps (517126 resets) in 2634 ms. (1897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[12, 12, 1, 1, 12]
[2025-06-05 07:13:24] [INFO ] Invariant cache hit.
[2025-06-05 07:13:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-05 07:13:24] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-05 07:13:24] [INFO ] [Real]Added 62 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:13:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Nat]Added 62 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:13:24] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2025-06-05 07:13:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-06-05 07:13:24] [INFO ] Computed and/alt/rep : 33/86/33 causal constraints (skipped 113 transitions) in 8 ms.
[2025-06-05 07:13:24] [INFO ] Added : 14 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 71 ms.
[2025-06-05 07:13:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Real]Added 62 Read/Feed constraints in 17 ms returned sat
[2025-06-05 07:13:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-05 07:13:24] [INFO ] [Nat]Added 62 Read/Feed constraints in 15 ms returned sat
[2025-06-05 07:13:24] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2025-06-05 07:13:24] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2025-06-05 07:13:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2025-06-05 07:13:24] [INFO ] Computed and/alt/rep : 33/86/33 causal constraints (skipped 113 transitions) in 8 ms.
[2025-06-05 07:13:24] [INFO ] Added : 16 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 71 ms.
[2025-06-05 07:13:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Real]Added 62 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:13:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Nat]Added 62 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:13:25] [INFO ] Computed and/alt/rep : 33/86/33 causal constraints (skipped 113 transitions) in 9 ms.
[2025-06-05 07:13:25] [INFO ] Added : 14 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 63 ms.
[2025-06-05 07:13:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Real]Added 62 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:13:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Nat]Added 62 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:13:25] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:13:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-06-05 07:13:25] [INFO ] Computed and/alt/rep : 33/86/33 causal constraints (skipped 113 transitions) in 10 ms.
[2025-06-05 07:13:25] [INFO ] Added : 22 causal constraints over 5 iterations in 73 ms. Result :sat
Minimization took 67 ms.
[2025-06-05 07:13:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Real]Added 62 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:13:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-05 07:13:25] [INFO ] [Nat]Added 62 Read/Feed constraints in 18 ms returned sat
[2025-06-05 07:13:25] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:13:26] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2025-06-05 07:13:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2025-06-05 07:13:26] [INFO ] Computed and/alt/rep : 33/86/33 causal constraints (skipped 113 transitions) in 9 ms.
[2025-06-05 07:13:26] [INFO ] Added : 24 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[12, 12, 1, 1, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[12, 12, 1, 1, 12]
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 147/147 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 121/121 places, 147/147 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 147/147 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2025-06-05 07:13:26] [INFO ] Invariant cache hit.
[2025-06-05 07:13:26] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-05 07:13:26] [INFO ] Invariant cache hit.
[2025-06-05 07:13:26] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-05 07:13:26] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2025-06-05 07:13:26] [INFO ] Redundant transitions in 4 ms returned []
Running 146 sub problems to find dead transitions.
[2025-06-05 07:13:26] [INFO ] Invariant cache hit.
[2025-06-05 07:13:26] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/121 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/268 variables, 121/125 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 62/187 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 187 constraints, problems are : Problem set: 0 solved, 146 unsolved in 3805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/121 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/268 variables, 121/125 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 62/187 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 146/333 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2025-06-05 07:13:33] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:13:33] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:13:33] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2025-06-05 07:13:33] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 4/337 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/337 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/337 constraints. Problems are: Problem set: 3 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 337 constraints, problems are : Problem set: 3 solved, 143 unsolved in 13577 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 4/4 constraints]
After SMT, in 17634ms problems are : Problem set: 3 solved, 143 unsolved
Search for dead transitions found 3 dead transitions in 17643ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 121/121 places, 144/147 transitions.
Graph (complete) has 346 edges and 121 vertex of which 118 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 118 /121 variables (removed 3) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 118 cols
[2025-06-05 07:13:44] [INFO ] Computed 3 invariants in 1 ms
[2025-06-05 07:13:44] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-05 07:13:44] [INFO ] Invariant cache hit.
[2025-06-05 07:13:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-05 07:13:44] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 118/121 places, 144/147 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18245 ms. Remains : 118/121 places, 144/147 transitions.
[2025-06-05 07:13:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[12, 12, 1, 1, 12]
RANDOM walk for 1000000 steps (224549 resets) in 1120 ms. (892 steps per ms)
BEST_FIRST walk for 5000003 steps (516927 resets) in 2706 ms. (1847 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[12, 12, 1, 1, 12]
[2025-06-05 07:13:48] [INFO ] Invariant cache hit.
[2025-06-05 07:13:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:13:48] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
[2025-06-05 07:13:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:13:48] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:13:48] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-05 07:13:48] [INFO ] [Real]Added 61 Read/Feed constraints in 15 ms returned sat
[2025-06-05 07:13:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:13:48] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-05 07:13:48] [INFO ] [Nat]Added 61 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:13:48] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:13:48] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
[2025-06-05 07:13:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2025-06-05 07:13:48] [INFO ] Computed and/alt/rep : 32/81/32 causal constraints (skipped 111 transitions) in 13 ms.
[2025-06-05 07:13:48] [INFO ] Added : 22 causal constraints over 5 iterations in 74 ms. Result :sat
Minimization took 53 ms.
[2025-06-05 07:13:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:48] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:13:48] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:13:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:13:49] [INFO ] Computed and/alt/rep : 32/81/32 causal constraints (skipped 111 transitions) in 10 ms.
[2025-06-05 07:13:49] [INFO ] Added : 15 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 48 ms.
[2025-06-05 07:13:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Real]Added 61 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:13:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Nat]Added 61 Read/Feed constraints in 25 ms returned sat
[2025-06-05 07:13:49] [INFO ] Computed and/alt/rep : 32/81/32 causal constraints (skipped 111 transitions) in 12 ms.
[2025-06-05 07:13:49] [INFO ] Added : 18 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 50 ms.
[2025-06-05 07:13:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:13:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-05 07:13:49] [INFO ] [Nat]Added 61 Read/Feed constraints in 19 ms returned sat
[2025-06-05 07:13:49] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:13:49] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:13:49] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:13:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 158 ms
[2025-06-05 07:13:49] [INFO ] Computed and/alt/rep : 32/81/32 causal constraints (skipped 111 transitions) in 9 ms.
[2025-06-05 07:13:49] [INFO ] Added : 25 causal constraints over 5 iterations in 76 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[1, 12, 1, 1, 12]
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 118/118 places, 144/144 transitions.
[2025-06-05 07:13:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
RANDOM walk for 1000000 steps (224495 resets) in 1089 ms. (917 steps per ms)
BEST_FIRST walk for 4000002 steps (413281 resets) in 2162 ms. (1849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
[2025-06-05 07:13:53] [INFO ] Invariant cache hit.
[2025-06-05 07:13:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:53] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-05 07:13:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-05 07:13:53] [INFO ] [Real]Added 61 Read/Feed constraints in 16 ms returned sat
[2025-06-05 07:13:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:53] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-05 07:13:53] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:13:53] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:13:53] [INFO ] Deduced a trap composed of 51 places in 34 ms of which 1 ms to minimize.
[2025-06-05 07:13:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2025-06-05 07:13:53] [INFO ] Computed and/alt/rep : 32/81/32 causal constraints (skipped 111 transitions) in 8 ms.
[2025-06-05 07:13:53] [INFO ] Added : 22 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 57 ms.
[2025-06-05 07:13:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:53] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-05 07:13:53] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:13:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:53] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:13:53] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:13:53] [INFO ] Computed and/alt/rep : 32/81/32 causal constraints (skipped 111 transitions) in 11 ms.
[2025-06-05 07:13:53] [INFO ] Added : 15 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 51 ms.
[2025-06-05 07:13:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:54] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:13:54] [INFO ] [Real]Added 61 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:13:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:54] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:13:54] [INFO ] [Nat]Added 61 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:13:54] [INFO ] Computed and/alt/rep : 32/81/32 causal constraints (skipped 111 transitions) in 10 ms.
[2025-06-05 07:13:54] [INFO ] Added : 18 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 49 ms.
[2025-06-05 07:13:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:13:54] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-05 07:13:54] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:13:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:13:54] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-05 07:13:54] [INFO ] [Nat]Added 61 Read/Feed constraints in 19 ms returned sat
[2025-06-05 07:13:54] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:13:54] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 4 ms to minimize.
[2025-06-05 07:13:54] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:13:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2025-06-05 07:13:54] [INFO ] Computed and/alt/rep : 32/81/32 causal constraints (skipped 111 transitions) in 7 ms.
[2025-06-05 07:13:54] [INFO ] Added : 25 causal constraints over 5 iterations in 73 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 118/118 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2025-06-05 07:13:54] [INFO ] Invariant cache hit.
[2025-06-05 07:13:54] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-05 07:13:54] [INFO ] Invariant cache hit.
[2025-06-05 07:13:55] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-05 07:13:55] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2025-06-05 07:13:55] [INFO ] Redundant transitions in 5 ms returned []
Running 143 sub problems to find dead transitions.
[2025-06-05 07:13:55] [INFO ] Invariant cache hit.
[2025-06-05 07:13:55] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 4 (OVERLAPS) 144/262 variables, 118/121 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 61/182 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/182 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/182 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 182 constraints, problems are : Problem set: 3 solved, 140 unsolved in 3543 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 118/118 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 143/258 variables, 115/118 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 60/178 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 16/194 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 4/262 variables, 3/197 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 1/198 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 124/322 constraints. Problems are: Problem set: 3 solved, 140 unsolved
[2025-06-05 07:14:02] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
[2025-06-05 07:14:03] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2025-06-05 07:14:03] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 3/325 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/325 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 13 (OVERLAPS) 0/262 variables, 0/325 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 325 constraints, problems are : Problem set: 3 solved, 140 unsolved in 13247 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 118/118 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 140/143 constraints, Known Traps: 3/3 constraints]
After SMT, in 16950ms problems are : Problem set: 3 solved, 140 unsolved
Search for dead transitions found 3 dead transitions in 16952ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/118 places, 141/144 transitions.
Graph (complete) has 337 edges and 118 vertex of which 115 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 115 /118 variables (removed 3) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 115 cols
[2025-06-05 07:14:12] [INFO ] Computed 3 invariants in 1 ms
[2025-06-05 07:14:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-05 07:14:12] [INFO ] Invariant cache hit.
[2025-06-05 07:14:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-05 07:14:12] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 115/118 places, 141/144 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17531 ms. Remains : 115/118 places, 141/144 transitions.
[2025-06-05 07:14:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
RANDOM walk for 1000000 steps (224262 resets) in 1034 ms. (966 steps per ms)
BEST_FIRST walk for 4000002 steps (413522 resets) in 2094 ms. (1909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
[2025-06-05 07:14:15] [INFO ] Invariant cache hit.
[2025-06-05 07:14:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:14:15] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:14:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-05 07:14:15] [INFO ] [Real]Added 60 Read/Feed constraints in 20 ms returned sat
[2025-06-05 07:14:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:14:15] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:14:15] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:14:15] [INFO ] Computed and/alt/rep : 31/74/31 causal constraints (skipped 109 transitions) in 10 ms.
[2025-06-05 07:14:15] [INFO ] Added : 17 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 57 ms.
[2025-06-05 07:14:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:14:15] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:14:15] [INFO ] [Real]Added 60 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:14:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:14:15] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:14:16] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:14:16] [INFO ] Computed and/alt/rep : 31/74/31 causal constraints (skipped 109 transitions) in 10 ms.
[2025-06-05 07:14:16] [INFO ] Added : 16 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 55 ms.
[2025-06-05 07:14:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:14:16] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:14:16] [INFO ] [Real]Added 60 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:14:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 07:14:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:14:16] [INFO ] [Nat]Added 60 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:14:16] [INFO ] Computed and/alt/rep : 31/74/31 causal constraints (skipped 109 transitions) in 9 ms.
[2025-06-05 07:14:16] [INFO ] Added : 21 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 58 ms.
[2025-06-05 07:14:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:16] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 07:14:16] [INFO ] [Real]Added 60 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:14:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:16] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:14:16] [INFO ] [Nat]Added 60 Read/Feed constraints in 17 ms returned sat
[2025-06-05 07:14:16] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-05 07:14:16] [INFO ] Computed and/alt/rep : 31/74/31 causal constraints (skipped 109 transitions) in 8 ms.
[2025-06-05 07:14:16] [INFO ] Added : 19 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 141/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 115/115 places, 141/141 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 141/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2025-06-05 07:14:16] [INFO ] Invariant cache hit.
[2025-06-05 07:14:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-05 07:14:16] [INFO ] Invariant cache hit.
[2025-06-05 07:14:17] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-05 07:14:17] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2025-06-05 07:14:17] [INFO ] Redundant transitions in 5 ms returned []
Running 140 sub problems to find dead transitions.
[2025-06-05 07:14:17] [INFO ] Invariant cache hit.
[2025-06-05 07:14:17] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/256 variables, 115/118 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 60/178 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 178 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/256 variables, 115/118 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 60/178 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 140/318 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-06-05 07:14:23] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/319 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/319 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/319 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 319 constraints, problems are : Problem set: 3 solved, 137 unsolved in 10811 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
After SMT, in 14124ms problems are : Problem set: 3 solved, 137 unsolved
Search for dead transitions found 3 dead transitions in 14126ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 115/115 places, 138/141 transitions.
Graph (complete) has 327 edges and 115 vertex of which 112 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 112 /115 variables (removed 3) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 112 cols
[2025-06-05 07:14:31] [INFO ] Computed 2 invariants in 2 ms
[2025-06-05 07:14:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-05 07:14:31] [INFO ] Invariant cache hit.
[2025-06-05 07:14:31] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:14:31] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 112/115 places, 138/141 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14690 ms. Remains : 112/115 places, 138/141 transitions.
[2025-06-05 07:14:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
RANDOM walk for 1000000 steps (224495 resets) in 1060 ms. (942 steps per ms)
BEST_FIRST walk for 4000002 steps (414110 resets) in 2161 ms. (1850 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
[2025-06-05 07:14:34] [INFO ] Invariant cache hit.
[2025-06-05 07:14:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:14:34] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:14:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:14:34] [INFO ] [Real]Added 59 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:14:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:14:34] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-05 07:14:34] [INFO ] [Nat]Added 59 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:14:35] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2025-06-05 07:14:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2025-06-05 07:14:35] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 107 transitions) in 11 ms.
[2025-06-05 07:14:35] [INFO ] Added : 19 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 45 ms.
[2025-06-05 07:14:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Real]Added 59 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:14:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Nat]Added 59 Read/Feed constraints in 7 ms returned sat
[2025-06-05 07:14:35] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 107 transitions) in 9 ms.
[2025-06-05 07:14:35] [INFO ] Added : 15 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 43 ms.
[2025-06-05 07:14:35] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Real]Added 59 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:14:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Nat]Added 59 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:14:35] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 107 transitions) in 8 ms.
[2025-06-05 07:14:35] [INFO ] Added : 23 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 49 ms.
[2025-06-05 07:14:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Real]Added 59 Read/Feed constraints in 13 ms returned sat
[2025-06-05 07:14:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-05 07:14:35] [INFO ] [Nat]Added 59 Read/Feed constraints in 18 ms returned sat
[2025-06-05 07:14:35] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 107 transitions) in 9 ms.
[2025-06-05 07:14:35] [INFO ] Added : 17 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[12, 1, 1, 12]
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 138/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 112/112 places, 138/138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 138/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2025-06-05 07:14:36] [INFO ] Invariant cache hit.
[2025-06-05 07:14:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-05 07:14:36] [INFO ] Invariant cache hit.
[2025-06-05 07:14:36] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:14:36] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2025-06-05 07:14:36] [INFO ] Redundant transitions in 2 ms returned []
Running 137 sub problems to find dead transitions.
[2025-06-05 07:14:36] [INFO ] Invariant cache hit.
[2025-06-05 07:14:36] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/250 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 59/173 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 173 constraints, problems are : Problem set: 0 solved, 137 unsolved in 3190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/250 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 59/173 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 137/310 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2025-06-05 07:14:41] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 311 constraints, problems are : Problem set: 0 solved, 137 unsolved in 9405 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 1/1 constraints]
After SMT, in 12730ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 12732ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13010 ms. Remains : 112/112 places, 138/138 transitions.
[2025-06-05 07:14:49] [INFO ] Flatten gal took : 74 ms
[2025-06-05 07:14:49] [INFO ] Flatten gal took : 33 ms
[2025-06-05 07:14:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6703419474995920813.gal : 15 ms
[2025-06-05 07:14:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15844766723951632985.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6703419474995920813.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15844766723951632985.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (8994 resets) in 1548 ms. (25 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality15844766723951632985.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 41
BEST_FIRST walk for 40002 steps (4145 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :194 after 214
BEST_FIRST walk for 40002 steps (4109 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :214 after 776
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :776 after 2484
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2484 after 3776
BEST_FIRST walk for 40003 steps (4080 resets) in 302 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4199 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4071 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (4137 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3776 after 10624
BEST_FIRST walk for 40002 steps (4165 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :10624 after 27296
BEST_FIRST walk for 40003 steps (4186 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :27296 after 44126
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :44126 after 91641
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :91641 after 552519
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :552519 after 9.63392e+06
Interrupted probabilistic random walk after 622002 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :4 out of 8
Probabilistic random walk after 622002 steps, saw 278716 distinct states, run finished after 3003 ms. (steps per millisecond=207 ) properties seen :4
[2025-06-05 07:14:53] [INFO ] Invariant cache hit.
[2025-06-05 07:14:53] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/123 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 120/243 variables, 88/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 32/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/248 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MAX3 is UNSAT
After SMT solving in domain Real declared 250/250 variables, and 173 constraints, problems are : Problem set: 2 solved, 0 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0] Max Struct:[12, 12]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
[2025-06-05 07:14:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2210 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (1044 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 07:14:53] [INFO ] Invariant cache hit.
[2025-06-05 07:14:53] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 07:14:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:14:53] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-05 07:14:53] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:14:53] [INFO ] [Real]Added 59 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:14:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:14:53] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-05 07:14:53] [INFO ] [Nat]Added 59 Read/Feed constraints in 11 ms returned sat
[2025-06-05 07:14:53] [INFO ] Deduced a trap composed of 39 places in 24 ms of which 0 ms to minimize.
[2025-06-05 07:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-05 07:14:53] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 107 transitions) in 7 ms.
[2025-06-05 07:14:53] [INFO ] Added : 19 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 138/138 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 124
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 106 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 106 transition count 120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 102 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 102 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 102 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 99 transition count 110
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 99 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 96 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 96 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 95 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 95 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 95 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 94 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 94 transition count 104
Applied a total of 38 rules in 12 ms. Remains 94 /112 variables (removed 18) and now considering 104/138 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 94/112 places, 104/138 transitions.
// Phase 1: matrix 104 rows 94 cols
[2025-06-05 07:14:53] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (224194 resets) in 804 ms. (1242 steps per ms)
BEST_FIRST walk for 1000000 steps (103969 resets) in 413 ms. (2415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 07:14:54] [INFO ] Invariant cache hit.
[2025-06-05 07:14:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:14:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 07:14:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 07:14:54] [INFO ] [Real]Added 38 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:14:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:14:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:14:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 07:14:55] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-05 07:14:55] [INFO ] [Nat]Added 38 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:14:55] [INFO ] Computed and/alt/rep : 24/58/24 causal constraints (skipped 79 transitions) in 7 ms.
[2025-06-05 07:14:55] [INFO ] Added : 17 causal constraints over 4 iterations in 70 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 94/94 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-05 07:14:55] [INFO ] Invariant cache hit.
[2025-06-05 07:14:55] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-05 07:14:55] [INFO ] Invariant cache hit.
[2025-06-05 07:14:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 07:14:55] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2025-06-05 07:14:55] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2025-06-05 07:14:55] [INFO ] Invariant cache hit.
[2025-06-05 07:14:55] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/198 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 38/134 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2025-06-05 07:14:56] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 135 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/198 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 103/238 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 238 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 1/1 constraints]
After SMT, in 6839ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 6840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7121 ms. Remains : 94/94 places, 104/104 transitions.
[2025-06-05 07:15:02] [INFO ] Flatten gal took : 12 ms
RANDOM walk for 40000 steps (8926 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
[2025-06-05 07:15:02] [INFO ] Flatten gal took : 11 ms
[2025-06-05 07:15:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7234910555240888640.gal : 2 ms
[2025-06-05 07:15:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4697859298411846618.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7234910555240888640.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4697859298411846618.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4697859298411846618.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
BEST_FIRST walk for 40002 steps (4141 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :194 after 214
BEST_FIRST walk for 40001 steps (4054 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :214 after 469
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :469 after 1560
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1560 after 3376
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3376 after 20486
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :20486 after 45022
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :45022 after 368011
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :368011 after 4.49968e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.49968e+06 after 6.57379e+07
Interrupted probabilistic random walk after 3001895 steps, run timeout after 3001 ms. (steps per millisecond=1000 ) properties seen :1 out of 2
Probabilistic random walk after 3001895 steps, saw 1397347 distinct states, run finished after 3001 ms. (steps per millisecond=1000 ) properties seen :1
[2025-06-05 07:15:05] [INFO ] Invariant cache hit.
[2025-06-05 07:15:05] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/82 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 110/192 variables, 83/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 27/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/196 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 198/198 variables, and 134 constraints, problems are : Problem set: 1 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[12]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-06 in 12225 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
// Phase 1: matrix 138 rows 112 cols
[2025-06-05 07:15:05] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2220 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10000 steps (1061 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 07:15:05] [INFO ] Invariant cache hit.
[2025-06-05 07:15:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:15:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:15:05] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-05 07:15:05] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 07:15:05] [INFO ] [Real]Added 59 Read/Feed constraints in 14 ms returned sat
[2025-06-05 07:15:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 07:15:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 07:15:05] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-05 07:15:05] [INFO ] [Nat]Added 59 Read/Feed constraints in 15 ms returned sat
[2025-06-05 07:15:05] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 107 transitions) in 10 ms.
[2025-06-05 07:15:05] [INFO ] Added : 17 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 108 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 108 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 105 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 105 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 103 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 103 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 101 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 101 transition count 125
Applied a total of 22 rules in 9 ms. Remains 101 /112 variables (removed 11) and now considering 125/138 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 101/112 places, 125/138 transitions.
// Phase 1: matrix 125 rows 101 cols
[2025-06-05 07:15:05] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (224701 resets) in 904 ms. (1104 steps per ms)
BEST_FIRST walk for 1000000 steps (103161 resets) in 467 ms. (2136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 07:15:07] [INFO ] Invariant cache hit.
[2025-06-05 07:15:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:15:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 07:15:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 07:15:07] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-05 07:15:07] [INFO ] [Real]Added 54 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:15:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 07:15:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 07:15:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-05 07:15:07] [INFO ] [Nat]Added 54 Read/Feed constraints in 12 ms returned sat
[2025-06-05 07:15:07] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2025-06-05 07:15:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-05 07:15:07] [INFO ] Computed and/alt/rep : 26/65/26 causal constraints (skipped 98 transitions) in 6 ms.
[2025-06-05 07:15:07] [INFO ] Added : 18 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 125/125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2025-06-05 07:15:07] [INFO ] Invariant cache hit.
[2025-06-05 07:15:07] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 07:15:07] [INFO ] Invariant cache hit.
[2025-06-05 07:15:07] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-05 07:15:07] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2025-06-05 07:15:07] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2025-06-05 07:15:07] [INFO ] Invariant cache hit.
[2025-06-05 07:15:07] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/226 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 54/157 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 157 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2938 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/226 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 54/157 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 124/281 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2025-06-05 07:15:12] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 0/226 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 282 constraints, problems are : Problem set: 0 solved, 124 unsolved in 7896 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 1/1 constraints]
After SMT, in 10952ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 10954ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11184 ms. Remains : 101/101 places, 125/125 transitions.
[2025-06-05 07:15:18] [INFO ] Flatten gal took : 8 ms
RANDOM walk for 40000 steps (9062 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4165 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
[2025-06-05 07:15:18] [INFO ] Flatten gal took : 37 ms
[2025-06-05 07:15:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5517411388285394685.gal : 2 ms
[2025-06-05 07:15:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6348283325572395107.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5517411388285394685.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6348283325572395107.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6348283325572395107.prop.
BEST_FIRST walk for 40004 steps (4044 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :194 after 218
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :218 after 914
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :914 after 2672
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2672 after 3504
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3504 after 34190
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :34190 after 50731
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :50731 after 451227
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :451227 after 9.63862e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9.63862e+06 after 1.15107e+08
Interrupted probabilistic random walk after 2610957 steps, run timeout after 3001 ms. (steps per millisecond=870 ) properties seen :1 out of 2
Probabilistic random walk after 2610957 steps, saw 1146267 distinct states, run finished after 3001 ms. (steps per millisecond=870 ) properties seen :1
[2025-06-05 07:15:21] [INFO ] Invariant cache hit.
[2025-06-05 07:15:21] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 98/112 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 108/220 variables, 80/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 28/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/224 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 226/226 variables, and 157 constraints, problems are : Problem set: 1 solved, 0 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[12]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-15 in 16467 ms.
[2025-06-05 07:15:21] [INFO ] Flatten gal took : 12 ms
[2025-06-05 07:15:22] [INFO ] Applying decomposition
[2025-06-05 07:15:22] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17813953878533973981.txt' '-o' '/tmp/graph17813953878533973981.bin' '-w' '/tmp/graph17813953878533973981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17813953878533973981.bin' '-l' '-1' '-v' '-w' '/tmp/graph17813953878533973981.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:15:22] [INFO ] Decomposing Gal with order
[2025-06-05 07:15:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:15:22] [INFO ] Removed a total of 124 redundant transitions.
[2025-06-05 07:15:22] [INFO ] Flatten gal took : 306 ms
[2025-06-05 07:15:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 53 ms.
[2025-06-05 07:15:22] [INFO ] Time to serialize gal into /tmp/UpperBounds9997758875721583861.gal : 7 ms
[2025-06-05 07:15:22] [INFO ] Time to serialize properties into /tmp/UpperBounds11265358020947267960.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9997758875721583861.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11265358020947267960.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds11265358020947267960.prop.
Detected timeout of ITS tools.
[2025-06-05 07:36:09] [INFO ] Flatten gal took : 10 ms
[2025-06-05 07:36:09] [INFO ] Time to serialize gal into /tmp/UpperBounds2594830921812145713.gal : 1 ms
[2025-06-05 07:36:09] [INFO ] Time to serialize properties into /tmp/UpperBounds11587513466368172205.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2594830921812145713.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11587513466368172205.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds11587513466368172205.prop.
ITS-tools command line returned an error code 137
[2025-06-05 07:51:42] [INFO ] Flatten gal took : 10 ms
[2025-06-05 07:51:42] [INFO ] Input system was already deterministic with 138 transitions.
[2025-06-05 07:51:42] [INFO ] Transformed 112 places.
[2025-06-05 07:51:42] [INFO ] Transformed 138 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-05 07:51:42] [INFO ] Time to serialize gal into /tmp/UpperBounds12018903630618112540.gal : 2 ms
[2025-06-05 07:51:42] [INFO ] Time to serialize properties into /tmp/UpperBounds7726299341574404498.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12018903630618112540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7726299341574404498.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7726299341574404498.prop.
Detected timeout of ITS tools.
Total runtime 3570584 ms.
BK_STOP 1749111149955
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m96"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is SieveSingleMsgMbox-PT-d2m96, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-174902009200062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m96.tgz
mv SieveSingleMsgMbox-PT-d2m96 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;