About the Execution of ITS-Tools for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11931.720 | 3600000.00 | 11140289.00 | 42769.80 | TTTTTTTTFT?FT?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200638.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200638
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.2M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.8M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 48K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 148K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 105K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 351K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 86K Mar 27 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Mar 27 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Mar 25 08:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 25 08:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.5M May 5 16:51 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-6-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1621027434783
Running Version 0
[2021-05-14 21:24:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2021-05-14 21:24:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 21:24:06] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2021-05-14 21:24:06] [INFO ] Transformed 1330 places.
[2021-05-14 21:24:06] [INFO ] Transformed 2030 transitions.
[2021-05-14 21:24:06] [INFO ] Found NUPN structural information;
[2021-05-14 21:24:06] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-6-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 13) seen :3
FORMULA Peterson-PT-6-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :1
FORMULA Peterson-PT-6-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2021-05-14 21:24:06] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 21:24:06] [INFO ] Computed 27 place invariants in 26 ms
[2021-05-14 21:24:07] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned unsat
[2021-05-14 21:24:07] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned unsat
[2021-05-14 21:24:07] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 21:24:07] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-14 21:24:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:08] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2021-05-14 21:24:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:24:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 30 ms returned sat
[2021-05-14 21:24:08] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:24:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:08] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2021-05-14 21:24:08] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:24:09] [INFO ] [Nat]Added 366 Read/Feed constraints in 108 ms returned sat
[2021-05-14 21:24:09] [INFO ] Deduced a trap composed of 146 places in 550 ms of which 4 ms to minimize.
[2021-05-14 21:24:10] [INFO ] Deduced a trap composed of 12 places in 555 ms of which 1 ms to minimize.
[2021-05-14 21:24:10] [INFO ] Deduced a trap composed of 12 places in 524 ms of which 1 ms to minimize.
[2021-05-14 21:24:11] [INFO ] Deduced a trap composed of 121 places in 508 ms of which 1 ms to minimize.
[2021-05-14 21:24:12] [INFO ] Deduced a trap composed of 118 places in 530 ms of which 2 ms to minimize.
[2021-05-14 21:24:12] [INFO ] Deduced a trap composed of 71 places in 498 ms of which 1 ms to minimize.
[2021-05-14 21:24:13] [INFO ] Deduced a trap composed of 21 places in 466 ms of which 1 ms to minimize.
[2021-05-14 21:24:13] [INFO ] Deduced a trap composed of 2 places in 659 ms of which 2 ms to minimize.
[2021-05-14 21:24:13] [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
[2021-05-14 21:24:14] [INFO ] [Real]Absence check using 20 positive place invariants in 33 ms returned sat
[2021-05-14 21:24:14] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:14] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2021-05-14 21:24:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:24:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-14 21:24:15] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:15] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2021-05-14 21:24:15] [INFO ] [Nat]Added 366 Read/Feed constraints in 97 ms returned sat
[2021-05-14 21:24:16] [INFO ] Deduced a trap composed of 191 places in 525 ms of which 1 ms to minimize.
[2021-05-14 21:24:17] [INFO ] Deduced a trap composed of 132 places in 520 ms of which 1 ms to minimize.
[2021-05-14 21:24:17] [INFO ] Deduced a trap composed of 132 places in 525 ms of which 1 ms to minimize.
[2021-05-14 21:24:18] [INFO ] Deduced a trap composed of 111 places in 508 ms of which 1 ms to minimize.
[2021-05-14 21:24:18] [INFO ] Deduced a trap composed of 125 places in 551 ms of which 1 ms to minimize.
[2021-05-14 21:24:19] [INFO ] Deduced a trap composed of 116 places in 509 ms of which 1 ms to minimize.
[2021-05-14 21:24:20] [INFO ] Deduced a trap composed of 111 places in 515 ms of which 1 ms to minimize.
[2021-05-14 21:24:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-14 21:24:20] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 21:24:20] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:20] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2021-05-14 21:24:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:24:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 21:24:21] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:21] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2021-05-14 21:24:21] [INFO ] [Nat]Added 366 Read/Feed constraints in 95 ms returned sat
[2021-05-14 21:24:22] [INFO ] Deduced a trap composed of 162 places in 530 ms of which 1 ms to minimize.
[2021-05-14 21:24:22] [INFO ] Deduced a trap composed of 53 places in 431 ms of which 1 ms to minimize.
[2021-05-14 21:24:23] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 1 ms to minimize.
[2021-05-14 21:24:23] [INFO ] Deduced a trap composed of 41 places in 420 ms of which 1 ms to minimize.
[2021-05-14 21:24:24] [INFO ] Deduced a trap composed of 41 places in 432 ms of which 0 ms to minimize.
[2021-05-14 21:24:24] [INFO ] Deduced a trap composed of 41 places in 424 ms of which 1 ms to minimize.
[2021-05-14 21:24:25] [INFO ] Deduced a trap composed of 12 places in 434 ms of which 1 ms to minimize.
[2021-05-14 21:24:25] [INFO ] Deduced a trap composed of 12 places in 432 ms of which 1 ms to minimize.
[2021-05-14 21:24:26] [INFO ] Deduced a trap composed of 12 places in 436 ms of which 0 ms to minimize.
[2021-05-14 21:24:26] [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
[2021-05-14 21:24:26] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 21:24:26] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:27] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2021-05-14 21:24:27] [INFO ] [Real]Added 366 Read/Feed constraints in 80 ms returned sat
[2021-05-14 21:24:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:24:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-14 21:24:27] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:27] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2021-05-14 21:24:28] [INFO ] [Nat]Added 366 Read/Feed constraints in 100 ms returned sat
[2021-05-14 21:24:28] [INFO ] Deduced a trap composed of 313 places in 500 ms of which 2 ms to minimize.
[2021-05-14 21:24:29] [INFO ] Deduced a trap composed of 313 places in 499 ms of which 2 ms to minimize.
[2021-05-14 21:24:29] [INFO ] Deduced a trap composed of 313 places in 493 ms of which 1 ms to minimize.
[2021-05-14 21:24:30] [INFO ] Deduced a trap composed of 325 places in 492 ms of which 1 ms to minimize.
[2021-05-14 21:24:30] [INFO ] Deduced a trap composed of 325 places in 489 ms of which 1 ms to minimize.
[2021-05-14 21:24:31] [INFO ] Deduced a trap composed of 303 places in 495 ms of which 1 ms to minimize.
[2021-05-14 21:24:31] [INFO ] Deduced a trap composed of 325 places in 508 ms of which 1 ms to minimize.
[2021-05-14 21:24:32] [INFO ] Deduced a trap composed of 325 places in 507 ms of which 1 ms to minimize.
[2021-05-14 21:24:32] [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
[2021-05-14 21:24:32] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 21:24:32] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:33] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2021-05-14 21:24:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:24:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 21:24:33] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:33] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2021-05-14 21:24:34] [INFO ] [Nat]Added 366 Read/Feed constraints in 107 ms returned sat
[2021-05-14 21:24:34] [INFO ] Deduced a trap composed of 27 places in 406 ms of which 1 ms to minimize.
[2021-05-14 21:24:34] [INFO ] Deduced a trap composed of 24 places in 408 ms of which 1 ms to minimize.
[2021-05-14 21:24:35] [INFO ] Deduced a trap composed of 24 places in 403 ms of which 5 ms to minimize.
[2021-05-14 21:24:35] [INFO ] Deduced a trap composed of 47 places in 445 ms of which 1 ms to minimize.
[2021-05-14 21:24:36] [INFO ] Deduced a trap composed of 83 places in 409 ms of which 1 ms to minimize.
[2021-05-14 21:24:36] [INFO ] Deduced a trap composed of 41 places in 405 ms of which 0 ms to minimize.
[2021-05-14 21:24:37] [INFO ] Deduced a trap composed of 47 places in 411 ms of which 1 ms to minimize.
[2021-05-14 21:24:37] [INFO ] Deduced a trap composed of 71 places in 421 ms of which 1 ms to minimize.
[2021-05-14 21:24:38] [INFO ] Deduced a trap composed of 57 places in 409 ms of which 1 ms to minimize.
[2021-05-14 21:24:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-14 21:24:38] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 21:24:38] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:24:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:39] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2021-05-14 21:24:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:24:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 21:24:39] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:39] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2021-05-14 21:24:39] [INFO ] [Nat]Added 366 Read/Feed constraints in 127 ms returned sat
[2021-05-14 21:24:40] [INFO ] Deduced a trap composed of 12 places in 524 ms of which 2 ms to minimize.
[2021-05-14 21:24:41] [INFO ] Deduced a trap composed of 12 places in 525 ms of which 1 ms to minimize.
[2021-05-14 21:24:41] [INFO ] Deduced a trap composed of 12 places in 528 ms of which 1 ms to minimize.
[2021-05-14 21:24:42] [INFO ] Deduced a trap composed of 12 places in 542 ms of which 1 ms to minimize.
[2021-05-14 21:24:42] [INFO ] Deduced a trap composed of 54 places in 520 ms of which 1 ms to minimize.
[2021-05-14 21:24:43] [INFO ] Deduced a trap composed of 53 places in 528 ms of which 1 ms to minimize.
[2021-05-14 21:24:43] [INFO ] Deduced a trap composed of 166 places in 530 ms of which 1 ms to minimize.
[2021-05-14 21:24:44] [INFO ] Deduced a trap composed of 84 places in 532 ms of which 1 ms to minimize.
[2021-05-14 21:24:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-14 21:24:44] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 21:24:44] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:45] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-14 21:24:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:24:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 21:24:45] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:24:45] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2021-05-14 21:24:46] [INFO ] [Nat]Added 366 Read/Feed constraints in 99 ms returned sat
[2021-05-14 21:24:46] [INFO ] Deduced a trap composed of 12 places in 509 ms of which 1 ms to minimize.
[2021-05-14 21:24:47] [INFO ] Deduced a trap composed of 12 places in 558 ms of which 2 ms to minimize.
[2021-05-14 21:24:47] [INFO ] Deduced a trap composed of 12 places in 566 ms of which 1 ms to minimize.
[2021-05-14 21:24:48] [INFO ] Deduced a trap composed of 50 places in 507 ms of which 1 ms to minimize.
[2021-05-14 21:24:49] [INFO ] Deduced a trap composed of 37 places in 505 ms of which 1 ms to minimize.
[2021-05-14 21:24:49] [INFO ] Deduced a trap composed of 91 places in 508 ms of which 1 ms to minimize.
[2021-05-14 21:24:50] [INFO ] Deduced a trap composed of 87 places in 503 ms of which 8 ms to minimize.
[2021-05-14 21:24:50] [INFO ] Deduced a trap composed of 88 places in 507 ms of which 1 ms to minimize.
[2021-05-14 21:24:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
FORMULA Peterson-PT-6-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Support contains 22 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1330 transition count 1474
Reduce places removed 556 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 565 rules applied. Total rules applied 1121 place count 774 transition count 1465
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1130 place count 765 transition count 1465
Performed 285 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 285 Pre rules applied. Total rules applied 1130 place count 765 transition count 1180
Deduced a syphon composed of 285 places in 1 ms
Reduce places removed 285 places and 0 transitions.
Iterating global reduction 3 with 570 rules applied. Total rules applied 1700 place count 480 transition count 1180
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1784 place count 438 transition count 1138
Applied a total of 1784 rules in 178 ms. Remains 438 /1330 variables (removed 892) and now considering 1138/2030 (removed 892) transitions.
Finished structural reductions, in 1 iterations. Remains : 438/1330 places, 1138/2030 transitions.
[2021-05-14 21:24:54] [INFO ] Flatten gal took : 123 ms
[2021-05-14 21:24:54] [INFO ] Flatten gal took : 64 ms
[2021-05-14 21:24:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7978880265629858700.gal : 30 ms
[2021-05-14 21:24:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5697720165479903232.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/ReachabilityCardinality7978880265629858700.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5697720165479903232.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/ReachabilityCardinality7978880265629858700.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5697720165479903232.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5697720165479903232.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :13 after 25
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :25 after 29
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :29 after 32
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :99 after 131
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :131 after 321
Invariant property Peterson-PT-6-ReachabilityCardinality-08 does not hold.
FORMULA Peterson-PT-6-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :321 after 578
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :578 after 1560
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1560 after 2720
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2720 after 7292
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :7292 after 12906
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :12906 after 52051
Detected timeout of ITS tools.
[2021-05-14 21:25:09] [INFO ] Flatten gal took : 55 ms
[2021-05-14 21:25:09] [INFO ] Applying decomposition
[2021-05-14 21:25:09] [INFO ] Flatten gal took : 48 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/graph10971476830247917939.txt, -o, /tmp/graph10971476830247917939.bin, -w, /tmp/graph10971476830247917939.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/graph10971476830247917939.bin, -l, -1, -v, -w, /tmp/graph10971476830247917939.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:25:11] [INFO ] Decomposing Gal with order
[2021-05-14 21:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:25:11] [INFO ] Removed a total of 1606 redundant transitions.
[2021-05-14 21:25:11] [INFO ] Flatten gal took : 167 ms
[2021-05-14 21:25:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 354 labels/synchronizations in 35 ms.
[2021-05-14 21:25:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10247415428185656559.gal : 14 ms
[2021-05-14 21:25:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11581003129247713428.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/ReachabilityCardinality10247415428185656559.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11581003129247713428.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/ReachabilityCardinality10247415428185656559.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11581003129247713428.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11581003129247713428.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :28 after 19092
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7208346653422066451
[2021-05-14 21:25:29] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7208346653422066451
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/ltsmin7208346653422066451]
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/ltsmin7208346653422066451] 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/ltsmin7208346653422066451] 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 3597 ms. (steps per millisecond=278 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 989 ms. (steps per millisecond=1011 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 6) seen :2
FORMULA Peterson-PT-6-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-6-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2021-05-14 21:25:37] [INFO ] Flow matrix only has 928 transitions (discarded 210 similar events)
// Phase 1: matrix 928 rows 438 cols
[2021-05-14 21:25:37] [INFO ] Computed 27 place invariants in 12 ms
[2021-05-14 21:25:37] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:25:37] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 21:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:25:38] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-14 21:25:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:25:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-14 21:25:38] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:25:38] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2021-05-14 21:25:38] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:25:38] [INFO ] [Nat]Added 366 Read/Feed constraints in 42 ms returned sat
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2021-05-14 21:25:38] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:25:39] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 0 ms to minimize.
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2021-05-14 21:25:40] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:25:41] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 1 ms to minimize.
[2021-05-14 21:25:46] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 0 ms to minimize.
[2021-05-14 21:25:47] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 0 ms to minimize.
[2021-05-14 21:25:47] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2021-05-14 21:25:47] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:25:47] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:25:47] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 10 ms to minimize.
[2021-05-14 21:25:48] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2021-05-14 21:25:48] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2021-05-14 21:25:48] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:25:48] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2021-05-14 21:25:48] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2021-05-14 21:25:48] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:25:49] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:25:50] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:25:50] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 12495 ms
[2021-05-14 21:25:51] [INFO ] Computed and/alt/rep : 837/2860/837 causal constraints (skipped 84 transitions) in 60 ms.
[2021-05-14 21:25:56] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:25:56] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:25:56] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:25:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 572 ms
[2021-05-14 21:25:56] [INFO ] Added : 545 causal constraints over 109 iterations in 5661 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-14 21:25:56] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:25:56] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:25:56] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-14 21:25:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:25:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 21:25:57] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:25:57] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-14 21:25:57] [INFO ] [Nat]Added 366 Read/Feed constraints in 45 ms returned sat
[2021-05-14 21:25:57] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:25:57] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:25:57] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:25:57] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:25:58] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:25:58] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:25:58] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:25:58] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:25:58] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:25:58] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:25:59] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:25:59] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:25:59] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:25:59] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:25:59] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:25:59] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:26:00] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:26:00] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:26:00] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:26:00] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:26:00] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:26:00] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:26:00] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:26:01] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:26:01] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:26:01] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:26:01] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:26:01] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:26:01] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:26:01] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:26:02] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:26:02] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:26:02] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:26:02] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:26:02] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:26:02] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:26:03] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:26:03] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:26:03] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:26:03] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2021-05-14 21:26:03] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2021-05-14 21:26:03] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2021-05-14 21:26:03] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2021-05-14 21:26:03] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 0 ms to minimize.
[2021-05-14 21:26:03] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2021-05-14 21:26:04] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:26:04] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:26:04] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 1 ms to minimize.
[2021-05-14 21:26:04] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 0 ms to minimize.
[2021-05-14 21:26:04] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 0 ms to minimize.
[2021-05-14 21:26:04] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 7433 ms
[2021-05-14 21:26:04] [INFO ] Computed and/alt/rep : 837/2860/837 causal constraints (skipped 84 transitions) in 57 ms.
[2021-05-14 21:26:10] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:26:10] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2021-05-14 21:26:11] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 3 ms to minimize.
[2021-05-14 21:26:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 456 ms
[2021-05-14 21:26:11] [INFO ] Added : 620 causal constraints over 124 iterations in 6476 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-14 21:26:11] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:26:11] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:11] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-14 21:26:11] [INFO ] [Real]Added 366 Read/Feed constraints in 39 ms returned sat
[2021-05-14 21:26:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:26:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 21:26:11] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:11] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-14 21:26:11] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:26:11] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:26:12] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:26:12] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:26:12] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:26:12] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:26:12] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:26:12] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:26:13] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:26:13] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:26:13] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:26:13] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 1 ms to minimize.
[2021-05-14 21:26:13] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:26:13] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:26:14] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:26:14] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 9 ms to minimize.
[2021-05-14 21:26:14] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:26:14] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:26:14] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:26:14] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:26:15] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:26:15] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:26:15] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:26:15] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:26:15] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:26:15] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:26:16] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:26:16] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:26:16] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:26:16] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:26:16] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:26:16] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:26:16] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:26:17] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:26:17] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:26:17] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:26:17] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:26:17] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:26:17] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:26:17] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:26:18] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:26:18] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:26:18] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:26:18] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:26:18] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:26:18] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:26:18] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:26:19] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:26:19] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:26:19] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 0 ms to minimize.
[2021-05-14 21:26:19] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:26:19] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 0 ms to minimize.
[2021-05-14 21:26:19] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 7792 ms
[2021-05-14 21:26:19] [INFO ] Computed and/alt/rep : 837/2860/837 causal constraints (skipped 84 transitions) in 56 ms.
[2021-05-14 21:26:24] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:26:24] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:26:25] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:26:25] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:26:25] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:26:25] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:26:25] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:26:25] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2021-05-14 21:26:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1530 ms
[2021-05-14 21:26:26] [INFO ] Added : 548 causal constraints over 110 iterations in 6560 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-14 21:26:26] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:26:26] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:26] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-14 21:26:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:26:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:26:26] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:26:26] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-14 21:26:26] [INFO ] [Nat]Added 366 Read/Feed constraints in 42 ms returned sat
[2021-05-14 21:26:26] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:26:27] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:26:27] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:26:27] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:26:27] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:26:27] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:26:27] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:26:28] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2021-05-14 21:26:28] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:26:28] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:26:28] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:26:28] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:26:28] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:26:28] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:26:29] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2021-05-14 21:26:29] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:26:29] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:26:29] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:26:29] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:26:29] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:26:29] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:26:30] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:26:37] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:26:37] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10671 ms
[2021-05-14 21:26:37] [INFO ] Computed and/alt/rep : 837/2860/837 causal constraints (skipped 84 transitions) in 51 ms.
[2021-05-14 21:26:43] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:26:43] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:26:44] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:26:44] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:26:44] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:26:44] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:26:44] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:26:44] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:26:45] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:26:45] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:26:45] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:26:45] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:26:45] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:26:46] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:26:46] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:26:46] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:26:46] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:26:46] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:26:47] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 8 ms to minimize.
[2021-05-14 21:26:47] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:26:47] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:26:47] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:26:47] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:26:47] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:26:48] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:26:48] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 0 ms to minimize.
[2021-05-14 21:26:48] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 0 ms to minimize.
[2021-05-14 21:26:48] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:26:48] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:26:49] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:26:49] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:26:49] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:26:49] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 0 ms to minimize.
[2021-05-14 21:26:49] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:26:49] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:26:50] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2021-05-14 21:26:50] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:26:50] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:26:50] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:26:50] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:26:50] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:26:51] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:26:51] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:26:51] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:26:51] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:26:52] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:26:53] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:26:54] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:26:55] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:26:55] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 12007 ms
[2021-05-14 21:26:55] [INFO ] Added : 667 causal constraints over 134 iterations in 18131 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 188500 steps, including 1000 resets, run finished after 612 ms. (steps per millisecond=308 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA Peterson-PT-6-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 252800 steps, including 1000 resets, run finished after 715 ms. (steps per millisecond=353 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA Peterson-PT-6-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 132200 steps, including 1000 resets, run finished after 401 ms. (steps per millisecond=329 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 221800 steps, including 1000 resets, run finished after 639 ms. (steps per millisecond=347 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 8 out of 438 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 438/438 places, 1138/1138 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 438 transition count 1128
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 428 transition count 1128
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 20 place count 428 transition count 1116
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 44 place count 416 transition count 1116
Applied a total of 44 rules in 36 ms. Remains 416 /438 variables (removed 22) and now considering 1116/1138 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/438 places, 1116/1138 transitions.
[2021-05-14 21:26:58] [INFO ] Flatten gal took : 38 ms
[2021-05-14 21:26:58] [INFO ] Flatten gal took : 38 ms
[2021-05-14 21:26:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2544400205224679138.gal : 5 ms
[2021-05-14 21:26:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9674095579922169270.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/ReachabilityCardinality2544400205224679138.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9674095579922169270.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/ReachabilityCardinality2544400205224679138.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9674095579922169270.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9674095579922169270.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 131
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :131 after 321
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :321 after 556
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :556 after 1861
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1861 after 4876
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4876 after 10276
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10276 after 50961
Detected timeout of ITS tools.
[2021-05-14 21:27:14] [INFO ] Flatten gal took : 36 ms
[2021-05-14 21:27:14] [INFO ] Applying decomposition
[2021-05-14 21:27:14] [INFO ] Flatten gal took : 39 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/graph14417296783277739133.txt, -o, /tmp/graph14417296783277739133.bin, -w, /tmp/graph14417296783277739133.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/graph14417296783277739133.bin, -l, -1, -v, -w, /tmp/graph14417296783277739133.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:27:15] [INFO ] Decomposing Gal with order
[2021-05-14 21:27:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:27:15] [INFO ] Removed a total of 1584 redundant transitions.
[2021-05-14 21:27:15] [INFO ] Flatten gal took : 100 ms
[2021-05-14 21:27:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 403 labels/synchronizations in 24 ms.
[2021-05-14 21:27:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15854989840372692251.gal : 7 ms
[2021-05-14 21:27:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17649432209128817123.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/ReachabilityCardinality15854989840372692251.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17649432209128817123.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/ReachabilityCardinality15854989840372692251.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17649432209128817123.prop --nowitness
Loading property file /tmp/ReachabilityCardinality17649432209128817123.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 67992
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :67992 after 117277
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2400679955638794895
[2021-05-14 21:27:30] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2400679955638794895
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/ltsmin2400679955638794895]
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/ltsmin2400679955638794895] 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/ltsmin2400679955638794895] 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 3017 ms. (steps per millisecond=331 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 832 ms. (steps per millisecond=1201 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 743 ms. (steps per millisecond=1345 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 7861448 steps, run timeout after 30001 ms. (steps per millisecond=262 ) properties seen :{}
Probabilistic random walk after 7861448 steps, saw 989087 distinct states, run finished after 31182 ms. (steps per millisecond=252 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-14 21:28:07] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
// Phase 1: matrix 906 rows 416 cols
[2021-05-14 21:28:07] [INFO ] Computed 27 place invariants in 4 ms
[2021-05-14 21:28:07] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:28:07] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:28:07] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-14 21:28:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:28:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:28:07] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:28:08] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-14 21:28:08] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:28:08] [INFO ] [Nat]Added 366 Read/Feed constraints in 38 ms returned sat
[2021-05-14 21:28:08] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:28:08] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:28:08] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:28:08] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:28:08] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:28:09] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:28:09] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:28:09] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:28:09] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:28:09] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:28:09] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:28:09] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:28:10] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:28:10] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:28:10] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 1 ms to minimize.
[2021-05-14 21:28:10] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:28:10] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:28:11] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:28:11] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:28:11] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:28:11] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:28:11] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:28:11] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:28:11] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:28:12] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:28:12] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:28:12] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:28:12] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:28:12] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:28:12] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:28:12] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:28:13] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:28:13] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:28:13] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:28:13] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:28:13] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:28:13] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:28:13] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:28:14] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:28:14] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:28:25] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2021-05-14 21:28:25] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:28:25] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:28:25] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:28:25] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:28:25] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:28:25] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:28:26] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:28:26] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:28:26] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:28:26] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:28:26] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2021-05-14 21:28:26] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:28:26] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2021-05-14 21:28:26] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:28:27] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:28:27] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:28:27] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:28:27] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:28:27] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:28:27] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:28:28] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:28:28] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:28:28] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:28:28] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:28:28] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:28:28] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:28:28] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:28:28] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 20848 ms
[2021-05-14 21:28:28] [INFO ] Computed and/alt/rep : 815/2838/815 causal constraints (skipped 84 transitions) in 53 ms.
[2021-05-14 21:28:34] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:28:34] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:28:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2021-05-14 21:28:34] [INFO ] Added : 532 causal constraints over 107 iterations in 5451 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-14 21:28:34] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:28:34] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:28:34] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-14 21:28:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:28:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:28:34] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:28:34] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-14 21:28:34] [INFO ] [Nat]Added 366 Read/Feed constraints in 39 ms returned sat
[2021-05-14 21:28:35] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:28:35] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:28:35] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:28:35] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:28:35] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:28:35] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:28:35] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:28:36] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:28:36] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:28:36] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:28:36] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:28:36] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:28:36] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:28:37] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:28:37] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:28:37] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:28:37] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2021-05-14 21:28:37] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:28:37] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 0 ms to minimize.
[2021-05-14 21:28:38] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:28:38] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:28:38] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:28:38] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2021-05-14 21:28:38] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:28:38] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 0 ms to minimize.
[2021-05-14 21:28:38] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2021-05-14 21:28:38] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2021-05-14 21:28:39] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:28:39] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 0 ms to minimize.
[2021-05-14 21:28:39] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:28:39] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:28:39] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:28:39] [INFO ] Deduced a trap composed of 113 places in 85 ms of which 0 ms to minimize.
[2021-05-14 21:28:39] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2021-05-14 21:28:39] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2021-05-14 21:28:39] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:28:40] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:28:40] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 1 ms to minimize.
[2021-05-14 21:28:40] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:28:40] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:28:40] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:28:40] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:28:41] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:28:41] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:28:41] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:28:41] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:28:41] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:28:41] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:28:42] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:28:42] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:28:42] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:28:42] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:28:42] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:28:42] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:28:42] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:28:43] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:28:43] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:28:43] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:28:43] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:28:43] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:28:43] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:28:43] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:28:44] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:28:44] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:28:44] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:28:44] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:28:44] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 0 ms to minimize.
[2021-05-14 21:28:44] [INFO ] Trap strengthening (SAT) tested/added 68/67 trap constraints in 9788 ms
[2021-05-14 21:28:44] [INFO ] Computed and/alt/rep : 815/2838/815 causal constraints (skipped 84 transitions) in 59 ms.
[2021-05-14 21:28:48] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:28:49] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:28:49] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:28:49] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:28:49] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:28:49] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:28:49] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:28:50] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:28:50] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:28:50] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:28:50] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2021-05-14 21:28:50] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2021-05-14 21:28:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2080 ms
[2021-05-14 21:28:50] [INFO ] Added : 469 causal constraints over 94 iterations in 6088 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 176800 steps, including 1000 resets, run finished after 648 ms. (steps per millisecond=272 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 139000 steps, including 1000 resets, run finished after 440 ms. (steps per millisecond=315 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 8 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 1116/1116 transitions.
Applied a total of 0 rules in 27 ms. Remains 416 /416 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1116/1116 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 1116/1116 transitions.
Applied a total of 0 rules in 25 ms. Remains 416 /416 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2021-05-14 21:28:52] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
// Phase 1: matrix 906 rows 416 cols
[2021-05-14 21:28:52] [INFO ] Computed 27 place invariants in 6 ms
[2021-05-14 21:28:52] [INFO ] Implicit Places using invariants in 328 ms returned [397, 398, 400, 408, 409, 410, 411]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 331 ms to find 7 implicit places.
[2021-05-14 21:28:52] [INFO ] Redundant transitions in 68 ms returned []
[2021-05-14 21:28:52] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
// Phase 1: matrix 906 rows 409 cols
[2021-05-14 21:28:52] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:28:52] [INFO ] Dead Transitions using invariants and state equation in 424 ms returned []
Starting structural reductions, iteration 1 : 409/416 places, 1116/1116 transitions.
Applied a total of 0 rules in 19 ms. Remains 409 /409 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2021-05-14 21:28:52] [INFO ] Redundant transitions in 16 ms returned []
[2021-05-14 21:28:52] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
// Phase 1: matrix 906 rows 409 cols
[2021-05-14 21:28:52] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:28:53] [INFO ] Dead Transitions using invariants and state equation in 430 ms returned []
Finished structural reductions, in 2 iterations. Remains : 409/416 places, 1116/1116 transitions.
[2021-05-14 21:28:53] [INFO ] Flatten gal took : 31 ms
[2021-05-14 21:28:53] [INFO ] Flatten gal took : 30 ms
[2021-05-14 21:28:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13961014849765425393.gal : 3 ms
[2021-05-14 21:28:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2386137911400513209.prop : 6232 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/ReachabilityCardinality13961014849765425393.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2386137911400513209.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/ReachabilityCardinality13961014849765425393.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2386137911400513209.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2386137911400513209.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 131
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :131 after 321
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :321 after 556
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :556 after 1998
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1998 after 4630
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4630 after 9952
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9952 after 54537
Detected timeout of ITS tools.
[2021-05-14 21:29:14] [INFO ] Flatten gal took : 30 ms
[2021-05-14 21:29:14] [INFO ] Applying decomposition
[2021-05-14 21:29:14] [INFO ] Flatten gal took : 30 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/graph15491196777443835141.txt, -o, /tmp/graph15491196777443835141.bin, -w, /tmp/graph15491196777443835141.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/graph15491196777443835141.bin, -l, -1, -v, -w, /tmp/graph15491196777443835141.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:29:16] [INFO ] Decomposing Gal with order
[2021-05-14 21:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:29:16] [INFO ] Removed a total of 1591 redundant transitions.
[2021-05-14 21:29:16] [INFO ] Flatten gal took : 66 ms
[2021-05-14 21:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 414 labels/synchronizations in 29 ms.
[2021-05-14 21:29:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9148185562786094448.gal : 7 ms
[2021-05-14 21:29:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9663220000164372945.prop : 1133 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/ReachabilityCardinality9148185562786094448.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9663220000164372945.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/ReachabilityCardinality9148185562786094448.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9663220000164372945.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9663220000164372945.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :21 after 15568
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15316379578419882947
[2021-05-14 21:29:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15316379578419882947
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/ltsmin15316379578419882947]
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/ltsmin15316379578419882947] 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/ltsmin15316379578419882947] 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 3019 ms. (steps per millisecond=331 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 7538376 steps, run timeout after 30001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 7538376 steps, saw 948895 distinct states, run finished after 30001 ms. (steps per millisecond=251 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-14 21:30:09] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
// Phase 1: matrix 906 rows 409 cols
[2021-05-14 21:30:09] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:30:09] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:30:09] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-14 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:30:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:30:10] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-14 21:30:10] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:30:10] [INFO ] [Nat]Added 366 Read/Feed constraints in 38 ms returned sat
[2021-05-14 21:30:10] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:30:10] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:30:10] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:30:10] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:30:10] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:30:11] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:30:11] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:30:11] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:30:11] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:30:11] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:30:11] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:30:11] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:30:12] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:30:12] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:30:12] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:30:12] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:30:12] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:30:12] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:30:12] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:30:13] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:30:13] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:30:13] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:30:13] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:30:13] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:30:13] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:30:13] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:30:14] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:30:14] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:30:14] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:30:14] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:30:14] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:30:14] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:30:14] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:30:14] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:30:15] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:30:15] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:30:15] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:30:15] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:30:15] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:30:15] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:30:15] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:30:16] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:30:16] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2021-05-14 21:30:16] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 0 ms to minimize.
[2021-05-14 21:30:16] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:30:16] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:30:16] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:30:16] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:30:17] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:30:17] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:30:17] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:30:17] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:30:17] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:30:17] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:30:17] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:30:18] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:30:18] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:30:18] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:30:18] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2021-05-14 21:30:18] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2021-05-14 21:30:18] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2021-05-14 21:30:18] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2021-05-14 21:30:19] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2021-05-14 21:30:19] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2021-05-14 21:30:19] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2021-05-14 21:30:19] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2021-05-14 21:30:19] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 0 ms to minimize.
[2021-05-14 21:30:19] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2021-05-14 21:30:19] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 9301 ms
[2021-05-14 21:30:19] [INFO ] Computed and/alt/rep : 815/2838/815 causal constraints (skipped 84 transitions) in 47 ms.
[2021-05-14 21:30:25] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:30:25] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:30:25] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:30:25] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:30:26] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:30:26] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:30:26] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:30:26] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:30:26] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2021-05-14 21:30:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1613 ms
[2021-05-14 21:30:26] [INFO ] Added : 643 causal constraints over 129 iterations in 7326 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-14 21:30:26] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:30:27] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-14 21:30:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:30:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:30:27] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-14 21:30:27] [INFO ] [Nat]Added 366 Read/Feed constraints in 39 ms returned sat
[2021-05-14 21:30:27] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:30:27] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:30:27] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:30:28] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:30:28] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:30:28] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:30:28] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:30:28] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:30:28] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:30:28] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:30:29] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:30:29] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2021-05-14 21:30:29] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2021-05-14 21:30:29] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2021-05-14 21:30:29] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:30:29] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:30:30] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:30:30] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:30:30] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:30:30] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:30:30] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:30:30] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:30:31] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:30:31] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:30:31] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:30:31] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:30:31] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:30:31] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:30:31] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:30:32] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:30:32] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:30:32] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:30:32] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:30:32] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:30:32] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:30:32] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:30:33] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:30:33] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:30:33] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:30:33] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:30:33] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:30:33] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:30:33] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:30:34] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:30:34] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 6673 ms
[2021-05-14 21:30:34] [INFO ] Computed and/alt/rep : 815/2838/815 causal constraints (skipped 84 transitions) in 49 ms.
[2021-05-14 21:30:41] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:30:42] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:30:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1841 ms
[2021-05-14 21:30:43] [INFO ] Added : 774 causal constraints over 156 iterations in 9717 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 218400 steps, including 1000 resets, run finished after 610 ms. (steps per millisecond=358 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 273100 steps, including 1000 resets, run finished after 772 ms. (steps per millisecond=353 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 8 out of 409 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 409/409 places, 1116/1116 transitions.
Applied a total of 0 rules in 17 ms. Remains 409 /409 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 409/409 places, 1116/1116 transitions.
Starting structural reductions, iteration 0 : 409/409 places, 1116/1116 transitions.
Applied a total of 0 rules in 20 ms. Remains 409 /409 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2021-05-14 21:30:45] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
// Phase 1: matrix 906 rows 409 cols
[2021-05-14 21:30:45] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-14 21:30:45] [INFO ] Implicit Places using invariants in 269 ms returned []
[2021-05-14 21:30:45] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
// Phase 1: matrix 906 rows 409 cols
[2021-05-14 21:30:45] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-14 21:30:45] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:30:51] [INFO ] Implicit Places using invariants and state equation in 5524 ms returned []
Implicit Place search using SMT with State Equation took 5795 ms to find 0 implicit places.
[2021-05-14 21:30:51] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-14 21:30:51] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
// Phase 1: matrix 906 rows 409 cols
[2021-05-14 21:30:51] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:30:51] [INFO ] Dead Transitions using invariants and state equation in 424 ms returned []
Finished structural reductions, in 1 iterations. Remains : 409/409 places, 1116/1116 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-14 21:30:51] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
// Phase 1: matrix 906 rows 409 cols
[2021-05-14 21:30:51] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:30:52] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:30:52] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-14 21:30:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:30:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:30:52] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2021-05-14 21:30:52] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:30:52] [INFO ] [Nat]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:30:52] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:30:52] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:30:52] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:30:53] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:30:54] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:30:55] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:30:56] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:30:57] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:30:58] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:30:59] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 1 ms to minimize.
[2021-05-14 21:30:59] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2021-05-14 21:30:59] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 0 ms to minimize.
[2021-05-14 21:30:59] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 0 ms to minimize.
[2021-05-14 21:30:59] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 1 ms to minimize.
[2021-05-14 21:30:59] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:00] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2021-05-14 21:31:00] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:31:00] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:31:00] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:31:00] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:31:00] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:31:01] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:31:01] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:31:01] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:31:01] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:31:01] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:31:01] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:31:01] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:31:02] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 0 ms to minimize.
[2021-05-14 21:31:02] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 0 ms to minimize.
[2021-05-14 21:31:02] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 0 ms to minimize.
[2021-05-14 21:31:02] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2021-05-14 21:31:02] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 0 ms to minimize.
[2021-05-14 21:31:02] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 9973 ms
[2021-05-14 21:31:02] [INFO ] Computed and/alt/rep : 815/2838/815 causal constraints (skipped 84 transitions) in 72 ms.
[2021-05-14 21:31:08] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:31:08] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:31:08] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:31:09] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2021-05-14 21:31:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1597 ms
[2021-05-14 21:31:10] [INFO ] Added : 643 causal constraints over 129 iterations in 7645 ms. Result :sat
[2021-05-14 21:31:10] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:31:10] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-14 21:31:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:31:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 21:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:31:10] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-14 21:31:10] [INFO ] [Nat]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:31:10] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:31:10] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:31:11] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:31:11] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:31:11] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:31:11] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:31:11] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:31:11] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:31:12] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:31:13] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:31:14] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:31:15] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:31:16] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:31:17] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 6671 ms
[2021-05-14 21:31:17] [INFO ] Computed and/alt/rep : 815/2838/815 causal constraints (skipped 84 transitions) in 59 ms.
[2021-05-14 21:31:24] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:31:24] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:31:25] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:31:25] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:31:25] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:31:25] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:31:25] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:31:25] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:31:26] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:31:26] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2021-05-14 21:31:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1850 ms
[2021-05-14 21:31:26] [INFO ] Added : 774 causal constraints over 156 iterations in 9168 ms. Result :sat
[2021-05-14 21:31:26] [INFO ] Flatten gal took : 28 ms
[2021-05-14 21:31:26] [INFO ] Flatten gal took : 28 ms
[2021-05-14 21:31:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14959609688470207140.gal : 1959 ms
[2021-05-14 21:31:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4819897558177052081.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/ReachabilityCardinality14959609688470207140.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4819897558177052081.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/ReachabilityCardinality14959609688470207140.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4819897558177052081.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4819897558177052081.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 131
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :131 after 321
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :321 after 556
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :556 after 1998
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1998 after 4630
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4630 after 9952
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9952 after 54537
Detected timeout of ITS tools.
[2021-05-14 21:31:48] [INFO ] Flatten gal took : 29 ms
[2021-05-14 21:31:48] [INFO ] Applying decomposition
[2021-05-14 21:31:48] [INFO ] Flatten gal took : 29 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/graph13518837104720939943.txt, -o, /tmp/graph13518837104720939943.bin, -w, /tmp/graph13518837104720939943.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/graph13518837104720939943.bin, -l, -1, -v, -w, /tmp/graph13518837104720939943.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:31:48] [INFO ] Decomposing Gal with order
[2021-05-14 21:31:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:31:48] [INFO ] Removed a total of 1591 redundant transitions.
[2021-05-14 21:31:48] [INFO ] Flatten gal took : 92 ms
[2021-05-14 21:31:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 413 labels/synchronizations in 19 ms.
[2021-05-14 21:31:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17895033543874882126.gal : 7 ms
[2021-05-14 21:31:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12285330597535347661.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/ReachabilityCardinality17895033543874882126.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12285330597535347661.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/ReachabilityCardinality17895033543874882126.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12285330597535347661.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12285330597535347661.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 768
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :768 after 961124
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13488989805050253248
[2021-05-14 21:32:08] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13488989805050253248
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/ltsmin13488989805050253248]
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/ltsmin13488989805050253248] 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/ltsmin13488989805050253248] 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)
Graph (trivial) has 831 edges and 409 vertex of which 265 / 409 are part of one of the 41 SCC in 6 ms
Free SCC test removed 224 places
Drop transitions removed 448 transitions
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 692 transitions.
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 34 Pre rules applied. Total rules applied 1 place count 185 transition count 390
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 68 rules applied. Total rules applied 69 place count 151 transition count 390
Performed 25 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 119 place count 126 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 126 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 1 with 31 rules applied. Total rules applied 154 place count 107 transition count 368
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 57 edges and 107 vertex of which 52 / 107 are part of one of the 7 SCC in 1 ms
Free SCC test removed 45 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 160 place count 62 transition count 363
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 52 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (complete) has 338 edges and 60 vertex of which 39 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 36 output transitions
Drop transitions removed 36 transitions
Graph (trivial) has 131 edges and 39 vertex of which 6 / 39 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 59 rules applied. Total rules applied 219 place count 36 transition count 272
Drop transitions removed 96 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 131 transitions.
Iterating post reduction 3 with 131 rules applied. Total rules applied 350 place count 36 transition count 141
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 380 place count 36 transition count 111
Graph (complete) has 126 edges and 36 vertex of which 18 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 381 place count 18 transition count 96
Drop transitions removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 456 place count 18 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 456 place count 18 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 458 place count 17 transition count 20
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 462 place count 17 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 466 place count 13 transition count 16
Applied a total of 466 rules in 40 ms. Remains 13 /409 variables (removed 396) and now considering 16/1116 (removed 1100) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 13 cols
[2021-05-14 21:32:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 21:32:10] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned sat
[2021-05-14 21:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:10] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-14 21:32:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:32:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:10] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-14 21:32:10] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 21:32:10] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-14 21:32:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:10] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 21:32:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:32:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-14 21:32:11] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-14 21:32:11] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-14 21:32:11] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
[2021-05-14 21:32:11] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin9434253462349163336
[2021-05-14 21:32:11] [INFO ] Computing symmetric may disable matrix : 1116 transitions.
[2021-05-14 21:32:11] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 21:32:11] [INFO ] Computing symmetric may enable matrix : 1116 transitions.
[2021-05-14 21:32:11] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 21:32:11] [INFO ] Flatten gal took : 66 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/graph472746969874782510.txt, -o, /tmp/graph472746969874782510.bin, -w, /tmp/graph472746969874782510.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/graph472746969874782510.bin, -l, -1, -v, -w, /tmp/graph472746969874782510.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:32:11] [INFO ] Decomposing Gal with order
[2021-05-14 21:32:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:32:11] [INFO ] Flatten gal took : 158 ms
[2021-05-14 21:32:11] [INFO ] Computing Do-Not-Accords matrix : 1116 transitions.
[2021-05-14 21:32:11] [INFO ] Removed a total of 1591 redundant transitions.
[2021-05-14 21:32:11] [INFO ] Flatten gal took : 223 ms
[2021-05-14 21:32:11] [INFO ] Input system was already deterministic with 1116 transitions.
[2021-05-14 21:32:11] [INFO ] Computation of Completed DNA matrix. took 143 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 21:32:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 411 labels/synchronizations in 21 ms.
[2021-05-14 21:32:11] [INFO ] Built C files in 633ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9434253462349163336
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/ltsmin9434253462349163336]
[2021-05-14 21:32:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13770884225624595477.gal : 32 ms
[2021-05-14 21:32:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality694312924264830638.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/ReachabilityCardinality13770884225624595477.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality694312924264830638.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/ReachabilityCardinality13770884225624595477.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality694312924264830638.prop --nowitness
Loading property file /tmp/ReachabilityCardinality694312924264830638.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 25
[2021-05-14 21:32:12] [INFO ] Ran tautology test, simplified 0 / 2 in 661 ms.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 7632
[2021-05-14 21:32:12] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-10(UNSAT) depth K=0 took 24 ms
[2021-05-14 21:32:12] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2021-05-14 21:32:12] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-10(UNSAT) depth K=1 took 2 ms
[2021-05-14 21:32:12] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-13(UNSAT) depth K=1 took 2 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 906 out of 1116 initially.
// Phase 1: matrix 906 rows 409 cols
[2021-05-14 21:32:12] [INFO ] Computed 20 place invariants in 13 ms
inv : WantSection_5_T + WantSection_5_F = 1
inv : WantSection_6_T + WantSection_6_F = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_4_2 + IsEndLoop_1_5_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_4_3 + IsEndLoop_1_2_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_5_3 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + IsEndLoop_1_5_4 + IsEndLoop_1_4_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_5 + IsEndLoop_1_0_5 + IsEndLoop_1_3_5 + IsEndLoop_1_2_5 + IsEndLoop_1_5_5 + IsEndLoop_1_4_5 + EndTurn_1_1 + EndTurn_1_2 + EndTurn_1_3 + EndTurn_1_0 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + EndTurn_1_4 + EndTurn_1_5 + BeginLoop_1_5_0 + BeginLoop_1_4_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + WantSection_1_F + TestAlone_1_1_3 + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_1 + TestTurn_1_0 + AskForSection_1_0 = 1
inv : Turn_2_0 + Turn_2_1 + Turn_2_3 + Turn_2_2 + Turn_2_4 + Turn_2_5 + Turn_2_6 = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_4_2 + IsEndLoop_4_3_2 + IsEndLoop_4_5_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_3_3 + IsEndLoop_4_2_3 + IsEndLoop_4_5_3 + IsEndLoop_4_4_3 + IsEndLoop_4_0_5 + IsEndLoop_4_3_5 + IsEndLoop_4_2_5 + IsEndLoop_4_1_5 + IsEndLoop_4_5_5 + IsEndLoop_4_4_5 + EndTurn_4_1 + EndTurn_4_2 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_5 + BeginLoop_4_1_0 + EndTurn_4_3 + EndTurn_4_4 + BeginLoop_4_4_0 + BeginLoop_4_5_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_5_1 + WantSection_4_F + TestAlone_4_1_0 + TestAlone_4_5_1 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_0 + AskForSection_4_0 = 1
inv : Turn_3_0 + Turn_3_1 + Turn_3_2 + Turn_3_4 + Turn_3_3 + Turn_3_5 + Turn_3_6 = 1
inv : WantSection_1_T + WantSection_1_F = 1
inv : Turn_4_0 + Turn_4_1 + Turn_4_2 + Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_6 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_3_1 + IsEndLoop_5_2_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_2_2 + IsEndLoop_5_3_2 + IsEndLoop_5_5_2 + IsEndLoop_5_4_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_2_4 + IsEndLoop_5_0_4 + IsEndLoop_5_1_4 + IsEndLoop_5_4_4 + IsEndLoop_5_3_4 + IsEndLoop_5_5_4 + EndTurn_5_1 + EndTurn_5_2 + EndTurn_5_0 + EndTurn_5_5 + BeginLoop_5_1_0 + BeginLoop_5_0_0 + EndTurn_5_3 + EndTurn_5_4 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + WantSection_5_F + TestAlone_5_3_2 + TestAlone_5_2_4 + TestTurn_5_5 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + AskForSection_5_0 = 1
inv : Turn_5_1 + Turn_5_0 + Turn_5_2 + Turn_5_3 + Turn_5_5 + Turn_5_4 + Turn_5_6 = 1
inv : WantSection_3_T + WantSection_3_F = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_4_1 + IsEndLoop_6_3_1 + IsEndLoop_6_5_1 + IsEndLoop_6_0_2 + IsEndLoop_6_1_2 + IsEndLoop_6_2_2 + IsEndLoop_6_3_2 + IsEndLoop_6_4_2 + IsEndLoop_6_1_3 + IsEndLoop_6_5_2 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_1_4 + IsEndLoop_6_2_4 + IsEndLoop_6_0_4 + IsEndLoop_6_4_4 + IsEndLoop_6_3_4 + IsEndLoop_6_5_4 + EndTurn_6_1 + EndTurn_6_2 + EndTurn_6_0 + EndTurn_6_5 + BeginLoop_6_0_0 + EndTurn_6_3 + EndTurn_6_4 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_2_0 + BeginLoop_6_1_0 + BeginLoop_6_3_0 + WantSection_6_F + TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + AskForSection_6_0 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_4_2 + IsEndLoop_3_5_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_4_4 + IsEndLoop_3_3_4 + IsEndLoop_3_1_5 + IsEndLoop_3_0_5 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_2_5 + IsEndLoop_3_5_5 + IsEndLoop_3_4_5 + EndTurn_3_1 + EndTurn_3_2 + EndTurn_3_0 + BeginLoop_3_0_0 + BeginLoop_3_1_0 + EndTurn_3_3 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_4_0 + BeginLoop_3_5_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + WantSection_3_F + TestAlone_3_3_6 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + TestAlone_3_5_6 + AskForSection_3_0 = 1
inv : Turn_0_0 + Turn_0_2 + Turn_0_1 + Turn_0_3 + Turn_0_4 + Turn_0_6 + Turn_0_5 = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_3_3 + IsEndLoop_2_4_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_5_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_5 + IsEndLoop_2_0_5 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_2_5 + IsEndLoop_2_5_5 + IsEndLoop_2_4_5 + EndTurn_2_1 + EndTurn_2_2 + EndTurn_2_0 + BeginLoop_2_0_0 + BeginLoop_2_1_0 + EndTurn_2_4 + EndTurn_2_3 + EndTurn_2_5 + BeginLoop_2_4_0 + BeginLoop_2_5_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + WantSection_2_F + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_1 + TestTurn_2_0 + AskForSection_2_0 = 1
inv : WantSection_4_T + WantSection_4_F = 1
inv : WantSection_2_T + WantSection_2_F = 1
inv : Turn_1_0 + Turn_1_1 + Turn_1_3 + Turn_1_2 + Turn_1_4 + Turn_1_5 + Turn_1_6 = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_5_1 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_4_2 + IsEndLoop_0_5_2 + IsEndLoop_0_1_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_0_4 + IsEndLoop_0_5_3 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + IsEndLoop_0_5_4 + IsEndLoop_0_4_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_5 + IsEndLoop_0_0_5 + IsEndLoop_0_3_5 + IsEndLoop_0_2_5 + IsEndLoop_0_5_5 + IsEndLoop_0_4_5 + EndTurn_0_1 + EndTurn_0_2 + EndTurn_0_3 + EndTurn_0_0 + BeginLoop_0_0_0 + BeginLoop_0_1_0 + EndTurn_0_4 + EndTurn_0_5 + BeginLoop_0_5_0 + BeginLoop_0_2_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + WantSection_0_F + TestAlone_0_2_2 + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_0 + TestIdentity_0_2_2 + AskForSection_0_0 = 1
Total of 20 invariants.
[2021-05-14 21:32:12] [INFO ] Computed 20 place invariants in 17 ms
[2021-05-14 21:32:12] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-10(UNSAT) depth K=2 took 570 ms
[2021-05-14 21:32:13] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-13(UNSAT) depth K=2 took 396 ms
[2021-05-14 21:32:13] [INFO ] Proved 409 variables to be positive in 1288 ms
[2021-05-14 21:32:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-10
[2021-05-14 21:32:14] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-10(SAT) depth K=0 took 169 ms
[2021-05-14 21:32:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-13
[2021-05-14 21:32:14] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-13(SAT) depth K=0 took 52 ms
[2021-05-14 21:32:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-10
[2021-05-14 21:32:15] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-10(SAT) depth K=1 took 1108 ms
[2021-05-14 21:32:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-13
[2021-05-14 21:32:16] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-13(SAT) depth K=1 took 829 ms
Compilation finished in 9297 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9434253462349163336]
Link finished in 88 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityCardinality10==true], workingDir=/tmp/ltsmin9434253462349163336]
[2021-05-14 21:32:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-10
[2021-05-14 21:32:22] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-10(SAT) depth K=2 took 6085 ms
[2021-05-14 21:32:29] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-10(UNSAT) depth K=3 took 16477 ms
[2021-05-14 21:32:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-13
[2021-05-14 21:32:38] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-13(SAT) depth K=2 took 16753 ms
[2021-05-14 21:32:52] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-13(UNSAT) depth K=3 took 22962 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7632 after 2.24923e+07
[2021-05-14 21:37:24] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-10(UNSAT) depth K=4 took 272092 ms
[2021-05-14 21:39:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-10
[2021-05-14 21:39:46] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-10(SAT) depth K=3 took 427600 ms
[2021-05-14 21:42:28] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-13(UNSAT) depth K=4 took 303343 ms
[2021-05-14 21:44:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-13
[2021-05-14 21:44:11] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-13(SAT) depth K=3 took 265219 ms
Detected timeout of ITS tools.
[2021-05-14 21:54:53] [INFO ] Applying decomposition
[2021-05-14 21:54:53] [INFO ] Flatten gal took : 78 ms
[2021-05-14 21:54:53] [INFO ] Decomposing Gal with order
[2021-05-14 21:54:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:54:54] [INFO ] Removed a total of 1591 redundant transitions.
[2021-05-14 21:54:54] [INFO ] Flatten gal took : 178 ms
[2021-05-14 21:54:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 413 labels/synchronizations in 81 ms.
[2021-05-14 21:54:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17915565586368635681.gal : 2433 ms
[2021-05-14 21:54:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1460313279312221202.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/ReachabilityCardinality17915565586368635681.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1460313279312221202.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/ReachabilityCardinality17915565586368635681.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1460313279312221202.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1460313279312221202.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1552
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1552 after 1.56454e+06
[2021-05-14 22:00:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-10
[2021-05-14 22:00:48] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-10(SAT) depth K=4 took 996746 ms
[2021-05-14 22:01:18] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityCardinality-10(UNSAT) depth K=5 took 1130343 ms
WARNING : LTSmin timed out (>1800 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityCardinality10==true], workingDir=/tmp/ltsmin9434253462349163336]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityCardinality13==true], workingDir=/tmp/ltsmin9434253462349163336]
[2021-05-14 22:08:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-13
[2021-05-14 22:08:05] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-13(SAT) depth K=4 took 437211 ms
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1.56454e+06 after 1.0285e+07
Detected timeout of ITS tools.
[2021-05-14 22:17:38] [INFO ] Flatten gal took : 90 ms
[2021-05-14 22:17:38] [INFO ] Input system was already deterministic with 1116 transitions.
[2021-05-14 22:17:38] [INFO ] Transformed 409 places.
[2021-05-14 22:17:38] [INFO ] Transformed 1116 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 22:17:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13173177045175432422.gal : 3 ms
[2021-05-14 22:17:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9775116664717771607.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/ReachabilityCardinality13173177045175432422.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9775116664717771607.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --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/ReachabilityCardinality13173177045175432422.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9775116664717771607.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality9775116664717771607.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 26
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :26 after 34
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 37
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :37 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 417
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :417 after 561
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :561 after 690
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :690 after 11494
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :11494 after 14935
[2021-05-14 22:19:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityCardinality-10
[2021-05-14 22:19:16] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityCardinality-10(SAT) depth K=5 took 670900 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14935 after 209137
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :209137 after 419717
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-6"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-6, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128200638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;