About the Execution of ITS-Tools for JoinFreeModules-PT-1000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11422.283 | 3600000.00 | 7313818.00 | 6503.20 | ?TFFFTFF?F??FFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820600212.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-1000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820600212
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 7.7K Apr 30 02:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 30 02:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 02:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 02:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.1M May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652756034689
Running Version 202205111006
[2022-05-17 02:53:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 02:53:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 02:53:56] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2022-05-17 02:53:56] [INFO ] Transformed 5001 places.
[2022-05-17 02:53:56] [INFO ] Transformed 8001 transitions.
[2022-05-17 02:53:56] [INFO ] Parsed PT model containing 5001 places and 8001 transitions in 477 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-1000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 551 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:53:57] [INFO ] Computed 1000 place invariants in 53 ms
[2022-05-17 02:54:01] [INFO ] Dead Transitions using invariants and state equation in 4721 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:54:01] [INFO ] Computed 1000 place invariants in 25 ms
[2022-05-17 02:54:02] [INFO ] Implicit Places using invariants in 958 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:54:02] [INFO ] Computed 1000 place invariants in 29 ms
[2022-05-17 02:54:03] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:54:03] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 02:54:08] [INFO ] Dead Transitions using invariants and state equation in 4585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Support contains 32 out of 5000 places after structural reductions.
[2022-05-17 02:54:08] [INFO ] Flatten gal took : 432 ms
[2022-05-17 02:54:09] [INFO ] Flatten gal took : 227 ms
[2022-05-17 02:54:09] [INFO ] Input system was already deterministic with 8001 transitions.
Support contains 31 out of 5000 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10516 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=20 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Probabilistic random walk after 28039 steps, saw 28021 distinct states, run finished after 3055 ms. (steps per millisecond=9 ) properties seen :2
Running SMT prover for 27 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:54:14] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 02:54:17] [INFO ] [Real]Absence check using 1000 positive place invariants in 254 ms returned sat
[2022-05-17 02:54:21] [INFO ] After 7091ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2022-05-17 02:54:24] [INFO ] [Nat]Absence check using 1000 positive place invariants in 286 ms returned sat
[2022-05-17 02:54:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 02:54:46] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 29 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 145 are kept as prefixes of interest. Removing 4855 places using SCC suffix rule.20 ms
Discarding 4855 places :
Also discarding 7768 output transitions
Drop transitions removed 7768 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 145 transition count 232
Applied a total of 2 rules in 61 ms. Remains 145 /5000 variables (removed 4855) and now considering 232/8001 (removed 7769) transitions.
// Phase 1: matrix 232 rows 145 cols
[2022-05-17 02:54:46] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-17 02:54:47] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/5000 places, 232/8001 transitions.
Incomplete random walk after 10016 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=589 ) properties (out of 27) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :1
Running SMT prover for 12 properties.
// Phase 1: matrix 232 rows 145 cols
[2022-05-17 02:54:47] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-17 02:54:47] [INFO ] [Real]Absence check using 29 positive place invariants in 7 ms returned sat
[2022-05-17 02:54:47] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-17 02:54:47] [INFO ] [Nat]Absence check using 29 positive place invariants in 4 ms returned sat
[2022-05-17 02:54:48] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-17 02:54:48] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-05-17 02:54:48] [INFO ] After 151ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2022-05-17 02:54:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 7 ms to minimize.
[2022-05-17 02:54:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-17 02:54:48] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 179 ms.
[2022-05-17 02:54:48] [INFO ] After 1074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Finished Parikh walk after 133 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Parikh walk visited 12 properties in 3933 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&G(X((!(F(p1)&&p0) U G(p1))))))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 404 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:54:53] [INFO ] Computed 1000 place invariants in 25 ms
[2022-05-17 02:54:58] [INFO ] Dead Transitions using invariants and state equation in 4615 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:54:58] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 02:54:59] [INFO ] Implicit Places using invariants in 853 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:54:59] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 02:54:59] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:54:59] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 02:55:04] [INFO ] Dead Transitions using invariants and state equation in 4701 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p1:(GEQ s1342 2), p0:(GEQ s3642 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 20490 steps with 0 reset in 10006 ms.
Product exploration timeout after 19720 steps with 0 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10516 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Probabilistic random walk after 39067 steps, saw 39040 distinct states, run finished after 3014 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:55:30] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 02:55:31] [INFO ] [Real]Absence check using 1000 positive place invariants in 228 ms returned sat
[2022-05-17 02:55:35] [INFO ] After 5484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 02:55:36] [INFO ] [Nat]Absence check using 1000 positive place invariants in 239 ms returned sat
[2022-05-17 02:56:00] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.5 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 23 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 02:56:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 02:56:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 2205 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=735 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 236 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:56:01] [INFO ] Computed 1000 place invariants in 22 ms
[2022-05-17 02:56:06] [INFO ] Dead Transitions using invariants and state equation in 4774 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:56:06] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 02:56:07] [INFO ] Implicit Places using invariants in 698 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:56:07] [INFO ] Computed 1000 place invariants in 20 ms
[2022-05-17 02:56:07] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:56:07] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 02:56:13] [INFO ] Dead Transitions using invariants and state equation in 5293 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Probabilistic random walk after 39067 steps, saw 39040 distinct states, run finished after 3024 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:56:18] [INFO ] Computed 1000 place invariants in 19 ms
[2022-05-17 02:56:19] [INFO ] [Real]Absence check using 1000 positive place invariants in 254 ms returned sat
[2022-05-17 02:56:24] [INFO ] After 5935ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 02:56:25] [INFO ] [Nat]Absence check using 1000 positive place invariants in 336 ms returned sat
[2022-05-17 02:56:49] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.6 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 23 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 02:56:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 02:56:49] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 1002 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration timeout after 20550 steps with 0 reset in 10002 ms.
Product exploration timeout after 20070 steps with 0 reset in 10007 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 804 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:57:11] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 02:57:16] [INFO ] Dead Transitions using invariants and state equation in 5140 ms found 0 transitions.
[2022-05-17 02:57:17] [INFO ] Redundant transitions in 879 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:57:17] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 02:57:22] [INFO ] Dead Transitions using invariants and state equation in 4601 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Product exploration timeout after 20480 steps with 0 reset in 10004 ms.
Product exploration timeout after 19620 steps with 0 reset in 10004 ms.
Built C files in :
/tmp/ltsmin3829386379524474182
[2022-05-17 02:57:42] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3829386379524474182
Running compilation step : cd /tmp/ltsmin3829386379524474182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3829386379524474182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3829386379524474182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 242 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:57:45] [INFO ] Computed 1000 place invariants in 36 ms
[2022-05-17 02:57:54] [INFO ] Dead Transitions using invariants and state equation in 8555 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:57:54] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 02:57:55] [INFO ] Implicit Places using invariants in 1630 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:57:55] [INFO ] Computed 1000 place invariants in 20 ms
[2022-05-17 02:57:56] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:57:56] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 02:58:05] [INFO ] Dead Transitions using invariants and state equation in 8582 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Built C files in :
/tmp/ltsmin3078790252109288989
[2022-05-17 02:58:05] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3078790252109288989
Running compilation step : cd /tmp/ltsmin3078790252109288989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3078790252109288989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3078790252109288989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 02:58:09] [INFO ] Flatten gal took : 515 ms
[2022-05-17 02:58:09] [INFO ] Flatten gal took : 201 ms
[2022-05-17 02:58:09] [INFO ] Time to serialize gal into /tmp/LTL17739045755161348744.gal : 32 ms
[2022-05-17 02:58:09] [INFO ] Time to serialize properties into /tmp/LTL1821121122351979677.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17739045755161348744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1821121122351979677.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1773904...267
Read 1 LTL properties
Checking formula 0 : !(((X(X("(p3643>=2)")))&&(G(X((!((F("(p1343>=2)"))&&("(p3643>=2)")))U(G("(p1343>=2)")))))))
Formula 0 simplified : !(XX"(p3643>=2)" & GX(!("(p3643>=2)" & F"(p1343>=2)") U G"(p1343>=2)"))
Detected timeout of ITS tools.
[2022-05-17 02:58:25] [INFO ] Flatten gal took : 184 ms
[2022-05-17 02:58:25] [INFO ] Applying decomposition
[2022-05-17 02:58:25] [INFO ] Flatten gal took : 195 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4475916065814565605.txt' '-o' '/tmp/graph4475916065814565605.bin' '-w' '/tmp/graph4475916065814565605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4475916065814565605.bin' '-l' '-1' '-v' '-w' '/tmp/graph4475916065814565605.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:58:26] [INFO ] Decomposing Gal with order
[2022-05-17 02:58:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:58:27] [INFO ] Flatten gal took : 258 ms
[2022-05-17 02:58:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 225 ms.
[2022-05-17 02:58:27] [INFO ] Time to serialize gal into /tmp/LTL8177794396201502603.gal : 49 ms
[2022-05-17 02:58:27] [INFO ] Time to serialize properties into /tmp/LTL11472159550546837918.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8177794396201502603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11472159550546837918.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8177794...246
Read 1 LTL properties
Checking formula 0 : !(((X(X("(u728.p3643>=2)")))&&(G(X((!((F("(u268.p1343>=2)"))&&("(u728.p3643>=2)")))U(G("(u268.p1343>=2)")))))))
Formula 0 simplified : !(XX"(u728.p3643>=2)" & GX(!("(u728.p3643>=2)" & F"(u268.p1343>=2)") U G"(u268.p1343>=2)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16078355253822286480
[2022-05-17 02:58:42] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16078355253822286480
Running compilation step : cd /tmp/ltsmin16078355253822286480;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16078355253822286480;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16078355253822286480;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property JoinFreeModules-PT-1000-LTLFireability-00 finished in 232653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||p1||(G(p2)&&p0))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 235 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:58:46] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 02:58:51] [INFO ] Dead Transitions using invariants and state equation in 5856 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:58:52] [INFO ] Computed 1000 place invariants in 20 ms
[2022-05-17 02:58:53] [INFO ] Implicit Places using invariants in 1353 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:58:53] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 02:58:54] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 2502 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:58:54] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 02:59:02] [INFO ] Dead Transitions using invariants and state equation in 8142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 415 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(LT s2628 3), p0:(LT s1230 5), p2:(LT s2173 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 55820 steps with 27910 reset in 10001 ms.
Product exploration timeout after 55510 steps with 27755 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-1000-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-1000-LTLFireability-01 finished in 37547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 248 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:23] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 02:59:28] [INFO ] Dead Transitions using invariants and state equation in 4471 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:28] [INFO ] Computed 1000 place invariants in 19 ms
[2022-05-17 02:59:28] [INFO ] Implicit Places using invariants in 752 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:28] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 02:59:29] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:29] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 02:59:34] [INFO ] Dead Transitions using invariants and state equation in 4489 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s4093 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7022 steps with 0 reset in 2608 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-02 finished in 13444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X((X(p1)&&p0))))))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 235 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:37] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 02:59:41] [INFO ] Dead Transitions using invariants and state equation in 4650 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:41] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 02:59:42] [INFO ] Implicit Places using invariants in 627 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:42] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 02:59:43] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:43] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 02:59:47] [INFO ] Dead Transitions using invariants and state equation in 4471 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s2087 2) (GEQ s2635 5)), p1:(GEQ s2087 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-03 finished in 10840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U (F(p1) U p2))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 252 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:48] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 02:59:52] [INFO ] Dead Transitions using invariants and state equation in 4444 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:52] [INFO ] Computed 1000 place invariants in 15 ms
[2022-05-17 02:59:53] [INFO ] Implicit Places using invariants in 706 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:53] [INFO ] Computed 1000 place invariants in 21 ms
[2022-05-17 02:59:53] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 02:59:53] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 02:59:58] [INFO ] Dead Transitions using invariants and state equation in 4565 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s1142 1), p0:(AND (GEQ s1142 1) (GEQ s2604 5)), p1:(GEQ s968 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 59580 steps with 29790 reset in 10001 ms.
Product exploration timeout after 57470 steps with 28735 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p0)))
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-1000-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-1000-LTLFireability-05 finished in 31261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 635 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:19] [INFO ] Computed 1000 place invariants in 24 ms
[2022-05-17 03:00:24] [INFO ] Dead Transitions using invariants and state equation in 4447 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:24] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 03:00:24] [INFO ] Implicit Places using invariants in 610 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:24] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:00:25] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
[2022-05-17 03:00:26] [INFO ] Redundant transitions in 686 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:26] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 03:00:30] [INFO ] Dead Transitions using invariants and state equation in 4482 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3630 3) (GEQ s4718 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-06 finished in 11648 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((F(p1)||p1)))&&p0)))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 233 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:30] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:00:35] [INFO ] Dead Transitions using invariants and state equation in 4517 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:35] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:00:36] [INFO ] Implicit Places using invariants in 603 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:36] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:00:36] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:36] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:00:41] [INFO ] Dead Transitions using invariants and state equation in 4503 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s1773 4) (GEQ s76 2)), p1:(LT s1773 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-07 finished in 10636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(G(X((F(p0)&&(G(!p0)||p1)))))))))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 658 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:41] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:00:47] [INFO ] Dead Transitions using invariants and state equation in 5122 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:47] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:00:47] [INFO ] Implicit Places using invariants in 634 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:47] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:00:48] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
[2022-05-17 03:00:49] [INFO ] Redundant transitions in 886 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:49] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:00:53] [INFO ] Dead Transitions using invariants and state equation in 4440 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(LT s1474 5), p0:(GEQ s4887 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 19900 steps with 0 reset in 10001 ms.
Product exploration timeout after 19430 steps with 0 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Incomplete random walk after 10019 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Probabilistic random walk after 104206 steps, saw 104127 distinct states, run finished after 9083 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:01:26] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:01:27] [INFO ] [Real]Absence check using 1000 positive place invariants in 245 ms returned sat
[2022-05-17 03:01:32] [INFO ] After 5612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 03:01:33] [INFO ] [Nat]Absence check using 1000 positive place invariants in 241 ms returned sat
[2022-05-17 03:01:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:01:57] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.2 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 17 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:01:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 03:01:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 1103 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=367 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 415 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 671 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:01:58] [INFO ] Computed 1000 place invariants in 19 ms
[2022-05-17 03:02:03] [INFO ] Dead Transitions using invariants and state equation in 4710 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:02:03] [INFO ] Computed 1000 place invariants in 43 ms
[2022-05-17 03:02:03] [INFO ] Implicit Places using invariants in 738 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:02:03] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:02:04] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2022-05-17 03:02:05] [INFO ] Redundant transitions in 895 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:02:05] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:02:10] [INFO ] Dead Transitions using invariants and state equation in 4987 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Probabilistic random walk after 103206 steps, saw 103127 distinct states, run finished after 9046 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:02:23] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:02:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2022-05-17 03:02:29] [INFO ] After 5821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 03:02:30] [INFO ] [Nat]Absence check using 1000 positive place invariants in 256 ms returned sat
[2022-05-17 03:02:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:02:54] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.1 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 12 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:02:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 03:02:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 3261 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=1630 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Product exploration timeout after 20420 steps with 0 reset in 10004 ms.
Product exploration timeout after 19890 steps with 0 reset in 10002 ms.
Built C files in :
/tmp/ltsmin4029405003962359338
[2022-05-17 03:03:15] [INFO ] Too many transitions (8001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:03:15] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4029405003962359338
Running compilation step : cd /tmp/ltsmin4029405003962359338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4029405003962359338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4029405003962359338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 657 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:03:18] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 03:03:23] [INFO ] Dead Transitions using invariants and state equation in 4916 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:03:23] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:03:24] [INFO ] Implicit Places using invariants in 713 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:03:24] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 03:03:25] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2022-05-17 03:03:25] [INFO ] Redundant transitions in 897 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:03:26] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:03:30] [INFO ] Dead Transitions using invariants and state equation in 4732 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Built C files in :
/tmp/ltsmin12770669578958525977
[2022-05-17 03:03:30] [INFO ] Too many transitions (8001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:03:30] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12770669578958525977
Running compilation step : cd /tmp/ltsmin12770669578958525977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12770669578958525977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12770669578958525977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 03:03:34] [INFO ] Flatten gal took : 228 ms
[2022-05-17 03:03:34] [INFO ] Flatten gal took : 171 ms
[2022-05-17 03:03:34] [INFO ] Time to serialize gal into /tmp/LTL429508969841510918.gal : 27 ms
[2022-05-17 03:03:34] [INFO ] Time to serialize properties into /tmp/LTL15353445626870625066.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL429508969841510918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15353445626870625066.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4295089...266
Read 1 LTL properties
Checking formula 0 : !((G(F(X(F(G(X((F("(p4888>=1)"))&&((G("(p4888<1)"))||("(p1475<5)"))))))))))
Formula 0 simplified : !GFXFGX(F"(p4888>=1)" & ("(p1475<5)" | G"(p4888<1)"))
Detected timeout of ITS tools.
[2022-05-17 03:03:49] [INFO ] Flatten gal took : 168 ms
[2022-05-17 03:03:49] [INFO ] Applying decomposition
[2022-05-17 03:03:49] [INFO ] Flatten gal took : 164 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11472561807739531209.txt' '-o' '/tmp/graph11472561807739531209.bin' '-w' '/tmp/graph11472561807739531209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11472561807739531209.bin' '-l' '-1' '-v' '-w' '/tmp/graph11472561807739531209.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:03:50] [INFO ] Decomposing Gal with order
[2022-05-17 03:03:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:03:51] [INFO ] Flatten gal took : 201 ms
[2022-05-17 03:03:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 59 ms.
[2022-05-17 03:03:51] [INFO ] Time to serialize gal into /tmp/LTL7380185485565516026.gal : 23 ms
[2022-05-17 03:03:51] [INFO ] Time to serialize properties into /tmp/LTL5703818340536544572.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7380185485565516026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5703818340536544572.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7380185...245
Read 1 LTL properties
Checking formula 0 : !((G(F(X(F(G(X((F("(u977.p4888>=1)"))&&((G("(u977.p4888<1)"))||("(u294.p1475<5)"))))))))))
Formula 0 simplified : !GFXFGX(F"(u977.p4888>=1)" & ("(u294.p1475<5)" | G"(u977.p4888<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17266080607121219614
[2022-05-17 03:04:06] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17266080607121219614
Running compilation step : cd /tmp/ltsmin17266080607121219614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17266080607121219614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17266080607121219614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property JoinFreeModules-PT-1000-LTLFireability-08 finished in 208044 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 710 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:04:10] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 03:04:14] [INFO ] Dead Transitions using invariants and state equation in 4684 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:04:14] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:04:15] [INFO ] Implicit Places using invariants in 701 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:04:15] [INFO ] Computed 1000 place invariants in 19 ms
[2022-05-17 03:04:16] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2022-05-17 03:04:17] [INFO ] Redundant transitions in 895 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:04:17] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 03:04:22] [INFO ] Dead Transitions using invariants and state equation in 5724 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3901 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-09 finished in 13601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||G(G(p1))||p2)))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 695 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:04:23] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:04:28] [INFO ] Dead Transitions using invariants and state equation in 4882 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:04:28] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:04:29] [INFO ] Implicit Places using invariants in 696 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:04:29] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:04:29] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
[2022-05-17 03:04:30] [INFO ] Redundant transitions in 913 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:04:30] [INFO ] Computed 1000 place invariants in 15 ms
[2022-05-17 03:04:35] [INFO ] Dead Transitions using invariants and state equation in 4927 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LT s4290 5), p1:(LT s3422 2), p0:(LT s940 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 19980 steps with 0 reset in 10007 ms.
Product exploration timeout after 19530 steps with 0 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10519 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Probabilistic random walk after 70131 steps, saw 70081 distinct states, run finished after 6076 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:05:05] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 03:05:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 239 ms returned sat
[2022-05-17 03:05:10] [INFO ] After 5424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 03:05:11] [INFO ] [Nat]Absence check using 1000 positive place invariants in 255 ms returned sat
[2022-05-17 03:05:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:05:35] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 15 are kept as prefixes of interest. Removing 4985 places using SCC suffix rule.2 ms
Discarding 4985 places :
Also discarding 7976 output transitions
Drop transitions removed 7976 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 24
Applied a total of 2 rules in 17 ms. Remains 15 /5000 variables (removed 4985) and now considering 24/8001 (removed 7977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 03:05:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 03:05:35] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/5000 places, 24/8001 transitions.
Finished random walk after 3208 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=1604 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 583 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:05:36] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 03:05:41] [INFO ] Dead Transitions using invariants and state equation in 4838 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:05:41] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:05:42] [INFO ] Implicit Places using invariants in 720 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:05:42] [INFO ] Computed 1000 place invariants in 15 ms
[2022-05-17 03:05:43] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
[2022-05-17 03:05:44] [INFO ] Redundant transitions in 891 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:05:44] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:05:48] [INFO ] Dead Transitions using invariants and state equation in 4680 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Probabilistic random walk after 80155 steps, saw 80096 distinct states, run finished after 6014 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:05:57] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 03:05:58] [INFO ] [Real]Absence check using 1000 positive place invariants in 247 ms returned sat
[2022-05-17 03:06:03] [INFO ] After 5187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 03:06:04] [INFO ] [Nat]Absence check using 1000 positive place invariants in 240 ms returned sat
[2022-05-17 03:06:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:06:28] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 15 are kept as prefixes of interest. Removing 4985 places using SCC suffix rule.3 ms
Discarding 4985 places :
Also discarding 7976 output transitions
Drop transitions removed 7976 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 24
Applied a total of 2 rules in 12 ms. Remains 15 /5000 variables (removed 4985) and now considering 24/8001 (removed 7977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 03:06:28] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 03:06:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/5000 places, 24/8001 transitions.
Finished random walk after 2599 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=433 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 282 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 20020 steps with 0 reset in 10002 ms.
Product exploration timeout after 19410 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin11962280944119285185
[2022-05-17 03:06:48] [INFO ] Too many transitions (8001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:06:48] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11962280944119285185
Running compilation step : cd /tmp/ltsmin11962280944119285185;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11962280944119285185;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11962280944119285185;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 665 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:06:52] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 03:06:57] [INFO ] Dead Transitions using invariants and state equation in 4613 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:06:57] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 03:06:57] [INFO ] Implicit Places using invariants in 697 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:06:57] [INFO ] Computed 1000 place invariants in 19 ms
[2022-05-17 03:06:58] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2022-05-17 03:06:59] [INFO ] Redundant transitions in 690 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:06:59] [INFO ] Computed 1000 place invariants in 19 ms
[2022-05-17 03:07:03] [INFO ] Dead Transitions using invariants and state equation in 4682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Built C files in :
/tmp/ltsmin1778296585899097517
[2022-05-17 03:07:03] [INFO ] Too many transitions (8001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:07:04] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1778296585899097517
Running compilation step : cd /tmp/ltsmin1778296585899097517;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1778296585899097517;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1778296585899097517;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 03:07:07] [INFO ] Flatten gal took : 176 ms
[2022-05-17 03:07:07] [INFO ] Flatten gal took : 196 ms
[2022-05-17 03:07:07] [INFO ] Time to serialize gal into /tmp/LTL14067290754758233219.gal : 20 ms
[2022-05-17 03:07:07] [INFO ] Time to serialize properties into /tmp/LTL7216680888004326718.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14067290754758233219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7216680888004326718.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1406729...267
Read 1 LTL properties
Checking formula 0 : !((G(((F(G("(p941<3)")))||(G(G("(p3423<2)"))))||("(p4291<5)"))))
Formula 0 simplified : !G("(p4291<5)" | FG"(p941<3)" | G"(p3423<2)")
Detected timeout of ITS tools.
[2022-05-17 03:07:22] [INFO ] Flatten gal took : 181 ms
[2022-05-17 03:07:22] [INFO ] Applying decomposition
[2022-05-17 03:07:22] [INFO ] Flatten gal took : 185 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10071383422795464472.txt' '-o' '/tmp/graph10071383422795464472.bin' '-w' '/tmp/graph10071383422795464472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10071383422795464472.bin' '-l' '-1' '-v' '-w' '/tmp/graph10071383422795464472.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:07:23] [INFO ] Decomposing Gal with order
[2022-05-17 03:07:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:07:24] [INFO ] Flatten gal took : 171 ms
[2022-05-17 03:07:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 166 ms.
[2022-05-17 03:07:24] [INFO ] Time to serialize gal into /tmp/LTL12653548303650955091.gal : 18 ms
[2022-05-17 03:07:24] [INFO ] Time to serialize properties into /tmp/LTL3905485268991183857.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12653548303650955091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3905485268991183857.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1265354...246
Read 1 LTL properties
Checking formula 0 : !((G(((F(G("(u188.p941<3)")))||(G(G("(u684.p3423<2)"))))||("(u858.p4291<5)"))))
Formula 0 simplified : !G("(u858.p4291<5)" | FG"(u188.p941<3)" | G"(u684.p3423<2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11952056539026299499
[2022-05-17 03:07:39] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11952056539026299499
Running compilation step : cd /tmp/ltsmin11952056539026299499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11952056539026299499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11952056539026299499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property JoinFreeModules-PT-1000-LTLFireability-10 finished in 199565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(!(!(X(p0)||p1) U G(p1)))&&p2)))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 272 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:07:42] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:07:47] [INFO ] Dead Transitions using invariants and state equation in 4561 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:07:47] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:07:47] [INFO ] Implicit Places using invariants in 639 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:07:47] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:07:48] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:07:48] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 03:07:53] [INFO ] Dead Transitions using invariants and state equation in 4563 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND p1 (NOT p0)), p1, (OR (NOT p2) p1)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GEQ s2815 3), p0:(GEQ s4593 4), p2:(GEQ s4607 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 29080 steps with 5 reset in 10005 ms.
Product exploration timeout after 24310 steps with 3 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1))), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 506 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Probabilistic random walk after 40067 steps, saw 40040 distinct states, run finished after 3022 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:08:19] [INFO ] Computed 1000 place invariants in 15 ms
[2022-05-17 03:08:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 251 ms returned sat
[2022-05-17 03:08:25] [INFO ] After 6072ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 03:08:26] [INFO ] [Nat]Absence check using 1000 positive place invariants in 250 ms returned sat
[2022-05-17 03:08:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:08:50] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.2 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 9 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:08:50] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 03:08:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 1629 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1629 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1))), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 2 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 238 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:08:50] [INFO ] Computed 1000 place invariants in 20 ms
[2022-05-17 03:08:55] [INFO ] Dead Transitions using invariants and state equation in 4452 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:08:55] [INFO ] Computed 1000 place invariants in 15 ms
[2022-05-17 03:08:56] [INFO ] Implicit Places using invariants in 653 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:08:56] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 03:08:56] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:08:56] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 03:09:01] [INFO ] Dead Transitions using invariants and state equation in 4447 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Probabilistic random walk after 41071 steps, saw 41042 distinct states, run finished after 3033 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:09:06] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:09:07] [INFO ] [Real]Absence check using 1000 positive place invariants in 243 ms returned sat
[2022-05-17 03:09:12] [INFO ] After 5717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 03:09:13] [INFO ] [Nat]Absence check using 1000 positive place invariants in 242 ms returned sat
[2022-05-17 03:09:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:09:37] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.1 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 9 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:09:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 03:09:37] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 1629 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=814 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 95 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration timeout after 21910 steps with 1 reset in 10003 ms.
Product exploration timeout after 25480 steps with 3 reset in 10001 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 105 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 592 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:09:58] [INFO ] Computed 1000 place invariants in 20 ms
[2022-05-17 03:10:03] [INFO ] Dead Transitions using invariants and state equation in 4506 ms found 0 transitions.
[2022-05-17 03:10:03] [INFO ] Redundant transitions in 669 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:10:03] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:10:08] [INFO ] Dead Transitions using invariants and state equation in 4485 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Product exploration timeout after 19830 steps with 0 reset in 10006 ms.
Product exploration timeout after 19240 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin8162314226247181081
[2022-05-17 03:10:28] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8162314226247181081
Running compilation step : cd /tmp/ltsmin8162314226247181081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8162314226247181081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8162314226247181081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 342 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:10:31] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:10:37] [INFO ] Dead Transitions using invariants and state equation in 5708 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:10:37] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:10:38] [INFO ] Implicit Places using invariants in 672 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:10:38] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:10:38] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:10:38] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:10:43] [INFO ] Dead Transitions using invariants and state equation in 4652 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Built C files in :
/tmp/ltsmin12345728490197275758
[2022-05-17 03:10:43] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12345728490197275758
Running compilation step : cd /tmp/ltsmin12345728490197275758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12345728490197275758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12345728490197275758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 03:10:46] [INFO ] Flatten gal took : 163 ms
[2022-05-17 03:10:47] [INFO ] Flatten gal took : 172 ms
[2022-05-17 03:10:47] [INFO ] Time to serialize gal into /tmp/LTL714018041092287464.gal : 16 ms
[2022-05-17 03:10:47] [INFO ] Time to serialize properties into /tmp/LTL17639456233871977810.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL714018041092287464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17639456233871977810.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7140180...266
Read 1 LTL properties
Checking formula 0 : !((F((F(!((!((X("(p4594>=4)"))||("(p2816>=3)")))U(G("(p2816>=3)")))))&&("(p4608>=2)"))))
Formula 0 simplified : !F("(p4608>=2)" & F!(!("(p2816>=3)" | X"(p4594>=4)") U G"(p2816>=3)"))
Detected timeout of ITS tools.
[2022-05-17 03:11:02] [INFO ] Flatten gal took : 166 ms
[2022-05-17 03:11:02] [INFO ] Applying decomposition
[2022-05-17 03:11:02] [INFO ] Flatten gal took : 168 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15752636984092502542.txt' '-o' '/tmp/graph15752636984092502542.bin' '-w' '/tmp/graph15752636984092502542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15752636984092502542.bin' '-l' '-1' '-v' '-w' '/tmp/graph15752636984092502542.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:11:02] [INFO ] Decomposing Gal with order
[2022-05-17 03:11:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:11:03] [INFO ] Flatten gal took : 169 ms
[2022-05-17 03:11:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 60 ms.
[2022-05-17 03:11:03] [INFO ] Time to serialize gal into /tmp/LTL15439826248846989877.gal : 21 ms
[2022-05-17 03:11:03] [INFO ] Time to serialize properties into /tmp/LTL8599324658811260920.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15439826248846989877.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8599324658811260920.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1543982...246
Read 1 LTL properties
Checking formula 0 : !((F((F(!((!((X("(u918.p4594>=4)"))||("(u563.p2816>=3)")))U(G("(u563.p2816>=3)")))))&&("(u921.p4608>=2)"))))
Formula 0 simplified : !F("(u921.p4608>=2)" & F!(!("(u563.p2816>=3)" | X"(u918.p4594>=4)") U G"(u563.p2816>=3)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15030146257941032441
[2022-05-17 03:11:18] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15030146257941032441
Running compilation step : cd /tmp/ltsmin15030146257941032441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15030146257941032441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15030146257941032441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property JoinFreeModules-PT-1000-LTLFireability-11 finished in 219406 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F((X((X(X(G(p0)))&&X(p1)))||p2))))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 626 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:11:22] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:11:27] [INFO ] Dead Transitions using invariants and state equation in 4730 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:11:27] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:11:28] [INFO ] Implicit Places using invariants in 669 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:11:28] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:11:28] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
[2022-05-17 03:11:29] [INFO ] Redundant transitions in 693 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:11:29] [INFO ] Computed 1000 place invariants in 15 ms
[2022-05-17 03:11:34] [INFO ] Dead Transitions using invariants and state equation in 4694 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LT s4368 4), p1:(LT s144 5), p0:(LT s1432 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 26710 steps with 3 reset in 10003 ms.
Product exploration timeout after 23520 steps with 2 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10514 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=26 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Probabilistic random walk after 72135 steps, saw 72084 distinct states, run finished after 6028 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:12:03] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:12:04] [INFO ] [Real]Absence check using 1000 positive place invariants in 242 ms returned sat
[2022-05-17 03:12:09] [INFO ] After 5546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 03:12:10] [INFO ] [Nat]Absence check using 1000 positive place invariants in 248 ms returned sat
[2022-05-17 03:12:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:12:34] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 15 are kept as prefixes of interest. Removing 4985 places using SCC suffix rule.4 ms
Discarding 4985 places :
Also discarding 7976 output transitions
Drop transitions removed 7976 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 24
Applied a total of 2 rules in 12 ms. Remains 15 /5000 variables (removed 4985) and now considering 24/8001 (removed 7977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 03:12:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 03:12:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/5000 places, 24/8001 transitions.
Incomplete random walk after 10178 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2035 ) properties (out of 5) seen :3
Finished Best-First random walk after 73 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 715 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:12:35] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 03:12:40] [INFO ] Dead Transitions using invariants and state equation in 4483 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:12:40] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:12:40] [INFO ] Implicit Places using invariants in 684 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:12:40] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:12:41] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
[2022-05-17 03:12:42] [INFO ] Redundant transitions in 690 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:12:42] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 03:12:46] [INFO ] Dead Transitions using invariants and state equation in 4501 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Probabilistic random walk after 68128 steps, saw 68079 distinct states, run finished after 6009 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:12:55] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:12:57] [INFO ] [Real]Absence check using 1000 positive place invariants in 231 ms returned sat
[2022-05-17 03:13:01] [INFO ] After 5648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 03:13:02] [INFO ] [Nat]Absence check using 1000 positive place invariants in 235 ms returned sat
[2022-05-17 03:13:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:13:26] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 15 are kept as prefixes of interest. Removing 4985 places using SCC suffix rule.2 ms
Discarding 4985 places :
Also discarding 7976 output transitions
Drop transitions removed 7976 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 24
Applied a total of 2 rules in 9 ms. Remains 15 /5000 variables (removed 4985) and now considering 24/8001 (removed 7977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 03:13:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 03:13:26] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/5000 places, 24/8001 transitions.
Incomplete random walk after 10494 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2098 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 03:13:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 03:13:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 03:13:26] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:13:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 03:13:26] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:13:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-17 03:13:26] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 03:13:26] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 03:13:26] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1013 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=126 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 20020 steps with 0 reset in 10003 ms.
Stack based approach found an accepted trace after 6354 steps with 0 reset with depth 6355 and stack size 66 in 2405 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-12 finished in 138077 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(F(p0)))||p0)))'
Support contains 1 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 590 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:13:40] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 03:13:44] [INFO ] Dead Transitions using invariants and state equation in 4414 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:13:45] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:13:45] [INFO ] Implicit Places using invariants in 669 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:13:45] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:13:46] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2022-05-17 03:13:47] [INFO ] Redundant transitions in 710 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:13:47] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:13:51] [INFO ] Dead Transitions using invariants and state equation in 4468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s84 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 22300 steps with 1 reset in 10003 ms.
Stack based approach found an accepted trace after 14829 steps with 0 reset with depth 14830 and stack size 11373 in 7015 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-14 finished in 28642 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&G(X((!(F(p1)&&p0) U G(p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(G(X((F(p0)&&(G(!p0)||p1)))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||G(G(p1))||p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(!(!(X(p0)||p1) U G(p1)))&&p2)))'
Found a CL insensitive property : JoinFreeModules-PT-1000-LTLFireability-11
Stuttering acceptance computed with spot in 86 ms :[(AND p1 (NOT p0)), p1, (OR (NOT p2) p1)]
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 667 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:14:09] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:14:14] [INFO ] Dead Transitions using invariants and state equation in 4447 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:14:14] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:14:14] [INFO ] Implicit Places using invariants in 702 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:14:14] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:14:15] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:14:15] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:14:20] [INFO ] Dead Transitions using invariants and state equation in 4526 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GEQ s2815 3), p0:(GEQ s4593 4), p2:(GEQ s4607 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 26580 steps with 3 reset in 10001 ms.
Product exploration timeout after 26540 steps with 5 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1))), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 305 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10518 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Probabilistic random walk after 43076 steps, saw 43045 distinct states, run finished after 3031 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:14:45] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:14:46] [INFO ] [Real]Absence check using 1000 positive place invariants in 236 ms returned sat
[2022-05-17 03:14:51] [INFO ] After 5509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 03:14:51] [INFO ] [Nat]Absence check using 1000 positive place invariants in 239 ms returned sat
[2022-05-17 03:15:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:15:16] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.2 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 8 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:15:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 03:15:16] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 1002 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1002 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1))), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 92 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 2 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 264 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:15:16] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 03:15:21] [INFO ] Dead Transitions using invariants and state equation in 4294 ms found 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:15:21] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 03:15:21] [INFO ] Implicit Places using invariants in 633 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:15:21] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 03:15:22] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:15:22] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 03:15:26] [INFO ] Dead Transitions using invariants and state equation in 4402 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Probabilistic random walk after 43076 steps, saw 43045 distinct states, run finished after 3033 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:15:32] [INFO ] Computed 1000 place invariants in 107 ms
[2022-05-17 03:15:33] [INFO ] [Real]Absence check using 1000 positive place invariants in 231 ms returned sat
[2022-05-17 03:15:37] [INFO ] After 5587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 03:15:38] [INFO ] [Nat]Absence check using 1000 positive place invariants in 230 ms returned sat
[2022-05-17 03:16:02] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.2 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 7 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:16:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 03:16:02] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 1129 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=564 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration timeout after 26550 steps with 3 reset in 10002 ms.
Product exploration timeout after 28540 steps with 6 reset in 10004 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 579 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:16:23] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 03:16:28] [INFO ] Dead Transitions using invariants and state equation in 4483 ms found 0 transitions.
[2022-05-17 03:16:29] [INFO ] Redundant transitions in 704 ms returned []
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:16:29] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 03:16:33] [INFO ] Dead Transitions using invariants and state equation in 4725 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 8001/8001 transitions.
Product exploration timeout after 28990 steps with 6 reset in 10002 ms.
Stack based approach found an accepted trace after 1588 steps with 0 reset with depth 1589 and stack size 1588 in 453 ms.
Treatment of property JoinFreeModules-PT-1000-LTLFireability-11 finished in 155493 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-17 03:16:44] [INFO ] Flatten gal took : 171 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5964253471915393358
[2022-05-17 03:16:44] [INFO ] Too many transitions (8001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:16:44] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5964253471915393358
Running compilation step : cd /tmp/ltsmin5964253471915393358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 03:16:44] [INFO ] Applying decomposition
[2022-05-17 03:16:44] [INFO ] Flatten gal took : 182 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7689017265500488427.txt' '-o' '/tmp/graph7689017265500488427.bin' '-w' '/tmp/graph7689017265500488427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7689017265500488427.bin' '-l' '-1' '-v' '-w' '/tmp/graph7689017265500488427.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:16:45] [INFO ] Decomposing Gal with order
[2022-05-17 03:16:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:16:46] [INFO ] Flatten gal took : 180 ms
[2022-05-17 03:16:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 59 ms.
[2022-05-17 03:16:46] [INFO ] Time to serialize gal into /tmp/LTLFireability3224238242591447520.gal : 21 ms
[2022-05-17 03:16:46] [INFO ] Time to serialize properties into /tmp/LTLFireability16544298961816324715.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3224238242591447520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16544298961816324715.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !(((X(X("(u728.p3643>=2)")))&&(G(X((!((F("(u268.p1343>=2)"))&&("(u728.p3643>=2)")))U(G("(u268.p1343>=2)")))))))
Formula 0 simplified : !(XX"(u728.p3643>=2)" & GX(!("(u728.p3643>=2)" & F"(u268.p1343>=2)") U G"(u268.p1343>=2)"))
Compilation finished in 35625 ms.
Running link step : cd /tmp/ltsmin5964253471915393358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 100 ms.
Running LTSmin : cd /tmp/ltsmin5964253471915393358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X((LTLAPp0==true)))&&[](X((!(<>((LTLAPp1==true))&&(LTLAPp0==true)) U []((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5964253471915393358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X((LTLAPp0==true)))&&[](X((!(<>((LTLAPp1==true))&&(LTLAPp0==true)) U []((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5964253471915393358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X(<>([](X((<>((LTLAPp2==true))&&([](!(LTLAPp2==true))||(LTLAPp3==true)))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.211: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.211: LTL layer: formula: [](<>(X(<>([](X((<>((LTLAPp2==true))&&([](!(LTLAPp2==true))||(LTLAPp3==true)))))))))
pins2lts-mc-linux64( 6/ 8), 0.212: "[](<>(X(<>([](X((<>((LTLAPp2==true))&&([](!(LTLAPp2==true))||(LTLAPp3==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.220: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.224: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.253: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.270: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.274: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.289: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.293: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.301: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.684: There are 8012 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.684: State length is 5001, there are 8014 groups
pins2lts-mc-linux64( 0/ 8), 2.684: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.684: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.684: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.684: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 8.880: [Blue] ~120 levels ~960 states ~1925376 transitions
pins2lts-mc-linux64( 5/ 8), 13.112: [Blue] ~240 levels ~1920 states ~3852472 transitions
pins2lts-mc-linux64( 1/ 8), 21.625: [Blue] ~480 levels ~3840 states ~7687648 transitions
pins2lts-mc-linux64( 0/ 8), 38.663: [Blue] ~960 levels ~7680 states ~15413528 transitions
pins2lts-mc-linux64( 0/ 8), 72.358: [Blue] ~1920 levels ~15360 states ~30840776 transitions
pins2lts-mc-linux64( 3/ 8), 111.267: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 135.624:
pins2lts-mc-linux64( 0/ 8), 135.624: Explored 22683 states 45523373 transitions, fanout: 2006.938
pins2lts-mc-linux64( 0/ 8), 135.624: Total exploration time 132.910 sec (108.580 sec minimum, 125.990 sec on average)
pins2lts-mc-linux64( 0/ 8), 135.624: States per second: 171, Transitions per second: 342513
pins2lts-mc-linux64( 0/ 8), 135.624:
pins2lts-mc-linux64( 0/ 8), 135.624: State space has 45497402 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 135.624: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 135.624: blue states: 22683 (0.05%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 135.624: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 135.624: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 135.624:
pins2lts-mc-linux64( 0/ 8), 135.624: Total memory used for local state coloring: 0.3MB
pins2lts-mc-linux64( 0/ 8), 135.624:
pins2lts-mc-linux64( 0/ 8), 135.624: Queue width: 8B, total height: 22683, memory: 0.17MB
pins2lts-mc-linux64( 0/ 8), 135.624: Tree memory: 603.1MB, 13.9 B/state, compr.: 0.1%
pins2lts-mc-linux64( 0/ 8), 135.624: Tree fill ratio (roots/leafs): 33.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 135.624: Stored 8421 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 135.624: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 135.624: Est. total memory use: 603.3MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5964253471915393358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X(<>([](X((<>((LTLAPp2==true))&&([](!(LTLAPp2==true))||(LTLAPp3==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5964253471915393358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X(<>([](X((<>((LTLAPp2==true))&&([](!(LTLAPp2==true))||(LTLAPp3==true)))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-17 03:44:23] [INFO ] Flatten gal took : 334 ms
[2022-05-17 03:44:23] [INFO ] Time to serialize gal into /tmp/LTLFireability6394165283690077755.gal : 17 ms
[2022-05-17 03:44:23] [INFO ] Time to serialize properties into /tmp/LTLFireability12646782988461659774.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6394165283690077755.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12646782988461659774.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 4 LTL properties
Checking formula 0 : !(((X(X("(p3643>=2)")))&&(G(X((!((F("(p1343>=2)"))&&("(p3643>=2)")))U(G("(p1343>=2)")))))))
Formula 0 simplified : !(XX"(p3643>=2)" & GX(!("(p3643>=2)" & F"(p1343>=2)") U G"(p1343>=2)"))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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=@none -Xss128m -Xms40m -Xmx8192m
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="JoinFreeModules-PT-1000"
export BK_EXAMINATION="LTLFireability"
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 JoinFreeModules-PT-1000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820600212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;