About the Execution of ITS-Tools for ShieldIIPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16244.279 | 3600000.00 | 2961174.00 | 411042.10 | ?FFFFFFF?FFTF??F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205200493.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205200493
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 12:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 860K May 5 16:52 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 ShieldIIPt-PT-050B-00
FORMULA_NAME ShieldIIPt-PT-050B-01
FORMULA_NAME ShieldIIPt-PT-050B-02
FORMULA_NAME ShieldIIPt-PT-050B-03
FORMULA_NAME ShieldIIPt-PT-050B-04
FORMULA_NAME ShieldIIPt-PT-050B-05
FORMULA_NAME ShieldIIPt-PT-050B-06
FORMULA_NAME ShieldIIPt-PT-050B-07
FORMULA_NAME ShieldIIPt-PT-050B-08
FORMULA_NAME ShieldIIPt-PT-050B-09
FORMULA_NAME ShieldIIPt-PT-050B-10
FORMULA_NAME ShieldIIPt-PT-050B-11
FORMULA_NAME ShieldIIPt-PT-050B-12
FORMULA_NAME ShieldIIPt-PT-050B-13
FORMULA_NAME ShieldIIPt-PT-050B-14
FORMULA_NAME ShieldIIPt-PT-050B-15
=== Now, execution of the tool begins
BK_START 1621113842201
Running Version 0
[2021-05-15 21:24:12] [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]
[2021-05-15 21:24:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 21:24:12] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2021-05-15 21:24:12] [INFO ] Transformed 3503 places.
[2021-05-15 21:24:12] [INFO ] Transformed 3253 transitions.
[2021-05-15 21:24:12] [INFO ] Found NUPN structural information;
[2021-05-15 21:24:12] [INFO ] Parsed PT model containing 3503 places and 3253 transitions in 331 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 21:24:12] [INFO ] Initial state test concluded for 3 properties.
FORMULA ShieldIIPt-PT-050B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 3503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 540 place count 2963 transition count 2713
Iterating global reduction 0 with 540 rules applied. Total rules applied 1080 place count 2963 transition count 2713
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1081 place count 2962 transition count 2712
Iterating global reduction 0 with 1 rules applied. Total rules applied 1082 place count 2962 transition count 2712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1083 place count 2961 transition count 2711
Iterating global reduction 0 with 1 rules applied. Total rules applied 1084 place count 2961 transition count 2711
Applied a total of 1084 rules in 1354 ms. Remains 2961 /3503 variables (removed 542) and now considering 2711/3253 (removed 542) transitions.
// Phase 1: matrix 2711 rows 2961 cols
[2021-05-15 21:24:14] [INFO ] Computed 451 place invariants in 45 ms
[2021-05-15 21:24:15] [INFO ] Implicit Places using invariants in 1082 ms returned []
// Phase 1: matrix 2711 rows 2961 cols
[2021-05-15 21:24:15] [INFO ] Computed 451 place invariants in 13 ms
[2021-05-15 21:24:18] [INFO ] Implicit Places using invariants and state equation in 2762 ms returned []
Implicit Place search using SMT with State Equation took 3872 ms to find 0 implicit places.
// Phase 1: matrix 2711 rows 2961 cols
[2021-05-15 21:24:18] [INFO ] Computed 451 place invariants in 10 ms
[2021-05-15 21:24:20] [INFO ] Dead Transitions using invariants and state equation in 1985 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2961/3503 places, 2711/3253 transitions.
[2021-05-15 21:24:26] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-15 21:24:26] [INFO ] Flatten gal took : 215 ms
FORMULA ShieldIIPt-PT-050B-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 21:24:27] [INFO ] Flatten gal took : 123 ms
[2021-05-15 21:24:27] [INFO ] Input system was already deterministic with 2711 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1234 ms. (steps per millisecond=81 ) properties (out of 30) seen :14
Running SMT prover for 16 properties.
// Phase 1: matrix 2711 rows 2961 cols
[2021-05-15 21:24:28] [INFO ] Computed 451 place invariants in 17 ms
[2021-05-15 21:24:29] [INFO ] [Real]Absence check using 451 positive place invariants in 171 ms returned sat
[2021-05-15 21:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:24:30] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2021-05-15 21:24:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:24:31] [INFO ] [Nat]Absence check using 451 positive place invariants in 168 ms returned sat
[2021-05-15 21:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:24:42] [INFO ] [Nat]Absence check using state equation in 11856 ms returned sat
[2021-05-15 21:24:44] [INFO ] Deduced a trap composed of 20 places in 945 ms of which 14 ms to minimize.
[2021-05-15 21:24:45] [INFO ] Deduced a trap composed of 22 places in 876 ms of which 10 ms to minimize.
[2021-05-15 21:24:46] [INFO ] Deduced a trap composed of 21 places in 1131 ms of which 9 ms to minimize.
[2021-05-15 21:24:47] [INFO ] Deduced a trap composed of 21 places in 750 ms of which 2 ms to minimize.
[2021-05-15 21:24:47] [INFO ] Deduced a trap composed of 34 places in 721 ms of which 1 ms to minimize.
[2021-05-15 21:24:48] [INFO ] Deduced a trap composed of 21 places in 748 ms of which 2 ms to minimize.
[2021-05-15 21:24:49] [INFO ] Deduced a trap composed of 25 places in 732 ms of which 2 ms to minimize.
[2021-05-15 21:24:50] [INFO ] Deduced a trap composed of 27 places in 726 ms of which 2 ms to minimize.
[2021-05-15 21:24:51] [INFO ] Deduced a trap composed of 28 places in 714 ms of which 2 ms to minimize.
[2021-05-15 21:24:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-15 21:24:51] [INFO ] [Real]Absence check using 451 positive place invariants in 173 ms returned sat
[2021-05-15 21:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:24:52] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2021-05-15 21:24:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:24:53] [INFO ] [Nat]Absence check using 451 positive place invariants in 161 ms returned sat
[2021-05-15 21:24:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:24:54] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2021-05-15 21:24:55] [INFO ] Deduced a trap composed of 18 places in 765 ms of which 1 ms to minimize.
[2021-05-15 21:24:56] [INFO ] Deduced a trap composed of 17 places in 736 ms of which 2 ms to minimize.
[2021-05-15 21:24:57] [INFO ] Deduced a trap composed of 18 places in 760 ms of which 3 ms to minimize.
[2021-05-15 21:24:58] [INFO ] Deduced a trap composed of 25 places in 711 ms of which 2 ms to minimize.
[2021-05-15 21:24:58] [INFO ] Deduced a trap composed of 25 places in 727 ms of which 1 ms to minimize.
[2021-05-15 21:24:59] [INFO ] Deduced a trap composed of 20 places in 710 ms of which 1 ms to minimize.
[2021-05-15 21:25:00] [INFO ] Deduced a trap composed of 30 places in 759 ms of which 1 ms to minimize.
[2021-05-15 21:25:01] [INFO ] Deduced a trap composed of 26 places in 721 ms of which 2 ms to minimize.
[2021-05-15 21:25:02] [INFO ] Deduced a trap composed of 19 places in 680 ms of which 1 ms to minimize.
[2021-05-15 21:25:02] [INFO ] Deduced a trap composed of 20 places in 715 ms of which 1 ms to minimize.
[2021-05-15 21:25:03] [INFO ] Deduced a trap composed of 28 places in 718 ms of which 1 ms to minimize.
[2021-05-15 21:25:04] [INFO ] Deduced a trap composed of 32 places in 656 ms of which 1 ms to minimize.
[2021-05-15 21:25:05] [INFO ] Deduced a trap composed of 24 places in 663 ms of which 2 ms to minimize.
[2021-05-15 21:25:06] [INFO ] Deduced a trap composed of 34 places in 665 ms of which 1 ms to minimize.
[2021-05-15 21:25:06] [INFO ] Deduced a trap composed of 21 places in 602 ms of which 2 ms to minimize.
[2021-05-15 21:25:07] [INFO ] Deduced a trap composed of 21 places in 587 ms of which 2 ms to minimize.
[2021-05-15 21:25:08] [INFO ] Deduced a trap composed of 36 places in 597 ms of which 1 ms to minimize.
[2021-05-15 21:25:08] [INFO ] Deduced a trap composed of 37 places in 613 ms of which 1 ms to minimize.
[2021-05-15 21:25:09] [INFO ] Deduced a trap composed of 31 places in 615 ms of which 1 ms to minimize.
[2021-05-15 21:25:10] [INFO ] Deduced a trap composed of 37 places in 603 ms of which 1 ms to minimize.
[2021-05-15 21:25:10] [INFO ] Deduced a trap composed of 32 places in 581 ms of which 1 ms to minimize.
[2021-05-15 21:25:11] [INFO ] Deduced a trap composed of 31 places in 594 ms of which 1 ms to minimize.
[2021-05-15 21:25:12] [INFO ] Deduced a trap composed of 29 places in 545 ms of which 2 ms to minimize.
[2021-05-15 21:25:12] [INFO ] Deduced a trap composed of 25 places in 563 ms of which 1 ms to minimize.
[2021-05-15 21:25:13] [INFO ] Deduced a trap composed of 32 places in 525 ms of which 1 ms to minimize.
[2021-05-15 21:25:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-15 21:25:13] [INFO ] [Real]Absence check using 451 positive place invariants in 163 ms returned sat
[2021-05-15 21:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:25:15] [INFO ] [Real]Absence check using state equation in 1351 ms returned sat
[2021-05-15 21:25:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:25:15] [INFO ] [Nat]Absence check using 451 positive place invariants in 170 ms returned sat
[2021-05-15 21:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:25:17] [INFO ] [Nat]Absence check using state equation in 1348 ms returned sat
[2021-05-15 21:25:17] [INFO ] Deduced a trap composed of 19 places in 640 ms of which 1 ms to minimize.
[2021-05-15 21:25:18] [INFO ] Deduced a trap composed of 30 places in 693 ms of which 2 ms to minimize.
[2021-05-15 21:25:19] [INFO ] Deduced a trap composed of 33 places in 627 ms of which 1 ms to minimize.
[2021-05-15 21:25:20] [INFO ] Deduced a trap composed of 35 places in 632 ms of which 1 ms to minimize.
[2021-05-15 21:25:20] [INFO ] Deduced a trap composed of 26 places in 670 ms of which 1 ms to minimize.
[2021-05-15 21:25:21] [INFO ] Deduced a trap composed of 28 places in 633 ms of which 2 ms to minimize.
[2021-05-15 21:25:22] [INFO ] Deduced a trap composed of 33 places in 645 ms of which 2 ms to minimize.
[2021-05-15 21:25:23] [INFO ] Deduced a trap composed of 33 places in 645 ms of which 1 ms to minimize.
[2021-05-15 21:25:23] [INFO ] Deduced a trap composed of 34 places in 668 ms of which 1 ms to minimize.
[2021-05-15 21:25:24] [INFO ] Deduced a trap composed of 23 places in 655 ms of which 2 ms to minimize.
[2021-05-15 21:25:25] [INFO ] Deduced a trap composed of 27 places in 643 ms of which 2 ms to minimize.
[2021-05-15 21:25:26] [INFO ] Deduced a trap composed of 22 places in 566 ms of which 1 ms to minimize.
[2021-05-15 21:25:26] [INFO ] Deduced a trap composed of 26 places in 575 ms of which 3 ms to minimize.
[2021-05-15 21:25:27] [INFO ] Deduced a trap composed of 18 places in 599 ms of which 1 ms to minimize.
[2021-05-15 21:25:28] [INFO ] Deduced a trap composed of 20 places in 565 ms of which 2 ms to minimize.
[2021-05-15 21:25:28] [INFO ] Deduced a trap composed of 34 places in 511 ms of which 2 ms to minimize.
[2021-05-15 21:25:29] [INFO ] Deduced a trap composed of 23 places in 532 ms of which 2 ms to minimize.
[2021-05-15 21:25:31] [INFO ] Deduced a trap composed of 40 places in 1983 ms of which 2 ms to minimize.
[2021-05-15 21:25:31] [INFO ] Deduced a trap composed of 19 places in 513 ms of which 1 ms to minimize.
[2021-05-15 21:25:32] [INFO ] Deduced a trap composed of 37 places in 524 ms of which 1 ms to minimize.
[2021-05-15 21:25:33] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 2 ms to minimize.
[2021-05-15 21:25:33] [INFO ] Deduced a trap composed of 28 places in 559 ms of which 6 ms to minimize.
[2021-05-15 21:25:34] [INFO ] Deduced a trap composed of 39 places in 546 ms of which 1 ms to minimize.
[2021-05-15 21:25:35] [INFO ] Deduced a trap composed of 35 places in 486 ms of which 1 ms to minimize.
[2021-05-15 21:25:35] [INFO ] Deduced a trap composed of 38 places in 529 ms of which 1 ms to minimize.
[2021-05-15 21:25:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-15 21:25:36] [INFO ] [Real]Absence check using 451 positive place invariants in 163 ms returned sat
[2021-05-15 21:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:25:37] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2021-05-15 21:25:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:25:37] [INFO ] [Nat]Absence check using 451 positive place invariants in 157 ms returned sat
[2021-05-15 21:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:25:39] [INFO ] [Nat]Absence check using state equation in 1320 ms returned sat
[2021-05-15 21:25:39] [INFO ] Deduced a trap composed of 19 places in 625 ms of which 1 ms to minimize.
[2021-05-15 21:25:40] [INFO ] Deduced a trap composed of 24 places in 647 ms of which 1 ms to minimize.
[2021-05-15 21:25:41] [INFO ] Deduced a trap composed of 20 places in 651 ms of which 2 ms to minimize.
[2021-05-15 21:25:42] [INFO ] Deduced a trap composed of 19 places in 592 ms of which 2 ms to minimize.
[2021-05-15 21:25:42] [INFO ] Deduced a trap composed of 20 places in 582 ms of which 2 ms to minimize.
[2021-05-15 21:25:43] [INFO ] Deduced a trap composed of 18 places in 584 ms of which 2 ms to minimize.
[2021-05-15 21:25:44] [INFO ] Deduced a trap composed of 23 places in 613 ms of which 9 ms to minimize.
[2021-05-15 21:25:44] [INFO ] Deduced a trap composed of 22 places in 626 ms of which 9 ms to minimize.
[2021-05-15 21:25:45] [INFO ] Deduced a trap composed of 25 places in 604 ms of which 1 ms to minimize.
[2021-05-15 21:25:46] [INFO ] Deduced a trap composed of 32 places in 593 ms of which 1 ms to minimize.
[2021-05-15 21:25:46] [INFO ] Deduced a trap composed of 20 places in 582 ms of which 2 ms to minimize.
[2021-05-15 21:25:47] [INFO ] Deduced a trap composed of 28 places in 564 ms of which 2 ms to minimize.
[2021-05-15 21:25:48] [INFO ] Deduced a trap composed of 27 places in 570 ms of which 1 ms to minimize.
[2021-05-15 21:25:48] [INFO ] Deduced a trap composed of 29 places in 524 ms of which 2 ms to minimize.
[2021-05-15 21:25:49] [INFO ] Deduced a trap composed of 25 places in 481 ms of which 1 ms to minimize.
[2021-05-15 21:25:49] [INFO ] Deduced a trap composed of 26 places in 505 ms of which 1 ms to minimize.
[2021-05-15 21:25:50] [INFO ] Deduced a trap composed of 35 places in 529 ms of which 1 ms to minimize.
[2021-05-15 21:25:51] [INFO ] Deduced a trap composed of 20 places in 475 ms of which 1 ms to minimize.
[2021-05-15 21:25:51] [INFO ] Deduced a trap composed of 43 places in 459 ms of which 1 ms to minimize.
[2021-05-15 21:25:52] [INFO ] Deduced a trap composed of 33 places in 485 ms of which 1 ms to minimize.
[2021-05-15 21:25:52] [INFO ] Deduced a trap composed of 33 places in 485 ms of which 1 ms to minimize.
[2021-05-15 21:25:53] [INFO ] Deduced a trap composed of 30 places in 446 ms of which 1 ms to minimize.
[2021-05-15 21:25:53] [INFO ] Deduced a trap composed of 31 places in 427 ms of which 1 ms to minimize.
[2021-05-15 21:25:54] [INFO ] Deduced a trap composed of 34 places in 435 ms of which 1 ms to minimize.
[2021-05-15 21:25:54] [INFO ] Deduced a trap composed of 36 places in 419 ms of which 1 ms to minimize.
[2021-05-15 21:25:55] [INFO ] Deduced a trap composed of 36 places in 480 ms of which 1 ms to minimize.
[2021-05-15 21:25:56] [INFO ] Deduced a trap composed of 36 places in 459 ms of which 1 ms to minimize.
[2021-05-15 21:25:56] [INFO ] Deduced a trap composed of 30 places in 452 ms of which 1 ms to minimize.
[2021-05-15 21:25:57] [INFO ] Deduced a trap composed of 41 places in 411 ms of which 1 ms to minimize.
[2021-05-15 21:25:57] [INFO ] Deduced a trap composed of 41 places in 432 ms of which 1 ms to minimize.
[2021-05-15 21:25:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-15 21:25:58] [INFO ] [Real]Absence check using 451 positive place invariants in 160 ms returned sat
[2021-05-15 21:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:25:59] [INFO ] [Real]Absence check using state equation in 1306 ms returned sat
[2021-05-15 21:26:00] [INFO ] Deduced a trap composed of 12 places in 759 ms of which 2 ms to minimize.
[2021-05-15 21:26:01] [INFO ] Deduced a trap composed of 15 places in 735 ms of which 2 ms to minimize.
[2021-05-15 21:26:02] [INFO ] Deduced a trap composed of 17 places in 712 ms of which 1 ms to minimize.
[2021-05-15 21:26:02] [INFO ] Deduced a trap composed of 17 places in 744 ms of which 1 ms to minimize.
[2021-05-15 21:26:03] [INFO ] Deduced a trap composed of 18 places in 725 ms of which 2 ms to minimize.
[2021-05-15 21:26:04] [INFO ] Deduced a trap composed of 33 places in 720 ms of which 2 ms to minimize.
[2021-05-15 21:26:05] [INFO ] Deduced a trap composed of 23 places in 718 ms of which 1 ms to minimize.
[2021-05-15 21:26:06] [INFO ] Deduced a trap composed of 33 places in 673 ms of which 1 ms to minimize.
[2021-05-15 21:26:06] [INFO ] Deduced a trap composed of 32 places in 679 ms of which 1 ms to minimize.
[2021-05-15 21:26:07] [INFO ] Deduced a trap composed of 35 places in 665 ms of which 1 ms to minimize.
[2021-05-15 21:26:08] [INFO ] Deduced a trap composed of 23 places in 691 ms of which 2 ms to minimize.
[2021-05-15 21:26:09] [INFO ] Deduced a trap composed of 19 places in 638 ms of which 2 ms to minimize.
[2021-05-15 21:26:09] [INFO ] Deduced a trap composed of 22 places in 678 ms of which 1 ms to minimize.
[2021-05-15 21:26:10] [INFO ] Deduced a trap composed of 18 places in 638 ms of which 2 ms to minimize.
[2021-05-15 21:26:11] [INFO ] Deduced a trap composed of 24 places in 626 ms of which 2 ms to minimize.
[2021-05-15 21:26:12] [INFO ] Deduced a trap composed of 23 places in 622 ms of which 1 ms to minimize.
[2021-05-15 21:26:12] [INFO ] Deduced a trap composed of 31 places in 593 ms of which 2 ms to minimize.
[2021-05-15 21:26:13] [INFO ] Deduced a trap composed of 23 places in 601 ms of which 2 ms to minimize.
[2021-05-15 21:26:14] [INFO ] Deduced a trap composed of 33 places in 632 ms of which 2 ms to minimize.
[2021-05-15 21:26:14] [INFO ] Deduced a trap composed of 33 places in 632 ms of which 1 ms to minimize.
[2021-05-15 21:26:15] [INFO ] Deduced a trap composed of 35 places in 596 ms of which 1 ms to minimize.
[2021-05-15 21:26:16] [INFO ] Deduced a trap composed of 38 places in 605 ms of which 1 ms to minimize.
[2021-05-15 21:26:17] [INFO ] Deduced a trap composed of 36 places in 607 ms of which 1 ms to minimize.
[2021-05-15 21:26:17] [INFO ] Deduced a trap composed of 37 places in 549 ms of which 1 ms to minimize.
[2021-05-15 21:26:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-15 21:26:23] [INFO ] [Real]Absence check using 451 positive place invariants in 154 ms returned sat
[2021-05-15 21:26:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:26:25] [INFO ] [Real]Absence check using state equation in 1325 ms returned sat
[2021-05-15 21:26:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:26:25] [INFO ] [Nat]Absence check using 451 positive place invariants in 156 ms returned sat
[2021-05-15 21:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:26:26] [INFO ] [Nat]Absence check using state equation in 1202 ms returned sat
[2021-05-15 21:26:27] [INFO ] Deduced a trap composed of 19 places in 628 ms of which 2 ms to minimize.
[2021-05-15 21:26:28] [INFO ] Deduced a trap composed of 24 places in 667 ms of which 2 ms to minimize.
[2021-05-15 21:26:29] [INFO ] Deduced a trap composed of 20 places in 632 ms of which 1 ms to minimize.
[2021-05-15 21:26:29] [INFO ] Deduced a trap composed of 19 places in 657 ms of which 2 ms to minimize.
[2021-05-15 21:26:30] [INFO ] Deduced a trap composed of 20 places in 632 ms of which 2 ms to minimize.
[2021-05-15 21:26:31] [INFO ] Deduced a trap composed of 18 places in 615 ms of which 1 ms to minimize.
[2021-05-15 21:26:31] [INFO ] Deduced a trap composed of 23 places in 636 ms of which 1 ms to minimize.
[2021-05-15 21:26:32] [INFO ] Deduced a trap composed of 22 places in 605 ms of which 1 ms to minimize.
[2021-05-15 21:26:33] [INFO ] Deduced a trap composed of 25 places in 590 ms of which 2 ms to minimize.
[2021-05-15 21:26:33] [INFO ] Deduced a trap composed of 32 places in 542 ms of which 2 ms to minimize.
[2021-05-15 21:26:34] [INFO ] Deduced a trap composed of 20 places in 581 ms of which 1 ms to minimize.
[2021-05-15 21:26:35] [INFO ] Deduced a trap composed of 28 places in 574 ms of which 1 ms to minimize.
[2021-05-15 21:26:35] [INFO ] Deduced a trap composed of 27 places in 506 ms of which 1 ms to minimize.
[2021-05-15 21:26:36] [INFO ] Deduced a trap composed of 29 places in 491 ms of which 1 ms to minimize.
[2021-05-15 21:26:37] [INFO ] Deduced a trap composed of 25 places in 524 ms of which 1 ms to minimize.
[2021-05-15 21:26:37] [INFO ] Deduced a trap composed of 26 places in 496 ms of which 2 ms to minimize.
[2021-05-15 21:26:38] [INFO ] Deduced a trap composed of 35 places in 497 ms of which 2 ms to minimize.
[2021-05-15 21:26:38] [INFO ] Deduced a trap composed of 20 places in 492 ms of which 2 ms to minimize.
[2021-05-15 21:26:39] [INFO ] Deduced a trap composed of 43 places in 451 ms of which 2 ms to minimize.
[2021-05-15 21:26:39] [INFO ] Deduced a trap composed of 33 places in 498 ms of which 1 ms to minimize.
[2021-05-15 21:26:40] [INFO ] Deduced a trap composed of 33 places in 481 ms of which 1 ms to minimize.
[2021-05-15 21:26:41] [INFO ] Deduced a trap composed of 30 places in 432 ms of which 1 ms to minimize.
[2021-05-15 21:26:41] [INFO ] Deduced a trap composed of 31 places in 448 ms of which 1 ms to minimize.
[2021-05-15 21:26:42] [INFO ] Deduced a trap composed of 34 places in 439 ms of which 2 ms to minimize.
[2021-05-15 21:26:42] [INFO ] Deduced a trap composed of 36 places in 415 ms of which 1 ms to minimize.
[2021-05-15 21:26:43] [INFO ] Deduced a trap composed of 36 places in 450 ms of which 1 ms to minimize.
[2021-05-15 21:26:43] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 1 ms to minimize.
[2021-05-15 21:26:44] [INFO ] Deduced a trap composed of 30 places in 429 ms of which 1 ms to minimize.
[2021-05-15 21:26:44] [INFO ] Deduced a trap composed of 41 places in 433 ms of which 1 ms to minimize.
[2021-05-15 21:26:45] [INFO ] Deduced a trap composed of 41 places in 426 ms of which 1 ms to minimize.
[2021-05-15 21:26:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-15 21:26:45] [INFO ] [Real]Absence check using 451 positive place invariants in 155 ms returned sat
[2021-05-15 21:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:26:46] [INFO ] [Real]Absence check using state equation in 1178 ms returned sat
[2021-05-15 21:26:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:26:47] [INFO ] [Nat]Absence check using 451 positive place invariants in 158 ms returned sat
[2021-05-15 21:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:26:48] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2021-05-15 21:26:49] [INFO ] Deduced a trap composed of 27 places in 728 ms of which 1 ms to minimize.
[2021-05-15 21:26:50] [INFO ] Deduced a trap composed of 17 places in 753 ms of which 2 ms to minimize.
[2021-05-15 21:26:51] [INFO ] Deduced a trap composed of 21 places in 757 ms of which 1 ms to minimize.
[2021-05-15 21:26:52] [INFO ] Deduced a trap composed of 28 places in 786 ms of which 2 ms to minimize.
[2021-05-15 21:26:52] [INFO ] Deduced a trap composed of 18 places in 779 ms of which 2 ms to minimize.
[2021-05-15 21:26:53] [INFO ] Deduced a trap composed of 17 places in 753 ms of which 1 ms to minimize.
[2021-05-15 21:26:54] [INFO ] Deduced a trap composed of 21 places in 698 ms of which 1 ms to minimize.
[2021-05-15 21:26:55] [INFO ] Deduced a trap composed of 31 places in 683 ms of which 1 ms to minimize.
[2021-05-15 21:26:56] [INFO ] Deduced a trap composed of 24 places in 717 ms of which 2 ms to minimize.
[2021-05-15 21:26:56] [INFO ] Deduced a trap composed of 22 places in 729 ms of which 2 ms to minimize.
[2021-05-15 21:26:57] [INFO ] Deduced a trap composed of 37 places in 686 ms of which 1 ms to minimize.
[2021-05-15 21:26:58] [INFO ] Deduced a trap composed of 25 places in 651 ms of which 2 ms to minimize.
[2021-05-15 21:26:59] [INFO ] Deduced a trap composed of 21 places in 716 ms of which 2 ms to minimize.
[2021-05-15 21:27:00] [INFO ] Deduced a trap composed of 25 places in 677 ms of which 2 ms to minimize.
[2021-05-15 21:27:00] [INFO ] Deduced a trap composed of 28 places in 682 ms of which 2 ms to minimize.
[2021-05-15 21:27:01] [INFO ] Deduced a trap composed of 29 places in 685 ms of which 2 ms to minimize.
[2021-05-15 21:27:02] [INFO ] Deduced a trap composed of 31 places in 627 ms of which 2 ms to minimize.
[2021-05-15 21:27:03] [INFO ] Deduced a trap composed of 25 places in 708 ms of which 2 ms to minimize.
[2021-05-15 21:27:03] [INFO ] Deduced a trap composed of 33 places in 679 ms of which 2 ms to minimize.
[2021-05-15 21:27:04] [INFO ] Deduced a trap composed of 27 places in 637 ms of which 1 ms to minimize.
[2021-05-15 21:27:05] [INFO ] Deduced a trap composed of 29 places in 667 ms of which 1 ms to minimize.
[2021-05-15 21:27:06] [INFO ] Deduced a trap composed of 37 places in 650 ms of which 2 ms to minimize.
[2021-05-15 21:27:06] [INFO ] Deduced a trap composed of 24 places in 600 ms of which 2 ms to minimize.
[2021-05-15 21:27:07] [INFO ] Deduced a trap composed of 55 places in 608 ms of which 1 ms to minimize.
[2021-05-15 21:27:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-15 21:27:07] [INFO ] [Real]Absence check using 451 positive place invariants in 159 ms returned sat
[2021-05-15 21:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:27:09] [INFO ] [Real]Absence check using state equation in 1227 ms returned sat
[2021-05-15 21:27:10] [INFO ] Deduced a trap composed of 29 places in 782 ms of which 2 ms to minimize.
[2021-05-15 21:27:10] [INFO ] Deduced a trap composed of 18 places in 768 ms of which 1 ms to minimize.
[2021-05-15 21:27:11] [INFO ] Deduced a trap composed of 21 places in 749 ms of which 1 ms to minimize.
[2021-05-15 21:27:12] [INFO ] Deduced a trap composed of 28 places in 751 ms of which 2 ms to minimize.
[2021-05-15 21:27:13] [INFO ] Deduced a trap composed of 28 places in 753 ms of which 2 ms to minimize.
[2021-05-15 21:27:14] [INFO ] Deduced a trap composed of 30 places in 732 ms of which 1 ms to minimize.
[2021-05-15 21:27:15] [INFO ] Deduced a trap composed of 34 places in 768 ms of which 2 ms to minimize.
[2021-05-15 21:27:15] [INFO ] Deduced a trap composed of 35 places in 709 ms of which 2 ms to minimize.
[2021-05-15 21:27:16] [INFO ] Deduced a trap composed of 21 places in 694 ms of which 2 ms to minimize.
[2021-05-15 21:27:17] [INFO ] Deduced a trap composed of 30 places in 669 ms of which 2 ms to minimize.
[2021-05-15 21:27:18] [INFO ] Deduced a trap composed of 17 places in 654 ms of which 1 ms to minimize.
[2021-05-15 21:27:19] [INFO ] Deduced a trap composed of 17 places in 649 ms of which 2 ms to minimize.
[2021-05-15 21:27:19] [INFO ] Deduced a trap composed of 33 places in 639 ms of which 2 ms to minimize.
[2021-05-15 21:27:20] [INFO ] Deduced a trap composed of 21 places in 650 ms of which 9 ms to minimize.
[2021-05-15 21:27:21] [INFO ] Deduced a trap composed of 26 places in 626 ms of which 2 ms to minimize.
[2021-05-15 21:27:22] [INFO ] Deduced a trap composed of 20 places in 642 ms of which 2 ms to minimize.
[2021-05-15 21:27:22] [INFO ] Deduced a trap composed of 31 places in 628 ms of which 1 ms to minimize.
[2021-05-15 21:27:23] [INFO ] Deduced a trap composed of 33 places in 666 ms of which 1 ms to minimize.
[2021-05-15 21:27:24] [INFO ] Deduced a trap composed of 38 places in 603 ms of which 1 ms to minimize.
[2021-05-15 21:27:24] [INFO ] Deduced a trap composed of 26 places in 598 ms of which 1 ms to minimize.
[2021-05-15 21:27:25] [INFO ] Deduced a trap composed of 41 places in 637 ms of which 2 ms to minimize.
[2021-05-15 21:27:26] [INFO ] Deduced a trap composed of 26 places in 600 ms of which 2 ms to minimize.
[2021-05-15 21:27:27] [INFO ] Deduced a trap composed of 34 places in 569 ms of which 2 ms to minimize.
[2021-05-15 21:27:27] [INFO ] Deduced a trap composed of 36 places in 625 ms of which 1 ms to minimize.
[2021-05-15 21:27:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-15 21:27:28] [INFO ] [Real]Absence check using 451 positive place invariants in 159 ms returned sat
[2021-05-15 21:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:27:29] [INFO ] [Real]Absence check using state equation in 1288 ms returned sat
[2021-05-15 21:27:30] [INFO ] Deduced a trap composed of 32 places in 698 ms of which 2 ms to minimize.
[2021-05-15 21:27:31] [INFO ] Deduced a trap composed of 34 places in 671 ms of which 2 ms to minimize.
[2021-05-15 21:27:31] [INFO ] Deduced a trap composed of 27 places in 674 ms of which 1 ms to minimize.
[2021-05-15 21:27:32] [INFO ] Deduced a trap composed of 30 places in 727 ms of which 2 ms to minimize.
[2021-05-15 21:27:33] [INFO ] Deduced a trap composed of 34 places in 722 ms of which 1 ms to minimize.
[2021-05-15 21:27:34] [INFO ] Deduced a trap composed of 21 places in 710 ms of which 1 ms to minimize.
[2021-05-15 21:27:35] [INFO ] Deduced a trap composed of 34 places in 699 ms of which 1 ms to minimize.
[2021-05-15 21:27:35] [INFO ] Deduced a trap composed of 21 places in 633 ms of which 1 ms to minimize.
[2021-05-15 21:27:36] [INFO ] Deduced a trap composed of 20 places in 697 ms of which 1 ms to minimize.
[2021-05-15 21:27:37] [INFO ] Deduced a trap composed of 31 places in 617 ms of which 2 ms to minimize.
[2021-05-15 21:27:38] [INFO ] Deduced a trap composed of 17 places in 663 ms of which 1 ms to minimize.
[2021-05-15 21:27:38] [INFO ] Deduced a trap composed of 25 places in 667 ms of which 1 ms to minimize.
[2021-05-15 21:27:39] [INFO ] Deduced a trap composed of 16 places in 654 ms of which 2 ms to minimize.
[2021-05-15 21:27:40] [INFO ] Deduced a trap composed of 29 places in 650 ms of which 1 ms to minimize.
[2021-05-15 21:27:41] [INFO ] Deduced a trap composed of 23 places in 632 ms of which 1 ms to minimize.
[2021-05-15 21:27:41] [INFO ] Deduced a trap composed of 33 places in 622 ms of which 1 ms to minimize.
[2021-05-15 21:27:42] [INFO ] Deduced a trap composed of 29 places in 640 ms of which 1 ms to minimize.
[2021-05-15 21:27:43] [INFO ] Deduced a trap composed of 26 places in 579 ms of which 2 ms to minimize.
[2021-05-15 21:27:44] [INFO ] Deduced a trap composed of 25 places in 616 ms of which 1 ms to minimize.
[2021-05-15 21:27:44] [INFO ] Deduced a trap composed of 42 places in 567 ms of which 2 ms to minimize.
[2021-05-15 21:27:45] [INFO ] Deduced a trap composed of 36 places in 611 ms of which 1 ms to minimize.
[2021-05-15 21:27:46] [INFO ] Deduced a trap composed of 18 places in 586 ms of which 1 ms to minimize.
[2021-05-15 21:27:46] [INFO ] Deduced a trap composed of 37 places in 606 ms of which 1 ms to minimize.
[2021-05-15 21:27:47] [INFO ] Deduced a trap composed of 36 places in 568 ms of which 1 ms to minimize.
[2021-05-15 21:27:48] [INFO ] Deduced a trap composed of 39 places in 565 ms of which 2 ms to minimize.
[2021-05-15 21:27:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-15 21:27:48] [INFO ] [Real]Absence check using 451 positive place invariants in 162 ms returned sat
[2021-05-15 21:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:27:49] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2021-05-15 21:27:50] [INFO ] Deduced a trap composed of 21 places in 726 ms of which 1 ms to minimize.
[2021-05-15 21:27:51] [INFO ] Deduced a trap composed of 17 places in 710 ms of which 2 ms to minimize.
[2021-05-15 21:27:52] [INFO ] Deduced a trap composed of 17 places in 705 ms of which 1 ms to minimize.
[2021-05-15 21:27:53] [INFO ] Deduced a trap composed of 15 places in 749 ms of which 1 ms to minimize.
[2021-05-15 21:27:54] [INFO ] Deduced a trap composed of 26 places in 755 ms of which 2 ms to minimize.
[2021-05-15 21:27:54] [INFO ] Deduced a trap composed of 17 places in 776 ms of which 1 ms to minimize.
[2021-05-15 21:27:55] [INFO ] Deduced a trap composed of 18 places in 678 ms of which 2 ms to minimize.
[2021-05-15 21:27:56] [INFO ] Deduced a trap composed of 26 places in 754 ms of which 2 ms to minimize.
[2021-05-15 21:27:57] [INFO ] Deduced a trap composed of 26 places in 742 ms of which 1 ms to minimize.
[2021-05-15 21:27:58] [INFO ] Deduced a trap composed of 12 places in 720 ms of which 1 ms to minimize.
[2021-05-15 21:27:58] [INFO ] Deduced a trap composed of 16 places in 705 ms of which 1 ms to minimize.
[2021-05-15 21:27:59] [INFO ] Deduced a trap composed of 34 places in 704 ms of which 1 ms to minimize.
[2021-05-15 21:28:00] [INFO ] Deduced a trap composed of 21 places in 689 ms of which 2 ms to minimize.
[2021-05-15 21:28:01] [INFO ] Deduced a trap composed of 28 places in 665 ms of which 1 ms to minimize.
[2021-05-15 21:28:02] [INFO ] Deduced a trap composed of 24 places in 647 ms of which 2 ms to minimize.
[2021-05-15 21:28:02] [INFO ] Deduced a trap composed of 18 places in 633 ms of which 1 ms to minimize.
[2021-05-15 21:28:03] [INFO ] Deduced a trap composed of 34 places in 614 ms of which 1 ms to minimize.
[2021-05-15 21:28:04] [INFO ] Deduced a trap composed of 31 places in 604 ms of which 2 ms to minimize.
[2021-05-15 21:28:04] [INFO ] Deduced a trap composed of 19 places in 623 ms of which 1 ms to minimize.
[2021-05-15 21:28:05] [INFO ] Deduced a trap composed of 23 places in 630 ms of which 1 ms to minimize.
[2021-05-15 21:28:06] [INFO ] Deduced a trap composed of 43 places in 642 ms of which 2 ms to minimize.
[2021-05-15 21:28:07] [INFO ] Deduced a trap composed of 31 places in 618 ms of which 1 ms to minimize.
[2021-05-15 21:28:07] [INFO ] Deduced a trap composed of 38 places in 604 ms of which 1 ms to minimize.
[2021-05-15 21:28:08] [INFO ] Deduced a trap composed of 40 places in 552 ms of which 1 ms to minimize.
[2021-05-15 21:28:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-05-15 21:28:08] [INFO ] [Real]Absence check using 451 positive place invariants in 153 ms returned sat
[2021-05-15 21:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:28:10] [INFO ] [Real]Absence check using state equation in 1171 ms returned sat
[2021-05-15 21:28:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:28:10] [INFO ] [Nat]Absence check using 451 positive place invariants in 155 ms returned sat
[2021-05-15 21:28:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:28:11] [INFO ] [Nat]Absence check using state equation in 1181 ms returned sat
[2021-05-15 21:28:12] [INFO ] Deduced a trap composed of 23 places in 681 ms of which 1 ms to minimize.
[2021-05-15 21:28:13] [INFO ] Deduced a trap composed of 24 places in 716 ms of which 2 ms to minimize.
[2021-05-15 21:28:14] [INFO ] Deduced a trap composed of 18 places in 702 ms of which 1 ms to minimize.
[2021-05-15 21:28:14] [INFO ] Deduced a trap composed of 25 places in 693 ms of which 2 ms to minimize.
[2021-05-15 21:28:15] [INFO ] Deduced a trap composed of 12 places in 655 ms of which 1 ms to minimize.
[2021-05-15 21:28:16] [INFO ] Deduced a trap composed of 23 places in 654 ms of which 1 ms to minimize.
[2021-05-15 21:28:17] [INFO ] Deduced a trap composed of 22 places in 675 ms of which 6 ms to minimize.
[2021-05-15 21:28:17] [INFO ] Deduced a trap composed of 28 places in 675 ms of which 2 ms to minimize.
[2021-05-15 21:28:18] [INFO ] Deduced a trap composed of 19 places in 667 ms of which 1 ms to minimize.
[2021-05-15 21:28:19] [INFO ] Deduced a trap composed of 16 places in 682 ms of which 2 ms to minimize.
[2021-05-15 21:28:20] [INFO ] Deduced a trap composed of 16 places in 616 ms of which 1 ms to minimize.
[2021-05-15 21:28:20] [INFO ] Deduced a trap composed of 22 places in 599 ms of which 2 ms to minimize.
[2021-05-15 21:28:21] [INFO ] Deduced a trap composed of 28 places in 604 ms of which 1 ms to minimize.
[2021-05-15 21:28:22] [INFO ] Deduced a trap composed of 22 places in 638 ms of which 2 ms to minimize.
[2021-05-15 21:28:22] [INFO ] Deduced a trap composed of 23 places in 565 ms of which 1 ms to minimize.
[2021-05-15 21:28:23] [INFO ] Deduced a trap composed of 41 places in 631 ms of which 2 ms to minimize.
[2021-05-15 21:28:24] [INFO ] Deduced a trap composed of 17 places in 584 ms of which 2 ms to minimize.
[2021-05-15 21:28:25] [INFO ] Deduced a trap composed of 29 places in 569 ms of which 2 ms to minimize.
[2021-05-15 21:28:25] [INFO ] Deduced a trap composed of 18 places in 546 ms of which 2 ms to minimize.
[2021-05-15 21:28:26] [INFO ] Deduced a trap composed of 18 places in 614 ms of which 1 ms to minimize.
[2021-05-15 21:28:27] [INFO ] Deduced a trap composed of 27 places in 622 ms of which 2 ms to minimize.
[2021-05-15 21:28:27] [INFO ] Deduced a trap composed of 26 places in 586 ms of which 1 ms to minimize.
[2021-05-15 21:28:28] [INFO ] Deduced a trap composed of 22 places in 584 ms of which 1 ms to minimize.
[2021-05-15 21:28:29] [INFO ] Deduced a trap composed of 21 places in 563 ms of which 1 ms to minimize.
[2021-05-15 21:28:29] [INFO ] Deduced a trap composed of 41 places in 583 ms of which 1 ms to minimize.
[2021-05-15 21:28:30] [INFO ] Deduced a trap composed of 30 places in 533 ms of which 1 ms to minimize.
[2021-05-15 21:28:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
[2021-05-15 21:28:30] [INFO ] [Real]Absence check using 451 positive place invariants in 156 ms returned sat
[2021-05-15 21:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:28:32] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2021-05-15 21:28:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:28:32] [INFO ] [Nat]Absence check using 451 positive place invariants in 157 ms returned sat
[2021-05-15 21:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:28:34] [INFO ] [Nat]Absence check using state equation in 1403 ms returned sat
[2021-05-15 21:28:34] [INFO ] Deduced a trap composed of 13 places in 836 ms of which 1 ms to minimize.
[2021-05-15 21:28:35] [INFO ] Deduced a trap composed of 31 places in 837 ms of which 2 ms to minimize.
[2021-05-15 21:28:36] [INFO ] Deduced a trap composed of 18 places in 844 ms of which 2 ms to minimize.
[2021-05-15 21:28:37] [INFO ] Deduced a trap composed of 21 places in 781 ms of which 1 ms to minimize.
[2021-05-15 21:28:38] [INFO ] Deduced a trap composed of 25 places in 748 ms of which 1 ms to minimize.
[2021-05-15 21:28:39] [INFO ] Deduced a trap composed of 25 places in 741 ms of which 2 ms to minimize.
[2021-05-15 21:28:40] [INFO ] Deduced a trap composed of 25 places in 811 ms of which 1 ms to minimize.
[2021-05-15 21:28:41] [INFO ] Deduced a trap composed of 22 places in 732 ms of which 1 ms to minimize.
[2021-05-15 21:28:41] [INFO ] Deduced a trap composed of 33 places in 783 ms of which 2 ms to minimize.
[2021-05-15 21:28:42] [INFO ] Deduced a trap composed of 23 places in 722 ms of which 2 ms to minimize.
[2021-05-15 21:28:43] [INFO ] Deduced a trap composed of 29 places in 721 ms of which 2 ms to minimize.
[2021-05-15 21:28:44] [INFO ] Deduced a trap composed of 34 places in 712 ms of which 2 ms to minimize.
[2021-05-15 21:28:45] [INFO ] Deduced a trap composed of 28 places in 740 ms of which 2 ms to minimize.
[2021-05-15 21:28:45] [INFO ] Deduced a trap composed of 25 places in 689 ms of which 2 ms to minimize.
[2021-05-15 21:28:46] [INFO ] Deduced a trap composed of 24 places in 743 ms of which 1 ms to minimize.
[2021-05-15 21:28:47] [INFO ] Deduced a trap composed of 28 places in 713 ms of which 2 ms to minimize.
[2021-05-15 21:28:48] [INFO ] Deduced a trap composed of 17 places in 720 ms of which 2 ms to minimize.
[2021-05-15 21:28:49] [INFO ] Deduced a trap composed of 44 places in 676 ms of which 1 ms to minimize.
[2021-05-15 21:28:49] [INFO ] Deduced a trap composed of 30 places in 635 ms of which 1 ms to minimize.
[2021-05-15 21:28:50] [INFO ] Deduced a trap composed of 39 places in 705 ms of which 1 ms to minimize.
[2021-05-15 21:28:51] [INFO ] Deduced a trap composed of 38 places in 618 ms of which 1 ms to minimize.
[2021-05-15 21:28:52] [INFO ] Deduced a trap composed of 31 places in 702 ms of which 2 ms to minimize.
[2021-05-15 21:28:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
[2021-05-15 21:28:52] [INFO ] [Real]Absence check using 451 positive place invariants in 161 ms returned sat
[2021-05-15 21:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:28:53] [INFO ] [Real]Absence check using state equation in 1302 ms returned sat
[2021-05-15 21:28:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:28:54] [INFO ] [Nat]Absence check using 451 positive place invariants in 166 ms returned sat
[2021-05-15 21:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:28:55] [INFO ] [Nat]Absence check using state equation in 1428 ms returned sat
[2021-05-15 21:28:56] [INFO ] Deduced a trap composed of 17 places in 790 ms of which 1 ms to minimize.
[2021-05-15 21:28:57] [INFO ] Deduced a trap composed of 17 places in 769 ms of which 2 ms to minimize.
[2021-05-15 21:28:58] [INFO ] Deduced a trap composed of 24 places in 730 ms of which 1 ms to minimize.
[2021-05-15 21:28:59] [INFO ] Deduced a trap composed of 16 places in 736 ms of which 3 ms to minimize.
[2021-05-15 21:29:00] [INFO ] Deduced a trap composed of 17 places in 774 ms of which 2 ms to minimize.
[2021-05-15 21:29:01] [INFO ] Deduced a trap composed of 22 places in 759 ms of which 2 ms to minimize.
[2021-05-15 21:29:01] [INFO ] Deduced a trap composed of 18 places in 690 ms of which 2 ms to minimize.
[2021-05-15 21:29:02] [INFO ] Deduced a trap composed of 23 places in 682 ms of which 1 ms to minimize.
[2021-05-15 21:29:03] [INFO ] Deduced a trap composed of 15 places in 730 ms of which 2 ms to minimize.
[2021-05-15 21:29:04] [INFO ] Deduced a trap composed of 25 places in 760 ms of which 1 ms to minimize.
[2021-05-15 21:29:05] [INFO ] Deduced a trap composed of 28 places in 761 ms of which 1 ms to minimize.
[2021-05-15 21:29:06] [INFO ] Deduced a trap composed of 32 places in 734 ms of which 1 ms to minimize.
[2021-05-15 21:29:06] [INFO ] Deduced a trap composed of 23 places in 706 ms of which 1 ms to minimize.
[2021-05-15 21:29:07] [INFO ] Deduced a trap composed of 25 places in 719 ms of which 2 ms to minimize.
[2021-05-15 21:29:08] [INFO ] Deduced a trap composed of 25 places in 732 ms of which 2 ms to minimize.
[2021-05-15 21:29:09] [INFO ] Deduced a trap composed of 17 places in 711 ms of which 2 ms to minimize.
[2021-05-15 21:29:10] [INFO ] Deduced a trap composed of 19 places in 689 ms of which 1 ms to minimize.
[2021-05-15 21:29:10] [INFO ] Deduced a trap composed of 34 places in 698 ms of which 1 ms to minimize.
[2021-05-15 21:29:11] [INFO ] Deduced a trap composed of 26 places in 671 ms of which 2 ms to minimize.
[2021-05-15 21:29:12] [INFO ] Deduced a trap composed of 37 places in 691 ms of which 2 ms to minimize.
[2021-05-15 21:29:13] [INFO ] Deduced a trap composed of 36 places in 671 ms of which 1 ms to minimize.
[2021-05-15 21:29:13] [INFO ] Deduced a trap composed of 24 places in 663 ms of which 1 ms to minimize.
[2021-05-15 21:29:14] [INFO ] Deduced a trap composed of 39 places in 638 ms of which 1 ms to minimize.
[2021-05-15 21:29:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
[2021-05-15 21:29:15] [INFO ] [Real]Absence check using 451 positive place invariants in 166 ms returned sat
[2021-05-15 21:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:29:16] [INFO ] [Real]Absence check using state equation in 1274 ms returned sat
[2021-05-15 21:29:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:29:16] [INFO ] [Nat]Absence check using 451 positive place invariants in 171 ms returned sat
[2021-05-15 21:29:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:29:18] [INFO ] [Nat]Absence check using state equation in 1272 ms returned sat
[2021-05-15 21:29:18] [INFO ] Deduced a trap composed of 20 places in 684 ms of which 2 ms to minimize.
[2021-05-15 21:29:19] [INFO ] Deduced a trap composed of 25 places in 733 ms of which 1 ms to minimize.
[2021-05-15 21:29:20] [INFO ] Deduced a trap composed of 33 places in 686 ms of which 1 ms to minimize.
[2021-05-15 21:29:21] [INFO ] Deduced a trap composed of 31 places in 664 ms of which 1 ms to minimize.
[2021-05-15 21:29:22] [INFO ] Deduced a trap composed of 17 places in 698 ms of which 1 ms to minimize.
[2021-05-15 21:29:22] [INFO ] Deduced a trap composed of 29 places in 704 ms of which 1 ms to minimize.
[2021-05-15 21:29:23] [INFO ] Deduced a trap composed of 27 places in 683 ms of which 2 ms to minimize.
[2021-05-15 21:29:24] [INFO ] Deduced a trap composed of 17 places in 667 ms of which 3 ms to minimize.
[2021-05-15 21:29:25] [INFO ] Deduced a trap composed of 28 places in 635 ms of which 1 ms to minimize.
[2021-05-15 21:29:25] [INFO ] Deduced a trap composed of 27 places in 620 ms of which 1 ms to minimize.
[2021-05-15 21:29:26] [INFO ] Deduced a trap composed of 21 places in 683 ms of which 1 ms to minimize.
[2021-05-15 21:29:27] [INFO ] Deduced a trap composed of 23 places in 678 ms of which 2 ms to minimize.
[2021-05-15 21:29:28] [INFO ] Deduced a trap composed of 18 places in 619 ms of which 1 ms to minimize.
[2021-05-15 21:29:28] [INFO ] Deduced a trap composed of 38 places in 618 ms of which 2 ms to minimize.
[2021-05-15 21:29:29] [INFO ] Deduced a trap composed of 37 places in 664 ms of which 1 ms to minimize.
[2021-05-15 21:29:30] [INFO ] Deduced a trap composed of 28 places in 650 ms of which 1 ms to minimize.
[2021-05-15 21:29:31] [INFO ] Deduced a trap composed of 41 places in 591 ms of which 1 ms to minimize.
[2021-05-15 21:29:31] [INFO ] Deduced a trap composed of 43 places in 559 ms of which 1 ms to minimize.
[2021-05-15 21:29:32] [INFO ] Deduced a trap composed of 32 places in 545 ms of which 2 ms to minimize.
[2021-05-15 21:29:32] [INFO ] Deduced a trap composed of 26 places in 577 ms of which 1 ms to minimize.
[2021-05-15 21:29:33] [INFO ] Deduced a trap composed of 35 places in 576 ms of which 1 ms to minimize.
[2021-05-15 21:29:34] [INFO ] Deduced a trap composed of 22 places in 537 ms of which 1 ms to minimize.
[2021-05-15 21:29:34] [INFO ] Deduced a trap composed of 26 places in 573 ms of which 1 ms to minimize.
[2021-05-15 21:29:35] [INFO ] Deduced a trap composed of 34 places in 570 ms of which 1 ms to minimize.
[2021-05-15 21:29:36] [INFO ] Deduced a trap composed of 33 places in 532 ms of which 1 ms to minimize.
[2021-05-15 21:29:36] [INFO ] Deduced a trap composed of 25 places in 498 ms of which 1 ms to minimize.
[2021-05-15 21:29:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
[2021-05-15 21:29:37] [INFO ] [Real]Absence check using 451 positive place invariants in 166 ms returned sat
[2021-05-15 21:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:29:38] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2021-05-15 21:29:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:29:39] [INFO ] [Nat]Absence check using 451 positive place invariants in 156 ms returned sat
[2021-05-15 21:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:29:40] [INFO ] [Nat]Absence check using state equation in 1376 ms returned sat
[2021-05-15 21:29:41] [INFO ] Deduced a trap composed of 16 places in 734 ms of which 2 ms to minimize.
[2021-05-15 21:29:42] [INFO ] Deduced a trap composed of 12 places in 768 ms of which 1 ms to minimize.
[2021-05-15 21:29:43] [INFO ] Deduced a trap composed of 23 places in 716 ms of which 1 ms to minimize.
[2021-05-15 21:29:43] [INFO ] Deduced a trap composed of 17 places in 721 ms of which 2 ms to minimize.
[2021-05-15 21:29:44] [INFO ] Deduced a trap composed of 22 places in 696 ms of which 1 ms to minimize.
[2021-05-15 21:29:45] [INFO ] Deduced a trap composed of 22 places in 707 ms of which 1 ms to minimize.
[2021-05-15 21:29:46] [INFO ] Deduced a trap composed of 18 places in 658 ms of which 2 ms to minimize.
[2021-05-15 21:29:46] [INFO ] Deduced a trap composed of 21 places in 632 ms of which 2 ms to minimize.
[2021-05-15 21:29:47] [INFO ] Deduced a trap composed of 32 places in 628 ms of which 2 ms to minimize.
[2021-05-15 21:29:48] [INFO ] Deduced a trap composed of 36 places in 615 ms of which 2 ms to minimize.
[2021-05-15 21:29:49] [INFO ] Deduced a trap composed of 29 places in 627 ms of which 1 ms to minimize.
[2021-05-15 21:29:49] [INFO ] Deduced a trap composed of 17 places in 648 ms of which 1 ms to minimize.
[2021-05-15 21:29:50] [INFO ] Deduced a trap composed of 27 places in 605 ms of which 2 ms to minimize.
[2021-05-15 21:29:51] [INFO ] Deduced a trap composed of 28 places in 601 ms of which 2 ms to minimize.
[2021-05-15 21:29:51] [INFO ] Deduced a trap composed of 26 places in 610 ms of which 1 ms to minimize.
[2021-05-15 21:29:52] [INFO ] Deduced a trap composed of 24 places in 581 ms of which 1 ms to minimize.
[2021-05-15 21:29:53] [INFO ] Deduced a trap composed of 25 places in 635 ms of which 1 ms to minimize.
[2021-05-15 21:29:53] [INFO ] Deduced a trap composed of 37 places in 587 ms of which 1 ms to minimize.
[2021-05-15 21:29:54] [INFO ] Deduced a trap composed of 26 places in 649 ms of which 2 ms to minimize.
[2021-05-15 21:29:55] [INFO ] Deduced a trap composed of 39 places in 597 ms of which 1 ms to minimize.
[2021-05-15 21:29:55] [INFO ] Deduced a trap composed of 34 places in 540 ms of which 2 ms to minimize.
[2021-05-15 21:29:56] [INFO ] Deduced a trap composed of 33 places in 531 ms of which 1 ms to minimize.
[2021-05-15 21:29:57] [INFO ] Deduced a trap composed of 30 places in 551 ms of which 1 ms to minimize.
[2021-05-15 21:29:57] [INFO ] Deduced a trap composed of 31 places in 512 ms of which 1 ms to minimize.
[2021-05-15 21:29:58] [INFO ] Deduced a trap composed of 28 places in 570 ms of which 1 ms to minimize.
[2021-05-15 21:29:59] [INFO ] Deduced a trap composed of 27 places in 564 ms of which 1 ms to minimize.
[2021-05-15 21:29:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 14
[2021-05-15 21:29:59] [INFO ] [Real]Absence check using 451 positive place invariants in 167 ms returned sat
[2021-05-15 21:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:30:00] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2021-05-15 21:30:01] [INFO ] Deduced a trap composed of 28 places in 754 ms of which 1 ms to minimize.
[2021-05-15 21:30:02] [INFO ] Deduced a trap composed of 31 places in 752 ms of which 1 ms to minimize.
[2021-05-15 21:30:03] [INFO ] Deduced a trap composed of 16 places in 703 ms of which 2 ms to minimize.
[2021-05-15 21:30:04] [INFO ] Deduced a trap composed of 34 places in 746 ms of which 2 ms to minimize.
[2021-05-15 21:30:05] [INFO ] Deduced a trap composed of 17 places in 682 ms of which 1 ms to minimize.
[2021-05-15 21:30:05] [INFO ] Deduced a trap composed of 23 places in 689 ms of which 2 ms to minimize.
[2021-05-15 21:30:06] [INFO ] Deduced a trap composed of 23 places in 723 ms of which 2 ms to minimize.
[2021-05-15 21:30:07] [INFO ] Deduced a trap composed of 26 places in 670 ms of which 2 ms to minimize.
[2021-05-15 21:30:08] [INFO ] Deduced a trap composed of 17 places in 669 ms of which 1 ms to minimize.
[2021-05-15 21:30:09] [INFO ] Deduced a trap composed of 28 places in 688 ms of which 1 ms to minimize.
[2021-05-15 21:30:09] [INFO ] Deduced a trap composed of 24 places in 648 ms of which 2 ms to minimize.
[2021-05-15 21:30:10] [INFO ] Deduced a trap composed of 28 places in 630 ms of which 2 ms to minimize.
[2021-05-15 21:30:11] [INFO ] Deduced a trap composed of 22 places in 623 ms of which 2 ms to minimize.
[2021-05-15 21:30:11] [INFO ] Deduced a trap composed of 21 places in 617 ms of which 1 ms to minimize.
[2021-05-15 21:30:12] [INFO ] Deduced a trap composed of 36 places in 601 ms of which 2 ms to minimize.
[2021-05-15 21:30:13] [INFO ] Deduced a trap composed of 37 places in 592 ms of which 2 ms to minimize.
[2021-05-15 21:30:14] [INFO ] Deduced a trap composed of 36 places in 636 ms of which 1 ms to minimize.
[2021-05-15 21:30:14] [INFO ] Deduced a trap composed of 34 places in 646 ms of which 1 ms to minimize.
[2021-05-15 21:30:15] [INFO ] Deduced a trap composed of 32 places in 638 ms of which 1 ms to minimize.
[2021-05-15 21:30:16] [INFO ] Deduced a trap composed of 28 places in 645 ms of which 1 ms to minimize.
[2021-05-15 21:30:16] [INFO ] Deduced a trap composed of 28 places in 585 ms of which 1 ms to minimize.
[2021-05-15 21:30:17] [INFO ] Deduced a trap composed of 29 places in 636 ms of which 1 ms to minimize.
[2021-05-15 21:30:18] [INFO ] Deduced a trap composed of 30 places in 623 ms of which 2 ms to minimize.
[2021-05-15 21:30:19] [INFO ] Deduced a trap composed of 38 places in 588 ms of which 2 ms to minimize.
[2021-05-15 21:30:20] [INFO ] Deduced a trap composed of 21 places in 1680 ms of which 2 ms to minimize.
[2021-05-15 21:30:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X((X(F(p0))||(p1 U (p2||G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2952 transition count 2702
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2952 transition count 2702
Applied a total of 18 rules in 390 ms. Remains 2952 /2961 variables (removed 9) and now considering 2702/2711 (removed 9) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:30:22] [INFO ] Computed 451 place invariants in 10 ms
[2021-05-15 21:30:23] [INFO ] Implicit Places using invariants in 1045 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:30:23] [INFO ] Computed 451 place invariants in 10 ms
[2021-05-15 21:30:27] [INFO ] Implicit Places using invariants and state equation in 4326 ms returned []
Implicit Place search using SMT with State Equation took 5380 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:30:27] [INFO ] Computed 451 place invariants in 8 ms
[2021-05-15 21:30:29] [INFO ] Dead Transitions using invariants and state equation in 1977 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2952/2961 places, 2702/2711 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(EQ s1086 1), p2:(AND (NEQ s542 1) (NEQ s1001 1)), p1:(NEQ s1001 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 834 ms.
Product exploration explored 100000 steps with 20000 reset in 710 ms.
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 652 ms.
Product exploration explored 100000 steps with 20000 reset in 666 ms.
Applying partial POR strategy [true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 2952 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Performed 597 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 2952 transition count 2702
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 253 Pre rules applied. Total rules applied 597 place count 2952 transition count 3006
Deduced a syphon composed of 850 places in 9 ms
Iterating global reduction 1 with 253 rules applied. Total rules applied 850 place count 2952 transition count 3006
Performed 948 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1798 places in 6 ms
Iterating global reduction 1 with 948 rules applied. Total rules applied 1798 place count 2952 transition count 3006
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1799 place count 2952 transition count 3005
Renaming transitions due to excessive name length > 1024 char.
Discarding 348 places :
Symmetric choice reduction at 2 with 348 rule applications. Total rules 2147 place count 2604 transition count 2657
Deduced a syphon composed of 1450 places in 6 ms
Iterating global reduction 2 with 348 rules applied. Total rules applied 2495 place count 2604 transition count 2657
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1451 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2496 place count 2604 transition count 2657
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2498 place count 2602 transition count 2655
Deduced a syphon composed of 1449 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2500 place count 2602 transition count 2655
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -542
Deduced a syphon composed of 1550 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2601 place count 2602 transition count 3197
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2703 place count 2500 transition count 2993
Deduced a syphon composed of 1448 places in 4 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2805 place count 2500 transition count 2993
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -260
Deduced a syphon composed of 1496 places in 5 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 2853 place count 2500 transition count 3253
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 2901 place count 2452 transition count 3157
Deduced a syphon composed of 1448 places in 4 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 2949 place count 2452 transition count 3157
Deduced a syphon composed of 1448 places in 3 ms
Applied a total of 2949 rules in 2550 ms. Remains 2452 /2952 variables (removed 500) and now considering 3157/2702 (removed -455) transitions.
[2021-05-15 21:30:38] [INFO ] Redundant transitions in 233 ms returned []
// Phase 1: matrix 3157 rows 2452 cols
[2021-05-15 21:30:38] [INFO ] Computed 451 place invariants in 32 ms
[2021-05-15 21:30:40] [INFO ] Dead Transitions using invariants and state equation in 1937 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2452/2952 places, 3157/2702 transitions.
Product exploration explored 100000 steps with 20000 reset in 717 ms.
Product exploration explored 100000 steps with 20000 reset in 691 ms.
[2021-05-15 21:30:42] [INFO ] Flatten gal took : 90 ms
[2021-05-15 21:30:42] [INFO ] Flatten gal took : 82 ms
[2021-05-15 21:30:42] [INFO ] Time to serialize gal into /tmp/LTL8167586350934170188.gal : 44 ms
[2021-05-15 21:30:42] [INFO ] Time to serialize properties into /tmp/LTL12703446873035592671.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8167586350934170188.gal, -t, CGAL, -LTL, /tmp/LTL12703446873035592671.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8167586350934170188.gal -t CGAL -LTL /tmp/LTL12703446873035592671.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((X(F("(p1278==1)")))||(("(p1176!=1)")U(("((p630!=1)&&(p1176!=1))")||(G("(p1176!=1)"))))))))))
Formula 0 simplified : !XXXX(XF"(p1278==1)" | ("(p1176!=1)" U ("((p630!=1)&&(p1176!=1))" | G"(p1176!=1)")))
Detected timeout of ITS tools.
[2021-05-15 21:30:57] [INFO ] Flatten gal took : 78 ms
[2021-05-15 21:30:57] [INFO ] Applying decomposition
[2021-05-15 21:30:57] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18319481795176109001.txt, -o, /tmp/graph18319481795176109001.bin, -w, /tmp/graph18319481795176109001.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18319481795176109001.bin, -l, -1, -v, -w, /tmp/graph18319481795176109001.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:30:58] [INFO ] Decomposing Gal with order
[2021-05-15 21:30:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:30:58] [INFO ] Removed a total of 499 redundant transitions.
[2021-05-15 21:30:58] [INFO ] Flatten gal took : 214 ms
[2021-05-15 21:30:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2021-05-15 21:30:58] [INFO ] Time to serialize gal into /tmp/LTL4450805752508195296.gal : 37 ms
[2021-05-15 21:30:58] [INFO ] Time to serialize properties into /tmp/LTL13135040301883251610.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4450805752508195296.gal, -t, CGAL, -LTL, /tmp/LTL13135040301883251610.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4450805752508195296.gal -t CGAL -LTL /tmp/LTL13135040301883251610.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((X(F("(i18.u410.p1278==1)")))||(("(i17.u377.p1176!=1)")U(("((i9.u205.p630!=1)&&(i17.u377.p1176!=1))")||(G("(i17.u377.p1176!=1)"))))))))))
Formula 0 simplified : !XXXX(XF"(i18.u410.p1278==1)" | ("(i17.u377.p1176!=1)" U ("((i9.u205.p630!=1)&&(i17.u377.p1176!=1))" | G"(i17.u377.p1176!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4426673309831459783
[2021-05-15 21:31:14] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4426673309831459783
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4426673309831459783]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4426673309831459783] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4426673309831459783] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-050B-00 finished in 54228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2960 transition count 2114
Reduce places removed 596 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 598 rules applied. Total rules applied 1194 place count 2364 transition count 2112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1196 place count 2362 transition count 2112
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1196 place count 2362 transition count 1717
Deduced a syphon composed of 395 places in 2 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 1986 place count 1967 transition count 1717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1991 place count 1962 transition count 1712
Iterating global reduction 3 with 5 rules applied. Total rules applied 1996 place count 1962 transition count 1712
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1996 place count 1962 transition count 1707
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2006 place count 1957 transition count 1707
Performed 851 Post agglomeration using F-continuation condition.Transition count delta: 851
Deduced a syphon composed of 851 places in 1 ms
Reduce places removed 851 places and 0 transitions.
Iterating global reduction 3 with 1702 rules applied. Total rules applied 3708 place count 1106 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3709 place count 1106 transition count 855
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3711 place count 1105 transition count 854
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3913 place count 1004 transition count 920
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4009 place count 956 transition count 952
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4010 place count 955 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4012 place count 953 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4012 place count 953 transition count 950
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4014 place count 952 transition count 950
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4015 place count 951 transition count 949
Applied a total of 4015 rules in 615 ms. Remains 951 /2961 variables (removed 2010) and now considering 949/2711 (removed 1762) transitions.
// Phase 1: matrix 949 rows 951 cols
[2021-05-15 21:31:15] [INFO ] Computed 449 place invariants in 13 ms
[2021-05-15 21:31:16] [INFO ] Implicit Places using invariants in 569 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 572 ms to find 1 implicit places.
[2021-05-15 21:31:16] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 949 rows 950 cols
[2021-05-15 21:31:16] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 21:31:16] [INFO ] Dead Transitions using invariants and state equation in 484 ms returned []
Starting structural reductions, iteration 1 : 950/2961 places, 949/2711 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 948
Applied a total of 2 rules in 33 ms. Remains 949 /950 variables (removed 1) and now considering 948/949 (removed 1) transitions.
// Phase 1: matrix 948 rows 949 cols
[2021-05-15 21:31:16] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 21:31:17] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 948 rows 949 cols
[2021-05-15 21:31:17] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 21:31:18] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 949/2961 places, 948/2711 transitions.
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s549 0), p1:(AND (NEQ s518 1) (NEQ s801 0))], 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 ShieldIIPt-PT-050B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-01 finished in 3769 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&G(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 2960 transition count 2115
Reduce places removed 595 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 596 rules applied. Total rules applied 1191 place count 2365 transition count 2114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1192 place count 2364 transition count 2114
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 1192 place count 2364 transition count 1718
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 1984 place count 1968 transition count 1718
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1990 place count 1962 transition count 1712
Iterating global reduction 3 with 6 rules applied. Total rules applied 1996 place count 1962 transition count 1712
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1996 place count 1962 transition count 1706
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2008 place count 1956 transition count 1706
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3706 place count 1107 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3707 place count 1107 transition count 856
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3709 place count 1106 transition count 855
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3911 place count 1005 transition count 922
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4005 place count 958 transition count 953
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4006 place count 958 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4007 place count 957 transition count 952
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4009 place count 955 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4009 place count 955 transition count 951
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4011 place count 954 transition count 951
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4012 place count 953 transition count 950
Applied a total of 4012 rules in 676 ms. Remains 953 /2961 variables (removed 2008) and now considering 950/2711 (removed 1761) transitions.
// Phase 1: matrix 950 rows 953 cols
[2021-05-15 21:31:19] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 21:31:20] [INFO ] Implicit Places using invariants in 528 ms returned [942]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 529 ms to find 1 implicit places.
[2021-05-15 21:31:20] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 950 rows 952 cols
[2021-05-15 21:31:20] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:31:20] [INFO ] Dead Transitions using invariants and state equation in 462 ms returned []
Starting structural reductions, iteration 1 : 952/2961 places, 950/2711 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 951 transition count 949
Applied a total of 2 rules in 38 ms. Remains 951 /952 variables (removed 1) and now considering 949/950 (removed 1) transitions.
// Phase 1: matrix 949 rows 951 cols
[2021-05-15 21:31:20] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 21:31:21] [INFO ] Implicit Places using invariants in 560 ms returned []
// Phase 1: matrix 949 rows 951 cols
[2021-05-15 21:31:21] [INFO ] Computed 448 place invariants in 3 ms
[2021-05-15 21:31:22] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 951/2961 places, 949/2711 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050B-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p2:(NEQ s653 1), p1:(EQ s550 0), p0:(EQ s453 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 5 ms.
FORMULA ShieldIIPt-PT-050B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-02 finished in 3347 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2960 transition count 2112
Reduce places removed 598 places and 0 transitions.
Iterating post reduction 1 with 598 rules applied. Total rules applied 1196 place count 2362 transition count 2112
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1196 place count 2362 transition count 1716
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1988 place count 1966 transition count 1716
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1993 place count 1961 transition count 1711
Iterating global reduction 2 with 5 rules applied. Total rules applied 1998 place count 1961 transition count 1711
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1998 place count 1961 transition count 1706
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2008 place count 1956 transition count 1706
Performed 853 Post agglomeration using F-continuation condition.Transition count delta: 853
Deduced a syphon composed of 853 places in 2 ms
Reduce places removed 853 places and 0 transitions.
Iterating global reduction 2 with 1706 rules applied. Total rules applied 3714 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3715 place count 1103 transition count 852
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3717 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3919 place count 1001 transition count 916
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4015 place count 953 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4016 place count 952 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4018 place count 950 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4018 place count 950 transition count 947
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4020 place count 949 transition count 947
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4021 place count 948 transition count 946
Applied a total of 4021 rules in 565 ms. Remains 948 /2961 variables (removed 2013) and now considering 946/2711 (removed 1765) transitions.
// Phase 1: matrix 946 rows 948 cols
[2021-05-15 21:31:22] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 21:31:23] [INFO ] Implicit Places using invariants in 556 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 557 ms to find 1 implicit places.
[2021-05-15 21:31:23] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 946 rows 947 cols
[2021-05-15 21:31:23] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:31:23] [INFO ] Dead Transitions using invariants and state equation in 570 ms returned []
Starting structural reductions, iteration 1 : 947/2961 places, 946/2711 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 945
Applied a total of 2 rules in 35 ms. Remains 946 /947 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 946 cols
[2021-05-15 21:31:23] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:31:24] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 945 rows 946 cols
[2021-05-15 21:31:24] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:31:25] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 946/2961 places, 945/2711 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-03 automaton TGBA [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 s319 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 ShieldIIPt-PT-050B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-03 finished in 3556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2951 transition count 2701
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2951 transition count 2701
Applied a total of 20 rules in 339 ms. Remains 2951 /2961 variables (removed 10) and now considering 2701/2711 (removed 10) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2021-05-15 21:31:26] [INFO ] Computed 451 place invariants in 8 ms
[2021-05-15 21:31:27] [INFO ] Implicit Places using invariants in 1033 ms returned []
// Phase 1: matrix 2701 rows 2951 cols
[2021-05-15 21:31:27] [INFO ] Computed 451 place invariants in 10 ms
[2021-05-15 21:31:30] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 3934 ms to find 0 implicit places.
// Phase 1: matrix 2701 rows 2951 cols
[2021-05-15 21:31:30] [INFO ] Computed 451 place invariants in 11 ms
[2021-05-15 21:31:31] [INFO ] Dead Transitions using invariants and state equation in 1811 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2951/2961 places, 2701/2711 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1035 1), p1:(NEQ s2730 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 949 ms.
Stack based approach found an accepted trace after 1665 steps with 0 reset with depth 1666 and stack size 1666 in 19 ms.
FORMULA ShieldIIPt-PT-050B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-04 finished in 7164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2960 transition count 2114
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2364 transition count 2114
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1192 place count 2364 transition count 1718
Deduced a syphon composed of 396 places in 2 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1984 place count 1968 transition count 1718
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1990 place count 1962 transition count 1712
Iterating global reduction 2 with 6 rules applied. Total rules applied 1996 place count 1962 transition count 1712
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1996 place count 1962 transition count 1706
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2008 place count 1956 transition count 1706
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3702 place count 1109 transition count 859
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3703 place count 1109 transition count 858
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3705 place count 1108 transition count 857
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3907 place count 1007 transition count 924
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4001 place count 960 transition count 955
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4002 place count 959 transition count 954
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4004 place count 957 transition count 954
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4004 place count 957 transition count 953
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4006 place count 956 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4007 place count 955 transition count 952
Applied a total of 4007 rules in 511 ms. Remains 955 /2961 variables (removed 2006) and now considering 952/2711 (removed 1759) transitions.
// Phase 1: matrix 952 rows 955 cols
[2021-05-15 21:31:33] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 21:31:34] [INFO ] Implicit Places using invariants in 590 ms returned [944]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 592 ms to find 1 implicit places.
[2021-05-15 21:31:34] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 952 rows 954 cols
[2021-05-15 21:31:34] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:31:34] [INFO ] Dead Transitions using invariants and state equation in 504 ms returned []
Starting structural reductions, iteration 1 : 954/2961 places, 952/2711 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 953 transition count 951
Applied a total of 2 rules in 30 ms. Remains 953 /954 variables (removed 1) and now considering 951/952 (removed 1) transitions.
// Phase 1: matrix 951 rows 953 cols
[2021-05-15 21:31:34] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:31:35] [INFO ] Implicit Places using invariants in 583 ms returned []
// Phase 1: matrix 951 rows 953 cols
[2021-05-15 21:31:35] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:31:36] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 953/2961 places, 951/2711 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s788 1), p1:(AND (EQ s872 1) (EQ s899 1)), p2:(OR (EQ s404 1) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-05 finished in 3423 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p0 U p1)&&(p1 U G(p2))&&F(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2952 transition count 2702
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2952 transition count 2702
Applied a total of 18 rules in 332 ms. Remains 2952 /2961 variables (removed 9) and now considering 2702/2711 (removed 9) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:31:36] [INFO ] Computed 451 place invariants in 8 ms
[2021-05-15 21:31:37] [INFO ] Implicit Places using invariants in 891 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:31:37] [INFO ] Computed 451 place invariants in 9 ms
[2021-05-15 21:31:40] [INFO ] Implicit Places using invariants and state equation in 2671 ms returned []
Implicit Place search using SMT with State Equation took 3563 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:31:40] [INFO ] Computed 451 place invariants in 8 ms
[2021-05-15 21:31:42] [INFO ] Dead Transitions using invariants and state equation in 1831 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2952/2961 places, 2702/2711 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050B-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1859 1) (EQ s1904 1)), p0:(AND (EQ s1878 1) (EQ s1927 1)), p2:(EQ s2879 1), p3:(EQ s2879 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 991 ms.
Stack based approach found an accepted trace after 3400 steps with 0 reset with depth 3401 and stack size 3401 in 38 ms.
FORMULA ShieldIIPt-PT-050B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-07 finished in 7048 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2960 transition count 2114
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2364 transition count 2114
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1192 place count 2364 transition count 1719
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1982 place count 1969 transition count 1719
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1988 place count 1963 transition count 1713
Iterating global reduction 2 with 6 rules applied. Total rules applied 1994 place count 1963 transition count 1713
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1994 place count 1963 transition count 1707
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2006 place count 1957 transition count 1707
Performed 852 Post agglomeration using F-continuation condition.Transition count delta: 852
Deduced a syphon composed of 852 places in 1 ms
Reduce places removed 852 places and 0 transitions.
Iterating global reduction 2 with 1704 rules applied. Total rules applied 3710 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3711 place count 1105 transition count 854
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3713 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3915 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4009 place count 956 transition count 951
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4010 place count 955 transition count 950
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4012 place count 953 transition count 950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4012 place count 953 transition count 949
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4014 place count 952 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4015 place count 951 transition count 948
Applied a total of 4015 rules in 512 ms. Remains 951 /2961 variables (removed 2010) and now considering 948/2711 (removed 1763) transitions.
// Phase 1: matrix 948 rows 951 cols
[2021-05-15 21:31:43] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 21:31:44] [INFO ] Implicit Places using invariants in 598 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 600 ms to find 1 implicit places.
[2021-05-15 21:31:44] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 948 rows 950 cols
[2021-05-15 21:31:44] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:31:45] [INFO ] Dead Transitions using invariants and state equation in 507 ms returned []
Starting structural reductions, iteration 1 : 950/2961 places, 948/2711 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 947
Applied a total of 2 rules in 27 ms. Remains 949 /950 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 949 cols
[2021-05-15 21:31:45] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 21:31:45] [INFO ] Implicit Places using invariants in 599 ms returned []
// Phase 1: matrix 947 rows 949 cols
[2021-05-15 21:31:45] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:31:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-15 21:31:46] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 949/2961 places, 947/2711 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s613 0) (EQ s20 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 902 ms.
Product exploration explored 100000 steps with 0 reset in 1211 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 888 ms.
Product exploration explored 100000 steps with 0 reset in 1160 ms.
[2021-05-15 21:31:51] [INFO ] Flatten gal took : 33 ms
[2021-05-15 21:31:51] [INFO ] Flatten gal took : 32 ms
[2021-05-15 21:31:51] [INFO ] Time to serialize gal into /tmp/LTL2375380452468195119.gal : 4 ms
[2021-05-15 21:31:51] [INFO ] Time to serialize properties into /tmp/LTL3125718347054341131.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2375380452468195119.gal, -t, CGAL, -LTL, /tmp/LTL3125718347054341131.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2375380452468195119.gal -t CGAL -LTL /tmp/LTL3125718347054341131.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((p2262==0)||(p106==0))")))
Formula 0 simplified : !G"((p2262==0)||(p106==0))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t599, t601, t606, t611, t616, t622, t627, t632, t637, t642, t647, t652, t657, t662, t668, t673, t678, t683, t688, t693, t698, t703, t708, t713, t718, t723, t728, t733, t738, t743, t748, t754, t759, t765, t596.t201.t205, t603.t207.t213, t604.t210.t213, t608.t215.t221, t609.t218.t221, t613.t223.t228, t614.t226.t228, t619.t230.t236, t620.t233.t236, t624.t238.t244, t625.t241.t244, t629.t246.t252, t630.t249.t252, t634.t254.t260, t635.t257.t260, t639.t584.t266, t640.t263.t266, t644.t268.t274, t645.t271.t274, t649.t276.t282, t650.t279.t282, t654.t284.t290, t655.t287.t290, t659.t292.t297, t660.t295.t297, t665.t300.t306, t666.t303.t306, t670.t308.t314, t671.t311.t314, t675.t316.t322, t676.t319.t322, t680.t586.t328, t681.t325.t328, t685.t330.t336, t686.t333.t336, t690.t338.t342, t691.t588.t342, t695.t344.t350, t696.t347.t350, t700.t352.t358, t701.t355.t358, t705.t360.t366, t706.t363.t366, t710.t368.t374, t711.t371.t374, t715.t376.t382, t716.t379.t382, t720.t384.t390, t721.t387.t390, t725.t392.t398, t726.t395.t398, t730.t400.t406, t731.t403.t406, t735.t408.t414, t736.t411.t414, t739.t416.t422, t740.t419.t422, t745.t424.t429, t746.t427.t429, t751.t431.t436, t752.t433.t436, t756.t438.t444, t757.t440.t444, t767.t453.t459, t767.t453.t460, t767.t454.t459, t767.t454.t460, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/814/133/947
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
[2021-05-15 21:32:06] [INFO ] Flatten gal took : 33 ms
[2021-05-15 21:32:06] [INFO ] Applying decomposition
[2021-05-15 21:32:06] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2828239705687437500.txt, -o, /tmp/graph2828239705687437500.bin, -w, /tmp/graph2828239705687437500.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2828239705687437500.bin, -l, -1, -v, -w, /tmp/graph2828239705687437500.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:32:06] [INFO ] Decomposing Gal with order
[2021-05-15 21:32:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:32:06] [INFO ] Removed a total of 1070 redundant transitions.
[2021-05-15 21:32:06] [INFO ] Flatten gal took : 63 ms
[2021-05-15 21:32:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 456 labels/synchronizations in 24 ms.
[2021-05-15 21:32:06] [INFO ] Time to serialize gal into /tmp/LTL9674478781066871480.gal : 9 ms
[2021-05-15 21:32:06] [INFO ] Time to serialize properties into /tmp/LTL13300810350759930111.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9674478781066871480.gal, -t, CGAL, -LTL, /tmp/LTL13300810350759930111.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9674478781066871480.gal -t CGAL -LTL /tmp/LTL13300810350759930111.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("((i18.u255.p2262==0)||(i0.u6.p106==0))")))
Formula 0 simplified : !G"((i18.u255.p2262==0)||(i0.u6.p106==0))"
Reverse transition relation is NOT exact ! Due to transitions i0.t0, i0.u1.t599, i0.u4.t596.t201.t205, i0.u6.t601, i1.i0.t1, i1.i0.t604_t209_t213, i1.i0.i1.t603_t207_t213, i1.i0.i1.u7.t606, i1.i1.t2, i1.i1.t608_t214_t221, i1.i1.i1.t609_t218_t221, i1.i1.i1.u15.t611, i2.i0.t3, i2.i0.t613_t222_t227, i2.i0.i0.t614_t225_t227, i2.i0.i0.u23.t616, i2.i1.t4, i2.i1.t619_t229_t236, i2.i1.i1.t620_t233_t235, i2.i1.i1.u31.t622, i3.i0.t5, i3.i0.t624_t238_t243, i3.i0.i1.t625_t240_t243, i3.i0.i1.u39.t627, i3.i1.t6, i3.i1.t630_t248_t252, i3.i1.i0.t629_t246_t251, i3.i1.i0.u47.t632, i4.i0.t7, i4.i0.t635_t257_t260, i4.i0.i0.t634_t253_t259, i4.i0.i0.u55.t637, i4.i1.t8, i4.i1.t640_t263_t266, i4.i1.i0.t639_t584_t265, i4.i1.i0.u63.t642, i5.t645_t271_t273, i5.t644_t267_t273, i5.t9, i5.u71.t647, i6.i0.t10, i6.i0.t649_t276_t281, i6.i0.i0.t650_t278_t282, i6.i0.i0.u79.t652, i6.i1.t11, i6.i1.t654_t284_t289, i6.i1.i0.t655_t286_t290, i6.i1.i0.u87.t657, i7.i0.t12, i7.i0.t659_t292_t298, i7.i0.i0.t660_t295_t297, i7.i0.i0.u95.t662, i7.i1.t13, i7.i1.t666_t303_t305, i7.i1.i0.t665_t299_t305, i7.i1.i0.u103.t668, i8.i0.t14, i8.i0.t671_t311_t313, i8.i0.i0.t670_t307_t314, i8.i0.i0.u111.t673, i8.i1.t15, i8.i1.t675_t315_t322, i8.i1.i0.t676_t319_t321, i8.i1.i0.u119.t678, i9.i0.t16, i9.i0.t680_t586_t328, i9.i0.i0.t681_t324_t328, i9.i0.i0.u127.t683, i9.i1.t17, i9.i1.t685_t330_t336, i9.i1.i1.t686_t332_t335, i9.i1.i1.u135.t688, i10.i0.t18, i10.i0.t690_t337_t341, i10.i0.i1.t691_t588_t341, i10.i0.i1.u143.t693, i10.i1.t19, i10.i1.t695_t344_t349, i10.i1.i0.t696_t346_t350, i10.i1.i0.u151.t698, i11.i0.t20, i11.i0.t701_t355_t357, i11.i0.i0.t700_t351_t358, i11.i0.i0.u159.t703, i11.i1.t21, i11.i1.t705_t359_t366, i11.i1.i1.t706_t362_t365, i11.i1.i1.u167.t708, i12.i0.t22, i12.i0.t710_t367_t374, i12.i0.i1.t711_t370_t374, i12.i0.i1.u175.t713, i12.i1.t23, i12.i1.t716_t379_t382, i12.i1.i1.t715_t375_t381, i12.i1.i1.u183.t718, i13.i0.t24, i13.i0.t721_t386_t390, i13.i0.i0.t720_t384_t389, i13.i0.i0.u191.t723, i13.i1.t25, i13.i1.t726_t394_t397, i13.i1.i1.t725_t392_t398, i13.i1.i1.u199.t728, i14.t731_t403_t406, i14.t730_t399_t406, i14.t26, i14.u207.t733, i15.i0.t27, i15.i0.t736_t410_t413, i15.i0.i0.t735_t408_t413, i15.i0.i0.u215.t738, i15.i1.t28, i15.i1.t740_t419_t422, i15.i1.i0.t739_t415_t422, i15.i1.i0.u223.t743, i16.i0.t29, i16.i0.t745_t423_t429, i16.i0.i1.t746_t427_t428, i16.i0.i1.u231.t748, i16.i1.t30, i16.i1.t752_t434_t436, i16.i1.i0.t751_t431_t435, i16.i1.i0.u239.t754, i17.t757_t440_t443, i17.t756_t437_t443, i17.t31, i17.u247.t759, i18.t767_t454_t460, i18.t765, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/426/130/556
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7265664868526392819
[2021-05-15 21:32:21] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7265664868526392819
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7265664868526392819]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7265664868526392819] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7265664868526392819] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-050B-08 finished in 39146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0&&X(p1)) U (X(p1)&&p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2951 transition count 2701
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2951 transition count 2701
Applied a total of 20 rules in 364 ms. Remains 2951 /2961 variables (removed 10) and now considering 2701/2711 (removed 10) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2021-05-15 21:32:22] [INFO ] Computed 451 place invariants in 8 ms
[2021-05-15 21:32:23] [INFO ] Implicit Places using invariants in 859 ms returned []
// Phase 1: matrix 2701 rows 2951 cols
[2021-05-15 21:32:23] [INFO ] Computed 451 place invariants in 8 ms
[2021-05-15 21:32:26] [INFO ] Implicit Places using invariants and state equation in 2923 ms returned []
Implicit Place search using SMT with State Equation took 3783 ms to find 0 implicit places.
// Phase 1: matrix 2701 rows 2951 cols
[2021-05-15 21:32:26] [INFO ] Computed 451 place invariants in 8 ms
[2021-05-15 21:32:28] [INFO ] Dead Transitions using invariants and state equation in 2000 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2951/2961 places, 2701/2711 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1735 1) (EQ s525 1) (EQ s570 1)), p0:(EQ s1735 1), p1:(EQ s2120 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-09 finished in 6348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2960 transition count 2114
Reduce places removed 596 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 597 rules applied. Total rules applied 1193 place count 2364 transition count 2113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1194 place count 2363 transition count 2113
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 1194 place count 2363 transition count 1717
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 1986 place count 1967 transition count 1717
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1992 place count 1961 transition count 1711
Iterating global reduction 3 with 6 rules applied. Total rules applied 1998 place count 1961 transition count 1711
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1998 place count 1961 transition count 1705
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2010 place count 1955 transition count 1705
Performed 852 Post agglomeration using F-continuation condition.Transition count delta: 852
Deduced a syphon composed of 852 places in 1 ms
Reduce places removed 852 places and 0 transitions.
Iterating global reduction 3 with 1704 rules applied. Total rules applied 3714 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3715 place count 1103 transition count 852
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3717 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3919 place count 1001 transition count 918
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4013 place count 954 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4014 place count 953 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4016 place count 951 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4016 place count 951 transition count 947
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4018 place count 950 transition count 947
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4019 place count 949 transition count 946
Applied a total of 4019 rules in 519 ms. Remains 949 /2961 variables (removed 2012) and now considering 946/2711 (removed 1765) transitions.
// Phase 1: matrix 946 rows 949 cols
[2021-05-15 21:32:29] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 21:32:29] [INFO ] Implicit Places using invariants in 545 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 555 ms to find 1 implicit places.
[2021-05-15 21:32:29] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 946 rows 948 cols
[2021-05-15 21:32:29] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:32:30] [INFO ] Dead Transitions using invariants and state equation in 497 ms returned []
Starting structural reductions, iteration 1 : 948/2961 places, 946/2711 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 945
Applied a total of 2 rules in 30 ms. Remains 947 /948 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 947 cols
[2021-05-15 21:32:30] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 21:32:31] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 945 rows 947 cols
[2021-05-15 21:32:31] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:32:32] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 947/2961 places, 945/2711 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s54 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 ShieldIIPt-PT-050B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-10 finished in 3257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(G(p0))||(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2952 transition count 2702
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2952 transition count 2702
Applied a total of 18 rules in 320 ms. Remains 2952 /2961 variables (removed 9) and now considering 2702/2711 (removed 9) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:32:32] [INFO ] Computed 451 place invariants in 7 ms
[2021-05-15 21:32:33] [INFO ] Implicit Places using invariants in 951 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:32:33] [INFO ] Computed 451 place invariants in 7 ms
[2021-05-15 21:32:36] [INFO ] Implicit Places using invariants and state equation in 2691 ms returned []
Implicit Place search using SMT with State Equation took 3643 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:32:36] [INFO ] Computed 451 place invariants in 7 ms
[2021-05-15 21:32:38] [INFO ] Dead Transitions using invariants and state equation in 2014 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2952/2961 places, 2702/2711 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-13 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NEQ s1022 1) (NEQ s638 1)), p1:(NEQ s638 1), p0:(NEQ s1139 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 965 ms.
Product exploration explored 100000 steps with 0 reset in 1232 ms.
Knowledge obtained : [p2, p1, p0]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 994 ms.
Product exploration explored 100000 steps with 0 reset in 1236 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Support contains 3 out of 2952 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2952 transition count 2702
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 252 Pre rules applied. Total rules applied 598 place count 2952 transition count 3006
Deduced a syphon composed of 850 places in 8 ms
Iterating global reduction 1 with 252 rules applied. Total rules applied 850 place count 2952 transition count 3006
Performed 946 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1796 places in 3 ms
Iterating global reduction 1 with 946 rules applied. Total rules applied 1796 place count 2952 transition count 3006
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1797 place count 2952 transition count 3005
Renaming transitions due to excessive name length > 1024 char.
Discarding 348 places :
Symmetric choice reduction at 2 with 348 rule applications. Total rules 2145 place count 2604 transition count 2657
Deduced a syphon composed of 1448 places in 3 ms
Iterating global reduction 2 with 348 rules applied. Total rules applied 2493 place count 2604 transition count 2657
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1449 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2494 place count 2604 transition count 2657
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2496 place count 2602 transition count 2655
Deduced a syphon composed of 1447 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2498 place count 2602 transition count 2655
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -536
Deduced a syphon composed of 1548 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2599 place count 2602 transition count 3191
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2701 place count 2500 transition count 2987
Deduced a syphon composed of 1446 places in 3 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2803 place count 2500 transition count 2987
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -260
Deduced a syphon composed of 1494 places in 4 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 2851 place count 2500 transition count 3247
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 2899 place count 2452 transition count 3151
Deduced a syphon composed of 1446 places in 4 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 2947 place count 2452 transition count 3151
Deduced a syphon composed of 1446 places in 3 ms
Applied a total of 2947 rules in 1277 ms. Remains 2452 /2952 variables (removed 500) and now considering 3151/2702 (removed -449) transitions.
[2021-05-15 21:32:44] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 3151 rows 2452 cols
[2021-05-15 21:32:44] [INFO ] Computed 451 place invariants in 27 ms
[2021-05-15 21:32:46] [INFO ] Dead Transitions using invariants and state equation in 1707 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2452/2952 places, 3151/2702 transitions.
Product exploration explored 100000 steps with 0 reset in 1126 ms.
Product exploration explored 100000 steps with 0 reset in 1214 ms.
[2021-05-15 21:32:48] [INFO ] Flatten gal took : 65 ms
[2021-05-15 21:32:48] [INFO ] Flatten gal took : 66 ms
[2021-05-15 21:32:48] [INFO ] Time to serialize gal into /tmp/LTL18280572844516083027.gal : 9 ms
[2021-05-15 21:32:48] [INFO ] Time to serialize properties into /tmp/LTL17270256154466897535.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18280572844516083027.gal, -t, CGAL, -LTL, /tmp/LTL17270256154466897535.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18280572844516083027.gal -t CGAL -LTL /tmp/LTL17270256154466897535.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(p1342!=1)")))||(("(p748!=1)")U(("((p1203!=1)&&(p748!=1))")||(G("(p748!=1)")))))))
Formula 0 simplified : !G(XG"(p1342!=1)" | ("(p748!=1)" U ("((p1203!=1)&&(p748!=1))" | G"(p748!=1)")))
Detected timeout of ITS tools.
[2021-05-15 21:33:03] [INFO ] Flatten gal took : 67 ms
[2021-05-15 21:33:03] [INFO ] Applying decomposition
[2021-05-15 21:33:03] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8948404771902096171.txt, -o, /tmp/graph8948404771902096171.bin, -w, /tmp/graph8948404771902096171.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8948404771902096171.bin, -l, -1, -v, -w, /tmp/graph8948404771902096171.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:33:04] [INFO ] Decomposing Gal with order
[2021-05-15 21:33:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:33:04] [INFO ] Removed a total of 496 redundant transitions.
[2021-05-15 21:33:04] [INFO ] Flatten gal took : 127 ms
[2021-05-15 21:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-15 21:33:04] [INFO ] Time to serialize gal into /tmp/LTL2683847411007603641.gal : 18 ms
[2021-05-15 21:33:06] [INFO ] Time to serialize properties into /tmp/LTL4588294535302837180.ltl : 2466 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2683847411007603641.gal, -t, CGAL, -LTL, /tmp/LTL4588294535302837180.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2683847411007603641.gal -t CGAL -LTL /tmp/LTL4588294535302837180.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(i18.u428.p1342!=1)")))||(("(i10.u243.p748!=1)")U(("((i16.u384.p1203!=1)&&(i10.u243.p748!=1))")||(G("(i10.u243.p748!=1)")))))))
Formula 0 simplified : !G(XG"(i18.u428.p1342!=1)" | ("(i10.u243.p748!=1)" U ("((i16.u384.p1203!=1)&&(i10.u243.p748!=1))" | G"(i10.u243.p748!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16308555640409755523
[2021-05-15 21:33:22] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16308555640409755523
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16308555640409755523]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16308555640409755523] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16308555640409755523] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-050B-13 finished in 50869 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((F(G(p0))&&(p1||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2952 transition count 2702
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2952 transition count 2702
Applied a total of 18 rules in 403 ms. Remains 2952 /2961 variables (removed 9) and now considering 2702/2711 (removed 9) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:33:23] [INFO ] Computed 451 place invariants in 7 ms
[2021-05-15 21:33:24] [INFO ] Implicit Places using invariants in 1018 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:33:24] [INFO ] Computed 451 place invariants in 7 ms
[2021-05-15 21:33:27] [INFO ] Implicit Places using invariants and state equation in 2877 ms returned []
Implicit Place search using SMT with State Equation took 3897 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2021-05-15 21:33:27] [INFO ] Computed 451 place invariants in 6 ms
[2021-05-15 21:33:29] [INFO ] Dead Transitions using invariants and state equation in 1971 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2952/2961 places, 2702/2711 transitions.
Stuttering acceptance computed with spot in 1876 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050B-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s1620 1), p0:(NEQ s801 1), p2:(NEQ s340 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 884 ms.
Product exploration explored 100000 steps with 0 reset in 1231 ms.
Knowledge obtained : [p1, p0, p2]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 911 ms.
Product exploration explored 100000 steps with 0 reset in 1334 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 2952 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2952 transition count 2702
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 251 Pre rules applied. Total rules applied 598 place count 2952 transition count 3002
Deduced a syphon composed of 849 places in 5 ms
Iterating global reduction 1 with 251 rules applied. Total rules applied 849 place count 2952 transition count 3002
Performed 948 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1797 places in 3 ms
Iterating global reduction 1 with 948 rules applied. Total rules applied 1797 place count 2952 transition count 3002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1798 place count 2952 transition count 3001
Renaming transitions due to excessive name length > 1024 char.
Discarding 349 places :
Symmetric choice reduction at 2 with 349 rule applications. Total rules 2147 place count 2603 transition count 2652
Deduced a syphon composed of 1448 places in 3 ms
Iterating global reduction 2 with 349 rules applied. Total rules applied 2496 place count 2603 transition count 2652
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1449 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2497 place count 2603 transition count 2652
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2499 place count 2601 transition count 2650
Deduced a syphon composed of 1447 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2501 place count 2601 transition count 2650
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -533
Deduced a syphon composed of 1548 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2602 place count 2601 transition count 3183
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2703 place count 2500 transition count 2981
Deduced a syphon composed of 1447 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2804 place count 2500 transition count 2981
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -260
Deduced a syphon composed of 1495 places in 4 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 2852 place count 2500 transition count 3241
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 2900 place count 2452 transition count 3145
Deduced a syphon composed of 1447 places in 4 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 2948 place count 2452 transition count 3145
Deduced a syphon composed of 1447 places in 4 ms
Applied a total of 2948 rules in 1081 ms. Remains 2452 /2952 variables (removed 500) and now considering 3145/2702 (removed -443) transitions.
[2021-05-15 21:33:37] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 3145 rows 2452 cols
[2021-05-15 21:33:37] [INFO ] Computed 451 place invariants in 27 ms
[2021-05-15 21:33:39] [INFO ] Dead Transitions using invariants and state equation in 1874 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2452/2952 places, 3145/2702 transitions.
Product exploration explored 100000 steps with 0 reset in 977 ms.
Product exploration explored 100000 steps with 0 reset in 1328 ms.
[2021-05-15 21:33:41] [INFO ] Flatten gal took : 62 ms
[2021-05-15 21:33:41] [INFO ] Flatten gal took : 62 ms
[2021-05-15 21:33:44] [INFO ] Time to serialize gal into /tmp/LTL16110741076523574279.gal : 602 ms
[2021-05-15 21:33:44] [INFO ] Time to serialize properties into /tmp/LTL17810873846790374789.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16110741076523574279.gal, -t, CGAL, -LTL, /tmp/LTL17810873846790374789.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16110741076523574279.gal -t CGAL -LTL /tmp/LTL17810873846790374789.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(G("(p941!=1)")))&&(("(p1916!=1)")||(G("(p393!=1)"))))))))
Formula 0 simplified : !XXF(FG"(p941!=1)" & ("(p1916!=1)" | G"(p393!=1)"))
Detected timeout of ITS tools.
[2021-05-15 21:33:59] [INFO ] Flatten gal took : 62 ms
[2021-05-15 21:33:59] [INFO ] Applying decomposition
[2021-05-15 21:33:59] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3239835373645864648.txt, -o, /tmp/graph3239835373645864648.bin, -w, /tmp/graph3239835373645864648.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3239835373645864648.bin, -l, -1, -v, -w, /tmp/graph3239835373645864648.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:34:00] [INFO ] Decomposing Gal with order
[2021-05-15 21:34:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:34:00] [INFO ] Removed a total of 500 redundant transitions.
[2021-05-15 21:34:00] [INFO ] Flatten gal took : 140 ms
[2021-05-15 21:34:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-15 21:34:00] [INFO ] Time to serialize gal into /tmp/LTL8991240668703506927.gal : 13 ms
[2021-05-15 21:34:00] [INFO ] Time to serialize properties into /tmp/LTL14871305315895336094.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8991240668703506927.gal, -t, CGAL, -LTL, /tmp/LTL14871305315895336094.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8991240668703506927.gal -t CGAL -LTL /tmp/LTL14871305315895336094.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(G("(i13.u304.p941!=1)")))&&(("(i27.u605.p1916!=1)")||(G("(i5.u132.p393!=1)"))))))))
Formula 0 simplified : !XXF(FG"(i13.u304.p941!=1)" & ("(i27.u605.p1916!=1)" | G"(i5.u132.p393!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6897978370740048499
[2021-05-15 21:34:15] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6897978370740048499
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6897978370740048499]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6897978370740048499] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6897978370740048499] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-050B-14 finished in 53576 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2961 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2961/2961 places, 2711/2711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2960 transition count 2112
Reduce places removed 598 places and 0 transitions.
Iterating post reduction 1 with 598 rules applied. Total rules applied 1196 place count 2362 transition count 2112
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1196 place count 2362 transition count 1716
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1988 place count 1966 transition count 1716
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1994 place count 1960 transition count 1710
Iterating global reduction 2 with 6 rules applied. Total rules applied 2000 place count 1960 transition count 1710
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2000 place count 1960 transition count 1704
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2012 place count 1954 transition count 1704
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3712 place count 1104 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3713 place count 1104 transition count 853
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3715 place count 1103 transition count 852
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3917 place count 1002 transition count 918
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4013 place count 954 transition count 951
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4014 place count 953 transition count 950
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4016 place count 951 transition count 950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4016 place count 951 transition count 949
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4018 place count 950 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4019 place count 949 transition count 948
Applied a total of 4019 rules in 475 ms. Remains 949 /2961 variables (removed 2012) and now considering 948/2711 (removed 1763) transitions.
// Phase 1: matrix 948 rows 949 cols
[2021-05-15 21:34:17] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 21:34:17] [INFO ] Implicit Places using invariants in 754 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 756 ms to find 1 implicit places.
[2021-05-15 21:34:17] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 948 rows 948 cols
[2021-05-15 21:34:17] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:34:18] [INFO ] Dead Transitions using invariants and state equation in 479 ms returned []
Starting structural reductions, iteration 1 : 948/2961 places, 948/2711 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 947
Applied a total of 2 rules in 28 ms. Remains 947 /948 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 947 cols
[2021-05-15 21:34:18] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 21:34:18] [INFO ] Implicit Places using invariants in 516 ms returned []
// Phase 1: matrix 947 rows 947 cols
[2021-05-15 21:34:18] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 21:34:19] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 947/2961 places, 947/2711 transitions.
Stuttering acceptance computed with spot in 6674 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-15 automaton TGBA [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 s630 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 ShieldIIPt-PT-050B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-15 finished in 9953 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11459541119333029155
[2021-05-15 21:34:26] [INFO ] Too many transitions (2711) to apply POR reductions. Disabling POR matrices.
[2021-05-15 21:34:26] [INFO ] Applying decomposition
[2021-05-15 21:34:26] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11459541119333029155
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11459541119333029155]
[2021-05-15 21:34:26] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2484403719322147314.txt, -o, /tmp/graph2484403719322147314.bin, -w, /tmp/graph2484403719322147314.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2484403719322147314.bin, -l, -1, -v, -w, /tmp/graph2484403719322147314.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:34:27] [INFO ] Decomposing Gal with order
[2021-05-15 21:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:34:27] [INFO ] Removed a total of 490 redundant transitions.
[2021-05-15 21:34:28] [INFO ] Flatten gal took : 290 ms
[2021-05-15 21:34:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-15 21:34:28] [INFO ] Time to serialize gal into /tmp/LTLFireability15131284162649379678.gal : 31 ms
[2021-05-15 21:34:28] [INFO ] Time to serialize properties into /tmp/LTLFireability10987858186931433635.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability15131284162649379678.gal, -t, CGAL, -LTL, /tmp/LTLFireability10987858186931433635.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability15131284162649379678.gal -t CGAL -LTL /tmp/LTLFireability10987858186931433635.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(X(X(X((X(F("(i17.u409.p1278==1)")))||(("(i16.u377.p1176!=1)")U(("((i8.u209.p630!=1)&&(i16.u377.p1176!=1))")||(G("(i16.u377.p1176!=1)"))))))))))
Formula 0 simplified : !XXXX(XF"(i17.u409.p1278==1)" | ("(i16.u377.p1176!=1)" U ("((i8.u209.p630!=1)&&(i16.u377.p1176!=1))" | G"(i16.u377.p1176!=1)")))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11459541119333029155] killed by timeout after 27 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11459541119333029155] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-15 21:58:05] [INFO ] Applying decomposition
[2021-05-15 21:58:06] [INFO ] Flatten gal took : 335 ms
[2021-05-15 21:58:06] [INFO ] Decomposing Gal with order
[2021-05-15 21:58:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:58:08] [INFO ] Removed a total of 145 redundant transitions.
[2021-05-15 21:58:08] [INFO ] Flatten gal took : 610 ms
[2021-05-15 21:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 35 ms.
[2021-05-15 21:58:11] [INFO ] Time to serialize gal into /tmp/LTLFireability13082872695420466701.gal : 54 ms
[2021-05-15 21:58:11] [INFO ] Time to serialize properties into /tmp/LTLFireability10897321398333191760.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability13082872695420466701.gal, -t, CGAL, -LTL, /tmp/LTLFireability10897321398333191760.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability13082872695420466701.gal -t CGAL -LTL /tmp/LTLFireability10897321398333191760.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(X(X(X((X(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u355.p1278==1)")))||(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u334.p1176!=1)")U(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u200.p630!=1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u334.p1176!=1))")||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u334.p1176!=1)"))))))))))
Formula 0 simplified : !XXXX(XF"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u355.p1278==1)" | ("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u334.p1176!=1)" U ("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u200.p630!=1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u334.p1176!=1))" | G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u334.p1176!=1)")))
Detected timeout of ITS tools.
[2021-05-15 22:21:38] [INFO ] Flatten gal took : 261 ms
[2021-05-15 22:21:39] [INFO ] Input system was already deterministic with 2711 transitions.
[2021-05-15 22:21:40] [INFO ] Transformed 2961 places.
[2021-05-15 22:21:40] [INFO ] Transformed 2711 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-15 22:21:40] [INFO ] Time to serialize gal into /tmp/LTLFireability6747342644728686651.gal : 13 ms
[2021-05-15 22:21:40] [INFO ] Time to serialize properties into /tmp/LTLFireability4060151641312077529.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability6747342644728686651.gal, -t, CGAL, -LTL, /tmp/LTLFireability4060151641312077529.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability6747342644728686651.gal -t CGAL -LTL /tmp/LTLFireability4060151641312077529.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(X((X(F("(p1278==1)")))||(("(p1176!=1)")U(("((p630!=1)&&(p1176!=1))")||(G("(p1176!=1)"))))))))))
Formula 0 simplified : !XXXX(XF"(p1278==1)" | ("(p1176!=1)" U ("((p630!=1)&&(p1176!=1))" | G"(p1176!=1)")))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination 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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
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 ShieldIIPt-PT-050B, 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 r216-tall-162098205200493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B 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 ;