About the Execution of Marcie+red for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5584.836 | 3600000.00 | 3637096.00 | 9026.90 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r138-smll-167819420900485.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DoubleExponent-PT-020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420900485
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:22 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
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678876926750
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 10:42:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 10:42:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:42:09] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2023-03-15 10:42:09] [INFO ] Transformed 1064 places.
[2023-03-15 10:42:09] [INFO ] Transformed 998 transitions.
[2023-03-15 10:42:09] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 998 rows 1064 cols
[2023-03-15 10:42:10] [INFO ] Invariants computation overflowed in 228 ms
Incomplete random walk after 10000 steps, including 342 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 292 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
// Phase 1: matrix 998 rows 1064 cols
[2023-03-15 10:42:11] [INFO ] Invariants computation overflowed in 403 ms
[2023-03-15 10:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:16] [INFO ] [Real]Absence check using state equation in 4596 ms returned unknown
[2023-03-15 10:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:19] [INFO ] [Real]Absence check using state equation in 3362 ms returned sat
[2023-03-15 10:42:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:23] [INFO ] [Nat]Absence check using state equation in 3161 ms returned sat
[2023-03-15 10:42:24] [INFO ] Deduced a trap composed of 72 places in 613 ms of which 6 ms to minimize.
[2023-03-15 10:42:25] [INFO ] Deduced a trap composed of 61 places in 969 ms of which 3 ms to minimize.
[2023-03-15 10:42:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:29] [INFO ] [Real]Absence check using state equation in 3877 ms returned sat
[2023-03-15 10:42:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:42:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:32] [INFO ] [Nat]Absence check using state equation in 2840 ms returned sat
[2023-03-15 10:42:32] [INFO ] Deduced a trap composed of 77 places in 414 ms of which 3 ms to minimize.
[2023-03-15 10:42:33] [INFO ] Deduced a trap composed of 90 places in 534 ms of which 3 ms to minimize.
[2023-03-15 10:42:33] [INFO ] Deduced a trap composed of 305 places in 424 ms of which 1 ms to minimize.
[2023-03-15 10:42:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1607 ms
[2023-03-15 10:42:34] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 82 ms.
[2023-03-15 10:42:35] [INFO ] Deduced a trap composed of 8 places in 919 ms of which 1 ms to minimize.
[2023-03-15 10:42:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:36] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2023-03-15 10:42:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:37] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2023-03-15 10:42:37] [INFO ] Deduced a trap composed of 368 places in 738 ms of which 2 ms to minimize.
[2023-03-15 10:42:39] [INFO ] Deduced a trap composed of 59 places in 658 ms of which 1 ms to minimize.
[2023-03-15 10:42:40] [INFO ] Deduced a trap composed of 400 places in 649 ms of which 1 ms to minimize.
[2023-03-15 10:42:40] [INFO ] Deduced a trap composed of 55 places in 624 ms of which 2 ms to minimize.
[2023-03-15 10:42:41] [INFO ] Deduced a trap composed of 41 places in 610 ms of which 1 ms to minimize.
[2023-03-15 10:42:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:42] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2023-03-15 10:42:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:44] [INFO ] [Nat]Absence check using state equation in 1279 ms returned sat
[2023-03-15 10:42:44] [INFO ] Deduced a trap composed of 445 places in 593 ms of which 3 ms to minimize.
[2023-03-15 10:42:45] [INFO ] Deduced a trap composed of 31 places in 635 ms of which 2 ms to minimize.
[2023-03-15 10:42:45] [INFO ] Deduced a trap composed of 113 places in 374 ms of which 1 ms to minimize.
[2023-03-15 10:42:46] [INFO ] Deduced a trap composed of 89 places in 677 ms of which 2 ms to minimize.
[2023-03-15 10:42:47] [INFO ] Deduced a trap composed of 108 places in 815 ms of which 1 ms to minimize.
[2023-03-15 10:42:48] [INFO ] Deduced a trap composed of 433 places in 761 ms of which 2 ms to minimize.
[2023-03-15 10:42:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:42:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:51] [INFO ] [Real]Absence check using state equation in 3036 ms returned sat
[2023-03-15 10:42:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:53] [INFO ] [Nat]Absence check using state equation in 1991 ms returned sat
[2023-03-15 10:42:54] [INFO ] Deduced a trap composed of 408 places in 634 ms of which 1 ms to minimize.
[2023-03-15 10:42:55] [INFO ] Deduced a trap composed of 58 places in 777 ms of which 1 ms to minimize.
[2023-03-15 10:42:56] [INFO ] Deduced a trap composed of 418 places in 952 ms of which 2 ms to minimize.
[2023-03-15 10:42:57] [INFO ] Deduced a trap composed of 41 places in 927 ms of which 2 ms to minimize.
[2023-03-15 10:42:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:42:58] [INFO ] [Real]Absence check using state equation in 1280 ms returned sat
[2023-03-15 10:42:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:00] [INFO ] [Nat]Absence check using state equation in 1344 ms returned sat
[2023-03-15 10:43:01] [INFO ] Deduced a trap composed of 61 places in 540 ms of which 2 ms to minimize.
[2023-03-15 10:43:01] [INFO ] Deduced a trap composed of 397 places in 646 ms of which 2 ms to minimize.
[2023-03-15 10:43:02] [INFO ] Deduced a trap composed of 415 places in 629 ms of which 1 ms to minimize.
[2023-03-15 10:43:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2102 ms
[2023-03-15 10:43:02] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 70 ms.
[2023-03-15 10:43:03] [INFO ] Added : 5 causal constraints over 1 iterations in 1417 ms. Result :unknown
[2023-03-15 10:43:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:04] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2023-03-15 10:43:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:05] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2023-03-15 10:43:05] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 70 ms.
[2023-03-15 10:43:09] [INFO ] Added : 75 causal constraints over 15 iterations in 4089 ms. Result :unknown
[2023-03-15 10:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:11] [INFO ] [Real]Absence check using state equation in 1887 ms returned sat
[2023-03-15 10:43:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:14] [INFO ] [Nat]Absence check using state equation in 2156 ms returned sat
[2023-03-15 10:43:14] [INFO ] Deduced a trap composed of 67 places in 598 ms of which 2 ms to minimize.
[2023-03-15 10:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 813 ms
[2023-03-15 10:43:15] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 119 ms.
[2023-03-15 10:43:17] [INFO ] Added : 20 causal constraints over 4 iterations in 1892 ms. Result :unknown
[2023-03-15 10:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:18] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2023-03-15 10:43:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:19] [INFO ] [Nat]Absence check using state equation in 1274 ms returned sat
[2023-03-15 10:43:20] [INFO ] Deduced a trap composed of 65 places in 887 ms of which 2 ms to minimize.
[2023-03-15 10:43:21] [INFO ] Deduced a trap composed of 73 places in 903 ms of which 2 ms to minimize.
[2023-03-15 10:43:22] [INFO ] Deduced a trap composed of 84 places in 850 ms of which 1 ms to minimize.
[2023-03-15 10:43:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2912 ms
[2023-03-15 10:43:22] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 77 ms.
[2023-03-15 10:43:23] [INFO ] Added : 20 causal constraints over 4 iterations in 676 ms. Result :unknown
[2023-03-15 10:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:24] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2023-03-15 10:43:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:25] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2023-03-15 10:43:25] [INFO ] Deduced a trap composed of 149 places in 372 ms of which 1 ms to minimize.
[2023-03-15 10:43:26] [INFO ] Deduced a trap composed of 137 places in 476 ms of which 1 ms to minimize.
[2023-03-15 10:43:26] [INFO ] Deduced a trap composed of 163 places in 524 ms of which 1 ms to minimize.
[2023-03-15 10:43:27] [INFO ] Deduced a trap composed of 151 places in 531 ms of which 1 ms to minimize.
[2023-03-15 10:43:28] [INFO ] Deduced a trap composed of 175 places in 323 ms of which 0 ms to minimize.
[2023-03-15 10:43:29] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3908 ms
[2023-03-15 10:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:30] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2023-03-15 10:43:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:31] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2023-03-15 10:43:31] [INFO ] Deduced a trap composed of 113 places in 361 ms of which 1 ms to minimize.
[2023-03-15 10:43:32] [INFO ] Deduced a trap composed of 125 places in 525 ms of which 2 ms to minimize.
[2023-03-15 10:43:33] [INFO ] Deduced a trap composed of 501 places in 905 ms of which 2 ms to minimize.
[2023-03-15 10:43:34] [INFO ] Deduced a trap composed of 477 places in 1032 ms of which 2 ms to minimize.
[2023-03-15 10:43:35] [INFO ] Deduced a trap composed of 470 places in 1014 ms of which 3 ms to minimize.
[2023-03-15 10:43:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:38] [INFO ] [Real]Absence check using state equation in 3069 ms returned sat
[2023-03-15 10:43:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:42] [INFO ] [Nat]Absence check using state equation in 2989 ms returned sat
[2023-03-15 10:43:42] [INFO ] Deduced a trap composed of 349 places in 640 ms of which 1 ms to minimize.
[2023-03-15 10:43:43] [INFO ] Deduced a trap composed of 163 places in 439 ms of which 1 ms to minimize.
[2023-03-15 10:43:43] [INFO ] Deduced a trap composed of 277 places in 469 ms of which 1 ms to minimize.
[2023-03-15 10:43:44] [INFO ] Deduced a trap composed of 151 places in 330 ms of which 0 ms to minimize.
[2023-03-15 10:43:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 10:43:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:47] [INFO ] [Real]Absence check using state equation in 2895 ms returned sat
[2023-03-15 10:43:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:43:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:48] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-15 10:43:49] [INFO ] Deduced a trap composed of 381 places in 761 ms of which 2 ms to minimize.
[2023-03-15 10:43:50] [INFO ] Deduced a trap composed of 394 places in 574 ms of which 1 ms to minimize.
[2023-03-15 10:43:50] [INFO ] Deduced a trap composed of 395 places in 704 ms of which 2 ms to minimize.
[2023-03-15 10:43:51] [INFO ] Deduced a trap composed of 55 places in 1040 ms of which 2 ms to minimize.
[2023-03-15 10:43:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4086 ms
[2023-03-15 10:43:52] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 114 ms.
[2023-03-15 10:43:52] [INFO ] Added : 0 causal constraints over 0 iterations in 116 ms. Result :unknown
[2023-03-15 10:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:53] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2023-03-15 10:43:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:43:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:43:54] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2023-03-15 10:43:55] [INFO ] Deduced a trap composed of 396 places in 866 ms of which 2 ms to minimize.
[2023-03-15 10:43:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1394 ms
[2023-03-15 10:43:55] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 84 ms.
[2023-03-15 10:43:58] [INFO ] Added : 20 causal constraints over 4 iterations in 2526 ms. Result :unknown
[2023-03-15 10:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:44:00] [INFO ] [Real]Absence check using state equation in 1523 ms returned sat
[2023-03-15 10:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:44:01] [INFO ] [Nat]Absence check using state equation in 1151 ms returned sat
[2023-03-15 10:44:02] [INFO ] Deduced a trap composed of 65 places in 504 ms of which 2 ms to minimize.
[2023-03-15 10:44:02] [INFO ] Deduced a trap composed of 107 places in 628 ms of which 1 ms to minimize.
[2023-03-15 10:44:03] [INFO ] Deduced a trap composed of 105 places in 645 ms of which 1 ms to minimize.
[2023-03-15 10:44:04] [INFO ] Deduced a trap composed of 84 places in 432 ms of which 1 ms to minimize.
[2023-03-15 10:44:04] [INFO ] Deduced a trap composed of 84 places in 450 ms of which 2 ms to minimize.
[2023-03-15 10:44:05] [INFO ] Deduced a trap composed of 108 places in 473 ms of which 1 ms to minimize.
[2023-03-15 10:44:05] [INFO ] Deduced a trap composed of 77 places in 455 ms of which 1 ms to minimize.
[2023-03-15 10:44:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1060 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 228 transitions
Trivial Post-agglo rules discarded 228 transitions
Performed 228 trivial Post agglomeration. Transition count delta: 228
Iterating post reduction 0 with 228 rules applied. Total rules applied 229 place count 1060 transition count 770
Reduce places removed 228 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 231 rules applied. Total rules applied 460 place count 832 transition count 767
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 463 place count 829 transition count 767
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 463 place count 829 transition count 724
Deduced a syphon composed of 43 places in 11 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 549 place count 786 transition count 724
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 11 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 3 with 346 rules applied. Total rules applied 895 place count 613 transition count 551
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 10 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 969 place count 576 transition count 551
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1049 place count 576 transition count 471
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 1129 place count 496 transition count 471
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 1208 place count 496 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1209 place count 495 transition count 470
Applied a total of 1209 rules in 413 ms. Remains 495 /1064 variables (removed 569) and now considering 470/998 (removed 528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 495/1064 places, 470/998 transitions.
// Phase 1: matrix 470 rows 495 cols
[2023-03-15 10:45:19] [INFO ] Computed 101 place invariants in 97 ms
Incomplete random walk after 1000000 steps, including 128008 resets, run finished after 1678 ms. (steps per millisecond=595 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84522 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84854 resets, run finished after 961 ms. (steps per millisecond=1040 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84793 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84242 resets, run finished after 1169 ms. (steps per millisecond=855 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84855 resets, run finished after 1161 ms. (steps per millisecond=861 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84815 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85108 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84411 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84360 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84871 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84676 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84864 resets, run finished after 1000 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84486 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84838 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84759 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84729 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties (out of 16) seen :0
[2023-03-15 10:45:36] [INFO ] Invariant cache hit.
[2023-03-15 10:45:36] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 10:45:37] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 44 ms returned sat
[2023-03-15 10:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:45:37] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2023-03-15 10:45:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:45:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 10:45:37] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 42 ms returned sat
[2023-03-15 10:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:45:37] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-15 10:45:37] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 10:45:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 10:45:43] [INFO ] [Nat]Added 73 Read/Feed constraints in 6094 ms returned unknown
[2023-03-15 10:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:45:44] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-15 10:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:45:44] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-15 10:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:45:44] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-15 10:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:45:44] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2023-03-15 10:45:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 282 ms returned sat
[2023-03-15 10:45:45] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 74 ms.
[2023-03-15 10:45:46] [INFO ] Added : 74 causal constraints over 15 iterations in 949 ms. Result :sat
Minimization took 872 ms.
[2023-03-15 10:45:47] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:45:47] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 35 ms returned sat
[2023-03-15 10:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:45:47] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2023-03-15 10:45:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:45:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 10:45:48] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 51 ms returned sat
[2023-03-15 10:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:45:48] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2023-03-15 10:45:49] [INFO ] [Nat]Added 73 Read/Feed constraints in 603 ms returned sat
[2023-03-15 10:45:49] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 68 ms.
[2023-03-15 10:45:54] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2023-03-15 10:45:54] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 2 ms to minimize.
[2023-03-15 10:45:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
[2023-03-15 10:45:55] [INFO ] Added : 158 causal constraints over 33 iterations in 5707 ms. Result :sat
Minimization took 1125 ms.
[2023-03-15 10:45:56] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:45:56] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 10:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:45:56] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2023-03-15 10:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:45:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-15 10:45:56] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 55 ms returned sat
[2023-03-15 10:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:45:57] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2023-03-15 10:45:57] [INFO ] [Nat]Added 73 Read/Feed constraints in 70 ms returned sat
[2023-03-15 10:45:57] [INFO ] Deduced a trap composed of 14 places in 333 ms of which 30 ms to minimize.
[2023-03-15 10:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2023-03-15 10:45:57] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 64 ms.
[2023-03-15 10:45:58] [INFO ] Added : 58 causal constraints over 12 iterations in 637 ms. Result :sat
Minimization took 1217 ms.
[2023-03-15 10:45:59] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:45:59] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 10:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:00] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2023-03-15 10:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:46:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-15 10:46:00] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-15 10:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:01] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2023-03-15 10:46:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 1319 ms returned sat
[2023-03-15 10:46:02] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 0 ms to minimize.
[2023-03-15 10:46:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-15 10:46:02] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 60 ms.
[2023-03-15 10:46:12] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-15 10:46:12] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 0 ms to minimize.
[2023-03-15 10:46:13] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2023-03-15 10:46:13] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 1 ms to minimize.
[2023-03-15 10:46:13] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2023-03-15 10:46:14] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2023-03-15 10:46:14] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2023-03-15 10:46:14] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2023-03-15 10:46:14] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2023-03-15 10:46:15] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2023-03-15 10:46:15] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2023-03-15 10:46:15] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2023-03-15 10:46:15] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2023-03-15 10:46:16] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 1 ms to minimize.
[2023-03-15 10:46:16] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 0 ms to minimize.
[2023-03-15 10:46:17] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 1 ms to minimize.
[2023-03-15 10:46:17] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 0 ms to minimize.
[2023-03-15 10:46:18] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 1 ms to minimize.
[2023-03-15 10:46:18] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 0 ms to minimize.
[2023-03-15 10:46:18] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
[2023-03-15 10:46:19] [INFO ] Deduced a trap composed of 90 places in 207 ms of which 0 ms to minimize.
[2023-03-15 10:46:19] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 1 ms to minimize.
[2023-03-15 10:46:19] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 7343 ms
[2023-03-15 10:46:19] [INFO ] Added : 295 causal constraints over 59 iterations in 17440 ms. Result :sat
Minimization took 3013 ms.
[2023-03-15 10:46:23] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-15 10:46:23] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 30 ms returned sat
[2023-03-15 10:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:23] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-15 10:46:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:46:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-15 10:46:23] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 55 ms returned sat
[2023-03-15 10:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:24] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2023-03-15 10:46:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 144 ms returned sat
[2023-03-15 10:46:24] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 54 ms.
[2023-03-15 10:46:30] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2023-03-15 10:46:30] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 2 ms to minimize.
[2023-03-15 10:46:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 586 ms
[2023-03-15 10:46:30] [INFO ] Added : 145 causal constraints over 30 iterations in 6361 ms. Result :sat
Minimization took 1894 ms.
[2023-03-15 10:46:32] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:46:32] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-15 10:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:33] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-15 10:46:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:46:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 10:46:33] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 54 ms returned sat
[2023-03-15 10:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:33] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2023-03-15 10:46:35] [INFO ] [Nat]Added 73 Read/Feed constraints in 1753 ms returned sat
[2023-03-15 10:46:35] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 0 ms to minimize.
[2023-03-15 10:46:36] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 0 ms to minimize.
[2023-03-15 10:46:36] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 0 ms to minimize.
[2023-03-15 10:46:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 955 ms
[2023-03-15 10:46:36] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-15 10:46:42] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 0 ms to minimize.
[2023-03-15 10:46:42] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 0 ms to minimize.
[2023-03-15 10:46:42] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 1 ms to minimize.
[2023-03-15 10:46:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 823 ms
[2023-03-15 10:46:42] [INFO ] Added : 195 causal constraints over 39 iterations in 6466 ms. Result :sat
Minimization took 1789 ms.
[2023-03-15 10:46:44] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:46:44] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-15 10:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:45] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-15 10:46:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:46:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 10:46:45] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 54 ms returned sat
[2023-03-15 10:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:45] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-15 10:46:46] [INFO ] [Nat]Added 73 Read/Feed constraints in 527 ms returned sat
[2023-03-15 10:46:46] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 38 ms.
[2023-03-15 10:46:50] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 0 ms to minimize.
[2023-03-15 10:46:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-15 10:46:51] [INFO ] Added : 220 causal constraints over 44 iterations in 4776 ms. Result :sat
Minimization took 1281 ms.
[2023-03-15 10:46:52] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 10:46:52] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 10:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:52] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2023-03-15 10:46:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:46:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-15 10:46:53] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 50 ms returned sat
[2023-03-15 10:46:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:46:53] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2023-03-15 10:46:54] [INFO ] [Nat]Added 73 Read/Feed constraints in 801 ms returned sat
[2023-03-15 10:46:54] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-15 10:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-15 10:46:54] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 56 ms.
[2023-03-15 10:46:57] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 1 ms to minimize.
[2023-03-15 10:46:57] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 1 ms to minimize.
[2023-03-15 10:46:58] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 1 ms to minimize.
[2023-03-15 10:46:58] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 0 ms to minimize.
[2023-03-15 10:46:58] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 1 ms to minimize.
[2023-03-15 10:46:59] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 1 ms to minimize.
[2023-03-15 10:46:59] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 1 ms to minimize.
[2023-03-15 10:46:59] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 1 ms to minimize.
[2023-03-15 10:47:00] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 1 ms to minimize.
[2023-03-15 10:47:00] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 1 ms to minimize.
[2023-03-15 10:47:00] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 1 ms to minimize.
[2023-03-15 10:47:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3844 ms
[2023-03-15 10:47:01] [INFO ] Added : 152 causal constraints over 32 iterations in 6592 ms. Result :sat
Minimization took 2255 ms.
[2023-03-15 10:47:03] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:47:03] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-15 10:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:04] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2023-03-15 10:47:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:47:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-15 10:47:04] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 59 ms returned sat
[2023-03-15 10:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:04] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-15 10:47:05] [INFO ] [Nat]Added 73 Read/Feed constraints in 195 ms returned sat
[2023-03-15 10:47:05] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 37 ms.
[2023-03-15 10:47:06] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-15 10:47:06] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:47:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 528 ms
[2023-03-15 10:47:06] [INFO ] Added : 93 causal constraints over 21 iterations in 1924 ms. Result :sat
Minimization took 985 ms.
[2023-03-15 10:47:08] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:47:08] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 42 ms returned sat
[2023-03-15 10:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:08] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-15 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:47:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:47:08] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 43 ms returned sat
[2023-03-15 10:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:08] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2023-03-15 10:47:10] [INFO ] [Nat]Added 73 Read/Feed constraints in 1240 ms returned sat
[2023-03-15 10:47:10] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-15 10:47:19] [INFO ] Deduced a trap composed of 8 places in 375 ms of which 1 ms to minimize.
[2023-03-15 10:47:19] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 1 ms to minimize.
[2023-03-15 10:47:19] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 1 ms to minimize.
[2023-03-15 10:47:20] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 1 ms to minimize.
[2023-03-15 10:47:20] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2023-03-15 10:47:20] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 1 ms to minimize.
[2023-03-15 10:47:21] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 1 ms to minimize.
[2023-03-15 10:47:21] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 1 ms to minimize.
[2023-03-15 10:47:22] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 1 ms to minimize.
[2023-03-15 10:47:22] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:47:22] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 2 ms to minimize.
[2023-03-15 10:47:23] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 1 ms to minimize.
[2023-03-15 10:47:23] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 2 ms to minimize.
[2023-03-15 10:47:24] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 1 ms to minimize.
[2023-03-15 10:47:24] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 1 ms to minimize.
[2023-03-15 10:47:25] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 1 ms to minimize.
[2023-03-15 10:47:25] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2023-03-15 10:47:25] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2023-03-15 10:47:26] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2023-03-15 10:47:26] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 1 ms to minimize.
[2023-03-15 10:47:26] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2023-03-15 10:47:27] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2023-03-15 10:47:27] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 8611 ms
[2023-03-15 10:47:27] [INFO ] Added : 266 causal constraints over 54 iterations in 17421 ms. Result :sat
Minimization took 3005 ms.
[2023-03-15 10:47:30] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:47:30] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 39 ms returned sat
[2023-03-15 10:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:30] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-15 10:47:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:47:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:47:31] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 41 ms returned sat
[2023-03-15 10:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:31] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2023-03-15 10:47:33] [INFO ] [Nat]Added 73 Read/Feed constraints in 1980 ms returned sat
[2023-03-15 10:47:33] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 40 ms.
[2023-03-15 10:47:42] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2023-03-15 10:47:42] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 1 ms to minimize.
[2023-03-15 10:47:43] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 1 ms to minimize.
[2023-03-15 10:47:43] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2023-03-15 10:47:43] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2023-03-15 10:47:44] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2023-03-15 10:47:44] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 1 ms to minimize.
[2023-03-15 10:47:45] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 0 ms to minimize.
[2023-03-15 10:47:45] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2023-03-15 10:47:45] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 1 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 1 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 0 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 1 ms to minimize.
[2023-03-15 10:47:46] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 1 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 0 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2023-03-15 10:47:47] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2023-03-15 10:47:48] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 2 ms to minimize.
[2023-03-15 10:47:48] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 0 ms to minimize.
[2023-03-15 10:47:48] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2023-03-15 10:47:49] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 0 ms to minimize.
[2023-03-15 10:47:49] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 0 ms to minimize.
[2023-03-15 10:47:49] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 0 ms to minimize.
[2023-03-15 10:47:50] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 0 ms to minimize.
[2023-03-15 10:47:50] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 1 ms to minimize.
[2023-03-15 10:47:50] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 1 ms to minimize.
[2023-03-15 10:47:50] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 1 ms to minimize.
[2023-03-15 10:47:50] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 1 ms to minimize.
[2023-03-15 10:47:51] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 1 ms to minimize.
[2023-03-15 10:47:51] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9387 ms
[2023-03-15 10:47:52] [INFO ] Added : 287 causal constraints over 58 iterations in 18553 ms. Result :sat
Minimization took 3024 ms.
[2023-03-15 10:47:55] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 10:47:55] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 10:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:55] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2023-03-15 10:47:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:47:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-15 10:47:55] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 42 ms returned sat
[2023-03-15 10:47:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:47:56] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2023-03-15 10:47:57] [INFO ] [Nat]Added 73 Read/Feed constraints in 1153 ms returned sat
[2023-03-15 10:47:57] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 1 ms to minimize.
[2023-03-15 10:47:57] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 0 ms to minimize.
[2023-03-15 10:47:58] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 1 ms to minimize.
[2023-03-15 10:47:58] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 1 ms to minimize.
[2023-03-15 10:47:58] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 1 ms to minimize.
[2023-03-15 10:47:58] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2023-03-15 10:47:58] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2023-03-15 10:47:59] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2023-03-15 10:47:59] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 0 ms to minimize.
[2023-03-15 10:47:59] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-15 10:47:59] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2023-03-15 10:47:59] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 0 ms to minimize.
[2023-03-15 10:48:00] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 1 ms to minimize.
[2023-03-15 10:48:00] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 1 ms to minimize.
[2023-03-15 10:48:00] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 1 ms to minimize.
[2023-03-15 10:48:01] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 1 ms to minimize.
[2023-03-15 10:48:01] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 1 ms to minimize.
[2023-03-15 10:48:01] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-15 10:48:01] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4416 ms
[2023-03-15 10:48:01] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 62 ms.
[2023-03-15 10:48:09] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2023-03-15 10:48:09] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2023-03-15 10:48:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 543 ms
[2023-03-15 10:48:09] [INFO ] Added : 209 causal constraints over 42 iterations in 7907 ms. Result :sat
Minimization took 2527 ms.
[2023-03-15 10:48:12] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:48:12] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 35 ms returned sat
[2023-03-15 10:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:48:12] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2023-03-15 10:48:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:48:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:48:12] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 10:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:48:13] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2023-03-15 10:48:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 36 ms returned sat
[2023-03-15 10:48:13] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 43 ms.
[2023-03-15 10:48:14] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 0 ms to minimize.
[2023-03-15 10:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-15 10:48:14] [INFO ] Added : 100 causal constraints over 20 iterations in 1847 ms. Result :sat
Minimization took 1510 ms.
[2023-03-15 10:48:16] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:48:16] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-15 10:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:48:16] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2023-03-15 10:48:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:48:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:48:17] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 10:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:48:17] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2023-03-15 10:48:17] [INFO ] [Nat]Added 73 Read/Feed constraints in 72 ms returned sat
[2023-03-15 10:48:17] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 40 ms.
[2023-03-15 10:48:18] [INFO ] Added : 70 causal constraints over 14 iterations in 966 ms. Result :sat
Minimization took 368 ms.
[2023-03-15 10:48:18] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:48:18] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 40 ms returned sat
[2023-03-15 10:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:48:19] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2023-03-15 10:48:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:48:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:48:19] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-15 10:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:48:19] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-15 10:48:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 1131 ms returned sat
[2023-03-15 10:48:20] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-15 10:48:31] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2023-03-15 10:48:31] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 0 ms to minimize.
[2023-03-15 10:48:31] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2023-03-15 10:48:31] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2023-03-15 10:48:32] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 1 ms to minimize.
[2023-03-15 10:48:32] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 1 ms to minimize.
[2023-03-15 10:48:32] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 2 ms to minimize.
[2023-03-15 10:48:33] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 0 ms to minimize.
[2023-03-15 10:48:33] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2023-03-15 10:48:33] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 1 ms to minimize.
[2023-03-15 10:48:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3762 ms
[2023-03-15 10:48:35] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2023-03-15 10:48:36] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2023-03-15 10:48:37] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2023-03-15 10:48:37] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2023-03-15 10:48:37] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2023-03-15 10:48:38] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 0 ms to minimize.
[2023-03-15 10:48:38] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2023-03-15 10:48:38] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2023-03-15 10:48:39] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2023-03-15 10:48:39] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 0 ms to minimize.
[2023-03-15 10:48:39] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2023-03-15 10:48:40] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2023-03-15 10:48:40] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 0 ms to minimize.
[2023-03-15 10:48:40] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2023-03-15 10:48:40] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2023-03-15 10:48:41] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2023-03-15 10:48:41] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2023-03-15 10:48:41] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2023-03-15 10:48:41] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 1 ms to minimize.
[2023-03-15 10:48:41] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 0 ms to minimize.
[2023-03-15 10:48:42] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2023-03-15 10:48:42] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2023-03-15 10:48:42] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2023-03-15 10:48:42] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2023-03-15 10:48:43] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 0 ms to minimize.
[2023-03-15 10:48:43] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2023-03-15 10:48:43] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 1 ms to minimize.
[2023-03-15 10:48:46] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 11161 ms
[2023-03-15 10:49:04] [INFO ] Deduced a trap composed of 2 places in 283 ms of which 0 ms to minimize.
[2023-03-15 10:49:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 470/470 transitions.
Applied a total of 0 rules in 56 ms. Remains 495 /495 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 495/495 places, 470/470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 470/470 transitions.
Applied a total of 0 rules in 41 ms. Remains 495 /495 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-15 10:50:35] [INFO ] Invariant cache hit.
[2023-03-15 10:50:36] [INFO ] Implicit Places using invariants in 1015 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 494/495 places, 470/470 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 493 transition count 469
Applied a total of 2 rules in 36 ms. Remains 493 /494 variables (removed 1) and now considering 469/470 (removed 1) transitions.
// Phase 1: matrix 469 rows 493 cols
[2023-03-15 10:50:36] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-15 10:50:37] [INFO ] Implicit Places using invariants in 763 ms returned []
// Phase 1: matrix 469 rows 493 cols
[2023-03-15 10:50:37] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 10:50:37] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 10:51:07] [INFO ] Performed 413/493 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 10:51:13] [INFO ] Implicit Places using invariants and state equation in 35980 ms returned [404]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 36748 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 492/495 places, 469/470 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 492 transition count 469
Applied a total of 1 rules in 35 ms. Remains 492 /492 variables (removed 0) and now considering 469/469 (removed 0) transitions.
// Phase 1: matrix 469 rows 492 cols
[2023-03-15 10:51:13] [INFO ] Computed 99 place invariants in 110 ms
[2023-03-15 10:51:14] [INFO ] Implicit Places using invariants in 846 ms returned []
[2023-03-15 10:51:14] [INFO ] Invariant cache hit.
[2023-03-15 10:51:14] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 10:51:42] [INFO ] Implicit Places using invariants and state equation in 27691 ms returned [274, 296, 301, 323, 328, 350, 355, 377, 383, 405, 409, 429, 435, 457, 462, 484, 490]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 28542 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 475/495 places, 469/470 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 475 transition count 462
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 468 transition count 462
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 468 transition count 462
Applied a total of 17 rules in 50 ms. Remains 468 /475 variables (removed 7) and now considering 462/469 (removed 7) transitions.
// Phase 1: matrix 462 rows 468 cols
[2023-03-15 10:51:42] [INFO ] Computed 82 place invariants in 59 ms
[2023-03-15 10:51:42] [INFO ] Implicit Places using invariants in 666 ms returned []
[2023-03-15 10:51:42] [INFO ] Invariant cache hit.
[2023-03-15 10:51:43] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 10:52:06] [INFO ] Implicit Places using invariants and state equation in 24099 ms returned [50, 159, 218, 225, 240, 268, 445]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 24768 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 461/495 places, 462/470 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 461
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 460 transition count 461
Applied a total of 7 rules in 74 ms. Remains 460 /461 variables (removed 1) and now considering 461/462 (removed 1) transitions.
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 10:52:06] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 10:52:07] [INFO ] Implicit Places using invariants in 648 ms returned []
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 10:52:07] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-15 10:52:07] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 10:52:34] [INFO ] Implicit Places using invariants and state equation in 27127 ms returned []
Implicit Place search using SMT with State Equation took 27778 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 460/495 places, 461/470 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 119099 ms. Remains : 460/495 places, 461/470 transitions.
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 10:52:34] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 1000000 steps, including 129294 resets, run finished after 1353 ms. (steps per millisecond=739 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85117 resets, run finished after 962 ms. (steps per millisecond=1039 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85116 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85507 resets, run finished after 959 ms. (steps per millisecond=1042 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85256 resets, run finished after 942 ms. (steps per millisecond=1061 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84967 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85431 resets, run finished after 968 ms. (steps per millisecond=1033 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85196 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85268 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85232 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85202 resets, run finished after 942 ms. (steps per millisecond=1061 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84799 resets, run finished after 962 ms. (steps per millisecond=1039 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85325 resets, run finished after 958 ms. (steps per millisecond=1043 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85218 resets, run finished after 943 ms. (steps per millisecond=1060 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85217 resets, run finished after 944 ms. (steps per millisecond=1059 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85178 resets, run finished after 944 ms. (steps per millisecond=1059 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85081 resets, run finished after 947 ms. (steps per millisecond=1055 ) properties (out of 16) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 10:52:51] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 10:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:52] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2023-03-15 10:52:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:52:52] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2023-03-15 10:52:52] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 10:52:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 10:52:58] [INFO ] [Nat]Added 73 Read/Feed constraints in 5558 ms returned sat
[2023-03-15 10:52:58] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2023-03-15 10:52:58] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2023-03-15 10:52:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 394 ms
[2023-03-15 10:52:58] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 35 ms.
[2023-03-15 10:53:16] [INFO ] Added : 250 causal constraints over 50 iterations in 17610 ms. Result :sat
Minimization took 3002 ms.
[2023-03-15 10:53:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:20] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2023-03-15 10:53:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:20] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-15 10:53:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 94 ms returned sat
[2023-03-15 10:53:20] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 56 ms.
[2023-03-15 10:53:22] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2023-03-15 10:53:23] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 2 ms to minimize.
[2023-03-15 10:53:23] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 1 ms to minimize.
[2023-03-15 10:53:23] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-15 10:53:24] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-15 10:53:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1457 ms
[2023-03-15 10:53:24] [INFO ] Added : 81 causal constraints over 17 iterations in 3624 ms. Result :sat
Minimization took 1548 ms.
[2023-03-15 10:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:26] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2023-03-15 10:53:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:27] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2023-03-15 10:53:27] [INFO ] [Nat]Added 73 Read/Feed constraints in 427 ms returned sat
[2023-03-15 10:53:27] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 40 ms.
[2023-03-15 10:53:34] [INFO ] Added : 141 causal constraints over 29 iterations in 7449 ms. Result :sat
Minimization took 1113 ms.
[2023-03-15 10:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:36] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2023-03-15 10:53:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:37] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2023-03-15 10:53:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 390 ms returned sat
[2023-03-15 10:53:37] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 1 ms to minimize.
[2023-03-15 10:53:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-15 10:53:37] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 36 ms.
[2023-03-15 10:53:38] [INFO ] Added : 47 causal constraints over 10 iterations in 877 ms. Result :sat
Minimization took 596 ms.
[2023-03-15 10:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:40] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2023-03-15 10:53:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:40] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2023-03-15 10:53:41] [INFO ] [Nat]Added 73 Read/Feed constraints in 1090 ms returned sat
[2023-03-15 10:53:42] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 43 ms.
[2023-03-15 10:53:53] [INFO ] Added : 275 causal constraints over 55 iterations in 11508 ms. Result :sat
Minimization took 3001 ms.
[2023-03-15 10:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:56] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2023-03-15 10:53:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:53:57] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2023-03-15 10:53:58] [INFO ] [Nat]Added 73 Read/Feed constraints in 769 ms returned sat
[2023-03-15 10:53:58] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-15 10:53:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-15 10:53:58] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-15 10:54:02] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:54:02] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2023-03-15 10:54:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 524 ms
[2023-03-15 10:54:02] [INFO ] Added : 117 causal constraints over 25 iterations in 4071 ms. Result :sat
Minimization took 932 ms.
[2023-03-15 10:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:04] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-15 10:54:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:04] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2023-03-15 10:54:05] [INFO ] [Nat]Added 73 Read/Feed constraints in 1034 ms returned sat
[2023-03-15 10:54:06] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 0 ms to minimize.
[2023-03-15 10:54:06] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2023-03-15 10:54:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 768 ms
[2023-03-15 10:54:06] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-15 10:54:15] [INFO ] Added : 191 causal constraints over 39 iterations in 8527 ms. Result :sat
Minimization took 1986 ms.
[2023-03-15 10:54:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:17] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-15 10:54:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:54:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:18] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2023-03-15 10:54:18] [INFO ] [Nat]Added 73 Read/Feed constraints in 709 ms returned sat
[2023-03-15 10:54:18] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-15 10:54:22] [INFO ] Deduced a trap composed of 8 places in 351 ms of which 1 ms to minimize.
[2023-03-15 10:54:22] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2023-03-15 10:54:23] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 1 ms to minimize.
[2023-03-15 10:54:23] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 1 ms to minimize.
[2023-03-15 10:54:23] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 2 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 1 ms to minimize.
[2023-03-15 10:54:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2893 ms
[2023-03-15 10:54:24] [INFO ] Added : 164 causal constraints over 33 iterations in 6102 ms. Result :sat
Minimization took 1843 ms.
[2023-03-15 10:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:27] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2023-03-15 10:54:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:54:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:27] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2023-03-15 10:54:28] [INFO ] [Nat]Added 73 Read/Feed constraints in 713 ms returned sat
[2023-03-15 10:54:28] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 36 ms.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 0 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 1 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 1 ms to minimize.
[2023-03-15 10:54:34] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2023-03-15 10:54:35] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 1 ms to minimize.
[2023-03-15 10:54:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1193 ms
[2023-03-15 10:54:35] [INFO ] Added : 171 causal constraints over 36 iterations in 6713 ms. Result :sat
Minimization took 861 ms.
[2023-03-15 10:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:36] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2023-03-15 10:54:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:37] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2023-03-15 10:54:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 251 ms returned sat
[2023-03-15 10:54:37] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-15 10:54:40] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2023-03-15 10:54:40] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2023-03-15 10:54:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 534 ms
[2023-03-15 10:54:40] [INFO ] Added : 90 causal constraints over 19 iterations in 3328 ms. Result :sat
Minimization took 1317 ms.
[2023-03-15 10:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:42] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-15 10:54:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:43] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2023-03-15 10:54:44] [INFO ] [Nat]Added 73 Read/Feed constraints in 948 ms returned sat
[2023-03-15 10:54:44] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-15 10:54:50] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 1 ms to minimize.
[2023-03-15 10:54:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-15 10:54:50] [INFO ] Added : 214 causal constraints over 43 iterations in 6363 ms. Result :sat
Minimization took 2252 ms.
[2023-03-15 10:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:53] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2023-03-15 10:54:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:54:54] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-15 10:54:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 2294 ms returned sat
[2023-03-15 10:54:56] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2023-03-15 10:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-15 10:54:56] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 54 ms.
[2023-03-15 10:55:09] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2023-03-15 10:55:09] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-15 10:55:09] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2023-03-15 10:55:10] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2023-03-15 10:55:10] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2023-03-15 10:55:10] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 0 ms to minimize.
[2023-03-15 10:55:11] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2023-03-15 10:55:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2267 ms
[2023-03-15 10:55:11] [INFO ] Added : 280 causal constraints over 58 iterations in 15119 ms. Result :sat
Minimization took 3002 ms.
[2023-03-15 10:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:15] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2023-03-15 10:55:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:16] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2023-03-15 10:55:17] [INFO ] [Nat]Added 73 Read/Feed constraints in 1021 ms returned sat
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 0 ms to minimize.
[2023-03-15 10:55:17] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 1 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 0 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2023-03-15 10:55:18] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 1 ms to minimize.
[2023-03-15 10:55:19] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2023-03-15 10:55:19] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2023-03-15 10:55:19] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2336 ms
[2023-03-15 10:55:19] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 44 ms.
[2023-03-15 10:55:28] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2023-03-15 10:55:28] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2023-03-15 10:55:29] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2023-03-15 10:55:29] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 0 ms to minimize.
[2023-03-15 10:55:29] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2023-03-15 10:55:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1224 ms
[2023-03-15 10:55:29] [INFO ] Added : 211 causal constraints over 44 iterations in 10155 ms. Result :sat
Minimization took 1894 ms.
[2023-03-15 10:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:31] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2023-03-15 10:55:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:32] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2023-03-15 10:55:33] [INFO ] [Nat]Added 73 Read/Feed constraints in 925 ms returned sat
[2023-03-15 10:55:33] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-15 10:55:34] [INFO ] Added : 73 causal constraints over 16 iterations in 1568 ms. Result :sat
Minimization took 939 ms.
[2023-03-15 10:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:36] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2023-03-15 10:55:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:36] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-15 10:55:36] [INFO ] [Nat]Added 73 Read/Feed constraints in 393 ms returned sat
[2023-03-15 10:55:36] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-15 10:55:41] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2023-03-15 10:55:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2023-03-15 10:55:42] [INFO ] Added : 89 causal constraints over 20 iterations in 5491 ms. Result :sat
Minimization took 3099 ms.
[2023-03-15 10:55:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:45] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-15 10:55:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:55:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:55:46] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2023-03-15 10:55:48] [INFO ] [Nat]Added 73 Read/Feed constraints in 1925 ms returned sat
[2023-03-15 10:55:48] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 35 ms.
[2023-03-15 10:56:02] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 0 ms to minimize.
[2023-03-15 10:56:02] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-15 10:56:03] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2023-03-15 10:56:03] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2023-03-15 10:56:03] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 1 ms to minimize.
[2023-03-15 10:56:03] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 1 ms to minimize.
[2023-03-15 10:56:04] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2023-03-15 10:56:04] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 1 ms to minimize.
[2023-03-15 10:56:04] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 1 ms to minimize.
[2023-03-15 10:56:05] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2023-03-15 10:56:05] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 1 ms to minimize.
[2023-03-15 10:56:05] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 1 ms to minimize.
[2023-03-15 10:56:06] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 1 ms to minimize.
[2023-03-15 10:56:06] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2023-03-15 10:56:06] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 1 ms to minimize.
[2023-03-15 10:56:07] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 0 ms to minimize.
[2023-03-15 10:56:07] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 1 ms to minimize.
[2023-03-15 10:56:07] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 0 ms to minimize.
[2023-03-15 10:56:08] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2023-03-15 10:56:08] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2023-03-15 10:56:08] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2023-03-15 10:56:08] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2023-03-15 10:56:09] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 0 ms to minimize.
[2023-03-15 10:56:09] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 0 ms to minimize.
[2023-03-15 10:56:09] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 0 ms to minimize.
[2023-03-15 10:56:10] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 0 ms to minimize.
[2023-03-15 10:56:10] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 1 ms to minimize.
[2023-03-15 10:56:10] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 1 ms to minimize.
[2023-03-15 10:56:10] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 0 ms to minimize.
[2023-03-15 10:56:11] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 0 ms to minimize.
[2023-03-15 10:56:11] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 1 ms to minimize.
[2023-03-15 10:56:12] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 1 ms to minimize.
[2023-03-15 10:56:12] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 1 ms to minimize.
[2023-03-15 10:56:12] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 0 ms to minimize.
[2023-03-15 10:56:12] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 1 ms to minimize.
[2023-03-15 10:56:13] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 0 ms to minimize.
[2023-03-15 10:56:13] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 1 ms to minimize.
[2023-03-15 10:56:13] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 1 ms to minimize.
[2023-03-15 10:56:13] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 1 ms to minimize.
[2023-03-15 10:56:13] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 0 ms to minimize.
[2023-03-15 10:56:14] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 0 ms to minimize.
[2023-03-15 10:56:14] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 1 ms to minimize.
[2023-03-15 10:56:14] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 0 ms to minimize.
[2023-03-15 10:56:14] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2023-03-15 10:56:14] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2023-03-15 10:56:15] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 1 ms to minimize.
[2023-03-15 10:56:15] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2023-03-15 10:56:16] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 1 ms to minimize.
[2023-03-15 10:56:16] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2023-03-15 10:56:16] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 14269 ms
[2023-03-15 10:56:16] [INFO ] Added : 306 causal constraints over 63 iterations in 28422 ms.(timeout) Result :sat
Minimization took 3011 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Applied a total of 0 rules in 16 ms. Remains 460 /460 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 460/460 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Applied a total of 0 rules in 17 ms. Remains 460 /460 variables (removed 0) and now considering 461/461 (removed 0) transitions.
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 10:58:25] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 10:58:25] [INFO ] Implicit Places using invariants in 667 ms returned []
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 10:58:25] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 10:58:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 10:58:56] [INFO ] Performed 454/460 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 10:58:57] [INFO ] Implicit Places using invariants and state equation in 31398 ms returned []
Implicit Place search using SMT with State Equation took 32067 ms to find 0 implicit places.
[2023-03-15 10:58:57] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 10:58:57] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 10:58:57] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32510 ms. Remains : 460/460 places, 461/461 transitions.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-00
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 10:58:57] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 10000 steps, including 1303 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 10:58:57] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 10:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:58:58] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-15 10:58:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:58:58] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2023-03-15 10:58:58] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 10:59:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 10:59:03] [INFO ] [Nat]Added 73 Read/Feed constraints in 4398 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 451 transition count 452
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 449 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 449 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 448 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 448 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 442 transition count 445
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 39 place count 442 transition count 445
Applied a total of 39 rules in 110 ms. Remains 442 /460 variables (removed 18) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 442/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 442 cols
[2023-03-15 10:59:03] [INFO ] Computed 75 place invariants in 113 ms
Incomplete random walk after 1000000 steps, including 129209 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85504 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 1) seen :0
[2023-03-15 10:59:05] [INFO ] Invariant cache hit.
[2023-03-15 10:59:05] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 10:59:05] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 38 ms returned sat
[2023-03-15 10:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:59:05] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-15 10:59:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:59:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 10:59:05] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 39 ms returned sat
[2023-03-15 10:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:59:06] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2023-03-15 10:59:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 10:59:09] [INFO ] [Nat]Added 80 Read/Feed constraints in 2501 ms returned sat
[2023-03-15 10:59:09] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 1 ms to minimize.
[2023-03-15 10:59:09] [INFO ] Deduced a trap composed of 8 places in 507 ms of which 1 ms to minimize.
[2023-03-15 10:59:10] [INFO ] Deduced a trap composed of 141 places in 512 ms of which 0 ms to minimize.
[2023-03-15 10:59:11] [INFO ] Deduced a trap composed of 143 places in 279 ms of which 1 ms to minimize.
[2023-03-15 10:59:11] [INFO ] Deduced a trap composed of 14 places in 349 ms of which 1 ms to minimize.
[2023-03-15 10:59:11] [INFO ] Deduced a trap composed of 127 places in 336 ms of which 1 ms to minimize.
[2023-03-15 10:59:12] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 1 ms to minimize.
[2023-03-15 10:59:12] [INFO ] Deduced a trap composed of 135 places in 378 ms of which 1 ms to minimize.
[2023-03-15 10:59:13] [INFO ] Deduced a trap composed of 143 places in 417 ms of which 1 ms to minimize.
[2023-03-15 10:59:13] [INFO ] Deduced a trap composed of 131 places in 366 ms of which 1 ms to minimize.
[2023-03-15 10:59:14] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 0 ms to minimize.
[2023-03-15 10:59:14] [INFO ] Deduced a trap composed of 130 places in 346 ms of which 1 ms to minimize.
[2023-03-15 10:59:14] [INFO ] Deduced a trap composed of 139 places in 343 ms of which 1 ms to minimize.
[2023-03-15 10:59:15] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-15 10:59:15] [INFO ] Deduced a trap composed of 148 places in 344 ms of which 1 ms to minimize.
[2023-03-15 10:59:15] [INFO ] Deduced a trap composed of 138 places in 325 ms of which 0 ms to minimize.
[2023-03-15 10:59:16] [INFO ] Deduced a trap composed of 30 places in 465 ms of which 1 ms to minimize.
[2023-03-15 10:59:16] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 1 ms to minimize.
[2023-03-15 10:59:17] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:59:17] [INFO ] Deduced a trap composed of 131 places in 341 ms of which 1 ms to minimize.
[2023-03-15 10:59:18] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 1 ms to minimize.
[2023-03-15 10:59:18] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 1 ms to minimize.
[2023-03-15 10:59:18] [INFO ] Deduced a trap composed of 105 places in 346 ms of which 1 ms to minimize.
[2023-03-15 10:59:19] [INFO ] Deduced a trap composed of 115 places in 272 ms of which 1 ms to minimize.
[2023-03-15 10:59:19] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 1 ms to minimize.
[2023-03-15 10:59:20] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 0 ms to minimize.
[2023-03-15 10:59:20] [INFO ] Deduced a trap composed of 147 places in 425 ms of which 1 ms to minimize.
[2023-03-15 10:59:21] [INFO ] Deduced a trap composed of 145 places in 392 ms of which 1 ms to minimize.
[2023-03-15 10:59:21] [INFO ] Deduced a trap composed of 152 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:59:21] [INFO ] Deduced a trap composed of 149 places in 324 ms of which 1 ms to minimize.
[2023-03-15 10:59:22] [INFO ] Deduced a trap composed of 8 places in 352 ms of which 1 ms to minimize.
[2023-03-15 10:59:23] [INFO ] Deduced a trap composed of 19 places in 509 ms of which 1 ms to minimize.
[2023-03-15 10:59:23] [INFO ] Deduced a trap composed of 147 places in 508 ms of which 1 ms to minimize.
[2023-03-15 10:59:24] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 0 ms to minimize.
[2023-03-15 10:59:24] [INFO ] Deduced a trap composed of 134 places in 519 ms of which 1 ms to minimize.
[2023-03-15 10:59:26] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2023-03-15 10:59:27] [INFO ] Deduced a trap composed of 105 places in 427 ms of which 1 ms to minimize.
[2023-03-15 10:59:27] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 0 ms to minimize.
[2023-03-15 10:59:27] [INFO ] Deduced a trap composed of 139 places in 267 ms of which 0 ms to minimize.
[2023-03-15 10:59:27] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 18844 ms
[2023-03-15 10:59:27] [INFO ] Computed and/alt/rep : 340/2179/340 causal constraints (skipped 104 transitions) in 46 ms.
[2023-03-15 10:59:45] [INFO ] Added : 240 causal constraints over 48 iterations in 17721 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 16 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 442/442 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 12 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-15 11:00:15] [INFO ] Invariant cache hit.
[2023-03-15 11:00:16] [INFO ] Implicit Places using invariants in 1183 ms returned [51, 71, 76, 97, 102, 122, 128, 153, 154, 174, 179, 200, 228]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1184 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 429/442 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 429 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 436
Applied a total of 18 rules in 24 ms. Remains 420 /429 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 11:00:16] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:00:17] [INFO ] Implicit Places using invariants in 512 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 11:00:17] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:00:17] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:00:27] [INFO ] Implicit Places using invariants and state equation in 10240 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10753 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/442 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 22 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:00:27] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:00:28] [INFO ] Implicit Places using invariants in 522 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:00:28] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:00:28] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:00:58] [INFO ] Performed 413/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:00:58] [INFO ] Implicit Places using invariants and state equation in 30579 ms returned []
Implicit Place search using SMT with State Equation took 31102 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/442 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 43097 ms. Remains : 417/442 places, 434/445 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:00:58] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 1000000 steps, including 143879 resets, run finished after 1184 ms. (steps per millisecond=844 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91468 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:01:00] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:01:01] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2023-03-15 11:01:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:01:01] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-15 11:01:01] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:01:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:01:04] [INFO ] [Nat]Added 80 Read/Feed constraints in 3401 ms returned sat
[2023-03-15 11:01:04] [INFO ] Computed and/alt/rep : 326/2143/326 causal constraints (skipped 107 transitions) in 35 ms.
[2023-03-15 11:01:16] [INFO ] Added : 205 causal constraints over 41 iterations in 11809 ms. Result :sat
Minimization took 2841 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 13 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:01:19] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:01:20] [INFO ] Implicit Places using invariants in 517 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:01:20] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:01:20] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:01:41] [INFO ] Implicit Places using invariants and state equation in 21230 ms returned []
Implicit Place search using SMT with State Equation took 21748 ms to find 0 implicit places.
[2023-03-15 11:01:41] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:01:41] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:01:41] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22123 ms. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-00 in 164054 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-01
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:01:41] [INFO ] Invariants computation overflowed in 46 ms
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:01:41] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:01:42] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2023-03-15 11:01:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:01:42] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2023-03-15 11:01:42] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:01:42] [INFO ] [Nat]Added 73 Read/Feed constraints in 65 ms returned sat
[2023-03-15 11:01:43] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-15 11:01:45] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2023-03-15 11:01:45] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2023-03-15 11:01:45] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2023-03-15 11:01:46] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:01:46] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:01:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1453 ms
[2023-03-15 11:01:46] [INFO ] Added : 81 causal constraints over 17 iterations in 3517 ms. Result :sat
Minimization took 1069 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 452 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 449 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 449 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 30 place count 448 transition count 445
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 37 place count 441 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 78 ms. Remains 441 /460 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 441/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:01:47] [INFO ] Invariants computation overflowed in 60 ms
Incomplete random walk after 1000000 steps, including 129457 resets, run finished after 1268 ms. (steps per millisecond=788 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85065 resets, run finished after 750 ms. (steps per millisecond=1333 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:01:49] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-15 11:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:01:50] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2023-03-15 11:01:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:01:51] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2023-03-15 11:01:51] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:01:51] [INFO ] [Nat]Added 84 Read/Feed constraints in 187 ms returned sat
[2023-03-15 11:01:51] [INFO ] Computed and/alt/rep : 338/2191/338 causal constraints (skipped 106 transitions) in 37 ms.
[2023-03-15 11:01:53] [INFO ] Deduced a trap composed of 124 places in 391 ms of which 1 ms to minimize.
[2023-03-15 11:01:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2023-03-15 11:01:53] [INFO ] Added : 78 causal constraints over 16 iterations in 2450 ms. Result :sat
Minimization took 963 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:01:54] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:01:55] [INFO ] Implicit Places using invariants in 641 ms returned []
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:01:55] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:01:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:02:25] [INFO ] Performed 346/441 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:02:32] [INFO ] Implicit Places using invariants and state equation in 36933 ms returned [13, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 37579 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 439 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 437 transition count 443
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 437 transition count 443
Applied a total of 5 rules in 33 ms. Remains 437 /439 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 437 cols
[2023-03-15 11:02:32] [INFO ] Computed 73 place invariants in 69 ms
[2023-03-15 11:02:33] [INFO ] Implicit Places using invariants in 1330 ms returned [47, 67, 72, 94, 99, 119, 125, 150, 151, 171, 196, 224]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1332 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 425/441 places, 443/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 425 transition count 434
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 416 transition count 434
Applied a total of 18 rules in 22 ms. Remains 416 /425 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:02:33] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:02:34] [INFO ] Implicit Places using invariants in 513 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:02:34] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-15 11:02:34] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:03:04] [INFO ] Performed 362/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:03:08] [INFO ] Implicit Places using invariants and state equation in 34506 ms returned []
Implicit Place search using SMT with State Equation took 35020 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 73997 ms. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:03:08] [INFO ] Invariants computation overflowed in 33 ms
Incomplete random walk after 1000000 steps, including 144374 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91288 resets, run finished after 687 ms. (steps per millisecond=1455 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:03:10] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:03:10] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-15 11:03:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:03:11] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2023-03-15 11:03:11] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:03:11] [INFO ] [Nat]Added 84 Read/Feed constraints in 167 ms returned sat
[2023-03-15 11:03:11] [INFO ] Computed and/alt/rep : 325/2163/325 causal constraints (skipped 108 transitions) in 34 ms.
[2023-03-15 11:03:13] [INFO ] Deduced a trap composed of 8 places in 521 ms of which 2 ms to minimize.
[2023-03-15 11:03:14] [INFO ] Deduced a trap composed of 110 places in 531 ms of which 1 ms to minimize.
[2023-03-15 11:03:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1217 ms
[2023-03-15 11:03:14] [INFO ] Added : 72 causal constraints over 15 iterations in 2747 ms. Result :sat
Minimization took 1081 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:03:15] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:03:16] [INFO ] Implicit Places using invariants in 679 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:03:16] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:03:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:03:46] [INFO ] Performed 414/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:03:46] [INFO ] Implicit Places using invariants and state equation in 30567 ms returned []
Implicit Place search using SMT with State Equation took 31248 ms to find 0 implicit places.
[2023-03-15 11:03:46] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:03:46] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:03:47] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31606 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-01 in 125383 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-02
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:03:47] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:03:47] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-15 11:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:03:47] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2023-03-15 11:03:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:03:48] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2023-03-15 11:03:48] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:03:49] [INFO ] [Nat]Added 73 Read/Feed constraints in 450 ms returned sat
[2023-03-15 11:03:49] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-15 11:03:52] [INFO ] Added : 105 causal constraints over 21 iterations in 3803 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 447 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 447 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 441 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 73 ms. Remains 441 /460 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 441/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:03:54] [INFO ] Invariants computation overflowed in 57 ms
Incomplete random walk after 1000000 steps, including 129334 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85451 resets, run finished after 734 ms. (steps per millisecond=1362 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:03:56] [INFO ] Invariants computation overflowed in 102 ms
[2023-03-15 11:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:03:56] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2023-03-15 11:03:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:03:57] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2023-03-15 11:03:57] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:03:57] [INFO ] [Nat]Added 84 Read/Feed constraints in 470 ms returned sat
[2023-03-15 11:03:58] [INFO ] Computed and/alt/rep : 341/2210/341 causal constraints (skipped 103 transitions) in 35 ms.
[2023-03-15 11:04:00] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:04:00] [INFO ] Deduced a trap composed of 12 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:04:00] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 1 ms to minimize.
[2023-03-15 11:04:01] [INFO ] Deduced a trap composed of 150 places in 520 ms of which 1 ms to minimize.
[2023-03-15 11:04:02] [INFO ] Deduced a trap composed of 141 places in 502 ms of which 1 ms to minimize.
[2023-03-15 11:04:02] [INFO ] Deduced a trap composed of 18 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:04:02] [INFO ] Deduced a trap composed of 125 places in 281 ms of which 0 ms to minimize.
[2023-03-15 11:04:03] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 0 ms to minimize.
[2023-03-15 11:04:03] [INFO ] Deduced a trap composed of 137 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:04:03] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 0 ms to minimize.
[2023-03-15 11:04:04] [INFO ] Deduced a trap composed of 128 places in 343 ms of which 0 ms to minimize.
[2023-03-15 11:04:04] [INFO ] Deduced a trap composed of 112 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:04:04] [INFO ] Deduced a trap composed of 128 places in 284 ms of which 0 ms to minimize.
[2023-03-15 11:04:05] [INFO ] Deduced a trap composed of 115 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:04:05] [INFO ] Deduced a trap composed of 89 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:04:06] [INFO ] Deduced a trap composed of 120 places in 408 ms of which 0 ms to minimize.
[2023-03-15 11:04:06] [INFO ] Deduced a trap composed of 126 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:04:06] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6891 ms
[2023-03-15 11:04:06] [INFO ] Added : 117 causal constraints over 24 iterations in 8669 ms. Result :sat
Minimization took 1399 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:04:09] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:04:10] [INFO ] Implicit Places using invariants in 633 ms returned []
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:04:10] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-15 11:04:10] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:04:30] [INFO ] Implicit Places using invariants and state equation in 19764 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 20401 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 440/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 438 transition count 443
Applied a total of 4 rules in 25 ms. Remains 438 /440 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:04:30] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-15 11:04:30] [INFO ] Implicit Places using invariants in 816 ms returned []
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:04:31] [INFO ] Invariants computation overflowed in 27 ms
[2023-03-15 11:04:31] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:05:01] [INFO ] Performed 411/438 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:05:03] [INFO ] Implicit Places using invariants and state equation in 32167 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 32986 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 437/441 places, 443/445 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 443
Applied a total of 1 rules in 24 ms. Remains 437 /437 variables (removed 0) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 437 cols
[2023-03-15 11:05:03] [INFO ] Computed 73 place invariants in 63 ms
[2023-03-15 11:05:04] [INFO ] Implicit Places using invariants in 1360 ms returned [47, 71, 92, 97, 117, 123, 148, 149, 175, 196, 224]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1370 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 426/441 places, 443/445 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 426 transition count 435
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 418 transition count 435
Applied a total of 17 rules in 37 ms. Remains 418 /426 variables (removed 8) and now considering 435/443 (removed 8) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:05:04] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 11:05:05] [INFO ] Implicit Places using invariants in 540 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:05:05] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 11:05:05] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:05:35] [INFO ] Performed 287/418 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:05:44] [INFO ] Implicit Places using invariants and state equation in 39641 ms returned []
Implicit Place search using SMT with State Equation took 40182 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 418/441 places, 435/445 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 95038 ms. Remains : 418/441 places, 435/445 transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:05:44] [INFO ] Invariants computation overflowed in 58 ms
Incomplete random walk after 1000000 steps, including 144082 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91706 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:05:46] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:05:47] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2023-03-15 11:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:05:47] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-15 11:05:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:05:48] [INFO ] [Nat]Added 84 Read/Feed constraints in 515 ms returned sat
[2023-03-15 11:05:48] [INFO ] Deduced a trap composed of 125 places in 259 ms of which 0 ms to minimize.
[2023-03-15 11:05:48] [INFO ] Deduced a trap composed of 123 places in 326 ms of which 0 ms to minimize.
[2023-03-15 11:05:50] [INFO ] Deduced a trap composed of 119 places in 254 ms of which 1 ms to minimize.
[2023-03-15 11:05:50] [INFO ] Deduced a trap composed of 122 places in 296 ms of which 1 ms to minimize.
[2023-03-15 11:05:50] [INFO ] Deduced a trap composed of 123 places in 312 ms of which 2 ms to minimize.
[2023-03-15 11:05:51] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 0 ms to minimize.
[2023-03-15 11:05:51] [INFO ] Deduced a trap composed of 107 places in 304 ms of which 1 ms to minimize.
[2023-03-15 11:05:51] [INFO ] Deduced a trap composed of 115 places in 314 ms of which 0 ms to minimize.
[2023-03-15 11:05:52] [INFO ] Deduced a trap composed of 115 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:05:52] [INFO ] Deduced a trap composed of 120 places in 316 ms of which 1 ms to minimize.
[2023-03-15 11:05:53] [INFO ] Deduced a trap composed of 118 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:05:53] [INFO ] Deduced a trap composed of 119 places in 311 ms of which 0 ms to minimize.
[2023-03-15 11:05:53] [INFO ] Deduced a trap composed of 122 places in 327 ms of which 0 ms to minimize.
[2023-03-15 11:05:54] [INFO ] Deduced a trap composed of 123 places in 321 ms of which 1 ms to minimize.
[2023-03-15 11:05:54] [INFO ] Deduced a trap composed of 133 places in 254 ms of which 1 ms to minimize.
[2023-03-15 11:05:54] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2023-03-15 11:05:55] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 0 ms to minimize.
[2023-03-15 11:05:56] [INFO ] Deduced a trap composed of 118 places in 321 ms of which 0 ms to minimize.
[2023-03-15 11:05:56] [INFO ] Deduced a trap composed of 128 places in 314 ms of which 1 ms to minimize.
[2023-03-15 11:05:56] [INFO ] Deduced a trap composed of 124 places in 310 ms of which 1 ms to minimize.
[2023-03-15 11:05:57] [INFO ] Deduced a trap composed of 130 places in 314 ms of which 1 ms to minimize.
[2023-03-15 11:05:57] [INFO ] Deduced a trap composed of 128 places in 309 ms of which 0 ms to minimize.
[2023-03-15 11:05:57] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 1 ms to minimize.
[2023-03-15 11:05:58] [INFO ] Deduced a trap composed of 125 places in 310 ms of which 1 ms to minimize.
[2023-03-15 11:05:58] [INFO ] Deduced a trap composed of 130 places in 308 ms of which 0 ms to minimize.
[2023-03-15 11:05:58] [INFO ] Deduced a trap composed of 128 places in 300 ms of which 0 ms to minimize.
[2023-03-15 11:05:59] [INFO ] Deduced a trap composed of 132 places in 313 ms of which 1 ms to minimize.
[2023-03-15 11:05:59] [INFO ] Deduced a trap composed of 130 places in 310 ms of which 1 ms to minimize.
[2023-03-15 11:05:59] [INFO ] Deduced a trap composed of 120 places in 309 ms of which 0 ms to minimize.
[2023-03-15 11:06:00] [INFO ] Deduced a trap composed of 122 places in 312 ms of which 0 ms to minimize.
[2023-03-15 11:06:00] [INFO ] Deduced a trap composed of 133 places in 315 ms of which 0 ms to minimize.
[2023-03-15 11:06:00] [INFO ] Deduced a trap composed of 134 places in 310 ms of which 0 ms to minimize.
[2023-03-15 11:06:01] [INFO ] Deduced a trap composed of 133 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:06:01] [INFO ] Deduced a trap composed of 127 places in 315 ms of which 1 ms to minimize.
[2023-03-15 11:06:01] [INFO ] Deduced a trap composed of 120 places in 310 ms of which 1 ms to minimize.
[2023-03-15 11:06:02] [INFO ] Deduced a trap composed of 108 places in 297 ms of which 0 ms to minimize.
[2023-03-15 11:06:02] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 1 ms to minimize.
[2023-03-15 11:06:03] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 0 ms to minimize.
[2023-03-15 11:06:04] [INFO ] Deduced a trap composed of 114 places in 320 ms of which 1 ms to minimize.
[2023-03-15 11:06:04] [INFO ] Deduced a trap composed of 131 places in 302 ms of which 1 ms to minimize.
[2023-03-15 11:06:04] [INFO ] Deduced a trap composed of 136 places in 306 ms of which 0 ms to minimize.
[2023-03-15 11:06:05] [INFO ] Deduced a trap composed of 138 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:06:06] [INFO ] Deduced a trap composed of 130 places in 321 ms of which 1 ms to minimize.
[2023-03-15 11:06:06] [INFO ] Deduced a trap composed of 130 places in 320 ms of which 1 ms to minimize.
[2023-03-15 11:06:07] [INFO ] Deduced a trap composed of 128 places in 323 ms of which 1 ms to minimize.
[2023-03-15 11:06:07] [INFO ] Deduced a trap composed of 129 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:06:07] [INFO ] Deduced a trap composed of 134 places in 310 ms of which 1 ms to minimize.
[2023-03-15 11:06:08] [INFO ] Deduced a trap composed of 16 places in 307 ms of which 1 ms to minimize.
[2023-03-15 11:06:08] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:06:08] [INFO ] Deduced a trap composed of 132 places in 311 ms of which 1 ms to minimize.
[2023-03-15 11:06:09] [INFO ] Deduced a trap composed of 121 places in 320 ms of which 0 ms to minimize.
[2023-03-15 11:06:09] [INFO ] Deduced a trap composed of 120 places in 316 ms of which 1 ms to minimize.
[2023-03-15 11:06:09] [INFO ] Deduced a trap composed of 126 places in 313 ms of which 1 ms to minimize.
[2023-03-15 11:06:10] [INFO ] Deduced a trap composed of 127 places in 314 ms of which 0 ms to minimize.
[2023-03-15 11:06:10] [INFO ] Deduced a trap composed of 130 places in 316 ms of which 0 ms to minimize.
[2023-03-15 11:06:10] [INFO ] Deduced a trap composed of 16 places in 307 ms of which 0 ms to minimize.
[2023-03-15 11:06:11] [INFO ] Deduced a trap composed of 122 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:06:12] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2023-03-15 11:06:12] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 23967 ms
[2023-03-15 11:06:12] [INFO ] Computed and/alt/rep : 328/2173/328 causal constraints (skipped 106 transitions) in 33 ms.
[2023-03-15 11:06:20] [INFO ] Deduced a trap composed of 129 places in 259 ms of which 0 ms to minimize.
[2023-03-15 11:06:20] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2023-03-15 11:06:20] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:06:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1013 ms
[2023-03-15 11:06:20] [INFO ] Added : 119 causal constraints over 25 iterations in 8653 ms. Result :sat
Minimization took 2084 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 418/418 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:06:23] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-15 11:06:24] [INFO ] Implicit Places using invariants in 544 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:06:24] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 11:06:24] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:06:54] [INFO ] Performed 315/418 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:07:01] [INFO ] Implicit Places using invariants and state equation in 37096 ms returned []
Implicit Place search using SMT with State Equation took 37642 ms to find 0 implicit places.
[2023-03-15 11:07:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:07:01] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-15 11:07:02] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38309 ms. Remains : 418/418 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-02 in 194898 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-03
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:07:02] [INFO ] Invariants computation overflowed in 72 ms
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:07:02] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 11:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:07:03] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2023-03-15 11:07:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:07:03] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2023-03-15 11:07:03] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:07:04] [INFO ] [Nat]Added 73 Read/Feed constraints in 412 ms returned sat
[2023-03-15 11:07:04] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 0 ms to minimize.
[2023-03-15 11:07:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-15 11:07:04] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 59 ms.
[2023-03-15 11:07:05] [INFO ] Added : 47 causal constraints over 10 iterations in 1468 ms. Result :sat
Minimization took 966 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 458 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 457 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 457 transition count 457
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 452 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 449 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 449 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 30 place count 448 transition count 445
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 37 place count 441 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 74 ms. Remains 441 /460 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 441/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:07:07] [INFO ] Invariants computation overflowed in 51 ms
Incomplete random walk after 1000000 steps, including 129098 resets, run finished after 1154 ms. (steps per millisecond=866 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85564 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:07:09] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:07:09] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2023-03-15 11:07:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:07:09] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-15 11:07:09] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:07:10] [INFO ] [Nat]Added 83 Read/Feed constraints in 477 ms returned sat
[2023-03-15 11:07:10] [INFO ] Computed and/alt/rep : 338/2206/338 causal constraints (skipped 106 transitions) in 38 ms.
[2023-03-15 11:07:13] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 1 ms to minimize.
[2023-03-15 11:07:14] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 0 ms to minimize.
[2023-03-15 11:07:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 740 ms
[2023-03-15 11:07:14] [INFO ] Added : 88 causal constraints over 19 iterations in 3971 ms. Result :sat
Minimization took 765 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:07:15] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:07:15] [INFO ] Implicit Places using invariants in 711 ms returned []
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:07:15] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-15 11:07:16] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:07:46] [INFO ] Performed 426/441 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:07:47] [INFO ] Implicit Places using invariants and state equation in 31650 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 32370 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 440/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 438 transition count 443
Applied a total of 4 rules in 23 ms. Remains 438 /440 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:07:47] [INFO ] Computed 74 place invariants in 57 ms
[2023-03-15 11:07:49] [INFO ] Implicit Places using invariants in 1517 ms returned [47, 68, 73, 94, 99, 119, 125, 150, 151, 171, 176, 197, 225]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1519 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 425/441 places, 443/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 425 transition count 434
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 416 transition count 434
Applied a total of 18 rules in 33 ms. Remains 416 /425 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:07:49] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-15 11:07:49] [INFO ] Implicit Places using invariants in 802 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:07:50] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-15 11:07:50] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:07:57] [INFO ] Implicit Places using invariants and state equation in 7083 ms returned []
Implicit Place search using SMT with State Equation took 7887 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 41843 ms. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:07:57] [INFO ] Invariants computation overflowed in 36 ms
Incomplete random walk after 1000000 steps, including 143979 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91111 resets, run finished after 708 ms. (steps per millisecond=1412 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:07:58] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:07:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:07:59] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-03-15 11:07:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:07:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:07:59] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2023-03-15 11:07:59] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:07:59] [INFO ] [Nat]Added 83 Read/Feed constraints in 192 ms returned sat
[2023-03-15 11:07:59] [INFO ] Computed and/alt/rep : 324/2168/324 causal constraints (skipped 109 transitions) in 35 ms.
[2023-03-15 11:08:00] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 1 ms to minimize.
[2023-03-15 11:08:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-15 11:08:00] [INFO ] Added : 60 causal constraints over 12 iterations in 903 ms. Result :sat
Minimization took 1402 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:08:02] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:08:02] [INFO ] Implicit Places using invariants in 608 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:08:03] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:08:03] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-15 11:08:11] [INFO ] Implicit Places using invariants and state equation in 8031 ms returned []
Implicit Place search using SMT with State Equation took 8640 ms to find 0 implicit places.
[2023-03-15 11:08:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:08:11] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:08:11] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8978 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-03 in 69294 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-04
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:08:11] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 10000 steps, including 1273 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:08:11] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:12] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2023-03-15 11:08:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:12] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2023-03-15 11:08:12] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:08:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 1077 ms returned sat
[2023-03-15 11:08:14] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 36 ms.
[2023-03-15 11:08:17] [INFO ] Added : 155 causal constraints over 31 iterations in 3095 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 452 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 449 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 449 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 30 place count 448 transition count 445
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 37 place count 441 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 73 ms. Remains 441 /460 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 441/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:08:17] [INFO ] Computed 75 place invariants in 67 ms
Incomplete random walk after 1000000 steps, including 129407 resets, run finished after 1034 ms. (steps per millisecond=967 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85042 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 1) seen :0
[2023-03-15 11:08:19] [INFO ] Invariant cache hit.
[2023-03-15 11:08:19] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:08:19] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 38 ms returned sat
[2023-03-15 11:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:19] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2023-03-15 11:08:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:08:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:08:19] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-15 11:08:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:08:20] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2023-03-15 11:08:20] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:08:21] [INFO ] [Nat]Added 84 Read/Feed constraints in 1566 ms returned sat
[2023-03-15 11:08:21] [INFO ] Computed and/alt/rep : 338/2191/338 causal constraints (skipped 106 transitions) in 36 ms.
[2023-03-15 11:08:29] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:08:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 429 ms
[2023-03-15 11:08:29] [INFO ] Added : 260 causal constraints over 52 iterations in 8172 ms. Result :sat
Minimization took 1850 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 15 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-15 11:09:01] [INFO ] Invariant cache hit.
[2023-03-15 11:09:03] [INFO ] Implicit Places using invariants in 1364 ms returned [51, 71, 76, 97, 102, 122, 128, 153, 154, 174, 179, 200, 228]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1366 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 428/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 419 transition count 436
Applied a total of 18 rules in 19 ms. Remains 419 /428 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 11:09:03] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:09:03] [INFO ] Implicit Places using invariants in 702 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 11:09:03] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:09:04] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:09:31] [INFO ] Implicit Places using invariants and state equation in 27884 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 28587 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/441 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 19 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:09:31] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:09:32] [INFO ] Implicit Places using invariants in 784 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:09:32] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-15 11:09:33] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:09:59] [INFO ] Implicit Places using invariants and state equation in 26750 ms returned []
Implicit Place search using SMT with State Equation took 27544 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 57545 ms. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:09:59] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 144494 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91533 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:10:01] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:10:01] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-15 11:10:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:10:02] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2023-03-15 11:10:02] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:10:03] [INFO ] [Nat]Added 84 Read/Feed constraints in 1034 ms returned sat
[2023-03-15 11:10:03] [INFO ] Computed and/alt/rep : 324/2153/324 causal constraints (skipped 109 transitions) in 33 ms.
[2023-03-15 11:10:10] [INFO ] Added : 250 causal constraints over 50 iterations in 7051 ms. Result :sat
Minimization took 2734 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:10:13] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:10:13] [INFO ] Implicit Places using invariants in 526 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:10:13] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:10:13] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:10:43] [INFO ] Performed 414/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:10:44] [INFO ] Implicit Places using invariants and state equation in 30551 ms returned []
Implicit Place search using SMT with State Equation took 31078 ms to find 0 implicit places.
[2023-03-15 11:10:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:10:44] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:10:44] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31427 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-04 in 153103 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-05
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:10:44] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 10000 steps, including 1277 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:10:44] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:10:45] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-15 11:10:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:10:45] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2023-03-15 11:10:45] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:10:46] [INFO ] [Nat]Added 73 Read/Feed constraints in 714 ms returned sat
[2023-03-15 11:10:46] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-15 11:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-15 11:10:46] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-15 11:10:50] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2023-03-15 11:10:50] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 282 ms
[2023-03-15 11:10:50] [INFO ] Deduced a trap composed of 2 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:10:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 447 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 447 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 441 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 88 ms. Remains 441 /460 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 441/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:10:50] [INFO ] Invariants computation overflowed in 50 ms
Incomplete random walk after 1000000 steps, including 129270 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85372 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:10:52] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:10:53] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2023-03-15 11:10:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:10:54] [INFO ] [Nat]Absence check using state equation in 1721 ms returned sat
[2023-03-15 11:10:54] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:10:55] [INFO ] [Nat]Added 84 Read/Feed constraints in 231 ms returned sat
[2023-03-15 11:10:55] [INFO ] Computed and/alt/rep : 341/2210/341 causal constraints (skipped 103 transitions) in 59 ms.
[2023-03-15 11:10:57] [INFO ] Deduced a trap composed of 118 places in 534 ms of which 1 ms to minimize.
[2023-03-15 11:10:58] [INFO ] Deduced a trap composed of 18 places in 535 ms of which 1 ms to minimize.
[2023-03-15 11:10:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1258 ms
[2023-03-15 11:10:58] [INFO ] Added : 103 causal constraints over 21 iterations in 3464 ms. Result :sat
Minimization took 1407 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 12 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:11:00] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 11:11:01] [INFO ] Implicit Places using invariants in 847 ms returned []
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:11:01] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-15 11:11:01] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:11:33] [INFO ] Performed 432/441 implicitness test of which 1 returned IMPLICIT in 31 seconds.
[2023-03-15 11:11:34] [INFO ] Implicit Places using invariants and state equation in 32896 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 33746 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 440/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 438 transition count 443
Applied a total of 4 rules in 21 ms. Remains 438 /440 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:11:34] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:11:34] [INFO ] Implicit Places using invariants in 532 ms returned []
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:11:34] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:11:34] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:12:04] [INFO ] Implicit Places using invariants and state equation in 30048 ms returned []
Implicit Place search using SMT with State Equation took 30582 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 438/441 places, 443/445 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64360 ms. Remains : 438/441 places, 443/445 transitions.
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:12:04] [INFO ] Invariants computation overflowed in 33 ms
Incomplete random walk after 1000000 steps, including 129421 resets, run finished after 1050 ms. (steps per millisecond=952 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84889 resets, run finished after 753 ms. (steps per millisecond=1328 ) properties (out of 1) seen :0
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:12:06] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:12:07] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2023-03-15 11:12:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:12:09] [INFO ] [Nat]Absence check using state equation in 2272 ms returned sat
[2023-03-15 11:12:09] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:12:09] [INFO ] [Nat]Added 84 Read/Feed constraints in 160 ms returned sat
[2023-03-15 11:12:10] [INFO ] Computed and/alt/rep : 339/2198/339 causal constraints (skipped 103 transitions) in 56 ms.
[2023-03-15 11:12:11] [INFO ] Deduced a trap composed of 12 places in 525 ms of which 1 ms to minimize.
[2023-03-15 11:12:12] [INFO ] Deduced a trap composed of 19 places in 538 ms of which 1 ms to minimize.
[2023-03-15 11:12:12] [INFO ] Deduced a trap composed of 8 places in 529 ms of which 1 ms to minimize.
[2023-03-15 11:12:13] [INFO ] Deduced a trap composed of 134 places in 362 ms of which 1 ms to minimize.
[2023-03-15 11:12:13] [INFO ] Deduced a trap composed of 136 places in 360 ms of which 1 ms to minimize.
[2023-03-15 11:12:14] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:12:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2970 ms
[2023-03-15 11:12:14] [INFO ] Added : 97 causal constraints over 20 iterations in 4180 ms. Result :sat
Minimization took 1760 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 438 /438 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 438/438 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 438 /438 variables (removed 0) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:12:16] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:12:17] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:12:17] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:12:17] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:12:47] [INFO ] Implicit Places using invariants and state equation in 29915 ms returned []
Implicit Place search using SMT with State Equation took 30525 ms to find 0 implicit places.
[2023-03-15 11:12:47] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 443 rows 438 cols
[2023-03-15 11:12:47] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:12:47] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30999 ms. Remains : 438/438 places, 443/443 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-05 in 123184 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-06
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:12:47] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:12:47] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:12:48] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-15 11:12:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:12:48] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-15 11:12:48] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:12:49] [INFO ] [Nat]Added 73 Read/Feed constraints in 1054 ms returned sat
[2023-03-15 11:12:50] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 1 ms to minimize.
[2023-03-15 11:12:50] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2023-03-15 11:12:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 805 ms
[2023-03-15 11:12:50] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 41 ms.
[2023-03-15 11:12:53] [INFO ] Added : 55 causal constraints over 11 iterations in 2638 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 451 transition count 452
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 449 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 449 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 448 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 448 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 442 transition count 445
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 442 transition count 445
Applied a total of 38 rules in 109 ms. Remains 442 /460 variables (removed 18) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 442/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 442 cols
[2023-03-15 11:12:53] [INFO ] Computed 75 place invariants in 92 ms
Incomplete random walk after 1000000 steps, including 129392 resets, run finished after 1714 ms. (steps per millisecond=583 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85122 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 1) seen :0
[2023-03-15 11:12:56] [INFO ] Invariant cache hit.
[2023-03-15 11:12:56] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:12:56] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 34 ms returned sat
[2023-03-15 11:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:12:56] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-15 11:12:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:12:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 11:12:56] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 52 ms returned sat
[2023-03-15 11:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:12:57] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-15 11:12:57] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:12:58] [INFO ] [Nat]Added 80 Read/Feed constraints in 1181 ms returned sat
[2023-03-15 11:12:58] [INFO ] Computed and/alt/rep : 346/2217/346 causal constraints (skipped 98 transitions) in 59 ms.
[2023-03-15 11:13:06] [INFO ] Deduced a trap composed of 15 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:13:06] [INFO ] Deduced a trap composed of 16 places in 364 ms of which 1 ms to minimize.
[2023-03-15 11:13:07] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 1 ms to minimize.
[2023-03-15 11:13:07] [INFO ] Deduced a trap composed of 132 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:13:08] [INFO ] Deduced a trap composed of 11 places in 430 ms of which 1 ms to minimize.
[2023-03-15 11:13:08] [INFO ] Deduced a trap composed of 145 places in 408 ms of which 1 ms to minimize.
[2023-03-15 11:13:09] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:13:09] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:13:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3453 ms
[2023-03-15 11:13:09] [INFO ] Added : 188 causal constraints over 39 iterations in 11442 ms. Result :sat
Minimization took 2086 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 442/442 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-15 11:13:18] [INFO ] Invariant cache hit.
[2023-03-15 11:13:20] [INFO ] Implicit Places using invariants in 1312 ms returned [50, 70, 75, 96, 101, 121, 127, 152, 153, 173, 178, 199, 228]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1313 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 429/442 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 429 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 436
Applied a total of 18 rules in 19 ms. Remains 420 /429 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 11:13:20] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:13:20] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 11:13:20] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:13:20] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:13:51] [INFO ] Performed 413/420 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:13:51] [INFO ] Implicit Places using invariants and state equation in 31103 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31612 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/442 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 20 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:13:51] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:13:52] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:13:52] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-15 11:13:52] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:14:22] [INFO ] Performed 416/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:14:22] [INFO ] Implicit Places using invariants and state equation in 30472 ms returned []
Implicit Place search using SMT with State Equation took 31065 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/442 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 64041 ms. Remains : 417/442 places, 434/445 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:14:22] [INFO ] Invariants computation overflowed in 60 ms
Incomplete random walk after 1000000 steps, including 144277 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91425 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:14:24] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 11:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:14:24] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-15 11:14:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:14:25] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2023-03-15 11:14:25] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:14:26] [INFO ] [Nat]Added 80 Read/Feed constraints in 1390 ms returned sat
[2023-03-15 11:14:27] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 0 ms to minimize.
[2023-03-15 11:14:27] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 1 ms to minimize.
[2023-03-15 11:14:27] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 1 ms to minimize.
[2023-03-15 11:14:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1018 ms
[2023-03-15 11:14:27] [INFO ] Computed and/alt/rep : 332/2179/332 causal constraints (skipped 101 transitions) in 33 ms.
[2023-03-15 11:14:35] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 1 ms to minimize.
[2023-03-15 11:14:36] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2023-03-15 11:14:36] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 0 ms to minimize.
[2023-03-15 11:14:36] [INFO ] Deduced a trap composed of 24 places in 468 ms of which 1 ms to minimize.
[2023-03-15 11:14:37] [INFO ] Deduced a trap composed of 136 places in 455 ms of which 1 ms to minimize.
[2023-03-15 11:14:37] [INFO ] Deduced a trap composed of 143 places in 422 ms of which 1 ms to minimize.
[2023-03-15 11:14:38] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 0 ms to minimize.
[2023-03-15 11:14:38] [INFO ] Deduced a trap composed of 139 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:14:38] [INFO ] Deduced a trap composed of 150 places in 266 ms of which 1 ms to minimize.
[2023-03-15 11:14:39] [INFO ] Deduced a trap composed of 139 places in 304 ms of which 1 ms to minimize.
[2023-03-15 11:14:39] [INFO ] Deduced a trap composed of 137 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:14:39] [INFO ] Deduced a trap composed of 149 places in 271 ms of which 0 ms to minimize.
[2023-03-15 11:14:40] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 0 ms to minimize.
[2023-03-15 11:14:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4655 ms
[2023-03-15 11:14:40] [INFO ] Added : 173 causal constraints over 35 iterations in 12452 ms. Result :sat
Minimization took 1604 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:14:51] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 11:14:52] [INFO ] Implicit Places using invariants in 534 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:14:52] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 11:14:52] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-15 11:15:17] [INFO ] Implicit Places using invariants and state equation in 25633 ms returned []
Implicit Place search using SMT with State Equation took 26168 ms to find 0 implicit places.
[2023-03-15 11:15:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:15:17] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 11:15:18] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26567 ms. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-06 in 150432 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-07
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:15:18] [INFO ] Invariants computation overflowed in 68 ms
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:15:18] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-15 11:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:15:18] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-15 11:15:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:15:19] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-15 11:15:19] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:15:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 756 ms returned sat
[2023-03-15 11:15:20] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-15 11:15:22] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2023-03-15 11:15:23] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 0 ms to minimize.
[2023-03-15 11:15:23] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2023-03-15 11:15:23] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2023-03-15 11:15:23] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 0 ms to minimize.
[2023-03-15 11:15:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 458 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 457 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 457 transition count 457
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 452 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 449 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 449 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 448 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 442 transition count 446
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 442 transition count 446
Applied a total of 40 rules in 70 ms. Remains 442 /460 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 442/460 places, 446/461 transitions.
// Phase 1: matrix 446 rows 442 cols
[2023-03-15 11:15:23] [INFO ] Invariants computation overflowed in 54 ms
Incomplete random walk after 1000000 steps, including 129230 resets, run finished after 1218 ms. (steps per millisecond=821 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85492 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 442 cols
[2023-03-15 11:15:25] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-15 11:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:15:26] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-15 11:15:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:15:26] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2023-03-15 11:15:26] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:15:27] [INFO ] [Nat]Added 84 Read/Feed constraints in 466 ms returned sat
[2023-03-15 11:15:27] [INFO ] Computed and/alt/rep : 339/2204/339 causal constraints (skipped 106 transitions) in 35 ms.
[2023-03-15 11:15:34] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2023-03-15 11:15:35] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2023-03-15 11:15:35] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2023-03-15 11:15:35] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2023-03-15 11:15:35] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2023-03-15 11:15:35] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2023-03-15 11:15:36] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2023-03-15 11:15:36] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2023-03-15 11:15:36] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2023-03-15 11:15:36] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 0 ms to minimize.
[2023-03-15 11:15:37] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2023-03-15 11:15:37] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2023-03-15 11:15:37] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 0 ms to minimize.
[2023-03-15 11:15:37] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 0 ms to minimize.
[2023-03-15 11:15:37] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 0 ms to minimize.
[2023-03-15 11:15:38] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 0 ms to minimize.
[2023-03-15 11:15:38] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2023-03-15 11:15:38] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2023-03-15 11:15:38] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 1 ms to minimize.
[2023-03-15 11:15:38] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4041 ms
[2023-03-15 11:15:38] [INFO ] Added : 196 causal constraints over 40 iterations in 11517 ms. Result :sat
Minimization took 2613 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 442/442 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 442 cols
[2023-03-15 11:16:11] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:16:12] [INFO ] Implicit Places using invariants in 743 ms returned []
// Phase 1: matrix 446 rows 442 cols
[2023-03-15 11:16:12] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-15 11:16:12] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:16:42] [INFO ] Performed 385/442 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:16:46] [INFO ] Implicit Places using invariants and state equation in 34190 ms returned [13, 227]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 34935 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 440/442 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 440 transition count 443
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 437 transition count 443
Applied a total of 6 rules in 21 ms. Remains 437 /440 variables (removed 3) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 437 cols
[2023-03-15 11:16:46] [INFO ] Computed 73 place invariants in 72 ms
[2023-03-15 11:16:47] [INFO ] Implicit Places using invariants in 1526 ms returned [47, 67, 72, 93, 98, 118, 124, 149, 150, 170, 175, 196]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1529 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 425/442 places, 443/446 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 425 transition count 435
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 417 transition count 435
Applied a total of 16 rules in 20 ms. Remains 417 /425 variables (removed 8) and now considering 435/443 (removed 8) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:16:48] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:16:48] [INFO ] Implicit Places using invariants in 576 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:16:48] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:16:49] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:16:56] [INFO ] Implicit Places using invariants and state equation in 8218 ms returned []
Implicit Place search using SMT with State Equation took 8795 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/442 places, 435/446 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 45311 ms. Remains : 417/442 places, 435/446 transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:16:56] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 144155 resets, run finished after 989 ms. (steps per millisecond=1011 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91339 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:16:58] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:16:58] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-15 11:16:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:16:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:16:59] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2023-03-15 11:16:59] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:17:00] [INFO ] [Nat]Added 84 Read/Feed constraints in 600 ms returned sat
[2023-03-15 11:17:00] [INFO ] Computed and/alt/rep : 325/2166/325 causal constraints (skipped 109 transitions) in 32 ms.
[2023-03-15 11:17:06] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2023-03-15 11:17:06] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2023-03-15 11:17:06] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2023-03-15 11:17:06] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2023-03-15 11:17:06] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2023-03-15 11:17:07] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 0 ms to minimize.
[2023-03-15 11:17:07] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2023-03-15 11:17:07] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2023-03-15 11:17:07] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2023-03-15 11:17:07] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 0 ms to minimize.
[2023-03-15 11:17:08] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2023-03-15 11:17:08] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2023-03-15 11:17:08] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2023-03-15 11:17:08] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2023-03-15 11:17:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2796 ms
[2023-03-15 11:17:08] [INFO ] Added : 203 causal constraints over 41 iterations in 8593 ms. Result :sat
Minimization took 2027 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 417/417 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 16 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:17:40] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:17:41] [INFO ] Implicit Places using invariants in 509 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:17:41] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:17:41] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:17:57] [INFO ] Implicit Places using invariants and state equation in 16634 ms returned []
Implicit Place search using SMT with State Equation took 17145 ms to find 0 implicit places.
[2023-03-15 11:17:57] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-15 11:17:57] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:17:58] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17505 ms. Remains : 417/417 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-07 in 160243 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-08
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:17:58] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:17:58] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:17:58] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2023-03-15 11:17:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:17:59] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2023-03-15 11:17:59] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:18:00] [INFO ] [Nat]Added 73 Read/Feed constraints in 706 ms returned sat
[2023-03-15 11:18:00] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 36 ms.
[2023-03-15 11:18:04] [INFO ] Added : 145 causal constraints over 29 iterations in 3648 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 448 transition count 445
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 37 place count 441 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 53 ms. Remains 441 /460 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 441/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:18:05] [INFO ] Invariants computation overflowed in 33 ms
Incomplete random walk after 1000000 steps, including 129535 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85240 resets, run finished after 747 ms. (steps per millisecond=1338 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:18:07] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:18:08] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2023-03-15 11:18:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:18:10] [INFO ] [Nat]Absence check using state equation in 1417 ms returned sat
[2023-03-15 11:18:10] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:18:10] [INFO ] [Nat]Added 84 Read/Feed constraints in 519 ms returned sat
[2023-03-15 11:18:10] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2023-03-15 11:18:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-15 11:18:10] [INFO ] Computed and/alt/rep : 338/2199/338 causal constraints (skipped 106 transitions) in 35 ms.
[2023-03-15 11:18:14] [INFO ] Added : 153 causal constraints over 31 iterations in 3404 ms. Result :sat
Minimization took 1144 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:18:45] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:18:45] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:18:46] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:18:46] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:19:00] [INFO ] Implicit Places using invariants and state equation in 14836 ms returned [13, 50, 70, 96, 101, 121, 127, 152, 153, 173, 178, 199, 228]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 15453 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 428/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 428 transition count 435
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 418 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 418 transition count 435
Applied a total of 21 rules in 29 ms. Remains 418 /428 variables (removed 10) and now considering 435/445 (removed 10) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:19:00] [INFO ] Computed 62 place invariants in 96 ms
[2023-03-15 11:19:01] [INFO ] Implicit Places using invariants in 919 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 921 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/441 places, 435/445 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 417 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 416 transition count 434
Applied a total of 2 rules in 30 ms. Remains 416 /417 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:19:01] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-15 11:19:02] [INFO ] Implicit Places using invariants in 719 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:19:02] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 11:19:02] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:19:33] [INFO ] Performed 352/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:19:33] [INFO ] Implicit Places using invariants and state equation in 31093 ms returned []
Implicit Place search using SMT with State Equation took 31813 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 48256 ms. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:19:33] [INFO ] Invariants computation overflowed in 36 ms
Incomplete random walk after 1000000 steps, including 144354 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91538 resets, run finished after 687 ms. (steps per millisecond=1455 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:19:35] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:19:36] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2023-03-15 11:19:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:19:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:19:36] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2023-03-15 11:19:36] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:19:37] [INFO ] [Nat]Added 84 Read/Feed constraints in 677 ms returned sat
[2023-03-15 11:19:37] [INFO ] Computed and/alt/rep : 324/2161/324 causal constraints (skipped 109 transitions) in 37 ms.
[2023-03-15 11:19:42] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-15 11:19:42] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:19:43] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:19:43] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:19:44] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 1 ms to minimize.
[2023-03-15 11:19:44] [INFO ] Deduced a trap composed of 22 places in 320 ms of which 1 ms to minimize.
[2023-03-15 11:19:44] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 1 ms to minimize.
[2023-03-15 11:19:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2648 ms
[2023-03-15 11:19:45] [INFO ] Added : 136 causal constraints over 29 iterations in 7895 ms. Result :sat
Minimization took 1869 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:19:54] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:19:54] [INFO ] Implicit Places using invariants in 707 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:19:55] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:19:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:20:25] [INFO ] Performed 401/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:20:26] [INFO ] Implicit Places using invariants and state equation in 31451 ms returned []
Implicit Place search using SMT with State Equation took 32162 ms to find 0 implicit places.
[2023-03-15 11:20:26] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:20:26] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:20:26] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32766 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-08 in 148695 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-09
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:20:27] [INFO ] Invariants computation overflowed in 62 ms
Incomplete random walk after 10000 steps, including 1321 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:20:27] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:20:27] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2023-03-15 11:20:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:20:28] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2023-03-15 11:20:28] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:20:28] [INFO ] [Nat]Added 73 Read/Feed constraints in 253 ms returned sat
[2023-03-15 11:20:28] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 36 ms.
[2023-03-15 11:20:32] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:20:33] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 1 ms to minimize.
[2023-03-15 11:20:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 447 transition count 451
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 32 place count 447 transition count 444
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 39 place count 440 transition count 444
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 43 place count 440 transition count 444
Applied a total of 43 rules in 109 ms. Remains 440 /460 variables (removed 20) and now considering 444/461 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 440/460 places, 444/461 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-15 11:20:33] [INFO ] Computed 75 place invariants in 121 ms
Incomplete random walk after 1000000 steps, including 129528 resets, run finished after 1391 ms. (steps per millisecond=718 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84976 resets, run finished after 800 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 11:20:35] [INFO ] Invariant cache hit.
[2023-03-15 11:20:35] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-15 11:20:35] [INFO ] [Real]Absence check using 4 positive and 71 generalized place invariants in 34 ms returned sat
[2023-03-15 11:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:20:36] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2023-03-15 11:20:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:20:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-15 11:20:36] [INFO ] [Nat]Absence check using 4 positive and 71 generalized place invariants in 54 ms returned sat
[2023-03-15 11:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:20:36] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2023-03-15 11:20:36] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:20:36] [INFO ] [Nat]Added 84 Read/Feed constraints in 134 ms returned sat
[2023-03-15 11:20:36] [INFO ] Computed and/alt/rep : 337/2192/337 causal constraints (skipped 106 transitions) in 57 ms.
[2023-03-15 11:20:39] [INFO ] Added : 91 causal constraints over 19 iterations in 2198 ms. Result :sat
Minimization took 1072 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-15 11:20:40] [INFO ] Invariant cache hit.
[2023-03-15 11:20:42] [INFO ] Implicit Places using invariants in 1941 ms returned [50, 70, 75, 96, 101, 121, 127, 152, 153, 173, 178, 199, 227]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1943 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 427/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 427 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 419 transition count 436
Applied a total of 16 rules in 25 ms. Remains 419 /427 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 11:20:42] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-15 11:20:43] [INFO ] Implicit Places using invariants in 839 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 11:20:43] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-15 11:20:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:21:11] [INFO ] Implicit Places using invariants and state equation in 27897 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 28738 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/440 places, 436/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 18 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:21:11] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:21:11] [INFO ] Implicit Places using invariants in 588 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:21:11] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-15 11:21:12] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:21:40] [INFO ] Implicit Places using invariants and state equation in 28546 ms returned []
Implicit Place search using SMT with State Equation took 29137 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/440 places, 434/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 59872 ms. Remains : 416/440 places, 434/444 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:21:40] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 1000000 steps, including 144353 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91573 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:21:42] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:21:42] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-15 11:21:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:21:43] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2023-03-15 11:21:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:21:43] [INFO ] [Nat]Added 84 Read/Feed constraints in 260 ms returned sat
[2023-03-15 11:21:43] [INFO ] Computed and/alt/rep : 327/2181/327 causal constraints (skipped 106 transitions) in 33 ms.
[2023-03-15 11:21:48] [INFO ] Added : 95 causal constraints over 19 iterations in 5156 ms. Result :sat
Minimization took 1542 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:21:50] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 11:21:51] [INFO ] Implicit Places using invariants in 618 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:21:51] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-15 11:21:51] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:22:21] [INFO ] Performed 316/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:22:37] [INFO ] Implicit Places using invariants and state equation in 46566 ms returned []
Implicit Place search using SMT with State Equation took 47185 ms to find 0 implicit places.
[2023-03-15 11:22:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:22:37] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:22:38] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47712 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-09 in 131286 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-10
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:22:38] [INFO ] Invariants computation overflowed in 72 ms
Incomplete random walk after 10000 steps, including 1305 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:22:38] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 11:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:39] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-15 11:22:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:22:40] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2023-03-15 11:22:40] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:22:41] [INFO ] [Nat]Added 73 Read/Feed constraints in 957 ms returned sat
[2023-03-15 11:22:41] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-15 11:22:44] [INFO ] Added : 150 causal constraints over 30 iterations in 2985 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 452 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 449 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 449 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 30 place count 448 transition count 445
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 37 place count 441 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 67 ms. Remains 441 /460 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 441/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:23:14] [INFO ] Computed 75 place invariants in 75 ms
Incomplete random walk after 1000000 steps, including 129210 resets, run finished after 1260 ms. (steps per millisecond=793 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85198 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 1) seen :0
[2023-03-15 11:23:16] [INFO ] Invariant cache hit.
[2023-03-15 11:23:16] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-15 11:23:16] [INFO ] [Real]Absence check using 4 positive and 71 generalized place invariants in 38 ms returned sat
[2023-03-15 11:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:16] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-03-15 11:23:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:23:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-15 11:23:16] [INFO ] [Nat]Absence check using 4 positive and 71 generalized place invariants in 31 ms returned sat
[2023-03-15 11:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:23:17] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2023-03-15 11:23:17] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:23:18] [INFO ] [Nat]Added 84 Read/Feed constraints in 929 ms returned sat
[2023-03-15 11:23:18] [INFO ] Computed and/alt/rep : 339/2200/339 causal constraints (skipped 105 transitions) in 36 ms.
[2023-03-15 11:23:25] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 1 ms to minimize.
[2023-03-15 11:23:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-15 11:23:25] [INFO ] Added : 206 causal constraints over 42 iterations in 7651 ms. Result :sat
Minimization took 1665 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-15 11:23:57] [INFO ] Invariant cache hit.
[2023-03-15 11:23:59] [INFO ] Implicit Places using invariants in 1637 ms returned [50, 70, 75, 96, 101, 121, 127, 152, 153, 173, 178, 199, 227]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1639 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 428/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 419 transition count 436
Applied a total of 18 rules in 25 ms. Remains 419 /428 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 11:23:59] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:23:59] [INFO ] Implicit Places using invariants in 751 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-15 11:23:59] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 11:24:00] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:24:30] [INFO ] Performed 410/419 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:24:30] [INFO ] Implicit Places using invariants and state equation in 31094 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31847 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/441 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 18 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:24:31] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:24:31] [INFO ] Implicit Places using invariants in 580 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:24:31] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:24:32] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:24:59] [INFO ] Implicit Places using invariants and state equation in 27525 ms returned []
Implicit Place search using SMT with State Equation took 28106 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 61647 ms. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:24:59] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 144190 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91710 resets, run finished after 683 ms. (steps per millisecond=1464 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:25:00] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:01] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2023-03-15 11:25:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:02] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2023-03-15 11:25:02] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:25:03] [INFO ] [Nat]Added 84 Read/Feed constraints in 1227 ms returned sat
[2023-03-15 11:25:03] [INFO ] Computed and/alt/rep : 325/2162/325 causal constraints (skipped 108 transitions) in 33 ms.
[2023-03-15 11:25:10] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:25:11] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2023-03-15 11:25:11] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 1 ms to minimize.
[2023-03-15 11:25:11] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 1 ms to minimize.
[2023-03-15 11:25:11] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 1 ms to minimize.
[2023-03-15 11:25:12] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 1 ms to minimize.
[2023-03-15 11:25:12] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 1 ms to minimize.
[2023-03-15 11:25:12] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2023-03-15 11:25:13] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 1 ms to minimize.
[2023-03-15 11:25:13] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 1 ms to minimize.
[2023-03-15 11:25:13] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2023-03-15 11:25:14] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 0 ms to minimize.
[2023-03-15 11:25:14] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 1 ms to minimize.
[2023-03-15 11:25:14] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 1 ms to minimize.
[2023-03-15 11:25:14] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 1 ms to minimize.
[2023-03-15 11:25:15] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 1 ms to minimize.
[2023-03-15 11:25:15] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 0 ms to minimize.
[2023-03-15 11:25:16] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2023-03-15 11:25:16] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 1 ms to minimize.
[2023-03-15 11:25:17] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 1 ms to minimize.
[2023-03-15 11:25:17] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 0 ms to minimize.
[2023-03-15 11:25:17] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 7065 ms
[2023-03-15 11:25:17] [INFO ] Added : 178 causal constraints over 37 iterations in 14444 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:25:20] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:25:21] [INFO ] Implicit Places using invariants in 619 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:25:21] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 11:25:21] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:25:48] [INFO ] Implicit Places using invariants and state equation in 27128 ms returned []
Implicit Place search using SMT with State Equation took 27748 ms to find 0 implicit places.
[2023-03-15 11:25:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-15 11:25:48] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:25:48] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28087 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-10 in 190546 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-11
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:25:48] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1305 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:25:48] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-15 11:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:49] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2023-03-15 11:25:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:50] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2023-03-15 11:25:50] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:25:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 2207 ms returned sat
[2023-03-15 11:25:52] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-15 11:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-15 11:25:52] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-15 11:25:55] [INFO ] Deduced a trap composed of 2 places in 447 ms of which 1 ms to minimize.
[2023-03-15 11:25:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 459 transition count 458
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 457 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 457 transition count 457
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 456 transition count 457
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 452 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 449 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 449 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 448 transition count 452
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 31 place count 448 transition count 445
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 38 place count 441 transition count 445
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 108 ms. Remains 441 /460 variables (removed 19) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 441/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-15 11:25:55] [INFO ] Computed 75 place invariants in 116 ms
Incomplete random walk after 1000000 steps, including 129146 resets, run finished after 1268 ms. (steps per millisecond=788 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85132 resets, run finished after 750 ms. (steps per millisecond=1333 ) properties (out of 1) seen :0
[2023-03-15 11:25:57] [INFO ] Invariant cache hit.
[2023-03-15 11:25:57] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 11:25:57] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 55 ms returned sat
[2023-03-15 11:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:58] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2023-03-15 11:25:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:25:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:25:58] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 40 ms returned sat
[2023-03-15 11:25:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:25:58] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2023-03-15 11:25:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:26:01] [INFO ] [Nat]Added 84 Read/Feed constraints in 2149 ms returned sat
[2023-03-15 11:26:01] [INFO ] Computed and/alt/rep : 339/2213/339 causal constraints (skipped 105 transitions) in 43 ms.
[2023-03-15 11:26:13] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-15 11:26:13] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2023-03-15 11:26:13] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 1 ms to minimize.
[2023-03-15 11:26:13] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2023-03-15 11:26:14] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 1 ms to minimize.
[2023-03-15 11:26:14] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:26:14] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 0 ms to minimize.
[2023-03-15 11:26:15] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 1 ms to minimize.
[2023-03-15 11:26:16] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 1 ms to minimize.
[2023-03-15 11:26:16] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 1 ms to minimize.
[2023-03-15 11:26:16] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 1 ms to minimize.
[2023-03-15 11:26:17] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 1 ms to minimize.
[2023-03-15 11:26:17] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-15 11:26:17] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 1 ms to minimize.
[2023-03-15 11:26:18] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 1 ms to minimize.
[2023-03-15 11:26:18] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 0 ms to minimize.
[2023-03-15 11:26:18] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 1 ms to minimize.
[2023-03-15 11:26:19] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2023-03-15 11:26:19] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 0 ms to minimize.
[2023-03-15 11:26:19] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 0 ms to minimize.
[2023-03-15 11:26:19] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 1 ms to minimize.
[2023-03-15 11:26:20] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2023-03-15 11:26:20] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 1 ms to minimize.
[2023-03-15 11:26:21] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 0 ms to minimize.
[2023-03-15 11:26:21] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 1 ms to minimize.
[2023-03-15 11:26:21] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 1 ms to minimize.
[2023-03-15 11:26:21] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 0 ms to minimize.
[2023-03-15 11:26:22] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 1 ms to minimize.
[2023-03-15 11:26:22] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2023-03-15 11:26:22] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 0 ms to minimize.
[2023-03-15 11:26:22] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 0 ms to minimize.
[2023-03-15 11:26:22] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 0 ms to minimize.
[2023-03-15 11:26:23] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 0 ms to minimize.
[2023-03-15 11:26:23] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 1 ms to minimize.
[2023-03-15 11:26:23] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 0 ms to minimize.
[2023-03-15 11:26:23] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 1 ms to minimize.
[2023-03-15 11:26:23] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 1 ms to minimize.
[2023-03-15 11:26:24] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 0 ms to minimize.
[2023-03-15 11:26:24] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2023-03-15 11:26:24] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 11584 ms
[2023-03-15 11:26:24] [INFO ] Added : 228 causal constraints over 46 iterations in 23465 ms. Result :sat
Minimization took 3003 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-15 11:26:27] [INFO ] Invariant cache hit.
[2023-03-15 11:26:28] [INFO ] Implicit Places using invariants in 915 ms returned []
[2023-03-15 11:26:28] [INFO ] Invariant cache hit.
[2023-03-15 11:26:28] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:26:59] [INFO ] Performed 429/441 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:26:59] [INFO ] Implicit Places using invariants and state equation in 31416 ms returned [13, 200]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 32333 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 439 transition count 442
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 442
Applied a total of 6 rules in 20 ms. Remains 436 /439 variables (removed 3) and now considering 442/445 (removed 3) transitions.
// Phase 1: matrix 442 rows 436 cols
[2023-03-15 11:26:59] [INFO ] Computed 73 place invariants in 56 ms
[2023-03-15 11:27:00] [INFO ] Implicit Places using invariants in 729 ms returned []
[2023-03-15 11:27:00] [INFO ] Invariant cache hit.
[2023-03-15 11:27:00] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:27:30] [INFO ] Implicit Places using invariants and state equation in 29933 ms returned []
Implicit Place search using SMT with State Equation took 30664 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 436/441 places, 442/445 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63028 ms. Remains : 436/441 places, 442/445 transitions.
[2023-03-15 11:27:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 129569 resets, run finished after 1247 ms. (steps per millisecond=801 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85407 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 1) seen :0
[2023-03-15 11:27:32] [INFO ] Invariant cache hit.
[2023-03-15 11:27:32] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-15 11:27:32] [INFO ] [Real]Absence check using 2 positive and 71 generalized place invariants in 55 ms returned sat
[2023-03-15 11:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:33] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2023-03-15 11:27:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:27:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:27:33] [INFO ] [Nat]Absence check using 2 positive and 71 generalized place invariants in 35 ms returned sat
[2023-03-15 11:27:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:27:34] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2023-03-15 11:27:34] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:27:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 11:27:37] [INFO ] [Nat]Added 84 Read/Feed constraints in 3143 ms returned sat
[2023-03-15 11:27:37] [INFO ] Computed and/alt/rep : 336/2200/336 causal constraints (skipped 105 transitions) in 35 ms.
[2023-03-15 11:27:43] [INFO ] Added : 228 causal constraints over 46 iterations in 6035 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 442/442 transitions.
Applied a total of 0 rules in 11 ms. Remains 436 /436 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 436/436 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 442/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 436 /436 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-15 11:27:46] [INFO ] Invariant cache hit.
[2023-03-15 11:27:47] [INFO ] Implicit Places using invariants in 749 ms returned []
[2023-03-15 11:27:47] [INFO ] Invariant cache hit.
[2023-03-15 11:27:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:28:11] [INFO ] Implicit Places using invariants and state equation in 23836 ms returned [94, 119, 150]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 24587 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 433/436 places, 442/442 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 432 transition count 441
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 432 transition count 441
Applied a total of 4 rules in 29 ms. Remains 432 /433 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 432 cols
[2023-03-15 11:28:11] [INFO ] Invariants computation overflowed in 27 ms
[2023-03-15 11:28:11] [INFO ] Implicit Places using invariants in 770 ms returned []
// Phase 1: matrix 441 rows 432 cols
[2023-03-15 11:28:11] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 11:28:12] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:28:39] [INFO ] Implicit Places using invariants and state equation in 27738 ms returned []
Implicit Place search using SMT with State Equation took 28509 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 432/436 places, 441/442 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 53135 ms. Remains : 432/436 places, 441/442 transitions.
// Phase 1: matrix 441 rows 432 cols
[2023-03-15 11:28:39] [INFO ] Invariants computation overflowed in 28 ms
Incomplete random walk after 1000000 steps, including 144355 resets, run finished after 1191 ms. (steps per millisecond=839 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91329 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties (out of 1) seen :0
// Phase 1: matrix 441 rows 432 cols
[2023-03-15 11:28:41] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-15 11:28:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:42] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-15 11:28:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:28:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:28:43] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2023-03-15 11:28:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:28:45] [INFO ] [Nat]Added 84 Read/Feed constraints in 2095 ms returned sat
[2023-03-15 11:28:45] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-15 11:28:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-15 11:28:45] [INFO ] Computed and/alt/rep : 332/2176/332 causal constraints (skipped 108 transitions) in 39 ms.
[2023-03-15 11:28:54] [INFO ] Added : 205 causal constraints over 41 iterations in 9371 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 441/441 transitions.
Applied a total of 0 rules in 10 ms. Remains 432 /432 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 432/432 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 441/441 transitions.
Applied a total of 0 rules in 9 ms. Remains 432 /432 variables (removed 0) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 432 cols
[2023-03-15 11:28:57] [INFO ] Invariants computation overflowed in 27 ms
[2023-03-15 11:28:58] [INFO ] Implicit Places using invariants in 849 ms returned []
// Phase 1: matrix 441 rows 432 cols
[2023-03-15 11:28:58] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 11:28:59] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:29:28] [INFO ] Implicit Places using invariants and state equation in 29886 ms returned []
Implicit Place search using SMT with State Equation took 30743 ms to find 0 implicit places.
[2023-03-15 11:29:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 441 rows 432 cols
[2023-03-15 11:29:28] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-15 11:29:28] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31101 ms. Remains : 432/432 places, 441/441 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-11 in 219938 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-12
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:29:28] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 871 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:29:28] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:29] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2023-03-15 11:29:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:29:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:30] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2023-03-15 11:29:30] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:29:30] [INFO ] [Nat]Added 73 Read/Feed constraints in 901 ms returned sat
[2023-03-15 11:29:31] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2023-03-15 11:29:31] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2023-03-15 11:29:31] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2023-03-15 11:29:31] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 1 ms to minimize.
[2023-03-15 11:29:31] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 1 ms to minimize.
[2023-03-15 11:29:32] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 1 ms to minimize.
[2023-03-15 11:29:32] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
[2023-03-15 11:29:32] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2023-03-15 11:29:32] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 0 ms to minimize.
[2023-03-15 11:29:33] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 1 ms to minimize.
[2023-03-15 11:29:33] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 1 ms to minimize.
[2023-03-15 11:29:33] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 1 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Deduced a trap composed of 15 places in 286 ms of which 0 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3491 ms
[2023-03-15 11:29:34] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 58 ms.
[2023-03-15 11:29:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 447 transition count 451
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 447 transition count 446
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 442 transition count 446
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 442 transition count 446
Applied a total of 40 rules in 109 ms. Remains 442 /460 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 442/460 places, 446/461 transitions.
// Phase 1: matrix 446 rows 442 cols
[2023-03-15 11:29:34] [INFO ] Invariants computation overflowed in 87 ms
Incomplete random walk after 1000000 steps, including 129697 resets, run finished after 1283 ms. (steps per millisecond=779 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85292 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 442 cols
[2023-03-15 11:29:36] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 11:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:37] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2023-03-15 11:29:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:29:38] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2023-03-15 11:29:38] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:29:39] [INFO ] [Nat]Added 84 Read/Feed constraints in 1163 ms returned sat
[2023-03-15 11:29:39] [INFO ] Deduced a trap composed of 122 places in 277 ms of which 1 ms to minimize.
[2023-03-15 11:29:40] [INFO ] Deduced a trap composed of 134 places in 500 ms of which 1 ms to minimize.
[2023-03-15 11:29:41] [INFO ] Deduced a trap composed of 125 places in 564 ms of which 1 ms to minimize.
[2023-03-15 11:29:41] [INFO ] Deduced a trap composed of 136 places in 553 ms of which 0 ms to minimize.
[2023-03-15 11:29:42] [INFO ] Deduced a trap composed of 127 places in 539 ms of which 1 ms to minimize.
[2023-03-15 11:29:43] [INFO ] Deduced a trap composed of 133 places in 526 ms of which 1 ms to minimize.
[2023-03-15 11:29:43] [INFO ] Deduced a trap composed of 142 places in 498 ms of which 1 ms to minimize.
[2023-03-15 11:29:44] [INFO ] Deduced a trap composed of 127 places in 561 ms of which 1 ms to minimize.
[2023-03-15 11:29:45] [INFO ] Deduced a trap composed of 134 places in 558 ms of which 1 ms to minimize.
[2023-03-15 11:29:45] [INFO ] Deduced a trap composed of 121 places in 559 ms of which 1 ms to minimize.
[2023-03-15 11:29:46] [INFO ] Deduced a trap composed of 133 places in 562 ms of which 1 ms to minimize.
[2023-03-15 11:29:47] [INFO ] Deduced a trap composed of 125 places in 563 ms of which 1 ms to minimize.
[2023-03-15 11:29:47] [INFO ] Deduced a trap composed of 117 places in 553 ms of which 1 ms to minimize.
[2023-03-15 11:29:48] [INFO ] Deduced a trap composed of 118 places in 553 ms of which 1 ms to minimize.
[2023-03-15 11:29:48] [INFO ] Deduced a trap composed of 122 places in 558 ms of which 1 ms to minimize.
[2023-03-15 11:29:49] [INFO ] Deduced a trap composed of 13 places in 530 ms of which 1 ms to minimize.
[2023-03-15 11:29:50] [INFO ] Deduced a trap composed of 19 places in 547 ms of which 1 ms to minimize.
[2023-03-15 11:29:50] [INFO ] Deduced a trap composed of 17 places in 552 ms of which 1 ms to minimize.
[2023-03-15 11:29:51] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 1 ms to minimize.
[2023-03-15 11:29:51] [INFO ] Deduced a trap composed of 31 places in 513 ms of which 2 ms to minimize.
[2023-03-15 11:29:52] [INFO ] Deduced a trap composed of 43 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:29:52] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 1 ms to minimize.
[2023-03-15 11:29:53] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 1 ms to minimize.
[2023-03-15 11:29:53] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 1 ms to minimize.
[2023-03-15 11:29:53] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2023-03-15 11:29:53] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 1 ms to minimize.
[2023-03-15 11:29:53] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 1 ms to minimize.
[2023-03-15 11:29:54] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2023-03-15 11:29:54] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 1 ms to minimize.
[2023-03-15 11:29:54] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 1 ms to minimize.
[2023-03-15 11:29:55] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 1 ms to minimize.
[2023-03-15 11:29:55] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:29:55] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 1 ms to minimize.
[2023-03-15 11:29:56] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:29:56] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 1 ms to minimize.
[2023-03-15 11:29:56] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:29:57] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 1 ms to minimize.
[2023-03-15 11:29:57] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 1 ms to minimize.
[2023-03-15 11:29:57] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 1 ms to minimize.
[2023-03-15 11:29:57] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 1 ms to minimize.
[2023-03-15 11:29:58] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 1 ms to minimize.
[2023-03-15 11:29:58] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 19292 ms
[2023-03-15 11:29:58] [INFO ] Computed and/alt/rep : 339/2200/339 causal constraints (skipped 106 transitions) in 53 ms.
[2023-03-15 11:30:13] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 1 ms to minimize.
[2023-03-15 11:30:14] [INFO ] Deduced a trap composed of 8 places in 550 ms of which 1 ms to minimize.
[2023-03-15 11:30:14] [INFO ] Deduced a trap composed of 140 places in 543 ms of which 1 ms to minimize.
[2023-03-15 11:30:15] [INFO ] Deduced a trap composed of 12 places in 498 ms of which 1 ms to minimize.
[2023-03-15 11:30:16] [INFO ] Deduced a trap composed of 14 places in 502 ms of which 1 ms to minimize.
[2023-03-15 11:30:16] [INFO ] Deduced a trap composed of 149 places in 534 ms of which 1 ms to minimize.
[2023-03-15 11:30:17] [INFO ] Deduced a trap composed of 141 places in 546 ms of which 1 ms to minimize.
[2023-03-15 11:30:17] [INFO ] Deduced a trap composed of 157 places in 552 ms of which 1 ms to minimize.
[2023-03-15 11:30:18] [INFO ] Deduced a trap composed of 155 places in 546 ms of which 1 ms to minimize.
[2023-03-15 11:30:19] [INFO ] Deduced a trap composed of 123 places in 546 ms of which 1 ms to minimize.
[2023-03-15 11:30:19] [INFO ] Deduced a trap composed of 141 places in 546 ms of which 1 ms to minimize.
[2023-03-15 11:30:20] [INFO ] Deduced a trap composed of 144 places in 554 ms of which 1 ms to minimize.
[2023-03-15 11:30:21] [INFO ] Deduced a trap composed of 145 places in 552 ms of which 1 ms to minimize.
[2023-03-15 11:30:21] [INFO ] Deduced a trap composed of 152 places in 547 ms of which 1 ms to minimize.
[2023-03-15 11:30:22] [INFO ] Deduced a trap composed of 108 places in 545 ms of which 1 ms to minimize.
[2023-03-15 11:30:23] [INFO ] Deduced a trap composed of 149 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:30:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 16 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 442/442 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 19 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 442 cols
[2023-03-15 11:30:23] [INFO ] Invariants computation overflowed in 87 ms
[2023-03-15 11:30:24] [INFO ] Implicit Places using invariants in 1005 ms returned []
// Phase 1: matrix 446 rows 442 cols
[2023-03-15 11:30:24] [INFO ] Invariants computation overflowed in 87 ms
[2023-03-15 11:30:24] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:30:54] [INFO ] Performed 347/442 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:31:02] [INFO ] Implicit Places using invariants and state equation in 37949 ms returned [13, 101]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 38956 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 440/442 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 438 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 438 transition count 444
Applied a total of 5 rules in 29 ms. Remains 438 /440 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 438 cols
[2023-03-15 11:31:02] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:31:02] [INFO ] Implicit Places using invariants in 696 ms returned []
// Phase 1: matrix 444 rows 438 cols
[2023-03-15 11:31:02] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 11:31:03] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:31:27] [INFO ] Implicit Places using invariants and state equation in 24463 ms returned []
Implicit Place search using SMT with State Equation took 25162 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 438/442 places, 444/446 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64166 ms. Remains : 438/442 places, 444/446 transitions.
// Phase 1: matrix 444 rows 438 cols
[2023-03-15 11:31:27] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 129238 resets, run finished after 1244 ms. (steps per millisecond=803 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85313 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 1) seen :0
// Phase 1: matrix 444 rows 438 cols
[2023-03-15 11:31:29] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:31:29] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2023-03-15 11:31:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:31:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:31:30] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2023-03-15 11:31:30] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:31:31] [INFO ] [Nat]Added 84 Read/Feed constraints in 1488 ms returned sat
[2023-03-15 11:31:32] [INFO ] Deduced a trap composed of 122 places in 450 ms of which 1 ms to minimize.
[2023-03-15 11:31:32] [INFO ] Deduced a trap composed of 117 places in 551 ms of which 1 ms to minimize.
[2023-03-15 11:31:33] [INFO ] Deduced a trap composed of 118 places in 536 ms of which 1 ms to minimize.
[2023-03-15 11:31:34] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 1 ms to minimize.
[2023-03-15 11:31:34] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 1 ms to minimize.
[2023-03-15 11:31:34] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 1 ms to minimize.
[2023-03-15 11:31:34] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 1 ms to minimize.
[2023-03-15 11:31:35] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 1 ms to minimize.
[2023-03-15 11:31:35] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 1 ms to minimize.
[2023-03-15 11:31:35] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 0 ms to minimize.
[2023-03-15 11:31:36] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:31:36] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 1 ms to minimize.
[2023-03-15 11:31:36] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2023-03-15 11:31:37] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 0 ms to minimize.
[2023-03-15 11:31:37] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 1 ms to minimize.
[2023-03-15 11:31:37] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:31:38] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 1 ms to minimize.
[2023-03-15 11:31:39] [INFO ] Deduced a trap composed of 9 places in 578 ms of which 1 ms to minimize.
[2023-03-15 11:31:39] [INFO ] Deduced a trap composed of 113 places in 555 ms of which 2 ms to minimize.
[2023-03-15 11:31:40] [INFO ] Deduced a trap composed of 114 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:31:41] [INFO ] Deduced a trap composed of 43 places in 271 ms of which 1 ms to minimize.
[2023-03-15 11:31:41] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2023-03-15 11:31:41] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2023-03-15 11:31:41] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2023-03-15 11:31:42] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 1 ms to minimize.
[2023-03-15 11:31:42] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 0 ms to minimize.
[2023-03-15 11:31:43] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 1 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 1 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 1 ms to minimize.
[2023-03-15 11:31:44] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 13168 ms
[2023-03-15 11:31:45] [INFO ] Computed and/alt/rep : 335/2173/335 causal constraints (skipped 108 transitions) in 54 ms.
[2023-03-15 11:31:49] [INFO ] Added : 139 causal constraints over 28 iterations in 4486 ms. Result :sat
Minimization took 1969 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 444/444 transitions.
Applied a total of 0 rules in 9 ms. Remains 438 /438 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 438/438 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 438 /438 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 438 cols
[2023-03-15 11:32:21] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-15 11:32:22] [INFO ] Implicit Places using invariants in 733 ms returned []
// Phase 1: matrix 444 rows 438 cols
[2023-03-15 11:32:22] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:32:22] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:32:52] [INFO ] Implicit Places using invariants and state equation in 30126 ms returned []
Implicit Place search using SMT with State Equation took 30861 ms to find 0 implicit places.
[2023-03-15 11:32:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 444 rows 438 cols
[2023-03-15 11:32:52] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:32:52] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31428 ms. Remains : 438/438 places, 444/444 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-12 in 204158 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-13
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:32:52] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:32:53] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:53] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-15 11:32:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:32:53] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2023-03-15 11:32:53] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:32:54] [INFO ] [Nat]Added 73 Read/Feed constraints in 1025 ms returned sat
[2023-03-15 11:32:55] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 35 ms.
[2023-03-15 11:32:57] [INFO ] Added : 73 causal constraints over 16 iterations in 2258 ms. Result :sat
Minimization took 1176 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 447 transition count 451
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 32 place count 447 transition count 444
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 39 place count 440 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 44 place count 440 transition count 444
Applied a total of 44 rules in 63 ms. Remains 440 /460 variables (removed 20) and now considering 444/461 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 440/460 places, 444/461 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-15 11:32:58] [INFO ] Computed 75 place invariants in 72 ms
Incomplete random walk after 1000000 steps, including 129342 resets, run finished after 1228 ms. (steps per millisecond=814 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85219 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 1) seen :0
[2023-03-15 11:33:00] [INFO ] Invariant cache hit.
[2023-03-15 11:33:00] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-15 11:33:00] [INFO ] [Real]Absence check using 4 positive and 71 generalized place invariants in 34 ms returned sat
[2023-03-15 11:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:00] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2023-03-15 11:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:33:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-15 11:33:01] [INFO ] [Nat]Absence check using 4 positive and 71 generalized place invariants in 44 ms returned sat
[2023-03-15 11:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:33:01] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-15 11:33:01] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:33:01] [INFO ] [Nat]Added 84 Read/Feed constraints in 120 ms returned sat
[2023-03-15 11:33:02] [INFO ] Deduced a trap composed of 23 places in 504 ms of which 1 ms to minimize.
[2023-03-15 11:33:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 574 ms
[2023-03-15 11:33:02] [INFO ] Computed and/alt/rep : 337/2198/337 causal constraints (skipped 106 transitions) in 54 ms.
[2023-03-15 11:33:04] [INFO ] Added : 76 causal constraints over 16 iterations in 2019 ms. Result :sat
Minimization took 1331 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 9 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-15 11:33:05] [INFO ] Invariant cache hit.
[2023-03-15 11:33:07] [INFO ] Implicit Places using invariants in 1841 ms returned [50, 70, 75, 96, 101, 121, 127, 152, 153, 173, 178, 199, 227]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1843 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 427/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 427 transition count 435
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 418 transition count 435
Applied a total of 18 rules in 31 ms. Remains 418 /427 variables (removed 9) and now considering 435/444 (removed 9) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:33:07] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:33:08] [INFO ] Implicit Places using invariants in 783 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-15 11:33:08] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:33:08] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:33:36] [INFO ] Implicit Places using invariants and state equation in 28530 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 29314 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/440 places, 435/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 417 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 415 transition count 433
Applied a total of 4 rules in 18 ms. Remains 415 /417 variables (removed 2) and now considering 433/435 (removed 2) transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 11:33:36] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:33:37] [INFO ] Implicit Places using invariants in 747 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 11:33:37] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 11:33:38] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:34:09] [INFO ] Performed 384/415 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2023-03-15 11:34:11] [INFO ] Implicit Places using invariants and state equation in 33707 ms returned []
Implicit Place search using SMT with State Equation took 34456 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 415/440 places, 433/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 65673 ms. Remains : 415/440 places, 433/444 transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 11:34:11] [INFO ] Invariants computation overflowed in 32 ms
Incomplete random walk after 1000000 steps, including 144395 resets, run finished after 1178 ms. (steps per millisecond=848 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91127 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 11:34:13] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:34:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:13] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2023-03-15 11:34:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:14] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2023-03-15 11:34:14] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:34:14] [INFO ] [Nat]Added 84 Read/Feed constraints in 452 ms returned sat
[2023-03-15 11:34:15] [INFO ] Computed and/alt/rep : 323/2160/323 causal constraints (skipped 109 transitions) in 32 ms.
[2023-03-15 11:34:15] [INFO ] Added : 70 causal constraints over 14 iterations in 913 ms. Result :sat
Minimization took 2007 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 415/415 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 11:34:18] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:34:18] [INFO ] Implicit Places using invariants in 668 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 11:34:18] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:34:19] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:34:49] [INFO ] Performed 398/415 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:34:50] [INFO ] Implicit Places using invariants and state equation in 31582 ms returned []
Implicit Place search using SMT with State Equation took 32252 ms to find 0 implicit places.
[2023-03-15 11:34:50] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-15 11:34:50] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:34:50] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32586 ms. Remains : 415/415 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-13 in 117809 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-14
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:34:50] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:34:50] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:51] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2023-03-15 11:34:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:51] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2023-03-15 11:34:51] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:34:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 649 ms returned sat
[2023-03-15 11:34:52] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 55 ms.
[2023-03-15 11:34:56] [INFO ] Added : 80 causal constraints over 17 iterations in 3878 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Graph (complete) has 3300 edges and 460 vertex of which 458 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 456 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 455 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 452 transition count 453
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 450 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 450 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 449 transition count 452
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 28 place count 449 transition count 445
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 35 place count 442 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 442 transition count 445
Applied a total of 40 rules in 60 ms. Remains 442 /460 variables (removed 18) and now considering 445/461 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 442/460 places, 445/461 transitions.
// Phase 1: matrix 445 rows 442 cols
[2023-03-15 11:34:56] [INFO ] Computed 75 place invariants in 66 ms
Incomplete random walk after 1000000 steps, including 129284 resets, run finished after 1607 ms. (steps per millisecond=622 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85168 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 1) seen :0
[2023-03-15 11:34:58] [INFO ] Invariant cache hit.
[2023-03-15 11:34:58] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-15 11:34:58] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 53 ms returned sat
[2023-03-15 11:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:59] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-15 11:34:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 11:34:59] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 67 ms returned sat
[2023-03-15 11:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:59] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-15 11:34:59] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 11:34:59] [INFO ] [Nat]Added 82 Read/Feed constraints in 156 ms returned sat
[2023-03-15 11:34:59] [INFO ] Computed and/alt/rep : 341/2186/341 causal constraints (skipped 103 transitions) in 35 ms.
[2023-03-15 11:35:00] [INFO ] Added : 52 causal constraints over 11 iterations in 504 ms. Result :sat
Minimization took 657 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 17 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 442/442 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 17 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-15 11:35:01] [INFO ] Invariant cache hit.
[2023-03-15 11:35:03] [INFO ] Implicit Places using invariants in 2014 ms returned [50, 72, 77, 98, 103, 123, 129, 154, 155, 175, 180, 201, 229]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 2015 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 429/442 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 429 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 436
Applied a total of 18 rules in 28 ms. Remains 420 /429 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 11:35:03] [INFO ] Invariants computation overflowed in 95 ms
[2023-03-15 11:35:04] [INFO ] Implicit Places using invariants in 837 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-15 11:35:04] [INFO ] Invariants computation overflowed in 91 ms
[2023-03-15 11:35:04] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 11:35:34] [INFO ] Implicit Places using invariants and state equation in 29887 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30725 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/442 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 18 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:35:34] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:35:34] [INFO ] Implicit Places using invariants in 624 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:35:34] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 11:35:35] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 11:36:01] [INFO ] Implicit Places using invariants and state equation in 26958 ms returned []
Implicit Place search using SMT with State Equation took 27583 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/442 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 60386 ms. Remains : 417/442 places, 434/445 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:36:01] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 143893 resets, run finished after 1159 ms. (steps per millisecond=862 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91456 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:36:03] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:03] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-15 11:36:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:04] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-15 11:36:04] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 11:36:04] [INFO ] [Nat]Added 82 Read/Feed constraints in 29 ms returned sat
[2023-03-15 11:36:04] [INFO ] Computed and/alt/rep : 331/2191/331 causal constraints (skipped 102 transitions) in 32 ms.
[2023-03-15 11:36:05] [INFO ] Deduced a trap composed of 8 places in 437 ms of which 1 ms to minimize.
[2023-03-15 11:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 517 ms
[2023-03-15 11:36:05] [INFO ] Added : 58 causal constraints over 12 iterations in 1163 ms. Result :sat
Minimization took 675 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:36:06] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:36:06] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:36:06] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:36:07] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-15 11:36:37] [INFO ] Performed 413/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:36:37] [INFO ] Implicit Places using invariants and state equation in 30884 ms returned []
Implicit Place search using SMT with State Equation took 31496 ms to find 0 implicit places.
[2023-03-15 11:36:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-15 11:36:37] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:36:37] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31872 ms. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-14 in 107238 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-15
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:36:38] [INFO ] Invariants computation overflowed in 72 ms
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 461 rows 460 cols
[2023-03-15 11:36:38] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 11:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:38] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2023-03-15 11:36:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:39] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2023-03-15 11:36:39] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:36:41] [INFO ] [Nat]Added 73 Read/Feed constraints in 2098 ms returned sat
[2023-03-15 11:36:41] [INFO ] Computed and/alt/rep : 374/2215/374 causal constraints (skipped 86 transitions) in 35 ms.
[2023-03-15 11:36:43] [INFO ] Added : 60 causal constraints over 12 iterations in 2362 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 461/461 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 460 transition count 459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 458 transition count 459
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 454 transition count 455
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 451 transition count 455
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 451 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 450 transition count 454
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 28 place count 450 transition count 446
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 36 place count 442 transition count 446
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 40 place count 442 transition count 446
Applied a total of 40 rules in 97 ms. Remains 442 /460 variables (removed 18) and now considering 446/461 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 442/460 places, 446/461 transitions.
// Phase 1: matrix 446 rows 442 cols
[2023-03-15 11:36:44] [INFO ] Computed 75 place invariants in 88 ms
Incomplete random walk after 1000000 steps, including 129010 resets, run finished after 1333 ms. (steps per millisecond=750 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85140 resets, run finished after 733 ms. (steps per millisecond=1364 ) properties (out of 1) seen :0
[2023-03-15 11:36:46] [INFO ] Invariant cache hit.
[2023-03-15 11:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 11:36:46] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 28 ms returned sat
[2023-03-15 11:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:47] [INFO ] [Real]Absence check using state equation in 963 ms returned sat
[2023-03-15 11:36:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:36:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:36:47] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 27 ms returned sat
[2023-03-15 11:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:48] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2023-03-15 11:36:48] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:36:49] [INFO ] [Nat]Added 84 Read/Feed constraints in 1452 ms returned sat
[2023-03-15 11:36:49] [INFO ] Computed and/alt/rep : 340/2214/340 causal constraints (skipped 105 transitions) in 34 ms.
[2023-03-15 11:37:02] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2023-03-15 11:37:03] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 1 ms to minimize.
[2023-03-15 11:37:03] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 1 ms to minimize.
[2023-03-15 11:37:03] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 0 ms to minimize.
[2023-03-15 11:37:04] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 1 ms to minimize.
[2023-03-15 11:37:04] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 1 ms to minimize.
[2023-03-15 11:37:04] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 0 ms to minimize.
[2023-03-15 11:37:04] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 0 ms to minimize.
[2023-03-15 11:37:05] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 1 ms to minimize.
[2023-03-15 11:37:05] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 0 ms to minimize.
[2023-03-15 11:37:05] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 0 ms to minimize.
[2023-03-15 11:37:06] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2023-03-15 11:37:06] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 0 ms to minimize.
[2023-03-15 11:37:06] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 0 ms to minimize.
[2023-03-15 11:37:07] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 1 ms to minimize.
[2023-03-15 11:37:07] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 0 ms to minimize.
[2023-03-15 11:37:08] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 0 ms to minimize.
[2023-03-15 11:37:08] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2023-03-15 11:37:08] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 1 ms to minimize.
[2023-03-15 11:37:08] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 0 ms to minimize.
[2023-03-15 11:37:09] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2023-03-15 11:37:09] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 1 ms to minimize.
[2023-03-15 11:37:09] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2023-03-15 11:37:10] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 0 ms to minimize.
[2023-03-15 11:37:10] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2023-03-15 11:37:10] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7661 ms
[2023-03-15 11:37:10] [INFO ] Added : 250 causal constraints over 52 iterations in 20987 ms.(timeout) Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 13 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 442/442 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 11:37:13] [INFO ] Invariant cache hit.
[2023-03-15 11:37:14] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-15 11:37:14] [INFO ] Invariant cache hit.
[2023-03-15 11:37:14] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:37:41] [INFO ] Implicit Places using invariants and state equation in 27650 ms returned [24, 123]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 28424 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 440/442 places, 446/446 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 446
Applied a total of 2 rules in 19 ms. Remains 440 /440 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 440 cols
[2023-03-15 11:37:42] [INFO ] Computed 73 place invariants in 64 ms
[2023-03-15 11:37:42] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-03-15 11:37:42] [INFO ] Invariant cache hit.
[2023-03-15 11:37:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:38:13] [INFO ] Performed 412/440 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:38:15] [INFO ] Implicit Places using invariants and state equation in 32291 ms returned []
Implicit Place search using SMT with State Equation took 33086 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 440/442 places, 446/446 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61539 ms. Remains : 440/442 places, 446/446 transitions.
[2023-03-15 11:38:15] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 129063 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85093 resets, run finished after 729 ms. (steps per millisecond=1371 ) properties (out of 1) seen :0
[2023-03-15 11:38:16] [INFO ] Invariant cache hit.
[2023-03-15 11:38:16] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:38:16] [INFO ] [Real]Absence check using 2 positive and 71 generalized place invariants in 37 ms returned sat
[2023-03-15 11:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:38:17] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2023-03-15 11:38:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:38:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 11:38:17] [INFO ] [Nat]Absence check using 2 positive and 71 generalized place invariants in 30 ms returned sat
[2023-03-15 11:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:38:18] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2023-03-15 11:38:18] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:38:19] [INFO ] [Nat]Added 84 Read/Feed constraints in 1121 ms returned sat
[2023-03-15 11:38:19] [INFO ] Computed and/alt/rep : 337/2195/337 causal constraints (skipped 108 transitions) in 36 ms.
[2023-03-15 11:38:29] [INFO ] Added : 220 causal constraints over 44 iterations in 10389 ms. Result :sat
Minimization took 1711 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 440/440 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-15 11:38:31] [INFO ] Invariant cache hit.
[2023-03-15 11:38:32] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-15 11:38:32] [INFO ] Invariant cache hit.
[2023-03-15 11:38:32] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-15 11:39:02] [INFO ] Performed 408/440 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:39:04] [INFO ] Implicit Places using invariants and state equation in 32403 ms returned []
Implicit Place search using SMT with State Equation took 33087 ms to find 0 implicit places.
[2023-03-15 11:39:04] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 11:39:04] [INFO ] Invariant cache hit.
[2023-03-15 11:39:04] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33475 ms. Remains : 440/440 places, 446/446 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-15 in 146964 ms.
[2023-03-15 11:39:05] [INFO ] Flatten gal took : 242 ms
[2023-03-15 11:39:05] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-15 11:39:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 460 places, 461 transitions and 3475 arcs took 9 ms.
Total runtime 3416102 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: DoubleExponent_PT_020
(NrP: 460 NrTr: 461 NrArc: 3475)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.058sec
net check time: 0m 0.001sec
init dd package: 0m 3.245sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10562640 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099344 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.002sec
19230 33669 52178 66151
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="DoubleExponent-PT-020"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is DoubleExponent-PT-020, 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 r138-smll-167819420900485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;