About the Execution of ITS-Tools for Peterson-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16213.771 | 3600000.00 | 3024013.00 | 259741.70 | ? 7 7 7 8 7 8 8 1 ? 1 ? 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536600645.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 itstools
Input is Peterson-PT-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536600645
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 323K Feb 25 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 22:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 629K Feb 25 22:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 141K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 411K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 318K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 794K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 608K Feb 25 23:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 23:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:23 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 Peterson-PT-7-UpperBounds-00
FORMULA_NAME Peterson-PT-7-UpperBounds-01
FORMULA_NAME Peterson-PT-7-UpperBounds-02
FORMULA_NAME Peterson-PT-7-UpperBounds-03
FORMULA_NAME Peterson-PT-7-UpperBounds-04
FORMULA_NAME Peterson-PT-7-UpperBounds-05
FORMULA_NAME Peterson-PT-7-UpperBounds-06
FORMULA_NAME Peterson-PT-7-UpperBounds-07
FORMULA_NAME Peterson-PT-7-UpperBounds-08
FORMULA_NAME Peterson-PT-7-UpperBounds-09
FORMULA_NAME Peterson-PT-7-UpperBounds-10
FORMULA_NAME Peterson-PT-7-UpperBounds-11
FORMULA_NAME Peterson-PT-7-UpperBounds-12
FORMULA_NAME Peterson-PT-7-UpperBounds-13
FORMULA_NAME Peterson-PT-7-UpperBounds-14
FORMULA_NAME Peterson-PT-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679085705492
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-17 20:41:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 20:41:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 20:41:49] [INFO ] Load time of PNML (sax parser for PT used): 532 ms
[2023-03-17 20:41:49] [INFO ] Transformed 1992 places.
[2023-03-17 20:41:49] [INFO ] Transformed 3096 transitions.
[2023-03-17 20:41:49] [INFO ] Found NUPN structural information;
[2023-03-17 20:41:49] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2023-03-17 20:41:49] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 841 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 41 ms.
FORMULA Peterson-PT-7-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2760 out of 3096 initially.
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 20:41:49] [INFO ] Computed 31 place invariants in 69 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 13) seen :36
FORMULA Peterson-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 9) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :23
[2023-03-17 20:41:51] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 20:41:51] [INFO ] Computed 31 place invariants in 23 ms
[2023-03-17 20:41:52] [INFO ] [Real]Absence check using 23 positive place invariants in 63 ms returned sat
[2023-03-17 20:41:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:41:53] [INFO ] [Real]Absence check using state equation in 1567 ms returned sat
[2023-03-17 20:41:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:41:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 94 ms returned sat
[2023-03-17 20:41:54] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:41:56] [INFO ] [Nat]Absence check using state equation in 1760 ms returned sat
[2023-03-17 20:41:56] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:41:57] [INFO ] [Nat]Added 497 Read/Feed constraints in 1065 ms returned sat
[2023-03-17 20:41:59] [INFO ] Deduced a trap composed of 13 places in 1734 ms of which 13 ms to minimize.
[2023-03-17 20:41:59] [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.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-17 20:42:00] [INFO ] [Real]Absence check using 23 positive place invariants in 56 ms returned sat
[2023-03-17 20:42:00] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:02] [INFO ] [Real]Absence check using state equation in 1463 ms returned sat
[2023-03-17 20:42:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:42:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 59 ms returned sat
[2023-03-17 20:42:02] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:42:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:04] [INFO ] [Nat]Absence check using state equation in 1401 ms returned sat
[2023-03-17 20:42:05] [INFO ] [Nat]Added 497 Read/Feed constraints in 971 ms returned sat
[2023-03-17 20:42:06] [INFO ] Deduced a trap composed of 13 places in 1624 ms of which 14 ms to minimize.
[2023-03-17 20:42:08] [INFO ] Deduced a trap composed of 13 places in 1596 ms of which 2 ms to minimize.
[2023-03-17 20:42:08] [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-17 20:42:09] [INFO ] [Real]Absence check using 23 positive place invariants in 92 ms returned unsat
[2023-03-17 20:42:09] [INFO ] [Real]Absence check using 23 positive place invariants in 91 ms returned sat
[2023-03-17 20:42:09] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:11] [INFO ] [Real]Absence check using state equation in 1838 ms returned sat
[2023-03-17 20:42:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:42:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 61 ms returned sat
[2023-03-17 20:42:12] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:13] [INFO ] [Nat]Absence check using state equation in 1468 ms returned sat
[2023-03-17 20:42:14] [INFO ] [Nat]Added 497 Read/Feed constraints in 785 ms returned sat
[2023-03-17 20:42:16] [INFO ] Deduced a trap composed of 13 places in 1800 ms of which 2 ms to minimize.
[2023-03-17 20:42:18] [INFO ] Deduced a trap composed of 13 places in 1704 ms of which 3 ms to minimize.
[2023-03-17 20:42:18] [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-17 20:42:18] [INFO ] [Real]Absence check using 23 positive place invariants in 58 ms returned unsat
[2023-03-17 20:42:19] [INFO ] [Real]Absence check using 23 positive place invariants in 59 ms returned unsat
[2023-03-17 20:42:19] [INFO ] [Real]Absence check using 23 positive place invariants in 56 ms returned sat
[2023-03-17 20:42:19] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:21] [INFO ] [Real]Absence check using state equation in 1434 ms returned sat
[2023-03-17 20:42:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:42:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 93 ms returned sat
[2023-03-17 20:42:22] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-17 20:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:23] [INFO ] [Nat]Absence check using state equation in 1477 ms returned sat
[2023-03-17 20:42:23] [INFO ] [Nat]Added 497 Read/Feed constraints in 131 ms returned sat
[2023-03-17 20:42:24] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 366 ms.
[2023-03-17 20:42:28] [INFO ] Deduced a trap composed of 2 places in 2356 ms of which 3 ms to minimize.
[2023-03-17 20:42:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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-17 20:42:29] [INFO ] [Real]Absence check using 23 positive place invariants in 58 ms returned sat
[2023-03-17 20:42:29] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:31] [INFO ] [Real]Absence check using state equation in 1665 ms returned sat
[2023-03-17 20:42:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:42:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 89 ms returned sat
[2023-03-17 20:42:31] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:42:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:33] [INFO ] [Nat]Absence check using state equation in 1649 ms returned sat
[2023-03-17 20:42:33] [INFO ] [Nat]Added 497 Read/Feed constraints in 266 ms returned sat
[2023-03-17 20:42:34] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 315 ms.
[2023-03-17 20:42:36] [INFO ] Added : 21 causal constraints over 5 iterations in 1973 ms. Result :sat
Minimization took 183 ms.
[2023-03-17 20:42:36] [INFO ] [Real]Absence check using 23 positive place invariants in 58 ms returned sat
[2023-03-17 20:42:36] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:38] [INFO ] [Real]Absence check using state equation in 1363 ms returned sat
[2023-03-17 20:42:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:42:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 59 ms returned sat
[2023-03-17 20:42:39] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:42:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:42:40] [INFO ] [Nat]Absence check using state equation in 1449 ms returned sat
[2023-03-17 20:42:40] [INFO ] [Nat]Added 497 Read/Feed constraints in 114 ms returned sat
[2023-03-17 20:42:41] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 322 ms.
[2023-03-17 20:42:46] [INFO ] Deduced a trap composed of 2 places in 2490 ms of which 2 ms to minimize.
[2023-03-17 20:42:46] [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 8
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) : [8, 56, 8, 56, 8, 8, 1, 1, 1] Max seen :[1, 7, 8, 7, 8, 8, 0, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 67 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 884 transitions
Trivial Post-agglo rules discarded 884 transitions
Performed 884 trivial Post agglomeration. Transition count delta: 884
Iterating post reduction 0 with 884 rules applied. Total rules applied 884 place count 1992 transition count 2212
Reduce places removed 884 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 885 rules applied. Total rules applied 1769 place count 1108 transition count 2211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1770 place count 1107 transition count 2211
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 1770 place count 1107 transition count 1813
Deduced a syphon composed of 398 places in 2 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 2566 place count 709 transition count 1813
Applied a total of 2566 rules in 619 ms. Remains 709 /1992 variables (removed 1283) and now considering 1813/3096 (removed 1283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 620 ms. Remains : 709/1992 places, 1813/3096 transitions.
Normalized transition count is 1477 out of 1813 initially.
// Phase 1: matrix 1477 rows 709 cols
[2023-03-17 20:42:46] [INFO ] Computed 31 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5957 ms. (steps per millisecond=167 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1353 ms. (steps per millisecond=739 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1895 ms. (steps per millisecond=527 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1236 ms. (steps per millisecond=809 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1212 ms. (steps per millisecond=825 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 6) seen :7
[2023-03-17 20:43:01] [INFO ] Flow matrix only has 1477 transitions (discarded 336 similar events)
// Phase 1: matrix 1477 rows 709 cols
[2023-03-17 20:43:01] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-17 20:43:01] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-17 20:43:01] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:02] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2023-03-17 20:43:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:43:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-17 20:43:02] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:03] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2023-03-17 20:43:03] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:43:03] [INFO ] [Nat]Added 497 Read/Feed constraints in 178 ms returned sat
[2023-03-17 20:43:04] [INFO ] Deduced a trap composed of 15 places in 709 ms of which 2 ms to minimize.
[2023-03-17 20:43:05] [INFO ] Deduced a trap composed of 28 places in 770 ms of which 2 ms to minimize.
[2023-03-17 20:43:05] [INFO ] Deduced a trap composed of 39 places in 648 ms of which 0 ms to minimize.
[2023-03-17 20:43:06] [INFO ] Deduced a trap composed of 26 places in 560 ms of which 1 ms to minimize.
[2023-03-17 20:43:07] [INFO ] Deduced a trap composed of 35 places in 662 ms of which 1 ms to minimize.
[2023-03-17 20:43:08] [INFO ] Deduced a trap composed of 34 places in 787 ms of which 1 ms to minimize.
[2023-03-17 20:43:09] [INFO ] Deduced a trap composed of 13 places in 749 ms of which 1 ms to minimize.
[2023-03-17 20:43:10] [INFO ] Deduced a trap composed of 50 places in 637 ms of which 1 ms to minimize.
[2023-03-17 20:43:10] [INFO ] Deduced a trap composed of 35 places in 657 ms of which 2 ms to minimize.
[2023-03-17 20:43:11] [INFO ] Deduced a trap composed of 14 places in 727 ms of which 2 ms to minimize.
[2023-03-17 20:43:12] [INFO ] Deduced a trap composed of 14 places in 749 ms of which 1 ms to minimize.
[2023-03-17 20:43:13] [INFO ] Deduced a trap composed of 24 places in 761 ms of which 1 ms to minimize.
[2023-03-17 20:43:14] [INFO ] Deduced a trap composed of 46 places in 698 ms of which 1 ms to minimize.
[2023-03-17 20:43:14] [INFO ] Deduced a trap composed of 27 places in 681 ms of which 1 ms to minimize.
[2023-03-17 20:43:15] [INFO ] Deduced a trap composed of 23 places in 680 ms of which 2 ms to minimize.
[2023-03-17 20:43:16] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 1 ms to minimize.
[2023-03-17 20:43:17] [INFO ] Deduced a trap composed of 13 places in 549 ms of which 1 ms to minimize.
[2023-03-17 20:43:17] [INFO ] Deduced a trap composed of 57 places in 398 ms of which 0 ms to minimize.
[2023-03-17 20:43:18] [INFO ] Deduced a trap composed of 58 places in 562 ms of which 1 ms to minimize.
[2023-03-17 20:43:18] [INFO ] Deduced a trap composed of 79 places in 444 ms of which 1 ms to minimize.
[2023-03-17 20:43:19] [INFO ] Deduced a trap composed of 26 places in 748 ms of which 2 ms to minimize.
[2023-03-17 20:43:20] [INFO ] Deduced a trap composed of 25 places in 763 ms of which 1 ms to minimize.
[2023-03-17 20:43:23] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 19932 ms
[2023-03-17 20:43:23] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-17 20:43:23] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:24] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2023-03-17 20:43:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:43:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 38 ms returned sat
[2023-03-17 20:43:24] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:25] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2023-03-17 20:43:25] [INFO ] [Nat]Added 497 Read/Feed constraints in 144 ms returned sat
[2023-03-17 20:43:26] [INFO ] Deduced a trap composed of 12 places in 653 ms of which 1 ms to minimize.
[2023-03-17 20:43:27] [INFO ] Deduced a trap composed of 13 places in 803 ms of which 1 ms to minimize.
[2023-03-17 20:43:27] [INFO ] Deduced a trap composed of 14 places in 763 ms of which 1 ms to minimize.
[2023-03-17 20:43:28] [INFO ] Deduced a trap composed of 17 places in 826 ms of which 1 ms to minimize.
[2023-03-17 20:43:29] [INFO ] Deduced a trap composed of 13 places in 823 ms of which 2 ms to minimize.
[2023-03-17 20:43:30] [INFO ] Deduced a trap composed of 13 places in 788 ms of which 5 ms to minimize.
[2023-03-17 20:43:31] [INFO ] Deduced a trap composed of 15 places in 879 ms of which 1 ms to minimize.
[2023-03-17 20:43:32] [INFO ] Deduced a trap composed of 12 places in 771 ms of which 1 ms to minimize.
[2023-03-17 20:43:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 6914 ms
[2023-03-17 20:43:32] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-17 20:43:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:33] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2023-03-17 20:43:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:43:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2023-03-17 20:43:33] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:43:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:34] [INFO ] [Nat]Absence check using state equation in 731 ms returned sat
[2023-03-17 20:43:34] [INFO ] [Nat]Added 497 Read/Feed constraints in 205 ms returned sat
[2023-03-17 20:43:35] [INFO ] Deduced a trap composed of 12 places in 830 ms of which 2 ms to minimize.
[2023-03-17 20:43:36] [INFO ] Deduced a trap composed of 13 places in 861 ms of which 1 ms to minimize.
[2023-03-17 20:43:37] [INFO ] Deduced a trap composed of 14 places in 844 ms of which 2 ms to minimize.
[2023-03-17 20:43:38] [INFO ] Deduced a trap composed of 17 places in 822 ms of which 1 ms to minimize.
[2023-03-17 20:43:39] [INFO ] Deduced a trap composed of 13 places in 812 ms of which 1 ms to minimize.
[2023-03-17 20:43:40] [INFO ] Deduced a trap composed of 13 places in 785 ms of which 1 ms to minimize.
[2023-03-17 20:43:41] [INFO ] Deduced a trap composed of 15 places in 743 ms of which 1 ms to minimize.
[2023-03-17 20:43:42] [INFO ] Deduced a trap composed of 12 places in 864 ms of which 2 ms to minimize.
[2023-03-17 20:43:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 7216 ms
[2023-03-17 20:43:42] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2023-03-17 20:43:42] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:43:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:43] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2023-03-17 20:43:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:43:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-17 20:43:43] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:43:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:43] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2023-03-17 20:43:44] [INFO ] [Nat]Added 497 Read/Feed constraints in 85 ms returned sat
[2023-03-17 20:43:44] [INFO ] Computed and/alt/rep : 1357/4557/1357 causal constraints (skipped 112 transitions) in 156 ms.
[2023-03-17 20:43:47] [INFO ] Deduced a trap composed of 24 places in 710 ms of which 2 ms to minimize.
[2023-03-17 20:43:48] [INFO ] Deduced a trap composed of 15 places in 599 ms of which 1 ms to minimize.
[2023-03-17 20:43:48] [INFO ] Deduced a trap composed of 13 places in 711 ms of which 1 ms to minimize.
[2023-03-17 20:43:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2614 ms
[2023-03-17 20:43:49] [INFO ] Added : 88 causal constraints over 18 iterations in 5432 ms. Result :sat
Minimization took 487 ms.
[2023-03-17 20:43:50] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2023-03-17 20:43:50] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:51] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2023-03-17 20:43:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:43:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-17 20:43:51] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:52] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2023-03-17 20:43:52] [INFO ] [Nat]Added 497 Read/Feed constraints in 101 ms returned sat
[2023-03-17 20:43:52] [INFO ] Computed and/alt/rep : 1357/4557/1357 causal constraints (skipped 112 transitions) in 156 ms.
[2023-03-17 20:43:52] [INFO ] Added : 6 causal constraints over 2 iterations in 565 ms. Result :sat
Minimization took 246 ms.
[2023-03-17 20:43:53] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-17 20:43:53] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-17 20:43:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:54] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2023-03-17 20:43:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:43:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2023-03-17 20:43:54] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:43:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:43:55] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2023-03-17 20:43:55] [INFO ] [Nat]Added 497 Read/Feed constraints in 93 ms returned sat
[2023-03-17 20:43:55] [INFO ] Computed and/alt/rep : 1357/4557/1357 causal constraints (skipped 112 transitions) in 159 ms.
[2023-03-17 20:43:56] [INFO ] Added : 20 causal constraints over 4 iterations in 830 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : [8, 7, 7, 1, 1, 1] Max seen :[1, 7, 7, 0, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1813/1813 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 1 rules applied. Total rules applied 1 place count 709 transition count 1812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 708 transition count 1812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 2 place count 708 transition count 1763
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 100 place count 659 transition count 1763
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 212 place count 603 transition count 1707
Applied a total of 212 rules in 143 ms. Remains 603 /709 variables (removed 106) and now considering 1707/1813 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 603/709 places, 1707/1813 transitions.
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 603 cols
[2023-03-17 20:43:57] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3336 ms. (steps per millisecond=299 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 901 ms. (steps per millisecond=1109 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 763 ms. (steps per millisecond=1310 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 3) seen :1
[2023-03-17 20:44:03] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 603 cols
[2023-03-17 20:44:03] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-17 20:44:03] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-17 20:44:03] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:44:04] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2023-03-17 20:44:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:44:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-17 20:44:04] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:44:04] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2023-03-17 20:44:04] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:44:05] [INFO ] [Nat]Added 497 Read/Feed constraints in 161 ms returned sat
[2023-03-17 20:44:05] [INFO ] Deduced a trap composed of 15 places in 477 ms of which 1 ms to minimize.
[2023-03-17 20:44:06] [INFO ] Deduced a trap composed of 24 places in 657 ms of which 2 ms to minimize.
[2023-03-17 20:44:06] [INFO ] Deduced a trap composed of 24 places in 529 ms of which 1 ms to minimize.
[2023-03-17 20:44:07] [INFO ] Deduced a trap composed of 24 places in 540 ms of which 1 ms to minimize.
[2023-03-17 20:44:08] [INFO ] Deduced a trap composed of 14 places in 571 ms of which 1 ms to minimize.
[2023-03-17 20:44:08] [INFO ] Deduced a trap composed of 13 places in 676 ms of which 1 ms to minimize.
[2023-03-17 20:44:09] [INFO ] Deduced a trap composed of 14 places in 629 ms of which 2 ms to minimize.
[2023-03-17 20:44:10] [INFO ] Deduced a trap composed of 22 places in 539 ms of which 4 ms to minimize.
[2023-03-17 20:44:11] [INFO ] Deduced a trap composed of 41 places in 641 ms of which 2 ms to minimize.
[2023-03-17 20:44:11] [INFO ] Deduced a trap composed of 56 places in 511 ms of which 1 ms to minimize.
[2023-03-17 20:44:12] [INFO ] Deduced a trap composed of 40 places in 621 ms of which 1 ms to minimize.
[2023-03-17 20:44:13] [INFO ] Deduced a trap composed of 23 places in 675 ms of which 1 ms to minimize.
[2023-03-17 20:44:13] [INFO ] Deduced a trap composed of 23 places in 613 ms of which 1 ms to minimize.
[2023-03-17 20:44:14] [INFO ] Deduced a trap composed of 24 places in 369 ms of which 1 ms to minimize.
[2023-03-17 20:44:15] [INFO ] Deduced a trap composed of 23 places in 563 ms of which 1 ms to minimize.
[2023-03-17 20:44:18] [INFO ] Deduced a trap composed of 11 places in 671 ms of which 1 ms to minimize.
[2023-03-17 20:44:19] [INFO ] Deduced a trap composed of 14 places in 672 ms of which 4 ms to minimize.
[2023-03-17 20:44:20] [INFO ] Deduced a trap composed of 23 places in 571 ms of which 1 ms to minimize.
[2023-03-17 20:44:21] [INFO ] Deduced a trap composed of 20 places in 644 ms of which 2 ms to minimize.
[2023-03-17 20:44:21] [INFO ] Deduced a trap composed of 32 places in 636 ms of which 3 ms to minimize.
[2023-03-17 20:44:22] [INFO ] Deduced a trap composed of 20 places in 609 ms of which 2 ms to minimize.
[2023-03-17 20:44:23] [INFO ] Deduced a trap composed of 50 places in 635 ms of which 20 ms to minimize.
[2023-03-17 20:44:24] [INFO ] Deduced a trap composed of 51 places in 626 ms of which 1 ms to minimize.
[2023-03-17 20:44:24] [INFO ] Deduced a trap composed of 51 places in 625 ms of which 1 ms to minimize.
[2023-03-17 20:44:25] [INFO ] Deduced a trap composed of 42 places in 581 ms of which 1 ms to minimize.
[2023-03-17 20:44:26] [INFO ] Deduced a trap composed of 33 places in 621 ms of which 3 ms to minimize.
[2023-03-17 20:44:27] [INFO ] Deduced a trap composed of 47 places in 604 ms of which 1 ms to minimize.
[2023-03-17 20:44:29] [INFO ] Deduced a trap composed of 47 places in 616 ms of which 2 ms to minimize.
[2023-03-17 20:44:30] [INFO ] Deduced a trap composed of 11 places in 649 ms of which 1 ms to minimize.
[2023-03-17 20:44:31] [INFO ] Deduced a trap composed of 29 places in 641 ms of which 1 ms to minimize.
[2023-03-17 20:44:32] [INFO ] Deduced a trap composed of 11 places in 655 ms of which 1 ms to minimize.
[2023-03-17 20:44:32] [INFO ] Deduced a trap composed of 48 places in 538 ms of which 1 ms to minimize.
[2023-03-17 20:44:33] [INFO ] Deduced a trap composed of 33 places in 567 ms of which 1 ms to minimize.
[2023-03-17 20:44:34] [INFO ] Deduced a trap composed of 29 places in 605 ms of which 1 ms to minimize.
[2023-03-17 20:44:37] [INFO ] Deduced a trap composed of 42 places in 444 ms of which 1 ms to minimize.
[2023-03-17 20:44:38] [INFO ] Deduced a trap composed of 33 places in 421 ms of which 1 ms to minimize.
[2023-03-17 20:44:38] [INFO ] Deduced a trap composed of 50 places in 397 ms of which 1 ms to minimize.
[2023-03-17 20:44:39] [INFO ] Deduced a trap composed of 41 places in 561 ms of which 1 ms to minimize.
[2023-03-17 20:44:40] [INFO ] Deduced a trap composed of 60 places in 553 ms of which 1 ms to minimize.
[2023-03-17 20:44:40] [INFO ] Deduced a trap composed of 67 places in 551 ms of which 1 ms to minimize.
[2023-03-17 20:44:41] [INFO ] Deduced a trap composed of 33 places in 602 ms of which 1 ms to minimize.
[2023-03-17 20:44:42] [INFO ] Deduced a trap composed of 51 places in 595 ms of which 1 ms to minimize.
[2023-03-17 20:44:43] [INFO ] Deduced a trap composed of 60 places in 590 ms of which 1 ms to minimize.
[2023-03-17 20:44:43] [INFO ] Deduced a trap composed of 32 places in 594 ms of which 1 ms to minimize.
[2023-03-17 20:44:45] [INFO ] Deduced a trap composed of 31 places in 530 ms of which 1 ms to minimize.
[2023-03-17 20:44:46] [INFO ] Deduced a trap composed of 21 places in 654 ms of which 1 ms to minimize.
[2023-03-17 20:44:48] [INFO ] Deduced a trap composed of 29 places in 531 ms of which 2 ms to minimize.
[2023-03-17 20:44:49] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 44063 ms
[2023-03-17 20:44:49] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2023-03-17 20:44:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-17 20:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:44:49] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-17 20:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:44:50] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-17 20:44:50] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:44:50] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-17 20:44:50] [INFO ] [Nat]Added 497 Read/Feed constraints in 109 ms returned sat
[2023-03-17 20:44:50] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 107 ms.
[2023-03-17 20:44:53] [INFO ] Deduced a trap composed of 14 places in 699 ms of which 4 ms to minimize.
[2023-03-17 20:44:54] [INFO ] Deduced a trap composed of 15 places in 698 ms of which 1 ms to minimize.
[2023-03-17 20:44:55] [INFO ] Deduced a trap composed of 12 places in 705 ms of which 2 ms to minimize.
[2023-03-17 20:44:56] [INFO ] Deduced a trap composed of 30 places in 645 ms of which 1 ms to minimize.
[2023-03-17 20:44:57] [INFO ] Deduced a trap composed of 48 places in 644 ms of which 1 ms to minimize.
[2023-03-17 20:44:57] [INFO ] Deduced a trap composed of 39 places in 578 ms of which 0 ms to minimize.
[2023-03-17 20:44:58] [INFO ] Deduced a trap composed of 24 places in 528 ms of which 1 ms to minimize.
[2023-03-17 20:44:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5461 ms
[2023-03-17 20:44:59] [INFO ] Added : 105 causal constraints over 22 iterations in 8514 ms. Result :sat
Minimization took 520 ms.
[2023-03-17 20:44:59] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-17 20:44:59] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:00] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2023-03-17 20:45:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:45:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-17 20:45:00] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:01] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2023-03-17 20:45:01] [INFO ] [Nat]Added 497 Read/Feed constraints in 138 ms returned sat
[2023-03-17 20:45:01] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 160 ms.
[2023-03-17 20:45:05] [INFO ] Deduced a trap composed of 15 places in 570 ms of which 1 ms to minimize.
[2023-03-17 20:45:05] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 0 ms to minimize.
[2023-03-17 20:45:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1249 ms
[2023-03-17 20:45:06] [INFO ] Added : 106 causal constraints over 23 iterations in 4577 ms. Result :sat
Minimization took 374 ms.
Current structural bounds on expressions (after SMT) : [8, 1, 1] Max seen :[1, 0, 0]
Support contains 10 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 1707/1707 transitions.
Applied a total of 0 rules in 101 ms. Remains 603 /603 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 603/603 places, 1707/1707 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 1707/1707 transitions.
Applied a total of 0 rules in 111 ms. Remains 603 /603 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
[2023-03-17 20:45:07] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
[2023-03-17 20:45:07] [INFO ] Invariant cache hit.
[2023-03-17 20:45:08] [INFO ] Implicit Places using invariants in 920 ms returned [587, 588, 589, 590, 591, 600, 601, 602]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 927 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 595/603 places, 1707/1707 transitions.
Applied a total of 0 rules in 54 ms. Remains 595 /595 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1093 ms. Remains : 595/603 places, 1707/1707 transitions.
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 595 cols
[2023-03-17 20:45:08] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2895 ms. (steps per millisecond=345 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 764 ms. (steps per millisecond=1308 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties (out of 3) seen :1
[2023-03-17 20:45:14] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-17 20:45:14] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-17 20:45:14] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-17 20:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:14] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-17 20:45:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:45:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-17 20:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:15] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2023-03-17 20:45:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:45:15] [INFO ] [Nat]Added 497 Read/Feed constraints in 295 ms returned sat
[2023-03-17 20:45:16] [INFO ] Deduced a trap composed of 15 places in 633 ms of which 1 ms to minimize.
[2023-03-17 20:45:17] [INFO ] Deduced a trap composed of 15 places in 663 ms of which 1 ms to minimize.
[2023-03-17 20:45:17] [INFO ] Deduced a trap composed of 39 places in 588 ms of which 1 ms to minimize.
[2023-03-17 20:45:18] [INFO ] Deduced a trap composed of 84 places in 613 ms of which 1 ms to minimize.
[2023-03-17 20:45:19] [INFO ] Deduced a trap composed of 14 places in 692 ms of which 1 ms to minimize.
[2023-03-17 20:45:20] [INFO ] Deduced a trap composed of 38 places in 485 ms of which 1 ms to minimize.
[2023-03-17 20:45:20] [INFO ] Deduced a trap composed of 47 places in 537 ms of which 1 ms to minimize.
[2023-03-17 20:45:21] [INFO ] Deduced a trap composed of 41 places in 517 ms of which 0 ms to minimize.
[2023-03-17 20:45:21] [INFO ] Deduced a trap composed of 29 places in 406 ms of which 1 ms to minimize.
[2023-03-17 20:45:22] [INFO ] Deduced a trap composed of 24 places in 399 ms of which 1 ms to minimize.
[2023-03-17 20:45:22] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 1 ms to minimize.
[2023-03-17 20:45:23] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 1 ms to minimize.
[2023-03-17 20:45:23] [INFO ] Deduced a trap composed of 20 places in 675 ms of which 2 ms to minimize.
[2023-03-17 20:45:25] [INFO ] Deduced a trap composed of 42 places in 585 ms of which 2 ms to minimize.
[2023-03-17 20:45:25] [INFO ] Deduced a trap composed of 42 places in 531 ms of which 1 ms to minimize.
[2023-03-17 20:45:26] [INFO ] Deduced a trap composed of 11 places in 537 ms of which 0 ms to minimize.
[2023-03-17 20:45:26] [INFO ] Deduced a trap composed of 33 places in 384 ms of which 0 ms to minimize.
[2023-03-17 20:45:27] [INFO ] Deduced a trap composed of 29 places in 655 ms of which 1 ms to minimize.
[2023-03-17 20:45:30] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 14737 ms
[2023-03-17 20:45:30] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2023-03-17 20:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:31] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2023-03-17 20:45:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:45:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-17 20:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:31] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2023-03-17 20:45:32] [INFO ] [Nat]Added 497 Read/Feed constraints in 99 ms returned sat
[2023-03-17 20:45:32] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 140 ms.
[2023-03-17 20:45:35] [INFO ] Deduced a trap composed of 11 places in 488 ms of which 1 ms to minimize.
[2023-03-17 20:45:35] [INFO ] Deduced a trap composed of 15 places in 567 ms of which 1 ms to minimize.
[2023-03-17 20:45:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1317 ms
[2023-03-17 20:45:36] [INFO ] Added : 119 causal constraints over 24 iterations in 4085 ms. Result :sat
Minimization took 420 ms.
[2023-03-17 20:45:36] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2023-03-17 20:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:37] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2023-03-17 20:45:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:45:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-17 20:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:37] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-17 20:45:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 66 ms returned sat
[2023-03-17 20:45:38] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 138 ms.
[2023-03-17 20:45:40] [INFO ] Deduced a trap composed of 14 places in 661 ms of which 1 ms to minimize.
[2023-03-17 20:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 833 ms
[2023-03-17 20:45:41] [INFO ] Added : 103 causal constraints over 22 iterations in 3257 ms. Result :sat
Minimization took 319 ms.
Current structural bounds on expressions (after SMT) : [8, 1, 1] Max seen :[1, 0, 0]
Support contains 10 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1707/1707 transitions.
Applied a total of 0 rules in 46 ms. Remains 595 /595 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 595/595 places, 1707/1707 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1707/1707 transitions.
Applied a total of 0 rules in 45 ms. Remains 595 /595 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
[2023-03-17 20:45:42] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
[2023-03-17 20:45:42] [INFO ] Invariant cache hit.
[2023-03-17 20:45:42] [INFO ] Implicit Places using invariants in 763 ms returned []
[2023-03-17 20:45:42] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
[2023-03-17 20:45:42] [INFO ] Invariant cache hit.
[2023-03-17 20:45:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:45:48] [INFO ] Implicit Places using invariants and state equation in 5792 ms returned []
Implicit Place search using SMT with State Equation took 6567 ms to find 0 implicit places.
[2023-03-17 20:45:48] [INFO ] Redundant transitions in 249 ms returned []
[2023-03-17 20:45:48] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
[2023-03-17 20:45:48] [INFO ] Invariant cache hit.
[2023-03-17 20:45:50] [INFO ] Dead Transitions using invariants and state equation in 1501 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8372 ms. Remains : 595/595 places, 1707/1707 transitions.
Starting property specific reduction for Peterson-PT-7-UpperBounds-00
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 595 cols
[2023-03-17 20:45:50] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
[2023-03-17 20:45:50] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-17 20:45:50] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-17 20:45:50] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-17 20:45:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:51] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2023-03-17 20:45:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:45:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2023-03-17 20:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:45:51] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2023-03-17 20:45:51] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:45:52] [INFO ] [Nat]Added 497 Read/Feed constraints in 279 ms returned sat
[2023-03-17 20:45:52] [INFO ] Deduced a trap composed of 15 places in 387 ms of which 1 ms to minimize.
[2023-03-17 20:45:53] [INFO ] Deduced a trap composed of 15 places in 678 ms of which 1 ms to minimize.
[2023-03-17 20:45:53] [INFO ] Deduced a trap composed of 39 places in 475 ms of which 0 ms to minimize.
[2023-03-17 20:45:54] [INFO ] Deduced a trap composed of 84 places in 533 ms of which 1 ms to minimize.
[2023-03-17 20:45:54] [INFO ] Deduced a trap composed of 14 places in 360 ms of which 0 ms to minimize.
[2023-03-17 20:45:55] [INFO ] Deduced a trap composed of 38 places in 587 ms of which 1 ms to minimize.
[2023-03-17 20:45:56] [INFO ] Deduced a trap composed of 47 places in 536 ms of which 1 ms to minimize.
[2023-03-17 20:45:56] [INFO ] Deduced a trap composed of 2 places in 494 ms of which 1 ms to minimize.
[2023-03-17 20:45:56] [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.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: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) : [8] Max seen :[1]
Support contains 8 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1707/1707 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 1 rules applied. Total rules applied 1 place count 595 transition count 1706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 594 transition count 1706
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 594 transition count 1704
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 592 transition count 1704
Applied a total of 6 rules in 43 ms. Remains 592 /595 variables (removed 3) and now considering 1704/1707 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 592/595 places, 1704/1707 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2023-03-17 20:45:56] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3179 ms. (steps per millisecond=314 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 1) seen :1
[2023-03-17 20:46:00] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-17 20:46:00] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-17 20:46:01] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-17 20:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:46:01] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-03-17 20:46:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:46:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-17 20:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:46:02] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2023-03-17 20:46:02] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:46:02] [INFO ] [Nat]Added 497 Read/Feed constraints in 167 ms returned sat
[2023-03-17 20:46:03] [INFO ] Deduced a trap composed of 29 places in 546 ms of which 1 ms to minimize.
[2023-03-17 20:46:03] [INFO ] Deduced a trap composed of 20 places in 532 ms of which 1 ms to minimize.
[2023-03-17 20:46:04] [INFO ] Deduced a trap composed of 47 places in 519 ms of which 1 ms to minimize.
[2023-03-17 20:46:04] [INFO ] Deduced a trap composed of 20 places in 524 ms of which 1 ms to minimize.
[2023-03-17 20:46:05] [INFO ] Deduced a trap composed of 16 places in 470 ms of which 1 ms to minimize.
[2023-03-17 20:46:06] [INFO ] Deduced a trap composed of 38 places in 378 ms of which 0 ms to minimize.
[2023-03-17 20:46:06] [INFO ] Deduced a trap composed of 11 places in 459 ms of which 1 ms to minimize.
[2023-03-17 20:46:07] [INFO ] Deduced a trap composed of 12 places in 515 ms of which 1 ms to minimize.
[2023-03-17 20:46:07] [INFO ] Deduced a trap composed of 56 places in 624 ms of which 1 ms to minimize.
[2023-03-17 20:46:08] [INFO ] Deduced a trap composed of 29 places in 511 ms of which 3 ms to minimize.
[2023-03-17 20:46:09] [INFO ] Deduced a trap composed of 81 places in 537 ms of which 2 ms to minimize.
[2023-03-17 20:46:09] [INFO ] Deduced a trap composed of 81 places in 601 ms of which 1 ms to minimize.
[2023-03-17 20:46:10] [INFO ] Deduced a trap composed of 38 places in 548 ms of which 1 ms to minimize.
[2023-03-17 20:46:10] [INFO ] Deduced a trap composed of 81 places in 397 ms of which 1 ms to minimize.
[2023-03-17 20:46:11] [INFO ] Deduced a trap composed of 38 places in 395 ms of which 1 ms to minimize.
[2023-03-17 20:46:11] [INFO ] Deduced a trap composed of 56 places in 385 ms of which 1 ms to minimize.
[2023-03-17 20:46:12] [INFO ] Deduced a trap composed of 21 places in 514 ms of which 1 ms to minimize.
[2023-03-17 20:46:15] [INFO ] Deduced a trap composed of 57 places in 348 ms of which 0 ms to minimize.
[2023-03-17 20:46:15] [INFO ] Deduced a trap composed of 39 places in 513 ms of which 1 ms to minimize.
[2023-03-17 20:46:17] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 0 ms to minimize.
[2023-03-17 20:46:17] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 0 ms to minimize.
[2023-03-17 20:46:18] [INFO ] Deduced a trap composed of 56 places in 380 ms of which 1 ms to minimize.
[2023-03-17 20:46:18] [INFO ] Deduced a trap composed of 52 places in 512 ms of which 1 ms to minimize.
[2023-03-17 20:46:19] [INFO ] Deduced a trap composed of 61 places in 506 ms of which 1 ms to minimize.
[2023-03-17 20:46:19] [INFO ] Deduced a trap composed of 70 places in 503 ms of which 1 ms to minimize.
[2023-03-17 20:46:20] [INFO ] Deduced a trap composed of 43 places in 514 ms of which 1 ms to minimize.
[2023-03-17 20:46:23] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 20691 ms
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 32 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 31 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-17 20:46:23] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-17 20:46:23] [INFO ] Invariant cache hit.
[2023-03-17 20:46:24] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2023-03-17 20:46:24] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-17 20:46:24] [INFO ] Invariant cache hit.
[2023-03-17 20:46:25] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:46:30] [INFO ] Implicit Places using invariants and state equation in 6210 ms returned []
Implicit Place search using SMT with State Equation took 7390 ms to find 0 implicit places.
[2023-03-17 20:46:30] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-17 20:46:30] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-17 20:46:30] [INFO ] Invariant cache hit.
[2023-03-17 20:46:31] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8694 ms. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-00 in 41500 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-09
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 595 cols
[2023-03-17 20:46:32] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-17 20:46:32] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-17 20:46:32] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-17 20:46:32] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-17 20:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:46:32] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2023-03-17 20:46:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:46:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-17 20:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:46:33] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2023-03-17 20:46:33] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:46:33] [INFO ] [Nat]Added 497 Read/Feed constraints in 146 ms returned sat
[2023-03-17 20:46:34] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 148 ms.
[2023-03-17 20:46:37] [INFO ] Deduced a trap composed of 11 places in 602 ms of which 2 ms to minimize.
[2023-03-17 20:46:37] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 679 ms
[2023-03-17 20:46:38] [INFO ] Deduced a trap composed of 2 places in 827 ms of which 2 ms to minimize.
[2023-03-17 20:46:38] [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 595 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1706/1706 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 594 transition count 1704
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 593 transition count 1702
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 592 transition count 1700
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 591 transition count 1698
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 4 place count 591 transition count 1689
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 22 place count 582 transition count 1689
Applied a total of 22 rules in 88 ms. Remains 582 /595 variables (removed 13) and now considering 1689/1706 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 582/595 places, 1689/1706 transitions.
Normalized transition count is 1353 out of 1689 initially.
// Phase 1: matrix 1353 rows 582 cols
[2023-03-17 20:46:38] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2896 ms. (steps per millisecond=345 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties (out of 1) seen :0
[2023-03-17 20:46:42] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
// Phase 1: matrix 1353 rows 582 cols
[2023-03-17 20:46:42] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-17 20:46:42] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-17 20:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:46:43] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2023-03-17 20:46:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:46:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-17 20:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:46:44] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2023-03-17 20:46:44] [INFO ] State equation strengthened by 493 read => feed constraints.
[2023-03-17 20:46:44] [INFO ] [Nat]Added 493 Read/Feed constraints in 53 ms returned sat
[2023-03-17 20:46:44] [INFO ] Computed and/alt/rep : 1233/4757/1233 causal constraints (skipped 112 transitions) in 98 ms.
[2023-03-17 20:46:48] [INFO ] Deduced a trap composed of 38 places in 680 ms of which 2 ms to minimize.
[2023-03-17 20:46:48] [INFO ] Deduced a trap composed of 56 places in 676 ms of which 1 ms to minimize.
[2023-03-17 20:46:49] [INFO ] Deduced a trap composed of 20 places in 654 ms of which 1 ms to minimize.
[2023-03-17 20:46:50] [INFO ] Deduced a trap composed of 20 places in 628 ms of which 1 ms to minimize.
[2023-03-17 20:46:51] [INFO ] Deduced a trap composed of 11 places in 641 ms of which 1 ms to minimize.
[2023-03-17 20:46:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4015 ms
[2023-03-17 20:46:52] [INFO ] Added : 120 causal constraints over 26 iterations in 7578 ms. Result :sat
Minimization took 470 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1689/1689 transitions.
Applied a total of 0 rules in 48 ms. Remains 582 /582 variables (removed 0) and now considering 1689/1689 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 582/582 places, 1689/1689 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1689/1689 transitions.
Applied a total of 0 rules in 46 ms. Remains 582 /582 variables (removed 0) and now considering 1689/1689 (removed 0) transitions.
[2023-03-17 20:46:53] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
[2023-03-17 20:46:53] [INFO ] Invariant cache hit.
[2023-03-17 20:46:54] [INFO ] Implicit Places using invariants in 971 ms returned []
[2023-03-17 20:46:54] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
[2023-03-17 20:46:54] [INFO ] Invariant cache hit.
[2023-03-17 20:46:54] [INFO ] State equation strengthened by 493 read => feed constraints.
[2023-03-17 20:46:58] [INFO ] Implicit Places using invariants and state equation in 4719 ms returned []
Implicit Place search using SMT with State Equation took 5693 ms to find 0 implicit places.
[2023-03-17 20:46:58] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-17 20:46:58] [INFO ] Flow matrix only has 1353 transitions (discarded 336 similar events)
[2023-03-17 20:46:58] [INFO ] Invariant cache hit.
[2023-03-17 20:47:00] [INFO ] Dead Transitions using invariants and state equation in 1767 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7568 ms. Remains : 582/582 places, 1689/1689 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-09 in 28561 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-11
Normalized transition count is 1371 out of 1707 initially.
// Phase 1: matrix 1371 rows 595 cols
[2023-03-17 20:47:00] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2023-03-17 20:47:00] [INFO ] Flow matrix only has 1371 transitions (discarded 336 similar events)
// Phase 1: matrix 1371 rows 595 cols
[2023-03-17 20:47:00] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-17 20:47:00] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-17 20:47:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:47:01] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2023-03-17 20:47:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:47:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-17 20:47:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:47:02] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2023-03-17 20:47:02] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:47:02] [INFO ] [Nat]Added 497 Read/Feed constraints in 107 ms returned sat
[2023-03-17 20:47:02] [INFO ] Computed and/alt/rep : 1251/4787/1251 causal constraints (skipped 112 transitions) in 166 ms.
[2023-03-17 20:47:06] [INFO ] Deduced a trap composed of 14 places in 683 ms of which 1 ms to minimize.
[2023-03-17 20:47:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 906 ms
[2023-03-17 20:47:07] [INFO ] Deduced a trap composed of 2 places in 757 ms of which 2 ms to minimize.
[2023-03-17 20:47:07] [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 595 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1705/1705 transitions.
Reduce places removed 1 places and 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 2 rules applied. Total rules applied 2 place count 594 transition count 1702
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 592 transition count 1700
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 4 place count 592 transition count 1691
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 22 place count 583 transition count 1691
Applied a total of 22 rules in 73 ms. Remains 583 /595 variables (removed 12) and now considering 1691/1705 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 583/595 places, 1691/1705 transitions.
Normalized transition count is 1355 out of 1691 initially.
// Phase 1: matrix 1355 rows 583 cols
[2023-03-17 20:47:07] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3160 ms. (steps per millisecond=316 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1073 ms. (steps per millisecond=931 ) properties (out of 1) seen :0
[2023-03-17 20:47:11] [INFO ] Flow matrix only has 1355 transitions (discarded 336 similar events)
// Phase 1: matrix 1355 rows 583 cols
[2023-03-17 20:47:11] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-17 20:47:11] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-17 20:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:47:12] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-17 20:47:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:47:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-17 20:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:47:13] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2023-03-17 20:47:13] [INFO ] State equation strengthened by 494 read => feed constraints.
[2023-03-17 20:47:13] [INFO ] [Nat]Added 494 Read/Feed constraints in 147 ms returned sat
[2023-03-17 20:47:13] [INFO ] Computed and/alt/rep : 1235/4760/1235 causal constraints (skipped 112 transitions) in 162 ms.
[2023-03-17 20:47:17] [INFO ] Deduced a trap composed of 11 places in 714 ms of which 1 ms to minimize.
[2023-03-17 20:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 936 ms
[2023-03-17 20:47:17] [INFO ] Added : 109 causal constraints over 23 iterations in 4363 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1691/1691 transitions.
Applied a total of 0 rules in 50 ms. Remains 583 /583 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 583/583 places, 1691/1691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1691/1691 transitions.
Applied a total of 0 rules in 43 ms. Remains 583 /583 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
[2023-03-17 20:47:18] [INFO ] Flow matrix only has 1355 transitions (discarded 336 similar events)
[2023-03-17 20:47:18] [INFO ] Invariant cache hit.
[2023-03-17 20:47:19] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2023-03-17 20:47:19] [INFO ] Flow matrix only has 1355 transitions (discarded 336 similar events)
[2023-03-17 20:47:19] [INFO ] Invariant cache hit.
[2023-03-17 20:47:20] [INFO ] State equation strengthened by 494 read => feed constraints.
[2023-03-17 20:47:25] [INFO ] Implicit Places using invariants and state equation in 6061 ms returned []
Implicit Place search using SMT with State Equation took 7084 ms to find 0 implicit places.
[2023-03-17 20:47:25] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-17 20:47:25] [INFO ] Flow matrix only has 1355 transitions (discarded 336 similar events)
[2023-03-17 20:47:25] [INFO ] Invariant cache hit.
[2023-03-17 20:47:27] [INFO ] Dead Transitions using invariants and state equation in 1795 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8991 ms. Remains : 583/583 places, 1691/1691 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-11 in 26599 ms.
[2023-03-17 20:47:27] [INFO ] Flatten gal took : 328 ms
[2023-03-17 20:47:27] [INFO ] Applying decomposition
[2023-03-17 20:47:28] [INFO ] Flatten gal took : 103 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3357972498798136881.txt' '-o' '/tmp/graph3357972498798136881.bin' '-w' '/tmp/graph3357972498798136881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3357972498798136881.bin' '-l' '-1' '-v' '-w' '/tmp/graph3357972498798136881.weights' '-q' '0' '-e' '0.001'
[2023-03-17 20:47:28] [INFO ] Decomposing Gal with order
[2023-03-17 20:47:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 20:47:28] [INFO ] Removed a total of 2500 redundant transitions.
[2023-03-17 20:47:28] [INFO ] Flatten gal took : 361 ms
[2023-03-17 20:47:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 890 labels/synchronizations in 136 ms.
[2023-03-17 20:47:29] [INFO ] Time to serialize gal into /tmp/UpperBounds11202543197479623976.gal : 49 ms
[2023-03-17 20:47:29] [INFO ] Time to serialize properties into /tmp/UpperBounds2715143670309739561.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11202543197479623976.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2715143670309739561.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds2715143670309739561.prop.
Detected timeout of ITS tools.
[2023-03-17 21:09:35] [INFO ] Applying decomposition
[2023-03-17 21:09:36] [INFO ] Flatten gal took : 1037 ms
[2023-03-17 21:09:36] [INFO ] Decomposing Gal with order
[2023-03-17 21:09:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 21:09:38] [INFO ] Removed a total of 2173 redundant transitions.
[2023-03-17 21:09:38] [INFO ] Flatten gal took : 1675 ms
[2023-03-17 21:09:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 956 labels/synchronizations in 258 ms.
[2023-03-17 21:09:39] [INFO ] Time to serialize gal into /tmp/UpperBounds2537625279295364860.gal : 72 ms
[2023-03-17 21:09:39] [INFO ] Time to serialize properties into /tmp/UpperBounds9513334385813057146.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2537625279295364860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9513334385813057146.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds9513334385813057146.prop.
Detected timeout of ITS tools.
[2023-03-17 21:31:38] [INFO ] Flatten gal took : 1009 ms
[2023-03-17 21:31:44] [INFO ] Input system was already deterministic with 1707 transitions.
[2023-03-17 21:31:44] [INFO ] Transformed 595 places.
[2023-03-17 21:31:46] [INFO ] Transformed 1707 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-17 21:31:46] [INFO ] Time to serialize gal into /tmp/UpperBounds12770766348634946562.gal : 40 ms
[2023-03-17 21:31:46] [INFO ] Time to serialize properties into /tmp/UpperBounds6241969512572912956.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12770766348634946562.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6241969512572912956.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6241969512572912956.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4493184 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16107376 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Peterson-PT-7, 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 r261-smll-167863536600645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 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 ;