fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r267-smll-167863542100637
Last Updated
May 14, 2023

About the Execution of Smart+red for Peterson-PT-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5847.220 3600000.00 3642486.00 10558.50 ? 6 7 7 7 6 6 7 1 1 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.r267-smll-167863542100637.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 smartxred
Input is Peterson-PT-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863542100637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 204K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 847K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 215K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 986K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 124K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 364K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 288K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 402K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 839K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 44K 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 877K 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-6-UpperBounds-00
FORMULA_NAME Peterson-PT-6-UpperBounds-01
FORMULA_NAME Peterson-PT-6-UpperBounds-02
FORMULA_NAME Peterson-PT-6-UpperBounds-03
FORMULA_NAME Peterson-PT-6-UpperBounds-04
FORMULA_NAME Peterson-PT-6-UpperBounds-05
FORMULA_NAME Peterson-PT-6-UpperBounds-06
FORMULA_NAME Peterson-PT-6-UpperBounds-07
FORMULA_NAME Peterson-PT-6-UpperBounds-08
FORMULA_NAME Peterson-PT-6-UpperBounds-09
FORMULA_NAME Peterson-PT-6-UpperBounds-10
FORMULA_NAME Peterson-PT-6-UpperBounds-11
FORMULA_NAME Peterson-PT-6-UpperBounds-12
FORMULA_NAME Peterson-PT-6-UpperBounds-13
FORMULA_NAME Peterson-PT-6-UpperBounds-14
FORMULA_NAME Peterson-PT-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678953470031

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 07:57:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 07:57:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 07:57:54] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2023-03-16 07:57:54] [INFO ] Transformed 1330 places.
[2023-03-16 07:57:54] [INFO ] Transformed 2030 transitions.
[2023-03-16 07:57:54] [INFO ] Found NUPN structural information;
[2023-03-16 07:57:54] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2023-03-16 07:57:54] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 519 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 28 ms.
FORMULA Peterson-PT-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1820 out of 2030 initially.
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-16 07:57:54] [INFO ] Computed 27 place invariants in 80 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 11) seen :28
FORMULA Peterson-PT-6-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :20
[2023-03-16 07:57:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-16 07:57:55] [INFO ] Computed 27 place invariants in 19 ms
[2023-03-16 07:57:55] [INFO ] [Real]Absence check using 20 positive place invariants in 46 ms returned sat
[2023-03-16 07:57:55] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-16 07:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:57:57] [INFO ] [Real]Absence check using state equation in 1252 ms returned sat
[2023-03-16 07:57:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:57:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 38 ms returned sat
[2023-03-16 07:57:58] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 07:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:57:58] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2023-03-16 07:57:58] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 07:57:59] [INFO ] [Nat]Added 330 Read/Feed constraints in 420 ms returned sat
[2023-03-16 07:58:00] [INFO ] Deduced a trap composed of 12 places in 965 ms of which 6 ms to minimize.
[2023-03-16 07:58:01] [INFO ] Deduced a trap composed of 178 places in 1054 ms of which 2 ms to minimize.
[2023-03-16 07:58:02] [INFO ] Deduced a trap composed of 47 places in 1224 ms of which 2 ms to minimize.
[2023-03-16 07:58:02] [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-16 07:58:03] [INFO ] [Real]Absence check using 20 positive place invariants in 54 ms returned sat
[2023-03-16 07:58:03] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 07:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:58:04] [INFO ] [Real]Absence check using state equation in 894 ms returned sat
[2023-03-16 07:58:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:58:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 45 ms returned sat
[2023-03-16 07:58:04] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 07:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:58:05] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2023-03-16 07:58:05] [INFO ] [Nat]Added 330 Read/Feed constraints in 183 ms returned sat
[2023-03-16 07:58:06] [INFO ] Deduced a trap composed of 24 places in 1064 ms of which 3 ms to minimize.
[2023-03-16 07:58:08] [INFO ] Deduced a trap composed of 24 places in 1381 ms of which 3 ms to minimize.
[2023-03-16 07:58:09] [INFO ] Deduced a trap composed of 23 places in 1076 ms of which 2 ms to minimize.
[2023-03-16 07:58:09] [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-16 07:58:09] [INFO ] [Real]Absence check using 20 positive place invariants in 38 ms returned unsat
[2023-03-16 07:58:09] [INFO ] [Real]Absence check using 20 positive place invariants in 42 ms returned unsat
[2023-03-16 07:58:10] [INFO ] [Real]Absence check using 20 positive place invariants in 40 ms returned unsat
[2023-03-16 07:58:10] [INFO ] [Real]Absence check using 20 positive place invariants in 61 ms returned sat
[2023-03-16 07:58:10] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 07:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:58:11] [INFO ] [Real]Absence check using state equation in 1091 ms returned sat
[2023-03-16 07:58:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:58:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 64 ms returned sat
[2023-03-16 07:58:12] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-16 07:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:58:13] [INFO ] [Nat]Absence check using state equation in 1168 ms returned sat
[2023-03-16 07:58:13] [INFO ] [Nat]Added 330 Read/Feed constraints in 122 ms returned sat
[2023-03-16 07:58:14] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 233 ms.
[2023-03-16 07:58:16] [INFO ] Added : 75 causal constraints over 15 iterations in 2885 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [294, 42, 7, 7, 7, 1] Max seen :[2, 6, 7, 7, 7, 0]
FORMULA Peterson-PT-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 336 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1008 place count 826 transition count 1484
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1092 place count 784 transition count 1484
Applied a total of 1092 rules in 395 ms. Remains 784 /1330 variables (removed 546) and now considering 1484/2030 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 784/1330 places, 1484/2030 transitions.
Normalized transition count is 1274 out of 1484 initially.
// Phase 1: matrix 1274 rows 784 cols
[2023-03-16 07:58:17] [INFO ] Computed 27 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9725 ms. (steps per millisecond=102 ) properties (out of 3) seen :10
Interrupted Best-First random walk after 833394 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2508 ms. (steps per millisecond=398 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1617 ms. (steps per millisecond=618 ) properties (out of 3) seen :9
[2023-03-16 07:58:36] [INFO ] Flow matrix only has 1274 transitions (discarded 210 similar events)
// Phase 1: matrix 1274 rows 784 cols
[2023-03-16 07:58:36] [INFO ] Computed 27 place invariants in 7 ms
[2023-03-16 07:58:36] [INFO ] [Real]Absence check using 20 positive place invariants in 36 ms returned sat
[2023-03-16 07:58:36] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 07:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:58:37] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2023-03-16 07:58:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:58:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 33 ms returned sat
[2023-03-16 07:58:37] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 07:58:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:58:38] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2023-03-16 07:58:38] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 07:58:38] [INFO ] [Nat]Added 330 Read/Feed constraints in 500 ms returned sat
[2023-03-16 07:58:39] [INFO ] Deduced a trap composed of 78 places in 728 ms of which 1 ms to minimize.
[2023-03-16 07:58:40] [INFO ] Deduced a trap composed of 78 places in 717 ms of which 2 ms to minimize.
[2023-03-16 07:58:41] [INFO ] Deduced a trap composed of 29 places in 906 ms of which 2 ms to minimize.
[2023-03-16 07:58:42] [INFO ] Deduced a trap composed of 12 places in 928 ms of which 2 ms to minimize.
[2023-03-16 07:58:43] [INFO ] Deduced a trap composed of 44 places in 852 ms of which 2 ms to minimize.
[2023-03-16 07:58:44] [INFO ] Deduced a trap composed of 12 places in 858 ms of which 1 ms to minimize.
[2023-03-16 07:58:44] [INFO ] Deduced a trap composed of 78 places in 739 ms of which 1 ms to minimize.
[2023-03-16 07:58:45] [INFO ] Deduced a trap composed of 28 places in 776 ms of which 1 ms to minimize.
[2023-03-16 07:58:46] [INFO ] Deduced a trap composed of 75 places in 917 ms of which 1 ms to minimize.
[2023-03-16 07:58:47] [INFO ] Deduced a trap composed of 70 places in 798 ms of which 2 ms to minimize.
[2023-03-16 07:58:48] [INFO ] Deduced a trap composed of 12 places in 914 ms of which 2 ms to minimize.
[2023-03-16 07:58:49] [INFO ] Deduced a trap composed of 39 places in 926 ms of which 1 ms to minimize.
[2023-03-16 07:58:50] [INFO ] Deduced a trap composed of 12 places in 791 ms of which 2 ms to minimize.
[2023-03-16 07:58:51] [INFO ] Deduced a trap composed of 12 places in 902 ms of which 2 ms to minimize.
[2023-03-16 07:58:52] [INFO ] Deduced a trap composed of 56 places in 794 ms of which 1 ms to minimize.
[2023-03-16 07:58:53] [INFO ] Deduced a trap composed of 32 places in 545 ms of which 1 ms to minimize.
[2023-03-16 07:58:53] [INFO ] Deduced a trap composed of 32 places in 655 ms of which 2 ms to minimize.
[2023-03-16 07:58:54] [INFO ] Deduced a trap composed of 67 places in 660 ms of which 1 ms to minimize.
[2023-03-16 07:58:55] [INFO ] Deduced a trap composed of 10 places in 825 ms of which 1 ms to minimize.
[2023-03-16 07:58:56] [INFO ] Deduced a trap composed of 12 places in 877 ms of which 2 ms to minimize.
[2023-03-16 07:58:57] [INFO ] Deduced a trap composed of 35 places in 814 ms of which 2 ms to minimize.
[2023-03-16 07:58:58] [INFO ] Deduced a trap composed of 110 places in 801 ms of which 2 ms to minimize.
[2023-03-16 07:58:59] [INFO ] Deduced a trap composed of 74 places in 705 ms of which 1 ms to minimize.
[2023-03-16 07:58:59] [INFO ] Deduced a trap composed of 91 places in 490 ms of which 1 ms to minimize.
[2023-03-16 07:59:00] [INFO ] Deduced a trap composed of 76 places in 720 ms of which 2 ms to minimize.
[2023-03-16 07:59:01] [INFO ] Deduced a trap composed of 40 places in 778 ms of which 2 ms to minimize.
[2023-03-16 07:59:02] [INFO ] Deduced a trap composed of 40 places in 716 ms of which 1 ms to minimize.
[2023-03-16 07:59:02] [INFO ] Deduced a trap composed of 76 places in 634 ms of which 2 ms to minimize.
[2023-03-16 07:59:03] [INFO ] Deduced a trap composed of 114 places in 803 ms of which 2 ms to minimize.
[2023-03-16 07:59:04] [INFO ] Deduced a trap composed of 59 places in 835 ms of which 1 ms to minimize.
[2023-03-16 07:59:05] [INFO ] Deduced a trap composed of 39 places in 812 ms of which 1 ms to minimize.
[2023-03-16 07:59:06] [INFO ] Deduced a trap composed of 39 places in 651 ms of which 2 ms to minimize.
[2023-03-16 07:59:07] [INFO ] Deduced a trap composed of 112 places in 707 ms of which 2 ms to minimize.
[2023-03-16 07:59:08] [INFO ] Deduced a trap composed of 112 places in 659 ms of which 1 ms to minimize.
[2023-03-16 07:59:08] [INFO ] Deduced a trap composed of 162 places in 676 ms of which 1 ms to minimize.
[2023-03-16 07:59:09] [INFO ] Deduced a trap composed of 33 places in 650 ms of which 1 ms to minimize.
[2023-03-16 07:59:10] [INFO ] Deduced a trap composed of 98 places in 723 ms of which 1 ms to minimize.
[2023-03-16 07:59:11] [INFO ] Deduced a trap composed of 98 places in 720 ms of which 2 ms to minimize.
[2023-03-16 07:59:11] [INFO ] Deduced a trap composed of 98 places in 710 ms of which 2 ms to minimize.
[2023-03-16 07:59:12] [INFO ] Deduced a trap composed of 33 places in 730 ms of which 2 ms to minimize.
[2023-03-16 07:59:13] [INFO ] Deduced a trap composed of 62 places in 655 ms of which 2 ms to minimize.
[2023-03-16 07:59:14] [INFO ] Deduced a trap composed of 92 places in 508 ms of which 1 ms to minimize.
[2023-03-16 07:59:14] [INFO ] Deduced a trap composed of 46 places in 634 ms of which 1 ms to minimize.
[2023-03-16 07:59:15] [INFO ] Deduced a trap composed of 63 places in 494 ms of which 1 ms to minimize.
[2023-03-16 07:59:15] [INFO ] Deduced a trap composed of 69 places in 467 ms of which 2 ms to minimize.
[2023-03-16 07:59:16] [INFO ] Deduced a trap composed of 50 places in 638 ms of which 1 ms to minimize.
[2023-03-16 07:59:17] [INFO ] Deduced a trap composed of 52 places in 518 ms of which 1 ms to minimize.
[2023-03-16 07:59:18] [INFO ] Deduced a trap composed of 80 places in 659 ms of which 1 ms to minimize.
[2023-03-16 07:59:18] [INFO ] Deduced a trap composed of 63 places in 637 ms of which 1 ms to minimize.
[2023-03-16 07:59:19] [INFO ] Deduced a trap composed of 46 places in 573 ms of which 1 ms to minimize.
[2023-03-16 07:59:20] [INFO ] Deduced a trap composed of 84 places in 592 ms of which 6 ms to minimize.
[2023-03-16 07:59:20] [INFO ] Deduced a trap composed of 50 places in 595 ms of which 2 ms to minimize.
[2023-03-16 07:59:21] [INFO ] Deduced a trap composed of 81 places in 478 ms of which 1 ms to minimize.
[2023-03-16 07:59:22] [INFO ] Deduced a trap composed of 97 places in 518 ms of which 1 ms to minimize.
[2023-03-16 07:59:22] [INFO ] Deduced a trap composed of 81 places in 410 ms of which 9 ms to minimize.
[2023-03-16 07:59:22] [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-16 07:59:22] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned sat
[2023-03-16 07:59:22] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 07:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:59:23] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2023-03-16 07:59:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:59:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-16 07:59:23] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 07:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:59:24] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2023-03-16 07:59:24] [INFO ] [Nat]Added 330 Read/Feed constraints in 157 ms returned sat
[2023-03-16 07:59:25] [INFO ] Deduced a trap composed of 18 places in 752 ms of which 2 ms to minimize.
[2023-03-16 07:59:26] [INFO ] Deduced a trap composed of 10 places in 777 ms of which 1 ms to minimize.
[2023-03-16 07:59:27] [INFO ] Deduced a trap composed of 10 places in 794 ms of which 1 ms to minimize.
[2023-03-16 07:59:28] [INFO ] Deduced a trap composed of 18 places in 803 ms of which 1 ms to minimize.
[2023-03-16 07:59:28] [INFO ] Deduced a trap composed of 16 places in 806 ms of which 2 ms to minimize.
[2023-03-16 07:59:29] [INFO ] Deduced a trap composed of 10 places in 781 ms of which 2 ms to minimize.
[2023-03-16 07:59:30] [INFO ] Deduced a trap composed of 16 places in 679 ms of which 1 ms to minimize.
[2023-03-16 07:59:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 5908 ms
[2023-03-16 07:59:30] [INFO ] [Real]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-16 07:59:30] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 07:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:59:31] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2023-03-16 07:59:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:59:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 36 ms returned sat
[2023-03-16 07:59:31] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 07:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:59:32] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2023-03-16 07:59:32] [INFO ] [Nat]Added 330 Read/Feed constraints in 74 ms returned sat
[2023-03-16 07:59:32] [INFO ] Computed and/alt/rep : 1183/2996/1183 causal constraints (skipped 84 transitions) in 156 ms.
[2023-03-16 07:59:47] [INFO ] Deduced a trap composed of 10 places in 744 ms of which 1 ms to minimize.
[2023-03-16 07:59:48] [INFO ] Deduced a trap composed of 26 places in 790 ms of which 2 ms to minimize.
[2023-03-16 07:59:49] [INFO ] Deduced a trap composed of 10 places in 772 ms of which 1 ms to minimize.
[2023-03-16 07:59:50] [INFO ] Deduced a trap composed of 29 places in 650 ms of which 1 ms to minimize.
[2023-03-16 07:59:50] [INFO ] Deduced a trap composed of 35 places in 469 ms of which 1 ms to minimize.
[2023-03-16 07:59:51] [INFO ] Deduced a trap composed of 122 places in 452 ms of which 1 ms to minimize.
[2023-03-16 07:59:52] [INFO ] Deduced a trap composed of 122 places in 566 ms of which 1 ms to minimize.
[2023-03-16 07:59:52] [INFO ] Deduced a trap composed of 46 places in 613 ms of which 1 ms to minimize.
[2023-03-16 07:59:53] [INFO ] Deduced a trap composed of 56 places in 588 ms of which 1 ms to minimize.
[2023-03-16 07:59:54] [INFO ] Deduced a trap composed of 56 places in 513 ms of which 1 ms to minimize.
[2023-03-16 07:59:55] [INFO ] Deduced a trap composed of 46 places in 585 ms of which 1 ms to minimize.
[2023-03-16 07:59:55] [INFO ] Deduced a trap composed of 33 places in 740 ms of which 1 ms to minimize.
[2023-03-16 07:59:56] [INFO ] Deduced a trap composed of 62 places in 560 ms of which 1 ms to minimize.
[2023-03-16 07:59:57] [INFO ] Deduced a trap composed of 62 places in 529 ms of which 2 ms to minimize.
[2023-03-16 07:59:58] [INFO ] Deduced a trap composed of 40 places in 583 ms of which 1 ms to minimize.
[2023-03-16 07:59:58] [INFO ] Deduced a trap composed of 75 places in 598 ms of which 1 ms to minimize.
[2023-03-16 07:59:59] [INFO ] Deduced a trap composed of 40 places in 563 ms of which 1 ms to minimize.
[2023-03-16 08:00:00] [INFO ] Deduced a trap composed of 80 places in 562 ms of which 1 ms to minimize.
[2023-03-16 08:00:01] [INFO ] Deduced a trap composed of 18 places in 802 ms of which 1 ms to minimize.
[2023-03-16 08:00:02] [INFO ] Deduced a trap composed of 27 places in 717 ms of which 1 ms to minimize.
[2023-03-16 08:00:02] [INFO ] Deduced a trap composed of 54 places in 580 ms of which 1 ms to minimize.
[2023-03-16 08:00:03] [INFO ] Deduced a trap composed of 54 places in 543 ms of which 1 ms to minimize.
[2023-03-16 08:00:04] [INFO ] Deduced a trap composed of 46 places in 586 ms of which 1 ms to minimize.
[2023-03-16 08:00:04] [INFO ] Deduced a trap composed of 58 places in 695 ms of which 2 ms to minimize.
[2023-03-16 08:00:05] [INFO ] Deduced a trap composed of 77 places in 674 ms of which 1 ms to minimize.
[2023-03-16 08:00:06] [INFO ] Deduced a trap composed of 33 places in 698 ms of which 1 ms to minimize.
[2023-03-16 08:00:07] [INFO ] Deduced a trap composed of 43 places in 707 ms of which 1 ms to minimize.
[2023-03-16 08:00:08] [INFO ] Deduced a trap composed of 61 places in 433 ms of which 2 ms to minimize.
[2023-03-16 08:00:08] [INFO ] Deduced a trap composed of 57 places in 671 ms of which 1 ms to minimize.
[2023-03-16 08:00:09] [INFO ] Deduced a trap composed of 59 places in 362 ms of which 1 ms to minimize.
[2023-03-16 08:00:10] [INFO ] Deduced a trap composed of 40 places in 596 ms of which 1 ms to minimize.
[2023-03-16 08:00:10] [INFO ] Deduced a trap composed of 71 places in 693 ms of which 2 ms to minimize.
[2023-03-16 08:00:11] [INFO ] Deduced a trap composed of 69 places in 425 ms of which 1 ms to minimize.
[2023-03-16 08:00:11] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 24763 ms
[2023-03-16 08:00:11] [INFO ] Added : 478 causal constraints over 97 iterations in 39185 ms.(timeout) Result :sat
Minimization took 908 ms.
Current structural bounds on expressions (after SMT) : [294, 6, 1] Max seen :[6, 6, 0]
FORMULA Peterson-PT-6-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 294 out of 784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1484/1484 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 784 transition count 1442
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 742 transition count 1442
Applied a total of 84 rules in 61 ms. Remains 742 /784 variables (removed 42) and now considering 1442/1484 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 742/784 places, 1442/1484 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 742 cols
[2023-03-16 08:00:14] [INFO ] Computed 27 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8539 ms. (steps per millisecond=117 ) properties (out of 1) seen :6
Finished Best-First random walk after 701834 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=140 )
[2023-03-16 08:00:28] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2023-03-16 08:00:28] [INFO ] Computed 27 place invariants in 7 ms
[2023-03-16 08:00:28] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-16 08:00:28] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 08:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 08:00:29] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-16 08:00:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 08:00:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-16 08:00:29] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 08:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 08:00:30] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2023-03-16 08:00:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 08:00:30] [INFO ] [Nat]Added 330 Read/Feed constraints in 408 ms returned sat
[2023-03-16 08:00:31] [INFO ] Deduced a trap composed of 41 places in 843 ms of which 1 ms to minimize.
[2023-03-16 08:00:32] [INFO ] Deduced a trap composed of 49 places in 863 ms of which 2 ms to minimize.
[2023-03-16 08:00:33] [INFO ] Deduced a trap composed of 27 places in 764 ms of which 1 ms to minimize.
[2023-03-16 08:00:33] [INFO ] Deduced a trap composed of 12 places in 741 ms of which 1 ms to minimize.
[2023-03-16 08:00:34] [INFO ] Deduced a trap composed of 28 places in 650 ms of which 1 ms to minimize.
[2023-03-16 08:00:35] [INFO ] Deduced a trap composed of 26 places in 771 ms of which 1 ms to minimize.
[2023-03-16 08:00:36] [INFO ] Deduced a trap composed of 34 places in 836 ms of which 2 ms to minimize.
[2023-03-16 08:00:37] [INFO ] Deduced a trap composed of 76 places in 897 ms of which 1 ms to minimize.
[2023-03-16 08:00:38] [INFO ] Deduced a trap composed of 26 places in 855 ms of which 1 ms to minimize.
[2023-03-16 08:00:39] [INFO ] Deduced a trap composed of 129 places in 759 ms of which 1 ms to minimize.
[2023-03-16 08:00:39] [INFO ] Deduced a trap composed of 20 places in 707 ms of which 1 ms to minimize.
[2023-03-16 08:00:40] [INFO ] Deduced a trap composed of 10 places in 685 ms of which 2 ms to minimize.
[2023-03-16 08:00:41] [INFO ] Deduced a trap composed of 10 places in 825 ms of which 1 ms to minimize.
[2023-03-16 08:00:42] [INFO ] Deduced a trap composed of 58 places in 752 ms of which 1 ms to minimize.
[2023-03-16 08:00:43] [INFO ] Deduced a trap composed of 18 places in 821 ms of which 1 ms to minimize.
[2023-03-16 08:00:44] [INFO ] Deduced a trap composed of 18 places in 756 ms of which 1 ms to minimize.
[2023-03-16 08:00:45] [INFO ] Deduced a trap composed of 18 places in 809 ms of which 1 ms to minimize.
[2023-03-16 08:00:45] [INFO ] Deduced a trap composed of 16 places in 813 ms of which 2 ms to minimize.
[2023-03-16 08:00:46] [INFO ] Deduced a trap composed of 30 places in 764 ms of which 1 ms to minimize.
[2023-03-16 08:00:47] [INFO ] Deduced a trap composed of 30 places in 765 ms of which 2 ms to minimize.
[2023-03-16 08:00:48] [INFO ] Deduced a trap composed of 30 places in 671 ms of which 1 ms to minimize.
[2023-03-16 08:00:49] [INFO ] Deduced a trap composed of 28 places in 595 ms of which 2 ms to minimize.
[2023-03-16 08:00:49] [INFO ] Deduced a trap composed of 44 places in 700 ms of which 1 ms to minimize.
[2023-03-16 08:00:50] [INFO ] Deduced a trap composed of 28 places in 721 ms of which 2 ms to minimize.
[2023-03-16 08:00:51] [INFO ] Deduced a trap composed of 103 places in 787 ms of which 1 ms to minimize.
[2023-03-16 08:00:52] [INFO ] Deduced a trap composed of 78 places in 789 ms of which 2 ms to minimize.
[2023-03-16 08:00:53] [INFO ] Deduced a trap composed of 62 places in 774 ms of which 1 ms to minimize.
[2023-03-16 08:00:54] [INFO ] Deduced a trap composed of 32 places in 755 ms of which 1 ms to minimize.
[2023-03-16 08:00:54] [INFO ] Deduced a trap composed of 50 places in 692 ms of which 2 ms to minimize.
[2023-03-16 08:00:55] [INFO ] Deduced a trap composed of 111 places in 538 ms of which 1 ms to minimize.
[2023-03-16 08:00:56] [INFO ] Deduced a trap composed of 46 places in 698 ms of which 1 ms to minimize.
[2023-03-16 08:00:57] [INFO ] Deduced a trap composed of 46 places in 692 ms of which 1 ms to minimize.
[2023-03-16 08:00:57] [INFO ] Deduced a trap composed of 82 places in 689 ms of which 1 ms to minimize.
[2023-03-16 08:00:58] [INFO ] Deduced a trap composed of 48 places in 588 ms of which 1 ms to minimize.
[2023-03-16 08:00:59] [INFO ] Deduced a trap composed of 50 places in 654 ms of which 2 ms to minimize.
[2023-03-16 08:00:59] [INFO ] Deduced a trap composed of 52 places in 695 ms of which 1 ms to minimize.
[2023-03-16 08:01:00] [INFO ] Deduced a trap composed of 78 places in 681 ms of which 1 ms to minimize.
[2023-03-16 08:01:01] [INFO ] Deduced a trap composed of 78 places in 652 ms of which 1 ms to minimize.
[2023-03-16 08:01:02] [INFO ] Deduced a trap composed of 124 places in 700 ms of which 2 ms to minimize.
[2023-03-16 08:01:03] [INFO ] Deduced a trap composed of 78 places in 710 ms of which 2 ms to minimize.
[2023-03-16 08:01:03] [INFO ] Deduced a trap composed of 62 places in 711 ms of which 1 ms to minimize.
[2023-03-16 08:01:04] [INFO ] Deduced a trap composed of 64 places in 684 ms of which 3 ms to minimize.
[2023-03-16 08:01:05] [INFO ] Deduced a trap composed of 62 places in 677 ms of which 1 ms to minimize.
[2023-03-16 08:01:05] [INFO ] Deduced a trap composed of 76 places in 389 ms of which 1 ms to minimize.
[2023-03-16 08:01:06] [INFO ] Deduced a trap composed of 64 places in 385 ms of which 1 ms to minimize.
[2023-03-16 08:01:07] [INFO ] Deduced a trap composed of 60 places in 445 ms of which 1 ms to minimize.
[2023-03-16 08:01:08] [INFO ] Deduced a trap composed of 70 places in 625 ms of which 1 ms to minimize.
[2023-03-16 08:01:08] [INFO ] Deduced a trap composed of 60 places in 650 ms of which 2 ms to minimize.
[2023-03-16 08:01:09] [INFO ] Deduced a trap composed of 44 places in 591 ms of which 1 ms to minimize.
[2023-03-16 08:01:10] [INFO ] Deduced a trap composed of 62 places in 659 ms of which 1 ms to minimize.
[2023-03-16 08:01:11] [INFO ] Deduced a trap composed of 62 places in 643 ms of which 1 ms to minimize.
[2023-03-16 08:01:11] [INFO ] Deduced a trap composed of 92 places in 495 ms of which 1 ms to minimize.
[2023-03-16 08:01:12] [INFO ] Deduced a trap composed of 38 places in 578 ms of which 1 ms to minimize.
[2023-03-16 08:01:12] [INFO ] Deduced a trap composed of 80 places in 384 ms of which 1 ms to minimize.
[2023-03-16 08:01:12] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 42465 ms
[2023-03-16 08:01:13] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 139 ms.
[2023-03-16 08:01:15] [INFO ] Deduced a trap composed of 127 places in 895 ms of which 7 ms to minimize.
[2023-03-16 08:01:15] [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: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) : [294] Max seen :[6]
Support contains 294 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 58 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 742/742 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 59 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-16 08:01:15] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:01:15] [INFO ] Invariant cache hit.
[2023-03-16 08:01:15] [INFO ] Implicit Places using invariants in 819 ms returned [714, 715, 717, 734, 735, 736, 737]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 827 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 735/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 36 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 922 ms. Remains : 735/742 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-16 08:01:16] [INFO ] Computed 20 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7839 ms. (steps per millisecond=127 ) properties (out of 1) seen :6
Finished Best-First random walk after 792506 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=158 )
[2023-03-16 08:01:28] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-16 08:01:28] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-16 08:01:29] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2023-03-16 08:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 08:01:29] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2023-03-16 08:01:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 08:01:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 36 ms returned sat
[2023-03-16 08:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 08:01:30] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2023-03-16 08:01:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 08:01:31] [INFO ] [Nat]Added 330 Read/Feed constraints in 442 ms returned sat
[2023-03-16 08:01:31] [INFO ] Deduced a trap composed of 37 places in 803 ms of which 1 ms to minimize.
[2023-03-16 08:01:32] [INFO ] Deduced a trap composed of 44 places in 760 ms of which 1 ms to minimize.
[2023-03-16 08:01:33] [INFO ] Deduced a trap composed of 16 places in 776 ms of which 1 ms to minimize.
[2023-03-16 08:01:34] [INFO ] Deduced a trap composed of 18 places in 657 ms of which 1 ms to minimize.
[2023-03-16 08:01:35] [INFO ] Deduced a trap composed of 12 places in 647 ms of which 1 ms to minimize.
[2023-03-16 08:01:35] [INFO ] Deduced a trap composed of 12 places in 636 ms of which 1 ms to minimize.
[2023-03-16 08:01:36] [INFO ] Deduced a trap composed of 18 places in 801 ms of which 1 ms to minimize.
[2023-03-16 08:01:37] [INFO ] Deduced a trap composed of 12 places in 755 ms of which 2 ms to minimize.
[2023-03-16 08:01:38] [INFO ] Deduced a trap composed of 18 places in 723 ms of which 1 ms to minimize.
[2023-03-16 08:01:38] [INFO ] Deduced a trap composed of 52 places in 539 ms of which 1 ms to minimize.
[2023-03-16 08:01:39] [INFO ] Deduced a trap composed of 40 places in 752 ms of which 1 ms to minimize.
[2023-03-16 08:01:40] [INFO ] Deduced a trap composed of 34 places in 718 ms of which 1 ms to minimize.
[2023-03-16 08:01:41] [INFO ] Deduced a trap composed of 76 places in 622 ms of which 1 ms to minimize.
[2023-03-16 08:01:41] [INFO ] Deduced a trap composed of 48 places in 626 ms of which 1 ms to minimize.
[2023-03-16 08:01:42] [INFO ] Deduced a trap composed of 32 places in 780 ms of which 1 ms to minimize.
[2023-03-16 08:01:43] [INFO ] Deduced a trap composed of 32 places in 740 ms of which 2 ms to minimize.
[2023-03-16 08:01:44] [INFO ] Deduced a trap composed of 91 places in 765 ms of which 1 ms to minimize.
[2023-03-16 08:01:45] [INFO ] Deduced a trap composed of 34 places in 618 ms of which 1 ms to minimize.
[2023-03-16 08:01:45] [INFO ] Deduced a trap composed of 34 places in 586 ms of which 1 ms to minimize.
[2023-03-16 08:01:46] [INFO ] Deduced a trap composed of 34 places in 741 ms of which 1 ms to minimize.
[2023-03-16 08:01:47] [INFO ] Deduced a trap composed of 55 places in 649 ms of which 1 ms to minimize.
[2023-03-16 08:01:48] [INFO ] Deduced a trap composed of 68 places in 583 ms of which 1 ms to minimize.
[2023-03-16 08:01:48] [INFO ] Deduced a trap composed of 60 places in 579 ms of which 1 ms to minimize.
[2023-03-16 08:01:49] [INFO ] Deduced a trap composed of 38 places in 675 ms of which 1 ms to minimize.
[2023-03-16 08:01:50] [INFO ] Deduced a trap composed of 74 places in 700 ms of which 1 ms to minimize.
[2023-03-16 08:01:50] [INFO ] Deduced a trap composed of 30 places in 494 ms of which 1 ms to minimize.
[2023-03-16 08:01:51] [INFO ] Deduced a trap composed of 64 places in 443 ms of which 0 ms to minimize.
[2023-03-16 08:01:52] [INFO ] Deduced a trap composed of 48 places in 535 ms of which 1 ms to minimize.
[2023-03-16 08:01:52] [INFO ] Deduced a trap composed of 91 places in 545 ms of which 1 ms to minimize.
[2023-03-16 08:01:53] [INFO ] Deduced a trap composed of 42 places in 683 ms of which 1 ms to minimize.
[2023-03-16 08:01:54] [INFO ] Deduced a trap composed of 46 places in 693 ms of which 2 ms to minimize.
[2023-03-16 08:01:54] [INFO ] Deduced a trap composed of 111 places in 646 ms of which 1 ms to minimize.
[2023-03-16 08:01:55] [INFO ] Deduced a trap composed of 44 places in 502 ms of which 1 ms to minimize.
[2023-03-16 08:01:56] [INFO ] Deduced a trap composed of 92 places in 613 ms of which 1 ms to minimize.
[2023-03-16 08:01:56] [INFO ] Deduced a trap composed of 92 places in 601 ms of which 1 ms to minimize.
[2023-03-16 08:01:57] [INFO ] Deduced a trap composed of 60 places in 456 ms of which 1 ms to minimize.
[2023-03-16 08:01:57] [INFO ] Deduced a trap composed of 64 places in 397 ms of which 1 ms to minimize.
[2023-03-16 08:01:58] [INFO ] Deduced a trap composed of 112 places in 389 ms of which 1 ms to minimize.
[2023-03-16 08:01:58] [INFO ] Deduced a trap composed of 60 places in 502 ms of which 1 ms to minimize.
[2023-03-16 08:01:59] [INFO ] Deduced a trap composed of 92 places in 373 ms of which 2 ms to minimize.
[2023-03-16 08:01:59] [INFO ] Deduced a trap composed of 80 places in 259 ms of which 1 ms to minimize.
[2023-03-16 08:01:59] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 28818 ms
[2023-03-16 08:02:00] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 137 ms.
[2023-03-16 08:02:12] [INFO ] Deduced a trap composed of 76 places in 396 ms of which 1 ms to minimize.
[2023-03-16 08:02:13] [INFO ] Deduced a trap composed of 80 places in 218 ms of which 1 ms to minimize.
[2023-03-16 08:02:13] [INFO ] Deduced a trap composed of 76 places in 271 ms of which 1 ms to minimize.
[2023-03-16 08:02:13] [INFO ] Deduced a trap composed of 76 places in 243 ms of which 0 ms to minimize.
[2023-03-16 08:02:14] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 2946 ms
[2023-03-16 08:02:15] [INFO ] Deduced a trap composed of 2 places in 769 ms of which 1 ms to minimize.
[2023-03-16 08:02:15] [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: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) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 34 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 30 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-16 08:02:15] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:02:15] [INFO ] Invariant cache hit.
[2023-03-16 08:02:16] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-16 08:02:16] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:02:16] [INFO ] Invariant cache hit.
[2023-03-16 08:02:16] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 08:02:21] [INFO ] Implicit Places using invariants and state equation in 5174 ms returned []
Implicit Place search using SMT with State Equation took 5778 ms to find 0 implicit places.
[2023-03-16 08:02:21] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-16 08:02:21] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:02:21] [INFO ] Invariant cache hit.
[2023-03-16 08:02:22] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7514 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting property specific reduction for Peterson-PT-6-UpperBounds-00
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-16 08:02:23] [INFO ] Computed 20 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :1
[2023-03-16 08:02:23] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-16 08:02:23] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-16 08:02:23] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2023-03-16 08:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 08:02:24] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2023-03-16 08:02:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 08:02:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2023-03-16 08:02:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 08:02:24] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2023-03-16 08:02:24] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 08:02:25] [INFO ] [Nat]Added 330 Read/Feed constraints in 256 ms returned sat
[2023-03-16 08:02:25] [INFO ] Deduced a trap composed of 47 places in 727 ms of which 1 ms to minimize.
[2023-03-16 08:02:26] [INFO ] Deduced a trap composed of 38 places in 814 ms of which 2 ms to minimize.
[2023-03-16 08:02:27] [INFO ] Deduced a trap composed of 28 places in 799 ms of which 2 ms to minimize.
[2023-03-16 08:02:28] [INFO ] Deduced a trap composed of 63 places in 788 ms of which 2 ms to minimize.
[2023-03-16 08:02:29] [INFO ] Deduced a trap composed of 12 places in 763 ms of which 1 ms to minimize.
[2023-03-16 08:02:29] [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) : [294] Max seen :[4]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 35 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-16 08:02:29] [INFO ] Computed 20 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7946 ms. (steps per millisecond=125 ) properties (out of 1) seen :6
Finished Best-First random walk after 793114 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=158 )
[2023-03-16 08:02:42] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-16 08:02:42] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-16 08:02:42] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-16 08:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 08:02:43] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2023-03-16 08:02:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 08:02:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-16 08:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 08:02:44] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2023-03-16 08:02:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 08:02:44] [INFO ] [Nat]Added 330 Read/Feed constraints in 335 ms returned sat
[2023-03-16 08:02:45] [INFO ] Deduced a trap composed of 37 places in 848 ms of which 1 ms to minimize.
[2023-03-16 08:02:46] [INFO ] Deduced a trap composed of 44 places in 842 ms of which 2 ms to minimize.
[2023-03-16 08:02:47] [INFO ] Deduced a trap composed of 16 places in 822 ms of which 2 ms to minimize.
[2023-03-16 08:02:48] [INFO ] Deduced a trap composed of 18 places in 834 ms of which 2 ms to minimize.
[2023-03-16 08:02:48] [INFO ] Deduced a trap composed of 12 places in 842 ms of which 2 ms to minimize.
[2023-03-16 08:02:49] [INFO ] Deduced a trap composed of 12 places in 647 ms of which 1 ms to minimize.
[2023-03-16 08:02:50] [INFO ] Deduced a trap composed of 18 places in 832 ms of which 2 ms to minimize.
[2023-03-16 08:02:51] [INFO ] Deduced a trap composed of 12 places in 813 ms of which 1 ms to minimize.
[2023-03-16 08:02:52] [INFO ] Deduced a trap composed of 18 places in 765 ms of which 2 ms to minimize.
[2023-03-16 08:02:53] [INFO ] Deduced a trap composed of 52 places in 811 ms of which 1 ms to minimize.
[2023-03-16 08:02:54] [INFO ] Deduced a trap composed of 40 places in 768 ms of which 2 ms to minimize.
[2023-03-16 08:02:54] [INFO ] Deduced a trap composed of 34 places in 662 ms of which 2 ms to minimize.
[2023-03-16 08:02:55] [INFO ] Deduced a trap composed of 76 places in 487 ms of which 1 ms to minimize.
[2023-03-16 08:02:55] [INFO ] Deduced a trap composed of 48 places in 475 ms of which 1 ms to minimize.
[2023-03-16 08:02:56] [INFO ] Deduced a trap composed of 32 places in 455 ms of which 1 ms to minimize.
[2023-03-16 08:02:57] [INFO ] Deduced a trap composed of 32 places in 739 ms of which 2 ms to minimize.
[2023-03-16 08:02:58] [INFO ] Deduced a trap composed of 91 places in 771 ms of which 1 ms to minimize.
[2023-03-16 08:02:58] [INFO ] Deduced a trap composed of 34 places in 704 ms of which 1 ms to minimize.
[2023-03-16 08:02:59] [INFO ] Deduced a trap composed of 34 places in 674 ms of which 1 ms to minimize.
[2023-03-16 08:03:00] [INFO ] Deduced a trap composed of 34 places in 537 ms of which 1 ms to minimize.
[2023-03-16 08:03:00] [INFO ] Deduced a trap composed of 55 places in 731 ms of which 2 ms to minimize.
[2023-03-16 08:03:01] [INFO ] Deduced a trap composed of 68 places in 699 ms of which 1 ms to minimize.
[2023-03-16 08:03:02] [INFO ] Deduced a trap composed of 60 places in 480 ms of which 1 ms to minimize.
[2023-03-16 08:03:02] [INFO ] Deduced a trap composed of 38 places in 565 ms of which 1 ms to minimize.
[2023-03-16 08:03:03] [INFO ] Deduced a trap composed of 74 places in 691 ms of which 1 ms to minimize.
[2023-03-16 08:03:04] [INFO ] Deduced a trap composed of 30 places in 520 ms of which 1 ms to minimize.
[2023-03-16 08:03:04] [INFO ] Deduced a trap composed of 64 places in 484 ms of which 1 ms to minimize.
[2023-03-16 08:03:05] [INFO ] Deduced a trap composed of 48 places in 557 ms of which 1 ms to minimize.
[2023-03-16 08:03:06] [INFO ] Deduced a trap composed of 91 places in 692 ms of which 1 ms to minimize.
[2023-03-16 08:03:07] [INFO ] Deduced a trap composed of 42 places in 652 ms of which 1 ms to minimize.
[2023-03-16 08:03:07] [INFO ] Deduced a trap composed of 46 places in 694 ms of which 1 ms to minimize.
[2023-03-16 08:03:08] [INFO ] Deduced a trap composed of 111 places in 549 ms of which 1 ms to minimize.
[2023-03-16 08:03:09] [INFO ] Deduced a trap composed of 44 places in 549 ms of which 1 ms to minimize.
[2023-03-16 08:03:09] [INFO ] Deduced a trap composed of 92 places in 472 ms of which 1 ms to minimize.
[2023-03-16 08:03:10] [INFO ] Deduced a trap composed of 92 places in 468 ms of which 1 ms to minimize.
[2023-03-16 08:03:10] [INFO ] Deduced a trap composed of 60 places in 479 ms of which 1 ms to minimize.
[2023-03-16 08:03:11] [INFO ] Deduced a trap composed of 64 places in 430 ms of which 1 ms to minimize.
[2023-03-16 08:03:11] [INFO ] Deduced a trap composed of 112 places in 465 ms of which 2 ms to minimize.
[2023-03-16 08:03:12] [INFO ] Deduced a trap composed of 60 places in 479 ms of which 2 ms to minimize.
[2023-03-16 08:03:12] [INFO ] Deduced a trap composed of 92 places in 354 ms of which 1 ms to minimize.
[2023-03-16 08:03:13] [INFO ] Deduced a trap composed of 80 places in 265 ms of which 1 ms to minimize.
[2023-03-16 08:03:13] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 29000 ms
[2023-03-16 08:03:13] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 136 ms.
[2023-03-16 08:03:24] [INFO ] Deduced a trap composed of 76 places in 457 ms of which 3 ms to minimize.
[2023-03-16 08:03:25] [INFO ] Deduced a trap composed of 80 places in 364 ms of which 1 ms to minimize.
[2023-03-16 08:03:26] [INFO ] Deduced a trap composed of 76 places in 355 ms of which 0 ms to minimize.
[2023-03-16 08:03:26] [INFO ] Deduced a trap composed of 76 places in 350 ms of which 1 ms to minimize.
[2023-03-16 08:03:28] [INFO ] Deduced a trap composed of 60 places in 382 ms of which 1 ms to minimize.
[2023-03-16 08:03: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 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) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 22 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 21 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-16 08:03:28] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:03:28] [INFO ] Invariant cache hit.
[2023-03-16 08:03:28] [INFO ] Implicit Places using invariants in 754 ms returned []
[2023-03-16 08:03:28] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:03:28] [INFO ] Invariant cache hit.
[2023-03-16 08:03:29] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 08:03:33] [INFO ] Implicit Places using invariants and state equation in 4986 ms returned []
Implicit Place search using SMT with State Equation took 5743 ms to find 0 implicit places.
[2023-03-16 08:03:34] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-16 08:03:34] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:03:34] [INFO ] Invariant cache hit.
[2023-03-16 08:03:35] [INFO ] Dead Transitions using invariants and state equation in 1867 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7746 ms. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-16 08:03:35] [INFO ] Computed 20 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8735 ms. (steps per millisecond=114 ) properties (out of 1) seen :6
Finished Best-First random walk after 744122 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=148 )
[2023-03-16 08:03:49] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-16 08:03:49] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-16 08:03:49] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned sat
[2023-03-16 08:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 08:03:50] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2023-03-16 08:03:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 08:03:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2023-03-16 08:03:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 08:03:51] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2023-03-16 08:03:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 08:03:51] [INFO ] [Nat]Added 330 Read/Feed constraints in 488 ms returned sat
[2023-03-16 08:03:52] [INFO ] Deduced a trap composed of 37 places in 822 ms of which 2 ms to minimize.
[2023-03-16 08:03:53] [INFO ] Deduced a trap composed of 44 places in 839 ms of which 2 ms to minimize.
[2023-03-16 08:03:54] [INFO ] Deduced a trap composed of 16 places in 698 ms of which 4 ms to minimize.
[2023-03-16 08:03:55] [INFO ] Deduced a trap composed of 18 places in 632 ms of which 2 ms to minimize.
[2023-03-16 08:03:56] [INFO ] Deduced a trap composed of 12 places in 817 ms of which 2 ms to minimize.
[2023-03-16 08:03:56] [INFO ] Deduced a trap composed of 12 places in 770 ms of which 1 ms to minimize.
[2023-03-16 08:03:57] [INFO ] Deduced a trap composed of 18 places in 530 ms of which 1 ms to minimize.
[2023-03-16 08:03:58] [INFO ] Deduced a trap composed of 12 places in 659 ms of which 2 ms to minimize.
[2023-03-16 08:03:58] [INFO ] Deduced a trap composed of 18 places in 717 ms of which 1 ms to minimize.
[2023-03-16 08:03:59] [INFO ] Deduced a trap composed of 52 places in 654 ms of which 1 ms to minimize.
[2023-03-16 08:04:00] [INFO ] Deduced a trap composed of 40 places in 758 ms of which 2 ms to minimize.
[2023-03-16 08:04:01] [INFO ] Deduced a trap composed of 34 places in 780 ms of which 1 ms to minimize.
[2023-03-16 08:04:02] [INFO ] Deduced a trap composed of 76 places in 782 ms of which 1 ms to minimize.
[2023-03-16 08:04:03] [INFO ] Deduced a trap composed of 48 places in 787 ms of which 1 ms to minimize.
[2023-03-16 08:04:03] [INFO ] Deduced a trap composed of 32 places in 713 ms of which 1 ms to minimize.
[2023-03-16 08:04:04] [INFO ] Deduced a trap composed of 32 places in 414 ms of which 1 ms to minimize.
[2023-03-16 08:04:05] [INFO ] Deduced a trap composed of 91 places in 751 ms of which 1 ms to minimize.
[2023-03-16 08:04:05] [INFO ] Deduced a trap composed of 34 places in 660 ms of which 1 ms to minimize.
[2023-03-16 08:04:06] [INFO ] Deduced a trap composed of 34 places in 573 ms of which 2 ms to minimize.
[2023-03-16 08:04:07] [INFO ] Deduced a trap composed of 34 places in 736 ms of which 1 ms to minimize.
[2023-03-16 08:04:08] [INFO ] Deduced a trap composed of 55 places in 724 ms of which 1 ms to minimize.
[2023-03-16 08:04:08] [INFO ] Deduced a trap composed of 68 places in 652 ms of which 1 ms to minimize.
[2023-03-16 08:04:09] [INFO ] Deduced a trap composed of 60 places in 517 ms of which 1 ms to minimize.
[2023-03-16 08:04:10] [INFO ] Deduced a trap composed of 38 places in 704 ms of which 1 ms to minimize.
[2023-03-16 08:04:11] [INFO ] Deduced a trap composed of 74 places in 734 ms of which 2 ms to minimize.
[2023-03-16 08:04:12] [INFO ] Deduced a trap composed of 30 places in 753 ms of which 2 ms to minimize.
[2023-03-16 08:04:12] [INFO ] Deduced a trap composed of 64 places in 679 ms of which 1 ms to minimize.
[2023-03-16 08:04:13] [INFO ] Deduced a trap composed of 48 places in 694 ms of which 1 ms to minimize.
[2023-03-16 08:04:14] [INFO ] Deduced a trap composed of 91 places in 710 ms of which 2 ms to minimize.
[2023-03-16 08:04:15] [INFO ] Deduced a trap composed of 42 places in 661 ms of which 1 ms to minimize.
[2023-03-16 08:04:15] [INFO ] Deduced a trap composed of 46 places in 670 ms of which 1 ms to minimize.
[2023-03-16 08:04:16] [INFO ] Deduced a trap composed of 111 places in 461 ms of which 1 ms to minimize.
[2023-03-16 08:04:16] [INFO ] Deduced a trap composed of 44 places in 486 ms of which 1 ms to minimize.
[2023-03-16 08:04:17] [INFO ] Deduced a trap composed of 92 places in 621 ms of which 2 ms to minimize.
[2023-03-16 08:04:18] [INFO ] Deduced a trap composed of 92 places in 609 ms of which 1 ms to minimize.
[2023-03-16 08:04:18] [INFO ] Deduced a trap composed of 60 places in 503 ms of which 1 ms to minimize.
[2023-03-16 08:04:19] [INFO ] Deduced a trap composed of 64 places in 492 ms of which 1 ms to minimize.
[2023-03-16 08:04:20] [INFO ] Deduced a trap composed of 112 places in 493 ms of which 1 ms to minimize.
[2023-03-16 08:04:20] [INFO ] Deduced a trap composed of 60 places in 498 ms of which 1 ms to minimize.
[2023-03-16 08:04:21] [INFO ] Deduced a trap composed of 92 places in 342 ms of which 1 ms to minimize.
[2023-03-16 08:04:21] [INFO ] Deduced a trap composed of 80 places in 366 ms of which 1 ms to minimize.
[2023-03-16 08:04:21] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 29813 ms
[2023-03-16 08:04:21] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 134 ms.
[2023-03-16 08:04:33] [INFO ] Deduced a trap composed of 76 places in 492 ms of which 1 ms to minimize.
[2023-03-16 08:04:34] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 1 ms to minimize.
[2023-03-16 08:04:34] [INFO ] Deduced a trap composed of 76 places in 277 ms of which 1 ms to minimize.
[2023-03-16 08:04:34] [INFO ] Deduced a trap composed of 76 places in 352 ms of which 1 ms to minimize.
[2023-03-16 08:04:35] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 2803 ms
[2023-03-16 08:04:36] [INFO ] Deduced a trap composed of 2 places in 743 ms of which 2 ms to minimize.
[2023-03-16 08:04:36] [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) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 34 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 35 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-16 08:04:36] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:04:36] [INFO ] Invariant cache hit.
[2023-03-16 08:04:37] [INFO ] Implicit Places using invariants in 712 ms returned []
[2023-03-16 08:04:37] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:04:37] [INFO ] Invariant cache hit.
[2023-03-16 08:04:37] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-16 08:04:41] [INFO ] Implicit Places using invariants and state equation in 4090 ms returned []
Implicit Place search using SMT with State Equation took 4817 ms to find 0 implicit places.
[2023-03-16 08:04:41] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-16 08:04:41] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-16 08:04:41] [INFO ] Invariant cache hit.
[2023-03-16 08:04:42] [INFO ] Dead Transitions using invariants and state equation in 1495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6391 ms. Remains : 735/735 places, 1442/1442 transitions.
Ending property specific reduction for Peterson-PT-6-UpperBounds-00 in 139710 ms.
[2023-03-16 08:04:43] [INFO ] Flatten gal took : 289 ms
[2023-03-16 08:04:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2023-03-16 08:04:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 735 places, 1442 transitions and 5082 arcs took 16 ms.
Total runtime 409860 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Peterson (PT), instance 6
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 735 places, 1442 transitions, 5082 arcs.
Final Score: 91844.939
Took : 71 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10293116 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16096592 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Peterson-PT-6, 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 r267-smll-167863542100637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;