About the Execution of ITS-Tools for BusinessProcesses-PT-19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 499.939 | 48233.00 | 82475.00 | 505.70 | TTFFFTTTFFFFFFFF | 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.r024-tall-165251918600468.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 BusinessProcesses-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 5.8K Apr 30 00:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 189K May 10 09:33 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 BusinessProcesses-PT-19-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652638987011
Running Version 202205111006
[2022-05-15 18:23:08] [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-15 18:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:23:08] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2022-05-15 18:23:08] [INFO ] Transformed 772 places.
[2022-05-15 18:23:08] [INFO ] Transformed 685 transitions.
[2022-05-15 18:23:08] [INFO ] Found NUPN structural information;
[2022-05-15 18:23:08] [INFO ] Parsed PT model containing 772 places and 685 transitions in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 15 places in 21 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 113 place count 644 transition count 565
Iterating global reduction 1 with 105 rules applied. Total rules applied 218 place count 644 transition count 565
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 268 place count 594 transition count 515
Iterating global reduction 1 with 50 rules applied. Total rules applied 318 place count 594 transition count 515
Applied a total of 318 rules in 161 ms. Remains 594 /757 variables (removed 163) and now considering 515/670 (removed 155) transitions.
// Phase 1: matrix 515 rows 594 cols
[2022-05-15 18:23:08] [INFO ] Computed 117 place invariants in 38 ms
[2022-05-15 18:23:09] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 515 rows 594 cols
[2022-05-15 18:23:09] [INFO ] Computed 117 place invariants in 13 ms
[2022-05-15 18:23:09] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
// Phase 1: matrix 515 rows 594 cols
[2022-05-15 18:23:09] [INFO ] Computed 117 place invariants in 19 ms
[2022-05-15 18:23:10] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 594/757 places, 515/670 transitions.
Finished structural reductions, in 1 iterations. Remains : 594/757 places, 515/670 transitions.
Support contains 34 out of 594 places after structural reductions.
[2022-05-15 18:23:10] [INFO ] Flatten gal took : 72 ms
[2022-05-15 18:23:10] [INFO ] Flatten gal took : 34 ms
[2022-05-15 18:23:10] [INFO ] Input system was already deterministic with 515 transitions.
Support contains 31 out of 594 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 515 rows 594 cols
[2022-05-15 18:23:11] [INFO ] Computed 117 place invariants in 14 ms
[2022-05-15 18:23:11] [INFO ] [Real]Absence check using 70 positive place invariants in 19 ms returned sat
[2022-05-15 18:23:11] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 14 ms returned sat
[2022-05-15 18:23:12] [INFO ] After 612ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:4
[2022-05-15 18:23:12] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 4 ms to minimize.
[2022-05-15 18:23:12] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2022-05-15 18:23:12] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2022-05-15 18:23:12] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2022-05-15 18:23:12] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2022-05-15 18:23:12] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2022-05-15 18:23:13] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2022-05-15 18:23:13] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 0 ms to minimize.
[2022-05-15 18:23:13] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2022-05-15 18:23:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1042 ms
[2022-05-15 18:23:13] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-15 18:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-15 18:23:13] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 0 ms to minimize.
[2022-05-15 18:23:13] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-15 18:23:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 267 ms
[2022-05-15 18:23:14] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 1 ms to minimize.
[2022-05-15 18:23:14] [INFO ] Deduced a trap composed of 124 places in 141 ms of which 1 ms to minimize.
[2022-05-15 18:23:14] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 1 ms to minimize.
[2022-05-15 18:23:14] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 0 ms to minimize.
[2022-05-15 18:23:14] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 1 ms to minimize.
[2022-05-15 18:23:14] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 1 ms to minimize.
[2022-05-15 18:23:14] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 0 ms to minimize.
[2022-05-15 18:23:15] [INFO ] Deduced a trap composed of 115 places in 136 ms of which 1 ms to minimize.
[2022-05-15 18:23:15] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 1 ms to minimize.
[2022-05-15 18:23:15] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 1 ms to minimize.
[2022-05-15 18:23:15] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 0 ms to minimize.
[2022-05-15 18:23:15] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 1 ms to minimize.
[2022-05-15 18:23:15] [INFO ] Deduced a trap composed of 116 places in 104 ms of which 0 ms to minimize.
[2022-05-15 18:23:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2062 ms
[2022-05-15 18:23:16] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2022-05-15 18:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-15 18:23:16] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 0 ms to minimize.
[2022-05-15 18:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-15 18:23:16] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:23:16] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2022-05-15 18:23:16] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2022-05-15 18:23:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 389 ms
[2022-05-15 18:23:16] [INFO ] After 5286ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:16
[2022-05-15 18:23:16] [INFO ] After 5738ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2022-05-15 18:23:17] [INFO ] [Nat]Absence check using 70 positive place invariants in 33 ms returned sat
[2022-05-15 18:23:17] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2022-05-15 18:23:17] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2022-05-15 18:23:18] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2022-05-15 18:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-15 18:23:18] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 1 ms to minimize.
[2022-05-15 18:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-15 18:23:18] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 0 ms to minimize.
[2022-05-15 18:23:18] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2022-05-15 18:23:18] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2022-05-15 18:23:18] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 1 ms to minimize.
[2022-05-15 18:23:19] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 1 ms to minimize.
[2022-05-15 18:23:19] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 0 ms to minimize.
[2022-05-15 18:23:19] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 0 ms to minimize.
[2022-05-15 18:23:19] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2022-05-15 18:23:19] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 0 ms to minimize.
[2022-05-15 18:23:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1332 ms
[2022-05-15 18:23:19] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 1 ms to minimize.
[2022-05-15 18:23:19] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 1 ms to minimize.
[2022-05-15 18:23:20] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 1 ms to minimize.
[2022-05-15 18:23:20] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 0 ms to minimize.
[2022-05-15 18:23:20] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 0 ms to minimize.
[2022-05-15 18:23:20] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 0 ms to minimize.
[2022-05-15 18:23:20] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 0 ms to minimize.
[2022-05-15 18:23:20] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 1 ms to minimize.
[2022-05-15 18:23:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1196 ms
[2022-05-15 18:23:21] [INFO ] After 4009ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 397 ms.
[2022-05-15 18:23:21] [INFO ] After 4854ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 4 properties in 220 ms.
Support contains 14 out of 594 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 594/594 places, 515/515 transitions.
Graph (trivial) has 269 edges and 594 vertex of which 6 / 594 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1309 edges and 589 vertex of which 588 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 588 transition count 445
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 526 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 525 transition count 444
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 128 place count 525 transition count 325
Deduced a syphon composed of 119 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 388 place count 384 transition count 325
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 392 place count 380 transition count 321
Iterating global reduction 3 with 4 rules applied. Total rules applied 396 place count 380 transition count 321
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 397 place count 379 transition count 320
Iterating global reduction 3 with 1 rules applied. Total rules applied 398 place count 379 transition count 320
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 3 with 321 rules applied. Total rules applied 719 place count 217 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 721 place count 216 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 723 place count 216 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 725 place count 214 transition count 162
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 730 place count 214 transition count 162
Applied a total of 730 rules in 145 ms. Remains 214 /594 variables (removed 380) and now considering 162/515 (removed 353) transitions.
Finished structural reductions, in 1 iterations. Remains : 214/594 places, 162/515 transitions.
Finished random walk after 247 steps, including 18 resets, run visited all 12 properties in 13 ms. (steps per millisecond=19 )
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA BusinessProcesses-PT-19-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 537 stabilizing places and 468 stable transitions
Graph (complete) has 1316 edges and 594 vertex of which 593 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(F(G(F(G(p0))))))||F(G(p1))))))'
Support contains 1 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Graph (trivial) has 284 edges and 594 vertex of which 6 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 589 vertex of which 588 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 587 transition count 442
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 522 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 521 transition count 441
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 128 Pre rules applied. Total rules applied 134 place count 521 transition count 313
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 281 rules applied. Total rules applied 415 place count 368 transition count 313
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 426 place count 357 transition count 302
Iterating global reduction 3 with 11 rules applied. Total rules applied 437 place count 357 transition count 302
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 438 place count 356 transition count 301
Iterating global reduction 3 with 1 rules applied. Total rules applied 439 place count 356 transition count 301
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 313 rules applied. Total rules applied 752 place count 197 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 756 place count 195 transition count 149
Applied a total of 756 rules in 80 ms. Remains 195 /594 variables (removed 399) and now considering 149/515 (removed 366) transitions.
// Phase 1: matrix 149 rows 195 cols
[2022-05-15 18:23:22] [INFO ] Computed 87 place invariants in 2 ms
[2022-05-15 18:23:22] [INFO ] Implicit Places using invariants in 125 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 58, 59, 60]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 128 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/594 places, 149/515 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 168/594 places, 149/515 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s33 0), p1:(EQ s33 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21474 reset in 346 ms.
Product exploration explored 100000 steps with 21308 reset in 276 ms.
Computed a total of 145 stabilizing places and 131 stable transitions
Computed a total of 145 stabilizing places and 131 stable transitions
Detected a total of 145/168 stabilizing places and 131/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 420 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2443 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 760 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 749 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 731 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 755 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 654310 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 654310 steps, saw 212481 distinct states, run finished after 3002 ms. (steps per millisecond=217 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 149 rows 168 cols
[2022-05-15 18:23:27] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-15 18:23:27] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 18:23:27] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2022-05-15 18:23:27] [INFO ] [Nat]Absence check using 45 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-15 18:23:27] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 13 factoid took 454 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-19-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-00 finished in 5455 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(X(p0))||F(p1)||p1))&&X(p2)))'
Support contains 3 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 584 transition count 505
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 584 transition count 505
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 582 transition count 503
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 579 transition count 500
Applied a total of 30 rules in 95 ms. Remains 579 /594 variables (removed 15) and now considering 500/515 (removed 15) transitions.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:23:28] [INFO ] Computed 117 place invariants in 11 ms
[2022-05-15 18:23:28] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:23:28] [INFO ] Computed 117 place invariants in 15 ms
[2022-05-15 18:23:28] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:23:28] [INFO ] Computed 117 place invariants in 10 ms
[2022-05-15 18:23:29] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/594 places, 500/515 transitions.
Finished structural reductions, in 1 iterations. Remains : 579/594 places, 500/515 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s291 1), p2:(EQ s469 0), p0:(EQ s526 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2019 reset in 255 ms.
Stack based approach found an accepted trace after 725 steps with 15 reset with depth 5 and stack size 5 in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-02 finished in 1704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Graph (trivial) has 279 edges and 594 vertex of which 6 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 589 vertex of which 588 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 587 transition count 444
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 524 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 523 transition count 443
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 130 place count 523 transition count 317
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 406 place count 373 transition count 317
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 417 place count 362 transition count 306
Iterating global reduction 3 with 11 rules applied. Total rules applied 428 place count 362 transition count 306
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 429 place count 361 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 430 place count 361 transition count 305
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 315 rules applied. Total rules applied 745 place count 201 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 747 place count 200 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 748 place count 199 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 749 place count 198 transition count 148
Applied a total of 749 rules in 68 ms. Remains 198 /594 variables (removed 396) and now considering 148/515 (removed 367) transitions.
// Phase 1: matrix 148 rows 198 cols
[2022-05-15 18:23:29] [INFO ] Computed 87 place invariants in 1 ms
[2022-05-15 18:23:29] [INFO ] Implicit Places using invariants in 114 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 17, 22, 23, 24, 25, 48, 49, 50, 51, 52, 53, 54, 57, 58, 59, 60, 61]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 118 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/594 places, 148/515 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 171/594 places, 148/515 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s33 1) (EQ s97 1) (EQ s141 1)), p0:(NEQ s10 1)], 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, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-03 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X((p0 U p1))&&X(p2)))&&p3)))'
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Graph (trivial) has 282 edges and 594 vertex of which 6 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 589 vertex of which 588 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 587 transition count 441
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 521 transition count 441
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 134 place count 521 transition count 315
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 410 place count 371 transition count 315
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 421 place count 360 transition count 304
Iterating global reduction 2 with 11 rules applied. Total rules applied 432 place count 360 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 433 place count 359 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 359 transition count 303
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 739 place count 204 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 743 place count 202 transition count 155
Applied a total of 743 rules in 55 ms. Remains 202 /594 variables (removed 392) and now considering 155/515 (removed 360) transitions.
// Phase 1: matrix 155 rows 202 cols
[2022-05-15 18:23:29] [INFO ] Computed 88 place invariants in 2 ms
[2022-05-15 18:23:30] [INFO ] Implicit Places using invariants in 142 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 142 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/594 places, 155/515 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 174/594 places, 155/515 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p2)) (AND p3 (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(EQ s81 1), p2:(EQ s36 1), p1:(AND (EQ s14 1) (EQ s137 1)), p0:(OR (EQ s36 1) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-04 finished in 394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))||(p1 U (p2||G(p1))))))))'
Support contains 3 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 584 transition count 505
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 580 transition count 501
Applied a total of 28 rules in 85 ms. Remains 580 /594 variables (removed 14) and now considering 501/515 (removed 14) transitions.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:23:30] [INFO ] Computed 117 place invariants in 11 ms
[2022-05-15 18:23:30] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:23:30] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:23:31] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:23:31] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:23:31] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/594 places, 501/515 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/594 places, 501/515 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (NEQ s74 1) (NEQ s446 1)), p1:(NEQ s446 1), p0:(NEQ s519 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 299 ms.
Product exploration explored 100000 steps with 25000 reset in 312 ms.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1295 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 368 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 55 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:23:33] [INFO ] Computed 117 place invariants in 8 ms
[2022-05-15 18:23:33] [INFO ] [Real]Absence check using 71 positive place invariants in 22 ms returned sat
[2022-05-15 18:23:33] [INFO ] [Real]Absence check using 71 positive and 46 generalized place invariants in 21 ms returned sat
[2022-05-15 18:23:33] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 18:23:33] [INFO ] [Nat]Absence check using 71 positive place invariants in 21 ms returned sat
[2022-05-15 18:23:33] [INFO ] [Nat]Absence check using 71 positive and 46 generalized place invariants in 22 ms returned sat
[2022-05-15 18:23:33] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 18:23:33] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2022-05-15 18:23:33] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2022-05-15 18:23:33] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2022-05-15 18:23:34] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2022-05-15 18:23:34] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 0 ms to minimize.
[2022-05-15 18:23:34] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2022-05-15 18:23:34] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2022-05-15 18:23:34] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 1 ms to minimize.
[2022-05-15 18:23:34] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 1 ms to minimize.
[2022-05-15 18:23:34] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:23:34] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 0 ms to minimize.
[2022-05-15 18:23:34] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 0 ms to minimize.
[2022-05-15 18:23:35] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 0 ms to minimize.
[2022-05-15 18:23:35] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2022-05-15 18:23:35] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1705 ms
[2022-05-15 18:23:35] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2022-05-15 18:23:35] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 1 ms to minimize.
[2022-05-15 18:23:35] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 1 ms to minimize.
[2022-05-15 18:23:35] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 1 ms to minimize.
[2022-05-15 18:23:36] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2022-05-15 18:23:36] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 1 ms to minimize.
[2022-05-15 18:23:36] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 1 ms to minimize.
[2022-05-15 18:23:36] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 1 ms to minimize.
[2022-05-15 18:23:36] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 1 ms to minimize.
[2022-05-15 18:23:36] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 0 ms to minimize.
[2022-05-15 18:23:36] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 1 ms to minimize.
[2022-05-15 18:23:37] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 1 ms to minimize.
[2022-05-15 18:23:37] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 1 ms to minimize.
[2022-05-15 18:23:37] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1895 ms
[2022-05-15 18:23:37] [INFO ] After 3887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-15 18:23:37] [INFO ] After 4085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 268 edges and 580 vertex of which 6 / 580 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1288 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 510 transition count 306
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 401 place count 362 transition count 306
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 319 rules applied. Total rules applied 720 place count 200 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 722 place count 199 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 724 place count 199 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 726 place count 197 transition count 150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 727 place count 197 transition count 150
Applied a total of 727 rules in 42 ms. Remains 197 /580 variables (removed 383) and now considering 150/501 (removed 351) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/580 places, 150/501 transitions.
Finished random walk after 76 steps, including 6 resets, run visited all 2 properties in 1 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p2 p1 p0), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 3 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 15 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:23:37] [INFO ] Computed 117 place invariants in 10 ms
[2022-05-15 18:23:38] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:23:38] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:23:38] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:23:38] [INFO ] Computed 117 place invariants in 8 ms
[2022-05-15 18:23:39] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 501/501 transitions.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1295 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 55 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:23:39] [INFO ] Computed 117 place invariants in 12 ms
[2022-05-15 18:23:39] [INFO ] [Real]Absence check using 71 positive place invariants in 21 ms returned sat
[2022-05-15 18:23:39] [INFO ] [Real]Absence check using 71 positive and 46 generalized place invariants in 24 ms returned sat
[2022-05-15 18:23:39] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 18:23:40] [INFO ] [Nat]Absence check using 71 positive place invariants in 24 ms returned sat
[2022-05-15 18:23:40] [INFO ] [Nat]Absence check using 71 positive and 46 generalized place invariants in 23 ms returned sat
[2022-05-15 18:23:40] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 18:23:40] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2022-05-15 18:23:40] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-05-15 18:23:40] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2022-05-15 18:23:40] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2022-05-15 18:23:40] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2022-05-15 18:23:40] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2022-05-15 18:23:41] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2022-05-15 18:23:41] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:23:41] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 1 ms to minimize.
[2022-05-15 18:23:41] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 1 ms to minimize.
[2022-05-15 18:23:41] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 1 ms to minimize.
[2022-05-15 18:23:41] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 0 ms to minimize.
[2022-05-15 18:23:41] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 1 ms to minimize.
[2022-05-15 18:23:41] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:23:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1693 ms
[2022-05-15 18:23:42] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2022-05-15 18:23:42] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 0 ms to minimize.
[2022-05-15 18:23:42] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 0 ms to minimize.
[2022-05-15 18:23:42] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 0 ms to minimize.
[2022-05-15 18:23:42] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:23:42] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 1 ms to minimize.
[2022-05-15 18:23:42] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 1 ms to minimize.
[2022-05-15 18:23:43] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 0 ms to minimize.
[2022-05-15 18:23:43] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 0 ms to minimize.
[2022-05-15 18:23:43] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 0 ms to minimize.
[2022-05-15 18:23:43] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 0 ms to minimize.
[2022-05-15 18:23:43] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 1 ms to minimize.
[2022-05-15 18:23:43] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 1 ms to minimize.
[2022-05-15 18:23:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1886 ms
[2022-05-15 18:23:43] [INFO ] After 3854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-05-15 18:23:43] [INFO ] After 4068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 268 edges and 580 vertex of which 6 / 580 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1288 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 510 transition count 306
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 401 place count 362 transition count 306
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 319 rules applied. Total rules applied 720 place count 200 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 722 place count 199 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 724 place count 199 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 726 place count 197 transition count 150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 727 place count 197 transition count 150
Applied a total of 727 rules in 40 ms. Remains 197 /580 variables (removed 383) and now considering 150/501 (removed 351) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/580 places, 150/501 transitions.
Finished random walk after 90 steps, including 6 resets, run visited all 2 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p2 p1 p0), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 294 ms.
Product exploration explored 100000 steps with 25000 reset in 290 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 3 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 268 edges and 580 vertex of which 6 / 580 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1289 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 574 transition count 494
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 574 transition count 562
Deduced a syphon composed of 151 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 574 transition count 562
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 552 transition count 521
Deduced a syphon composed of 129 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 552 transition count 521
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 321 places in 0 ms
Iterating global reduction 1 with 192 rules applied. Total rules applied 389 place count 552 transition count 521
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 435 place count 506 transition count 475
Deduced a syphon composed of 275 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 481 place count 506 transition count 475
Deduced a syphon composed of 275 places in 2 ms
Applied a total of 481 rules in 95 ms. Remains 506 /580 variables (removed 74) and now considering 475/501 (removed 26) transitions.
[2022-05-15 18:23:45] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 475 rows 506 cols
[2022-05-15 18:23:45] [INFO ] Computed 117 place invariants in 5 ms
[2022-05-15 18:23:46] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 506/580 places, 475/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 506/580 places, 475/501 transitions.
Product exploration explored 100000 steps with 25000 reset in 1048 ms.
Product exploration explored 100000 steps with 25000 reset in 967 ms.
Built C files in :
/tmp/ltsmin17442311215196207241
[2022-05-15 18:23:48] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17442311215196207241
Running compilation step : cd /tmp/ltsmin17442311215196207241;'/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'
Compilation finished in 849 ms.
Running link step : cd /tmp/ltsmin17442311215196207241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17442311215196207241;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased732547779627214282.hoa' '--buchi-type=spotba'
LTSmin run took 286 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-19-LTLFireability-05 finished in 19147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(!(p0 U p1))))||p2))))'
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Graph (trivial) has 279 edges and 594 vertex of which 6 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 589 vertex of which 588 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 587 transition count 443
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 523 transition count 443
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 130 place count 523 transition count 317
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 406 place count 373 transition count 317
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 414 place count 365 transition count 309
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 365 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 423 place count 364 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 424 place count 364 transition count 308
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 740 place count 204 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 744 place count 202 transition count 154
Applied a total of 744 rules in 64 ms. Remains 202 /594 variables (removed 392) and now considering 154/515 (removed 361) transitions.
// Phase 1: matrix 154 rows 202 cols
[2022-05-15 18:23:49] [INFO ] Computed 89 place invariants in 3 ms
[2022-05-15 18:23:49] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 3, 4, 5, 13, 14, 18, 19, 20, 21, 24, 25, 26, 27, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 151]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 152 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/594 places, 154/515 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 172/594 places, 154/515 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s146 1), p2:(EQ s134 0), p0:(OR (NEQ s140 1) (EQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21378 reset in 195 ms.
Product exploration explored 100000 steps with 21301 reset in 202 ms.
Computed a total of 147 stabilizing places and 134 stable transitions
Computed a total of 147 stabilizing places and 134 stable transitions
Detected a total of 147/172 stabilizing places and 134/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (AND p2 p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 475 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2410 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 757 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 761 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 154 rows 172 cols
[2022-05-15 18:23:50] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-15 18:23:50] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 18:23:50] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2022-05-15 18:23:50] [INFO ] [Nat]Absence check using 44 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-15 18:23:51] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 18:23:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:23:51] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 18:23:51] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2022-05-15 18:23:51] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:23:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2022-05-15 18:23:51] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-15 18:23:51] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 172/172 places, 154/154 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 172 transition count 153
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 172 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 170 transition count 151
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 170 transition count 151
Applied a total of 6 rules in 14 ms. Remains 170 /172 variables (removed 2) and now considering 151/154 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/172 places, 151/154 transitions.
Finished random walk after 77 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=77 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (AND p2 p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F p1), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2 p0)))]
Property proved to be true thanks to knowledge :(F (OR (G p1) (G (NOT p1))))
Knowledge based reduction with 12 factoid took 447 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-19-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-07 finished in 2255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U F(G(!p0)))))'
Support contains 1 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Graph (trivial) has 284 edges and 594 vertex of which 6 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 589 vertex of which 588 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 587 transition count 441
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 521 transition count 441
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 134 place count 521 transition count 313
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 281 rules applied. Total rules applied 415 place count 368 transition count 313
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 425 place count 358 transition count 303
Iterating global reduction 2 with 10 rules applied. Total rules applied 435 place count 358 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 436 place count 357 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 437 place count 357 transition count 302
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 315 rules applied. Total rules applied 752 place count 197 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 756 place count 195 transition count 149
Applied a total of 756 rules in 46 ms. Remains 195 /594 variables (removed 399) and now considering 149/515 (removed 366) transitions.
// Phase 1: matrix 149 rows 195 cols
[2022-05-15 18:23:51] [INFO ] Computed 87 place invariants in 3 ms
[2022-05-15 18:23:51] [INFO ] Implicit Places using invariants in 138 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 139 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/594 places, 149/515 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 167/594 places, 149/515 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s133 1)], 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 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-09 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Graph (trivial) has 283 edges and 594 vertex of which 6 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 589 vertex of which 588 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 587 transition count 442
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 522 transition count 442
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 132 place count 522 transition count 314
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 281 rules applied. Total rules applied 413 place count 369 transition count 314
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 423 place count 359 transition count 304
Iterating global reduction 2 with 10 rules applied. Total rules applied 433 place count 359 transition count 304
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 315 rules applied. Total rules applied 748 place count 199 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 752 place count 197 transition count 151
Applied a total of 752 rules in 36 ms. Remains 197 /594 variables (removed 397) and now considering 151/515 (removed 364) transitions.
// Phase 1: matrix 151 rows 197 cols
[2022-05-15 18:23:51] [INFO ] Computed 87 place invariants in 3 ms
[2022-05-15 18:23:52] [INFO ] Implicit Places using invariants in 135 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 137 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/594 places, 151/515 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 169/594 places, 151/515 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-10 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:(EQ s119 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-10 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((G(p0) U X(p1)) U (p2 U p0)))))'
Support contains 7 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 584 transition count 505
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 584 transition count 505
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 582 transition count 503
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 582 transition count 503
Applied a total of 24 rules in 39 ms. Remains 582 /594 variables (removed 12) and now considering 503/515 (removed 12) transitions.
// Phase 1: matrix 503 rows 582 cols
[2022-05-15 18:23:52] [INFO ] Computed 117 place invariants in 10 ms
[2022-05-15 18:23:52] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 503 rows 582 cols
[2022-05-15 18:23:52] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:23:53] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
// Phase 1: matrix 503 rows 582 cols
[2022-05-15 18:23:53] [INFO ] Computed 117 place invariants in 10 ms
[2022-05-15 18:23:53] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 582/594 places, 503/515 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/594 places, 503/515 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s88 1) (EQ s371 1) (EQ s492 1)), p2:(EQ s469 1), p1:(AND (EQ s59 1) (EQ s323 1) (EQ s487 1))], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-11 finished in 1514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F((p1||X(p2)))))))'
Support contains 3 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 515/515 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 586 transition count 507
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 586 transition count 507
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 584 transition count 505
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 581 transition count 502
Applied a total of 26 rules in 69 ms. Remains 581 /594 variables (removed 13) and now considering 502/515 (removed 13) transitions.
// Phase 1: matrix 502 rows 581 cols
[2022-05-15 18:23:53] [INFO ] Computed 117 place invariants in 8 ms
[2022-05-15 18:23:53] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 502 rows 581 cols
[2022-05-15 18:23:53] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:23:54] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 581 cols
[2022-05-15 18:23:54] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:23:54] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 581/594 places, 502/515 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/594 places, 502/515 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s500 1), p2:(EQ s460 1), p0:(EQ s451 1)], 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, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-12 finished in 1506 ms.
All properties solved by simple procedures.
Total runtime 46974 ms.
BK_STOP 1652639035244
--------------------
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="BusinessProcesses-PT-19"
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 BusinessProcesses-PT-19, 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 r024-tall-165251918600468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 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 ;