About the Execution of 2021-gold for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1738.016 | 512986.00 | 572866.00 | 1620.60 | TFFFFFFFFFTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r179-tall-165277026700030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Peterson-PT-5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700030
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 180K Apr 30 09:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 767K Apr 30 09:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 245K Apr 30 09:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 30 09:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 535K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655072074910
Running Version 0
[2022-06-12 22:14:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:14:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:14:36] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-06-12 22:14:36] [INFO ] Transformed 834 places.
[2022-06-12 22:14:36] [INFO ] Transformed 1242 transitions.
[2022-06-12 22:14:36] [INFO ] Found NUPN structural information;
[2022-06-12 22:14:36] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2022-06-12 22:14:36] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 165 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 82 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-5-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :5
FORMULA Peterson-PT-5-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :1
FORMULA Peterson-PT-5-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-06-12 22:14:37] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-06-12 22:14:37] [INFO ] Computed 23 place invariants in 24 ms
[2022-06-12 22:14:38] [INFO ] [Real]Absence check using 17 positive place invariants in 77 ms returned sat
[2022-06-12 22:14:38] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 30 ms returned sat
[2022-06-12 22:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:14:42] [INFO ] [Real]Absence check using state equation in 4367 ms returned sat
[2022-06-12 22:14:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:14:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 36 ms returned sat
[2022-06-12 22:14:42] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 15 ms returned sat
[2022-06-12 22:14:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:14:44] [INFO ] [Nat]Absence check using state equation in 1478 ms returned sat
[2022-06-12 22:14:44] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 22:14:44] [INFO ] [Nat]Added 230 Read/Feed constraints in 55 ms returned sat
[2022-06-12 22:14:44] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2022-06-12 22:14:45] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 1 ms to minimize.
[2022-06-12 22:14:45] [INFO ] Deduced a trap composed of 48 places in 304 ms of which 2 ms to minimize.
[2022-06-12 22:14:45] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 1 ms to minimize.
[2022-06-12 22:14:46] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2022-06-12 22:14:46] [INFO ] Deduced a trap composed of 127 places in 250 ms of which 1 ms to minimize.
[2022-06-12 22:14:46] [INFO ] Deduced a trap composed of 11 places in 483 ms of which 0 ms to minimize.
[2022-06-12 22:14:47] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 2 ms to minimize.
[2022-06-12 22:14:47] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2022-06-12 22:14:47] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 0 ms to minimize.
[2022-06-12 22:14:47] [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
[2022-06-12 22:14:47] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2022-06-12 22:14:47] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 18 ms returned sat
[2022-06-12 22:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:14:49] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2022-06-12 22:14:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:14:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 34 ms returned sat
[2022-06-12 22:14:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2022-06-12 22:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:14:50] [INFO ] [Nat]Absence check using state equation in 1030 ms returned sat
[2022-06-12 22:14:50] [INFO ] [Nat]Added 230 Read/Feed constraints in 61 ms returned sat
[2022-06-12 22:14:50] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 1 ms to minimize.
[2022-06-12 22:14:51] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 1 ms to minimize.
[2022-06-12 22:14:51] [INFO ] Deduced a trap composed of 136 places in 227 ms of which 1 ms to minimize.
[2022-06-12 22:14:51] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 0 ms to minimize.
[2022-06-12 22:14:51] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 0 ms to minimize.
[2022-06-12 22:14:52] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 12 ms to minimize.
[2022-06-12 22:14:52] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 1 ms to minimize.
[2022-06-12 22:14:52] [INFO ] Deduced a trap composed of 105 places in 211 ms of which 0 ms to minimize.
[2022-06-12 22:14:53] [INFO ] Deduced a trap composed of 79 places in 234 ms of which 0 ms to minimize.
[2022-06-12 22:14:53] [INFO ] Deduced a trap composed of 78 places in 211 ms of which 2 ms to minimize.
[2022-06-12 22:14:53] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 1 ms to minimize.
[2022-06-12 22:14:53] [INFO ] Deduced a trap composed of 82 places in 226 ms of which 1 ms to minimize.
[2022-06-12 22:14:54] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 1 ms to minimize.
[2022-06-12 22:14:54] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 0 ms to minimize.
[2022-06-12 22:14:54] [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
[2022-06-12 22:14:54] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2022-06-12 22:14:54] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-06-12 22:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:14:54] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-06-12 22:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:14:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2022-06-12 22:14:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-06-12 22:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:14:55] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2022-06-12 22:14:55] [INFO ] [Nat]Added 230 Read/Feed constraints in 46 ms returned sat
[2022-06-12 22:14:55] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2022-06-12 22:14:55] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
[2022-06-12 22:14:56] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 0 ms to minimize.
[2022-06-12 22:14:56] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 1 ms to minimize.
[2022-06-12 22:14:56] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2022-06-12 22:14:57] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 1 ms to minimize.
[2022-06-12 22:14:57] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 0 ms to minimize.
[2022-06-12 22:14:57] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 1 ms to minimize.
[2022-06-12 22:14:57] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 1 ms to minimize.
[2022-06-12 22:14:57] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2022-06-12 22:14:58] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 4 ms to minimize.
[2022-06-12 22:14:58] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 1 ms to minimize.
[2022-06-12 22:14:58] [INFO ] Deduced a trap composed of 77 places in 199 ms of which 1 ms to minimize.
[2022-06-12 22:14:58] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 0 ms to minimize.
[2022-06-12 22:14:59] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 1 ms to minimize.
[2022-06-12 22:14:59] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 2 ms to minimize.
[2022-06-12 22:14:59] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 1 ms to minimize.
[2022-06-12 22:14:59] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 1 ms to minimize.
[2022-06-12 22:14:59] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:15:00] [INFO ] Deduced a trap composed of 115 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:15:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-12 22:15:00] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned unsat
[2022-06-12 22:15:00] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-06-12 22:15:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-06-12 22:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:00] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-06-12 22:15:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-06-12 22:15:00] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-06-12 22:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:00] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2022-06-12 22:15:01] [INFO ] [Nat]Added 230 Read/Feed constraints in 57 ms returned sat
[2022-06-12 22:15:01] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2022-06-12 22:15:01] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2022-06-12 22:15:01] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2022-06-12 22:15:02] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2022-06-12 22:15:02] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2022-06-12 22:15:02] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 0 ms to minimize.
[2022-06-12 22:15:02] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 2 ms to minimize.
[2022-06-12 22:15:03] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 0 ms to minimize.
[2022-06-12 22:15:03] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 1 ms to minimize.
[2022-06-12 22:15:03] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 0 ms to minimize.
[2022-06-12 22:15:03] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 1 ms to minimize.
[2022-06-12 22:15:03] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 1 ms to minimize.
[2022-06-12 22:15:04] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 5 ms to minimize.
[2022-06-12 22:15:04] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 0 ms to minimize.
[2022-06-12 22:15:04] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 0 ms to minimize.
[2022-06-12 22:15:04] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 0 ms to minimize.
[2022-06-12 22:15:05] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 1 ms to minimize.
[2022-06-12 22:15:05] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 1 ms to minimize.
[2022-06-12 22:15:05] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:15:05] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 1 ms to minimize.
[2022-06-12 22:15:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-12 22:15:05] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-06-12 22:15:05] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-06-12 22:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:06] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-06-12 22:15:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-06-12 22:15:06] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-06-12 22:15:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:06] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2022-06-12 22:15:06] [INFO ] [Nat]Added 230 Read/Feed constraints in 45 ms returned sat
[2022-06-12 22:15:06] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2022-06-12 22:15:07] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 0 ms to minimize.
[2022-06-12 22:15:07] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 1 ms to minimize.
[2022-06-12 22:15:07] [INFO ] Deduced a trap composed of 149 places in 191 ms of which 0 ms to minimize.
[2022-06-12 22:15:07] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 1 ms to minimize.
[2022-06-12 22:15:07] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 0 ms to minimize.
[2022-06-12 22:15:08] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 0 ms to minimize.
[2022-06-12 22:15:08] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 1 ms to minimize.
[2022-06-12 22:15:08] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 0 ms to minimize.
[2022-06-12 22:15:08] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 1 ms to minimize.
[2022-06-12 22:15:09] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 0 ms to minimize.
[2022-06-12 22:15:09] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 1 ms to minimize.
[2022-06-12 22:15:09] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 0 ms to minimize.
[2022-06-12 22:15:09] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 1 ms to minimize.
[2022-06-12 22:15:09] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 1 ms to minimize.
[2022-06-12 22:15:10] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 1 ms to minimize.
[2022-06-12 22:15:10] [INFO ] Deduced a trap composed of 70 places in 215 ms of which 2 ms to minimize.
[2022-06-12 22:15:10] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 0 ms to minimize.
[2022-06-12 22:15:10] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 1 ms to minimize.
[2022-06-12 22:15:11] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:15:11] [INFO ] Deduced a trap composed of 2 places in 299 ms of which 1 ms to minimize.
[2022-06-12 22:15:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-12 22:15:11] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-06-12 22:15:11] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-06-12 22:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:11] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-06-12 22:15:11] [INFO ] [Real]Added 230 Read/Feed constraints in 41 ms returned sat
[2022-06-12 22:15:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2022-06-12 22:15:12] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-06-12 22:15:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:12] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2022-06-12 22:15:12] [INFO ] [Nat]Added 230 Read/Feed constraints in 46 ms returned sat
[2022-06-12 22:15:12] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 1 ms to minimize.
[2022-06-12 22:15:12] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 0 ms to minimize.
[2022-06-12 22:15:13] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 0 ms to minimize.
[2022-06-12 22:15:13] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2022-06-12 22:15:13] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 0 ms to minimize.
[2022-06-12 22:15:13] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2022-06-12 22:15:14] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 0 ms to minimize.
[2022-06-12 22:15:14] [INFO ] Deduced a trap composed of 99 places in 201 ms of which 1 ms to minimize.
[2022-06-12 22:15:14] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 0 ms to minimize.
[2022-06-12 22:15:14] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 1 ms to minimize.
[2022-06-12 22:15:15] [INFO ] Deduced a trap composed of 86 places in 192 ms of which 1 ms to minimize.
[2022-06-12 22:15:15] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 0 ms to minimize.
[2022-06-12 22:15:15] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 0 ms to minimize.
[2022-06-12 22:15:15] [INFO ] Deduced a trap composed of 63 places in 201 ms of which 0 ms to minimize.
[2022-06-12 22:15:16] [INFO ] Deduced a trap composed of 63 places in 200 ms of which 1 ms to minimize.
[2022-06-12 22:15:16] [INFO ] Deduced a trap composed of 63 places in 194 ms of which 0 ms to minimize.
[2022-06-12 22:15:16] [INFO ] Deduced a trap composed of 63 places in 203 ms of which 3 ms to minimize.
[2022-06-12 22:15:16] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 0 ms to minimize.
[2022-06-12 22:15:17] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 1 ms to minimize.
[2022-06-12 22:15:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
FORMULA Peterson-PT-5-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Support contains 470 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 834 transition count 1168
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 760 transition count 1168
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 129 Pre rules applied. Total rules applied 148 place count 760 transition count 1039
Deduced a syphon composed of 129 places in 2 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 406 place count 631 transition count 1039
Applied a total of 406 rules in 94 ms. Remains 631 /834 variables (removed 203) and now considering 1039/1242 (removed 203) transitions.
Finished structural reductions, in 1 iterations. Remains : 631/834 places, 1039/1242 transitions.
[2022-06-12 22:15:17] [INFO ] Flatten gal took : 98 ms
[2022-06-12 22:15:17] [INFO ] Flatten gal took : 68 ms
[2022-06-12 22:15:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17961923055381669819.gal : 40 ms
[2022-06-12 22:15:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8296037798900899655.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17961923055381669819.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8296037798900899655.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17961923055381669819.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8296037798900899655.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8296037798900899655.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :6 after 8
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :8 after 34
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :34 after 46
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :46 after 82
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :82 after 118
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :118 after 320
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :320 after 714
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :714 after 1990
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1990 after 4016
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :4016 after 17520
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :17520 after 68429
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :68429 after 145398
Detected timeout of ITS tools.
[2022-06-12 22:15:32] [INFO ] Flatten gal took : 46 ms
[2022-06-12 22:15:32] [INFO ] Applying decomposition
[2022-06-12 22:15:32] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4661783075795895129.txt, -o, /tmp/graph4661783075795895129.bin, -w, /tmp/graph4661783075795895129.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4661783075795895129.bin, -l, -1, -v, -w, /tmp/graph4661783075795895129.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:15:33] [INFO ] Decomposing Gal with order
[2022-06-12 22:15:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:15:33] [INFO ] Removed a total of 1033 redundant transitions.
[2022-06-12 22:15:33] [INFO ] Flatten gal took : 160 ms
[2022-06-12 22:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-06-12 22:15:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9062726676955019734.gal : 47 ms
[2022-06-12 22:15:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14923541278931644106.prop : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9062726676955019734.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14923541278931644106.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality9062726676955019734.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14923541278931644106.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14923541278931644106.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 4488
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :4488 after 6.12257e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9291571668636563991
[2022-06-12 22:15:48] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9291571668636563991
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9291571668636563991]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9291571668636563991] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9291571668636563991] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3969 ms. (steps per millisecond=251 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 238763 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=47 ) properties seen :{}
Interrupted Best-First random walk after 575184 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=115 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 6942705 steps, run timeout after 30001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 6942705 steps, saw 1142546 distinct states, run finished after 30001 ms. (steps per millisecond=231 ) properties seen :{}
Running SMT prover for 6 properties.
[2022-06-12 22:16:37] [INFO ] Flow matrix only has 919 transitions (discarded 120 similar events)
// Phase 1: matrix 919 rows 631 cols
[2022-06-12 22:16:37] [INFO ] Computed 23 place invariants in 13 ms
[2022-06-12 22:16:37] [INFO ] [Real]Absence check using 17 positive place invariants in 32 ms returned sat
[2022-06-12 22:16:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-12 22:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:38] [INFO ] [Real]Absence check using state equation in 1515 ms returned sat
[2022-06-12 22:16:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 26 ms returned sat
[2022-06-12 22:16:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-06-12 22:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:39] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2022-06-12 22:16:39] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 22:16:39] [INFO ] [Nat]Added 230 Read/Feed constraints in 42 ms returned sat
[2022-06-12 22:16:39] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2022-06-12 22:16:40] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:16:40] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:16:40] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2022-06-12 22:16:40] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:16:40] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:16:41] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2022-06-12 22:16:41] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:16:41] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2022-06-12 22:16:41] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2022-06-12 22:16:41] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2022-06-12 22:16:42] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:16:42] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:16:42] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 1 ms to minimize.
[2022-06-12 22:16:42] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:16:42] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 1 ms to minimize.
[2022-06-12 22:16:42] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2022-06-12 22:16:43] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2022-06-12 22:16:43] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:16:43] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 0 ms to minimize.
[2022-06-12 22:16:43] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:16:43] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:16:43] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:16:44] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:16:44] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 0 ms to minimize.
[2022-06-12 22:16:44] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:16:44] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 0 ms to minimize.
[2022-06-12 22:16:44] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:16:44] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:16:44] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2022-06-12 22:16:45] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2022-06-12 22:16:45] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-06-12 22:16:45] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-06-12 22:16:45] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-06-12 22:16:45] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:16:45] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 0 ms to minimize.
[2022-06-12 22:16:45] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:16:45] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:16:46] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:16:46] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:16:46] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:16:46] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 0 ms to minimize.
[2022-06-12 22:16:46] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:16:47] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 0 ms to minimize.
[2022-06-12 22:16:47] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2022-06-12 22:16:47] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 1 ms to minimize.
[2022-06-12 22:16:47] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:16:47] [INFO ] Deduced a trap composed of 161 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:16:48] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:16:48] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 1 ms to minimize.
[2022-06-12 22:16:48] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:16:48] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 0 ms to minimize.
[2022-06-12 22:16:49] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:16:49] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:16:49] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:16:49] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
[2022-06-12 22:16:49] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2022-06-12 22:16:50] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:16:50] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:16:50] [INFO ] Deduced a trap composed of 139 places in 103 ms of which 1 ms to minimize.
[2022-06-12 22:16:50] [INFO ] Deduced a trap composed of 139 places in 104 ms of which 1 ms to minimize.
[2022-06-12 22:16:50] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 0 ms to minimize.
[2022-06-12 22:16:50] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 0 ms to minimize.
[2022-06-12 22:16:51] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2022-06-12 22:16:51] [INFO ] Deduced a trap composed of 112 places in 75 ms of which 1 ms to minimize.
[2022-06-12 22:16:51] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 0 ms to minimize.
[2022-06-12 22:16:51] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 0 ms to minimize.
[2022-06-12 22:16:51] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:16:51] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 0 ms to minimize.
[2022-06-12 22:16:51] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 0 ms to minimize.
[2022-06-12 22:16:52] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:16:52] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:16:52] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:16:52] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2022-06-12 22:16:52] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:16:52] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:16:53] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:16:53] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:16:53] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:16:53] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2022-06-12 22:16:53] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:16:54] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:16:54] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2022-06-12 22:16:54] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 0 ms to minimize.
[2022-06-12 22:16:55] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 1 ms to minimize.
[2022-06-12 22:16:55] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2022-06-12 22:16:55] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 0 ms to minimize.
[2022-06-12 22:16:55] [INFO ] Deduced a trap composed of 99 places in 169 ms of which 1 ms to minimize.
[2022-06-12 22:16:56] [INFO ] Deduced a trap composed of 99 places in 197 ms of which 1 ms to minimize.
[2022-06-12 22:16:56] [INFO ] Deduced a trap composed of 99 places in 164 ms of which 1 ms to minimize.
[2022-06-12 22:16:56] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:16:56] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 1 ms to minimize.
[2022-06-12 22:16:56] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 1 ms to minimize.
[2022-06-12 22:16:57] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 1 ms to minimize.
[2022-06-12 22:16:57] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 1 ms to minimize.
[2022-06-12 22:16:57] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 1 ms to minimize.
[2022-06-12 22:16:57] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 1 ms to minimize.
[2022-06-12 22:16:58] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2022-06-12 22:16:58] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:16:58] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 1 ms to minimize.
[2022-06-12 22:16:58] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 0 ms to minimize.
[2022-06-12 22:16:58] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 1 ms to minimize.
[2022-06-12 22:16:59] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:16:59] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:16:59] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 0 ms to minimize.
[2022-06-12 22:16:59] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 1 ms to minimize.
[2022-06-12 22:17:00] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 1 ms to minimize.
[2022-06-12 22:17:00] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:17:00] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:17:00] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 1 ms to minimize.
[2022-06-12 22:17:00] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:17:01] [INFO ] Trap strengthening (SAT) tested/added 112/111 trap constraints in 21286 ms
[2022-06-12 22:17:01] [INFO ] Computed and/alt/rep : 853/1789/853 causal constraints (skipped 60 transitions) in 50 ms.
[2022-06-12 22:17:14] [INFO ] Added : 839 causal constraints over 168 iterations in 13538 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-12 22:17:14] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2022-06-12 22:17:14] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-06-12 22:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:15] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2022-06-12 22:17:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:17:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2022-06-12 22:17:15] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-06-12 22:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:16] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2022-06-12 22:17:16] [INFO ] [Nat]Added 230 Read/Feed constraints in 46 ms returned sat
[2022-06-12 22:17:17] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 1 ms to minimize.
[2022-06-12 22:17:17] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 1 ms to minimize.
[2022-06-12 22:17:17] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 1 ms to minimize.
[2022-06-12 22:17:17] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2022-06-12 22:17:17] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 0 ms to minimize.
[2022-06-12 22:17:18] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2022-06-12 22:17:18] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2022-06-12 22:17:18] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 0 ms to minimize.
[2022-06-12 22:17:18] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 1 ms to minimize.
[2022-06-12 22:17:18] [INFO ] Deduced a trap composed of 96 places in 176 ms of which 0 ms to minimize.
[2022-06-12 22:17:19] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 0 ms to minimize.
[2022-06-12 22:17:19] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 0 ms to minimize.
[2022-06-12 22:17:19] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 1 ms to minimize.
[2022-06-12 22:17:19] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 2 ms to minimize.
[2022-06-12 22:17:20] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2022-06-12 22:17:20] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 0 ms to minimize.
[2022-06-12 22:17:20] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 1 ms to minimize.
[2022-06-12 22:17:20] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:17:20] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:17:21] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 1 ms to minimize.
[2022-06-12 22:17:21] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:17:21] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:17:21] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:17:21] [INFO ] Deduced a trap composed of 188 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:17:22] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 1 ms to minimize.
[2022-06-12 22:17:22] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-06-12 22:17:22] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:17:22] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:17:22] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:17:23] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 15 ms to minimize.
[2022-06-12 22:17:23] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:17:23] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:17:23] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 1 ms to minimize.
[2022-06-12 22:17:23] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 1 ms to minimize.
[2022-06-12 22:17:24] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 4 ms to minimize.
[2022-06-12 22:17:24] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 1 ms to minimize.
[2022-06-12 22:17:24] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 0 ms to minimize.
[2022-06-12 22:17:24] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:17:24] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 1 ms to minimize.
[2022-06-12 22:17:25] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 2 ms to minimize.
[2022-06-12 22:17:25] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 0 ms to minimize.
[2022-06-12 22:17:25] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 0 ms to minimize.
[2022-06-12 22:17:25] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 0 ms to minimize.
[2022-06-12 22:17:25] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:17:26] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2022-06-12 22:17:26] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:17:26] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:17:26] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 1 ms to minimize.
[2022-06-12 22:17:26] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:17:27] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 1 ms to minimize.
[2022-06-12 22:17:27] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2022-06-12 22:17:27] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:17:27] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:17:27] [INFO ] Deduced a trap composed of 142 places in 122 ms of which 0 ms to minimize.
[2022-06-12 22:17:27] [INFO ] Deduced a trap composed of 177 places in 127 ms of which 0 ms to minimize.
[2022-06-12 22:17:28] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:17:28] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:17:28] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 0 ms to minimize.
[2022-06-12 22:17:28] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 1 ms to minimize.
[2022-06-12 22:17:28] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2022-06-12 22:17:28] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:17:29] [INFO ] Deduced a trap composed of 156 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:17:29] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-06-12 22:17:29] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2022-06-12 22:17:29] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2022-06-12 22:17:29] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 1 ms to minimize.
[2022-06-12 22:17:30] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:17:30] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:17:30] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:17:30] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:17:30] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:17:30] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 1 ms to minimize.
[2022-06-12 22:17:31] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:17:31] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 1 ms to minimize.
[2022-06-12 22:17:31] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 14541 ms
[2022-06-12 22:17:31] [INFO ] Computed and/alt/rep : 853/1789/853 causal constraints (skipped 60 transitions) in 44 ms.
[2022-06-12 22:17:40] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2022-06-12 22:17:40] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 0 ms to minimize.
[2022-06-12 22:17:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2022-06-12 22:17:40] [INFO ] Added : 707 causal constraints over 142 iterations in 9423 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-06-12 22:17:40] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2022-06-12 22:17:40] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-06-12 22:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:41] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-06-12 22:17:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:17:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-06-12 22:17:41] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:41] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2022-06-12 22:17:41] [INFO ] [Nat]Added 230 Read/Feed constraints in 36 ms returned sat
[2022-06-12 22:17:41] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2022-06-12 22:17:41] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2022-06-12 22:17:42] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 0 ms to minimize.
[2022-06-12 22:17:42] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:17:42] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2022-06-12 22:17:42] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2022-06-12 22:17:42] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 0 ms to minimize.
[2022-06-12 22:17:42] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:17:44] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:17:44] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:17:44] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:17:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2790 ms
[2022-06-12 22:17:44] [INFO ] Computed and/alt/rep : 853/1789/853 causal constraints (skipped 60 transitions) in 52 ms.
[2022-06-12 22:17:53] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:17:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2022-06-12 22:17:53] [INFO ] Added : 763 causal constraints over 153 iterations in 9312 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-12 22:17:53] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2022-06-12 22:17:53] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:53] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2022-06-12 22:17:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:17:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2022-06-12 22:17:54] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:17:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:54] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2022-06-12 22:17:54] [INFO ] [Nat]Added 230 Read/Feed constraints in 33 ms returned sat
[2022-06-12 22:17:54] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 1 ms to minimize.
[2022-06-12 22:17:54] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 0 ms to minimize.
[2022-06-12 22:17:55] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 0 ms to minimize.
[2022-06-12 22:17:55] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 0 ms to minimize.
[2022-06-12 22:17:55] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 1 ms to minimize.
[2022-06-12 22:17:55] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 1 ms to minimize.
[2022-06-12 22:17:55] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2022-06-12 22:17:56] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2022-06-12 22:17:56] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2022-06-12 22:17:56] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2022-06-12 22:17:56] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:17:56] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2022-06-12 22:17:57] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2022-06-12 22:17:57] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 1 ms to minimize.
[2022-06-12 22:17:57] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:17:57] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:17:57] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:17:57] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:17:58] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:17:58] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:17:58] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:17:58] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:17:58] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:17:59] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:17:59] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 0 ms to minimize.
[2022-06-12 22:17:59] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 1 ms to minimize.
[2022-06-12 22:17:59] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:17:59] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 1 ms to minimize.
[2022-06-12 22:18:00] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:18:00] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 0 ms to minimize.
[2022-06-12 22:18:00] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:18:00] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 0 ms to minimize.
[2022-06-12 22:18:00] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:18:00] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 8 ms to minimize.
[2022-06-12 22:18:01] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2022-06-12 22:18:01] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:18:01] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 0 ms to minimize.
[2022-06-12 22:18:01] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 0 ms to minimize.
[2022-06-12 22:18:01] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:18:01] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:18:01] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2022-06-12 22:18:02] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 1 ms to minimize.
[2022-06-12 22:18:02] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 0 ms to minimize.
[2022-06-12 22:18:02] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:18:02] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:18:03] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 0 ms to minimize.
[2022-06-12 22:18:03] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:18:03] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 0 ms to minimize.
[2022-06-12 22:18:03] [INFO ] Deduced a trap composed of 148 places in 103 ms of which 0 ms to minimize.
[2022-06-12 22:18:03] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 1 ms to minimize.
[2022-06-12 22:18:03] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2022-06-12 22:18:04] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:18:04] [INFO ] Deduced a trap composed of 124 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:18:04] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 1 ms to minimize.
[2022-06-12 22:18:04] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:18:04] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 10159 ms
[2022-06-12 22:18:04] [INFO ] Computed and/alt/rep : 853/1789/853 causal constraints (skipped 60 transitions) in 48 ms.
[2022-06-12 22:18:13] [INFO ] Added : 702 causal constraints over 141 iterations in 8645 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-12 22:18:13] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2022-06-12 22:18:13] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:13] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2022-06-12 22:18:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:18:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-06-12 22:18:13] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:18:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:13] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2022-06-12 22:18:13] [INFO ] [Nat]Added 230 Read/Feed constraints in 35 ms returned sat
[2022-06-12 22:18:14] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2022-06-12 22:18:14] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2022-06-12 22:18:14] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2022-06-12 22:18:14] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 0 ms to minimize.
[2022-06-12 22:18:15] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 1 ms to minimize.
[2022-06-12 22:18:15] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 1 ms to minimize.
[2022-06-12 22:18:15] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 1 ms to minimize.
[2022-06-12 22:18:15] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 0 ms to minimize.
[2022-06-12 22:18:15] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 0 ms to minimize.
[2022-06-12 22:18:16] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2022-06-12 22:18:16] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 1 ms to minimize.
[2022-06-12 22:18:16] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 1 ms to minimize.
[2022-06-12 22:18:16] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2022-06-12 22:18:16] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 1 ms to minimize.
[2022-06-12 22:18:17] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 0 ms to minimize.
[2022-06-12 22:18:17] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:18:17] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:18:17] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:18:17] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:18:18] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:18:18] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:18:18] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 0 ms to minimize.
[2022-06-12 22:18:18] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:18:18] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2022-06-12 22:18:19] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2022-06-12 22:18:19] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 1 ms to minimize.
[2022-06-12 22:18:19] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 0 ms to minimize.
[2022-06-12 22:18:19] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:18:19] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 0 ms to minimize.
[2022-06-12 22:18:19] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 0 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 165 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 1 ms to minimize.
[2022-06-12 22:18:21] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 0 ms to minimize.
[2022-06-12 22:18:21] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:18:21] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:18:21] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 7558 ms
[2022-06-12 22:18:21] [INFO ] Computed and/alt/rep : 853/1789/853 causal constraints (skipped 60 transitions) in 42 ms.
[2022-06-12 22:18:31] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:18:31] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 0 ms to minimize.
[2022-06-12 22:18:31] [INFO ] Deduced a trap composed of 132 places in 60 ms of which 1 ms to minimize.
[2022-06-12 22:18:31] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:18:32] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 1 ms to minimize.
[2022-06-12 22:18:32] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 0 ms to minimize.
[2022-06-12 22:18:32] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 0 ms to minimize.
[2022-06-12 22:18:32] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:18:32] [INFO ] Deduced a trap composed of 185 places in 100 ms of which 0 ms to minimize.
[2022-06-12 22:18:32] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:18:33] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2022-06-12 22:18:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1854 ms
[2022-06-12 22:18:33] [INFO ] Added : 835 causal constraints over 168 iterations in 11913 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-12 22:18:33] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2022-06-12 22:18:33] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:33] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-06-12 22:18:33] [INFO ] [Real]Added 230 Read/Feed constraints in 32 ms returned sat
[2022-06-12 22:18:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:18:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-06-12 22:18:33] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-06-12 22:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:34] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-06-12 22:18:34] [INFO ] [Nat]Added 230 Read/Feed constraints in 37 ms returned sat
[2022-06-12 22:18:34] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 1 ms to minimize.
[2022-06-12 22:18:34] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 0 ms to minimize.
[2022-06-12 22:18:34] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 0 ms to minimize.
[2022-06-12 22:18:34] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 1 ms to minimize.
[2022-06-12 22:18:35] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 1 ms to minimize.
[2022-06-12 22:18:35] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 1 ms to minimize.
[2022-06-12 22:18:35] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 0 ms to minimize.
[2022-06-12 22:18:35] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:18:35] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:18:36] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:18:36] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 0 ms to minimize.
[2022-06-12 22:18:36] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:18:36] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 0 ms to minimize.
[2022-06-12 22:18:36] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:18:37] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:18:37] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-06-12 22:18:37] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:18:37] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 0 ms to minimize.
[2022-06-12 22:18:37] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 1 ms to minimize.
[2022-06-12 22:18:38] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:18:38] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 0 ms to minimize.
[2022-06-12 22:18:38] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
[2022-06-12 22:18:38] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:18:38] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
[2022-06-12 22:18:39] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:18:39] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 0 ms to minimize.
[2022-06-12 22:18:39] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 1 ms to minimize.
[2022-06-12 22:18:39] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:18:39] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 1 ms to minimize.
[2022-06-12 22:18:39] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:18:39] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:18:40] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:18:40] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:18:40] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:18:40] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2022-06-12 22:18:40] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-06-12 22:18:40] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 1 ms to minimize.
[2022-06-12 22:18:41] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:18:41] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 0 ms to minimize.
[2022-06-12 22:18:41] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7011 ms
[2022-06-12 22:18:41] [INFO ] Computed and/alt/rep : 853/1789/853 causal constraints (skipped 60 transitions) in 43 ms.
[2022-06-12 22:18:51] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 0 ms to minimize.
[2022-06-12 22:18:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-06-12 22:18:51] [INFO ] Added : 829 causal constraints over 166 iterations in 10079 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 366100 steps, including 1000 resets, run finished after 656 ms. (steps per millisecond=558 ) properties (out of 6) seen :3 could not realise parikh vector
FORMULA Peterson-PT-5-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 229500 steps, including 1000 resets, run finished after 324 ms. (steps per millisecond=708 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 265800 steps, including 1000 resets, run finished after 402 ms. (steps per millisecond=661 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 226800 steps, including 1000 resets, run finished after 340 ms. (steps per millisecond=667 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 355100 steps, including 1000 resets, run finished after 500 ms. (steps per millisecond=710 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 376300 steps, including 1000 resets, run finished after 521 ms. (steps per millisecond=722 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 6 out of 631 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 631/631 places, 1039/1039 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 631 transition count 886
Reduce places removed 153 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 155 rules applied. Total rules applied 308 place count 478 transition count 884
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 310 place count 476 transition count 884
Performed 177 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 177 Pre rules applied. Total rules applied 310 place count 476 transition count 707
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 664 place count 299 transition count 707
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 722 place count 270 transition count 678
Applied a total of 722 rules in 74 ms. Remains 270 /631 variables (removed 361) and now considering 678/1039 (removed 361) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/631 places, 678/1039 transitions.
[2022-06-12 22:18:54] [INFO ] Flatten gal took : 27 ms
[2022-06-12 22:18:54] [INFO ] Flatten gal took : 22 ms
[2022-06-12 22:18:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1857515996542664037.gal : 3 ms
[2022-06-12 22:18:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17434668981789940833.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1857515996542664037.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17434668981789940833.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1857515996542664037.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17434668981789940833.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17434668981789940833.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :19 after 37
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :37 after 93
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :93 after 173
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :173 after 551
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :551 after 2697
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2697 after 7165
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :7165 after 13509
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :13509 after 100468
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :100468 after 278000
Detected timeout of ITS tools.
[2022-06-12 22:19:09] [INFO ] Flatten gal took : 21 ms
[2022-06-12 22:19:09] [INFO ] Applying decomposition
[2022-06-12 22:19:09] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11795020497279271876.txt, -o, /tmp/graph11795020497279271876.bin, -w, /tmp/graph11795020497279271876.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11795020497279271876.bin, -l, -1, -v, -w, /tmp/graph11795020497279271876.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:19:09] [INFO ] Decomposing Gal with order
[2022-06-12 22:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:19:09] [INFO ] Removed a total of 915 redundant transitions.
[2022-06-12 22:19:09] [INFO ] Flatten gal took : 45 ms
[2022-06-12 22:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 17 ms.
[2022-06-12 22:19:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14190987559725713652.gal : 5 ms
[2022-06-12 22:19:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10104567654503701250.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14190987559725713652.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10104567654503701250.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14190987559725713652.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10104567654503701250.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10104567654503701250.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 723
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :723 after 954
Reachability property Peterson-PT-5-ReachabilityFireability-15 is true.
FORMULA Peterson-PT-5-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Peterson-PT-5-ReachabilityFireability-13 does not hold.
FORMULA Peterson-PT-5-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :954 after 1.19743e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12813887592043843042
[2022-06-12 22:19:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12813887592043843042
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12813887592043843042]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12813887592043843042] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12813887592043843042] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1493 ms. (steps per millisecond=669 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=2032 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13850627 steps, run timeout after 30001 ms. (steps per millisecond=461 ) properties seen :{}
Probabilistic random walk after 13850627 steps, saw 1979045 distinct states, run finished after 30001 ms. (steps per millisecond=461 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 22:19:57] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 270 cols
[2022-06-12 22:19:57] [INFO ] Computed 23 place invariants in 7 ms
[2022-06-12 22:19:57] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-06-12 22:19:57] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:57] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-06-12 22:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-06-12 22:19:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:57] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-06-12 22:19:57] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 22:19:57] [INFO ] [Nat]Added 230 Read/Feed constraints in 21 ms returned sat
[2022-06-12 22:19:57] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2022-06-12 22:19:57] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1157 ms
[2022-06-12 22:19:58] [INFO ] Computed and/alt/rep : 492/1548/492 causal constraints (skipped 60 transitions) in 26 ms.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 3 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2022-06-12 22:20:02] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2022-06-12 22:20:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 987 ms
[2022-06-12 22:20:02] [INFO ] Added : 380 causal constraints over 77 iterations in 3636 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 119100 steps, including 1000 resets, run finished after 169 ms. (steps per millisecond=704 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 678/678 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 677
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 269 transition count 677
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 269 transition count 675
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 267 transition count 675
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 266 transition count 674
Applied a total of 8 rules in 43 ms. Remains 266 /270 variables (removed 4) and now considering 674/678 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/270 places, 674/678 transitions.
[2022-06-12 22:20:02] [INFO ] Flatten gal took : 21 ms
[2022-06-12 22:20:02] [INFO ] Flatten gal took : 20 ms
[2022-06-12 22:20:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10874472619754711618.gal : 3 ms
[2022-06-12 22:20:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1405389974234754827.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10874472619754711618.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1405389974234754827.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10874472619754711618.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1405389974234754827.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1405389974234754827.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 102
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :102 after 211
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :211 after 423
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :423 after 728
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :728 after 3895
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3895 after 8032
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8032 after 18885
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :18885 after 96344
Detected timeout of ITS tools.
[2022-06-12 22:20:17] [INFO ] Flatten gal took : 19 ms
[2022-06-12 22:20:17] [INFO ] Applying decomposition
[2022-06-12 22:20:17] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17903241713706422610.txt, -o, /tmp/graph17903241713706422610.bin, -w, /tmp/graph17903241713706422610.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17903241713706422610.bin, -l, -1, -v, -w, /tmp/graph17903241713706422610.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:20:18] [INFO ] Decomposing Gal with order
[2022-06-12 22:20:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:20:18] [INFO ] Removed a total of 913 redundant transitions.
[2022-06-12 22:20:18] [INFO ] Flatten gal took : 57 ms
[2022-06-12 22:20:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 19 ms.
[2022-06-12 22:20:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1409467730542197918.gal : 5 ms
[2022-06-12 22:20:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3988808935050863408.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1409467730542197918.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3988808935050863408.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1409467730542197918.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3988808935050863408.prop --nowitness
Loading property file /tmp/ReachabilityCardinality3988808935050863408.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1461
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1461 after 1475
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14675490948356651728
[2022-06-12 22:20:33] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14675490948356651728
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14675490948356651728]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14675490948356651728] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14675490948356651728] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1460 ms. (steps per millisecond=684 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=1976 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 14003759 steps, run timeout after 30001 ms. (steps per millisecond=466 ) properties seen :{}
Probabilistic random walk after 14003759 steps, saw 2000892 distinct states, run finished after 30001 ms. (steps per millisecond=466 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 22:21:06] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2022-06-12 22:21:06] [INFO ] Computed 23 place invariants in 10 ms
[2022-06-12 22:21:06] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-06-12 22:21:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:06] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-06-12 22:21:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-06-12 22:21:06] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-12 22:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:06] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-06-12 22:21:06] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 22:21:06] [INFO ] [Nat]Added 230 Read/Feed constraints in 23 ms returned sat
[2022-06-12 22:21:06] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2022-06-12 22:21:06] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2022-06-12 22:21:06] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2022-06-12 22:21:06] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:21:06] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2022-06-12 22:21:06] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2022-06-12 22:21:07] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2022-06-12 22:21:07] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2022-06-12 22:21:07] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2022-06-12 22:21:07] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2022-06-12 22:21:07] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2022-06-12 22:21:07] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-06-12 22:21:07] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2022-06-12 22:21:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1012 ms
[2022-06-12 22:21:07] [INFO ] Computed and/alt/rep : 488/1544/488 causal constraints (skipped 60 transitions) in 25 ms.
[2022-06-12 22:21:09] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2022-06-12 22:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-06-12 22:21:09] [INFO ] Added : 257 causal constraints over 52 iterations in 1850 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 68000 steps, including 999 resets, run finished after 97 ms. (steps per millisecond=701 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 674/674 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 674/674 transitions.
Starting structural reductions, iteration 0 : 266/266 places, 674/674 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2022-06-12 22:21:09] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2022-06-12 22:21:09] [INFO ] Computed 23 place invariants in 2 ms
[2022-06-12 22:21:09] [INFO ] Implicit Places using invariants in 201 ms returned [230, 242, 243, 244, 245, 246]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 203 ms to find 6 implicit places.
[2022-06-12 22:21:09] [INFO ] Redundant transitions in 40 ms returned []
[2022-06-12 22:21:09] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-06-12 22:21:09] [INFO ] Computed 17 place invariants in 3 ms
[2022-06-12 22:21:09] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Starting structural reductions, iteration 1 : 260/266 places, 674/674 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2022-06-12 22:21:09] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-12 22:21:09] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-06-12 22:21:10] [INFO ] Computed 17 place invariants in 2 ms
[2022-06-12 22:21:10] [INFO ] Dead Transitions using invariants and state equation in 284 ms returned []
Finished structural reductions, in 2 iterations. Remains : 260/266 places, 674/674 transitions.
[2022-06-12 22:21:10] [INFO ] Flatten gal took : 17 ms
[2022-06-12 22:21:10] [INFO ] Flatten gal took : 17 ms
[2022-06-12 22:21:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10771886798506365245.gal : 2 ms
[2022-06-12 22:21:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4681061176634864402.prop : 30 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10771886798506365245.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4681061176634864402.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10771886798506365245.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4681061176634864402.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4681061176634864402.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 91
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :91 after 201
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :201 after 423
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :423 after 1570
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1570 after 3787
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3787 after 8803
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8803 after 18881
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :18881 after 98036
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :98036 after 215925
Detected timeout of ITS tools.
[2022-06-12 22:21:30] [INFO ] Flatten gal took : 20 ms
[2022-06-12 22:21:30] [INFO ] Applying decomposition
[2022-06-12 22:21:30] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1934023227415706195.txt, -o, /tmp/graph1934023227415706195.bin, -w, /tmp/graph1934023227415706195.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1934023227415706195.bin, -l, -1, -v, -w, /tmp/graph1934023227415706195.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:21:30] [INFO ] Decomposing Gal with order
[2022-06-12 22:21:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:21:30] [INFO ] Removed a total of 914 redundant transitions.
[2022-06-12 22:21:30] [INFO ] Flatten gal took : 41 ms
[2022-06-12 22:21:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 17 ms.
[2022-06-12 22:21:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14000565913811029616.gal : 5 ms
[2022-06-12 22:21:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9007554222181947091.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14000565913811029616.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9007554222181947091.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14000565913811029616.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9007554222181947091.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9007554222181947091.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 42884
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10416062918304336142
[2022-06-12 22:21:50] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10416062918304336142
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10416062918304336142]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10416062918304336142] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10416062918304336142] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1536 ms. (steps per millisecond=651 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13996262 steps, run timeout after 30001 ms. (steps per millisecond=466 ) properties seen :{}
Probabilistic random walk after 13996262 steps, saw 1999847 distinct states, run finished after 30001 ms. (steps per millisecond=466 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 22:22:24] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-06-12 22:22:24] [INFO ] Computed 17 place invariants in 5 ms
[2022-06-12 22:22:24] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-06-12 22:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:24] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-06-12 22:22:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:22:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-06-12 22:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:24] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-06-12 22:22:24] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 22:22:24] [INFO ] [Nat]Added 230 Read/Feed constraints in 24 ms returned sat
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 4 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1967 ms
[2022-06-12 22:22:26] [INFO ] Computed and/alt/rep : 488/1544/488 causal constraints (skipped 60 transitions) in 29 ms.
[2022-06-12 22:22:29] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:22:29] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2022-06-12 22:22:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2022-06-12 22:22:29] [INFO ] Added : 342 causal constraints over 69 iterations in 2609 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 90500 steps, including 1000 resets, run finished after 124 ms. (steps per millisecond=729 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 12 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 260/260 places, 674/674 transitions.
Starting structural reductions, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2022-06-12 22:22:29] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-06-12 22:22:29] [INFO ] Computed 17 place invariants in 3 ms
[2022-06-12 22:22:29] [INFO ] Implicit Places using invariants in 138 ms returned []
[2022-06-12 22:22:29] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-06-12 22:22:29] [INFO ] Computed 17 place invariants in 2 ms
[2022-06-12 22:22:29] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 22:22:30] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2022-06-12 22:22:30] [INFO ] Redundant transitions in 12 ms returned []
[2022-06-12 22:22:30] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-06-12 22:22:30] [INFO ] Computed 17 place invariants in 4 ms
[2022-06-12 22:22:30] [INFO ] Dead Transitions using invariants and state equation in 225 ms returned []
Finished structural reductions, in 1 iterations. Remains : 260/260 places, 674/674 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=321 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 22:22:31] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2022-06-12 22:22:31] [INFO ] Computed 17 place invariants in 2 ms
[2022-06-12 22:22:31] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2022-06-12 22:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:31] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2022-06-12 22:22:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:22:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-06-12 22:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:31] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-06-12 22:22:31] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 22:22:31] [INFO ] [Nat]Added 230 Read/Feed constraints in 23 ms returned sat
[2022-06-12 22:22:31] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2022-06-12 22:22:31] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:22:31] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2022-06-12 22:22:31] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2022-06-12 22:22:32] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-06-12 22:22:33] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2022-06-12 22:22:33] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-06-12 22:22:33] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:22:33] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2022-06-12 22:22:33] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2022-06-12 22:22:33] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2022-06-12 22:22:33] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2014 ms
[2022-06-12 22:22:33] [INFO ] Computed and/alt/rep : 488/1544/488 causal constraints (skipped 60 transitions) in 37 ms.
[2022-06-12 22:22:35] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2022-06-12 22:22:36] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2022-06-12 22:22:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2022-06-12 22:22:36] [INFO ] Added : 342 causal constraints over 69 iterations in 2640 ms. Result :sat
[2022-06-12 22:22:36] [INFO ] Flatten gal took : 22 ms
[2022-06-12 22:22:36] [INFO ] Flatten gal took : 17 ms
[2022-06-12 22:22:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8017011829813855605.gal : 2 ms
[2022-06-12 22:22:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8923907546392340554.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8017011829813855605.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8923907546392340554.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8017011829813855605.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8923907546392340554.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8923907546392340554.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 91
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :91 after 201
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :201 after 423
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :423 after 1570
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1570 after 3787
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3787 after 8803
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8803 after 18881
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :18881 after 98036
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :98036 after 215925
Detected timeout of ITS tools.
[2022-06-12 22:23:01] [INFO ] Flatten gal took : 21 ms
[2022-06-12 22:23:01] [INFO ] Applying decomposition
[2022-06-12 22:23:01] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6388693475149135279.txt, -o, /tmp/graph6388693475149135279.bin, -w, /tmp/graph6388693475149135279.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6388693475149135279.bin, -l, -1, -v, -w, /tmp/graph6388693475149135279.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:23:01] [INFO ] Decomposing Gal with order
[2022-06-12 22:23:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:23:01] [INFO ] Removed a total of 914 redundant transitions.
[2022-06-12 22:23:01] [INFO ] Flatten gal took : 57 ms
[2022-06-12 22:23:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 7 ms.
[2022-06-12 22:23:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3708137439732650077.gal : 6 ms
[2022-06-12 22:23:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15372805580935230178.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3708137439732650077.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15372805580935230178.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3708137439732650077.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15372805580935230178.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15372805580935230178.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 209
Invariant property Peterson-PT-5-ReachabilityFireability-09 does not hold.
FORMULA Peterson-PT-5-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.47167e+06,5.30822,132188,10124,473,240551,4451,1384,357179,133,28661,0
Total reachable state count : 1471673
Verifying 1 reachability properties.
Invariant property Peterson-PT-5-ReachabilityFireability-09 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-5-ReachabilityFireability-09,62,5.34652,132188,97,96,240551,4451,1396,357179,140,28661,0
All properties solved without resorting to model-checking.
BK_STOP 1655072587896
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-5"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is Peterson-PT-5, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277026700030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;