About the Execution of ITS-Tools for Anderson-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6792.747 | 3029771.00 | 9177483.00 | 3672.20 | FFTFTFTFTTTFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r004-smll-171620118400356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Anderson-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118400356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 927K May 18 16:42 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 Anderson-PT-09-LTLFireability-00
FORMULA_NAME Anderson-PT-09-LTLFireability-01
FORMULA_NAME Anderson-PT-09-LTLFireability-02
FORMULA_NAME Anderson-PT-09-LTLFireability-03
FORMULA_NAME Anderson-PT-09-LTLFireability-04
FORMULA_NAME Anderson-PT-09-LTLFireability-05
FORMULA_NAME Anderson-PT-09-LTLFireability-06
FORMULA_NAME Anderson-PT-09-LTLFireability-07
FORMULA_NAME Anderson-PT-09-LTLFireability-08
FORMULA_NAME Anderson-PT-09-LTLFireability-09
FORMULA_NAME Anderson-PT-09-LTLFireability-10
FORMULA_NAME Anderson-PT-09-LTLFireability-11
FORMULA_NAME Anderson-PT-09-LTLFireability-12
FORMULA_NAME Anderson-PT-09-LTLFireability-13
FORMULA_NAME Anderson-PT-09-LTLFireability-14
FORMULA_NAME Anderson-PT-09-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716440732147
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 05:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 05:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 05:05:34] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2024-05-23 05:05:34] [INFO ] Transformed 505 places.
[2024-05-23 05:05:34] [INFO ] Transformed 1845 transitions.
[2024-05-23 05:05:34] [INFO ] Found NUPN structural information;
[2024-05-23 05:05:34] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 459 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 125 places :
Symmetric choice reduction at 0 with 125 rule applications. Total rules 125 place count 380 transition count 840
Iterating global reduction 0 with 125 rules applied. Total rules applied 250 place count 380 transition count 840
Applied a total of 250 rules in 140 ms. Remains 380 /505 variables (removed 125) and now considering 840/1845 (removed 1005) transitions.
// Phase 1: matrix 840 rows 380 cols
[2024-05-23 05:05:35] [INFO ] Computed 21 invariants in 61 ms
[2024-05-23 05:05:36] [INFO ] Implicit Places using invariants in 904 ms returned []
[2024-05-23 05:05:36] [INFO ] Invariant cache hit.
[2024-05-23 05:05:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:05:38] [INFO ] Implicit Places using invariants and state equation in 2403 ms returned []
Implicit Place search using SMT with State Equation took 3378 ms to find 0 implicit places.
Running 831 sub problems to find dead transitions.
[2024-05-23 05:05:38] [INFO ] Invariant cache hit.
[2024-05-23 05:05:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-05-23 05:05:48] [INFO ] Deduced a trap composed of 84 places in 452 ms of which 44 ms to minimize.
[2024-05-23 05:05:49] [INFO ] Deduced a trap composed of 129 places in 361 ms of which 5 ms to minimize.
[2024-05-23 05:05:49] [INFO ] Deduced a trap composed of 155 places in 353 ms of which 5 ms to minimize.
[2024-05-23 05:05:49] [INFO ] Deduced a trap composed of 87 places in 381 ms of which 4 ms to minimize.
[2024-05-23 05:05:50] [INFO ] Deduced a trap composed of 223 places in 285 ms of which 4 ms to minimize.
[2024-05-23 05:05:50] [INFO ] Deduced a trap composed of 145 places in 249 ms of which 4 ms to minimize.
[2024-05-23 05:05:51] [INFO ] Deduced a trap composed of 161 places in 352 ms of which 4 ms to minimize.
[2024-05-23 05:05:51] [INFO ] Deduced a trap composed of 92 places in 252 ms of which 4 ms to minimize.
[2024-05-23 05:05:51] [INFO ] Deduced a trap composed of 126 places in 355 ms of which 4 ms to minimize.
[2024-05-23 05:05:52] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 10 ms to minimize.
[2024-05-23 05:05:52] [INFO ] Deduced a trap composed of 124 places in 229 ms of which 4 ms to minimize.
[2024-05-23 05:05:52] [INFO ] Deduced a trap composed of 86 places in 315 ms of which 4 ms to minimize.
[2024-05-23 05:05:53] [INFO ] Deduced a trap composed of 222 places in 373 ms of which 4 ms to minimize.
[2024-05-23 05:05:53] [INFO ] Deduced a trap composed of 167 places in 338 ms of which 5 ms to minimize.
[2024-05-23 05:05:53] [INFO ] Deduced a trap composed of 62 places in 388 ms of which 4 ms to minimize.
[2024-05-23 05:05:54] [INFO ] Deduced a trap composed of 162 places in 361 ms of which 4 ms to minimize.
[2024-05-23 05:05:54] [INFO ] Deduced a trap composed of 197 places in 365 ms of which 4 ms to minimize.
[2024-05-23 05:05:54] [INFO ] Deduced a trap composed of 142 places in 338 ms of which 5 ms to minimize.
[2024-05-23 05:05:55] [INFO ] Deduced a trap composed of 118 places in 340 ms of which 4 ms to minimize.
[2024-05-23 05:05:55] [INFO ] Deduced a trap composed of 111 places in 328 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-05-23 05:05:57] [INFO ] Deduced a trap composed of 84 places in 311 ms of which 4 ms to minimize.
[2024-05-23 05:05:57] [INFO ] Deduced a trap composed of 177 places in 345 ms of which 5 ms to minimize.
[2024-05-23 05:05:57] [INFO ] Deduced a trap composed of 77 places in 353 ms of which 4 ms to minimize.
[2024-05-23 05:05:58] [INFO ] Deduced a trap composed of 140 places in 295 ms of which 4 ms to minimize.
[2024-05-23 05:05:58] [INFO ] Deduced a trap composed of 74 places in 364 ms of which 4 ms to minimize.
[2024-05-23 05:05:59] [INFO ] Deduced a trap composed of 135 places in 296 ms of which 4 ms to minimize.
[2024-05-23 05:05:59] [INFO ] Deduced a trap composed of 75 places in 339 ms of which 4 ms to minimize.
[2024-05-23 05:05:59] [INFO ] Deduced a trap composed of 176 places in 344 ms of which 3 ms to minimize.
[2024-05-23 05:06:00] [INFO ] Deduced a trap composed of 169 places in 366 ms of which 4 ms to minimize.
[2024-05-23 05:06:00] [INFO ] Deduced a trap composed of 147 places in 333 ms of which 4 ms to minimize.
[2024-05-23 05:06:01] [INFO ] Deduced a trap composed of 160 places in 352 ms of which 5 ms to minimize.
[2024-05-23 05:06:01] [INFO ] Deduced a trap composed of 238 places in 350 ms of which 4 ms to minimize.
[2024-05-23 05:06:01] [INFO ] Deduced a trap composed of 121 places in 370 ms of which 6 ms to minimize.
[2024-05-23 05:06:02] [INFO ] Deduced a trap composed of 126 places in 295 ms of which 4 ms to minimize.
[2024-05-23 05:06:02] [INFO ] Deduced a trap composed of 104 places in 357 ms of which 7 ms to minimize.
[2024-05-23 05:06:03] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 4 ms to minimize.
[2024-05-23 05:06:03] [INFO ] Deduced a trap composed of 170 places in 362 ms of which 4 ms to minimize.
[2024-05-23 05:06:03] [INFO ] Deduced a trap composed of 115 places in 342 ms of which 4 ms to minimize.
[2024-05-23 05:06:04] [INFO ] Deduced a trap composed of 106 places in 299 ms of which 3 ms to minimize.
[2024-05-23 05:06:04] [INFO ] Deduced a trap composed of 135 places in 342 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1220 variables, and 61 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/380 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 831 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 40/61 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-05-23 05:06:13] [INFO ] Deduced a trap composed of 79 places in 267 ms of which 4 ms to minimize.
[2024-05-23 05:06:14] [INFO ] Deduced a trap composed of 174 places in 384 ms of which 4 ms to minimize.
[2024-05-23 05:06:14] [INFO ] Deduced a trap composed of 159 places in 346 ms of which 5 ms to minimize.
[2024-05-23 05:06:14] [INFO ] Deduced a trap composed of 130 places in 319 ms of which 4 ms to minimize.
[2024-05-23 05:06:15] [INFO ] Deduced a trap composed of 170 places in 325 ms of which 4 ms to minimize.
[2024-05-23 05:06:15] [INFO ] Deduced a trap composed of 97 places in 330 ms of which 4 ms to minimize.
[2024-05-23 05:06:16] [INFO ] Deduced a trap composed of 170 places in 369 ms of which 4 ms to minimize.
[2024-05-23 05:06:16] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 4 ms to minimize.
[2024-05-23 05:06:16] [INFO ] Deduced a trap composed of 183 places in 358 ms of which 4 ms to minimize.
[2024-05-23 05:06:17] [INFO ] Deduced a trap composed of 169 places in 349 ms of which 4 ms to minimize.
[2024-05-23 05:06:17] [INFO ] Deduced a trap composed of 186 places in 352 ms of which 4 ms to minimize.
[2024-05-23 05:06:17] [INFO ] Deduced a trap composed of 210 places in 345 ms of which 4 ms to minimize.
[2024-05-23 05:06:18] [INFO ] Deduced a trap composed of 126 places in 369 ms of which 4 ms to minimize.
[2024-05-23 05:06:18] [INFO ] Deduced a trap composed of 167 places in 358 ms of which 4 ms to minimize.
[2024-05-23 05:06:18] [INFO ] Deduced a trap composed of 123 places in 348 ms of which 4 ms to minimize.
[2024-05-23 05:06:19] [INFO ] Deduced a trap composed of 224 places in 366 ms of which 5 ms to minimize.
[2024-05-23 05:06:19] [INFO ] Deduced a trap composed of 79 places in 354 ms of which 6 ms to minimize.
[2024-05-23 05:06:20] [INFO ] Deduced a trap composed of 80 places in 471 ms of which 5 ms to minimize.
[2024-05-23 05:06:20] [INFO ] Deduced a trap composed of 206 places in 283 ms of which 4 ms to minimize.
[2024-05-23 05:06:20] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-05-23 05:06:23] [INFO ] Deduced a trap composed of 61 places in 318 ms of which 4 ms to minimize.
[2024-05-23 05:06:24] [INFO ] Deduced a trap composed of 93 places in 387 ms of which 4 ms to minimize.
[2024-05-23 05:06:25] [INFO ] Deduced a trap composed of 172 places in 371 ms of which 4 ms to minimize.
[2024-05-23 05:06:25] [INFO ] Deduced a trap composed of 102 places in 362 ms of which 4 ms to minimize.
[2024-05-23 05:06:25] [INFO ] Deduced a trap composed of 162 places in 355 ms of which 4 ms to minimize.
[2024-05-23 05:06:26] [INFO ] Deduced a trap composed of 162 places in 364 ms of which 5 ms to minimize.
[2024-05-23 05:06:26] [INFO ] Deduced a trap composed of 160 places in 363 ms of which 6 ms to minimize.
[2024-05-23 05:06:27] [INFO ] Deduced a trap composed of 119 places in 457 ms of which 4 ms to minimize.
[2024-05-23 05:06:27] [INFO ] Deduced a trap composed of 110 places in 337 ms of which 4 ms to minimize.
[2024-05-23 05:06:27] [INFO ] Deduced a trap composed of 108 places in 336 ms of which 4 ms to minimize.
[2024-05-23 05:06:28] [INFO ] Deduced a trap composed of 206 places in 289 ms of which 3 ms to minimize.
[2024-05-23 05:06:28] [INFO ] Deduced a trap composed of 87 places in 338 ms of which 4 ms to minimize.
[2024-05-23 05:06:28] [INFO ] Deduced a trap composed of 108 places in 336 ms of which 4 ms to minimize.
[2024-05-23 05:06:29] [INFO ] Deduced a trap composed of 116 places in 302 ms of which 4 ms to minimize.
[2024-05-23 05:06:29] [INFO ] Deduced a trap composed of 122 places in 353 ms of which 4 ms to minimize.
[2024-05-23 05:06:29] [INFO ] Deduced a trap composed of 127 places in 345 ms of which 4 ms to minimize.
[2024-05-23 05:06:30] [INFO ] Deduced a trap composed of 96 places in 270 ms of which 3 ms to minimize.
[2024-05-23 05:06:30] [INFO ] Deduced a trap composed of 152 places in 327 ms of which 4 ms to minimize.
[2024-05-23 05:06:30] [INFO ] Deduced a trap composed of 112 places in 324 ms of which 4 ms to minimize.
[2024-05-23 05:06:31] [INFO ] Deduced a trap composed of 94 places in 241 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-05-23 05:06:35] [INFO ] Deduced a trap composed of 107 places in 228 ms of which 3 ms to minimize.
[2024-05-23 05:06:36] [INFO ] Deduced a trap composed of 75 places in 306 ms of which 3 ms to minimize.
[2024-05-23 05:06:37] [INFO ] Deduced a trap composed of 162 places in 352 ms of which 3 ms to minimize.
[2024-05-23 05:06:37] [INFO ] Deduced a trap composed of 162 places in 361 ms of which 3 ms to minimize.
[2024-05-23 05:06:38] [INFO ] Deduced a trap composed of 168 places in 358 ms of which 4 ms to minimize.
[2024-05-23 05:06:38] [INFO ] Deduced a trap composed of 178 places in 480 ms of which 6 ms to minimize.
[2024-05-23 05:06:39] [INFO ] Deduced a trap composed of 224 places in 374 ms of which 4 ms to minimize.
[2024-05-23 05:06:39] [INFO ] Deduced a trap composed of 240 places in 284 ms of which 4 ms to minimize.
[2024-05-23 05:06:39] [INFO ] Deduced a trap composed of 75 places in 367 ms of which 4 ms to minimize.
[2024-05-23 05:06:40] [INFO ] Deduced a trap composed of 210 places in 382 ms of which 4 ms to minimize.
[2024-05-23 05:06:40] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 4 ms to minimize.
SMT process timed out in 61902ms, After SMT, problems are : Problem set: 0 solved, 831 unsolved
Search for dead transitions found 0 dead transitions in 61949ms
Starting structural reductions in LTL mode, iteration 1 : 380/505 places, 840/1845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65517 ms. Remains : 380/505 places, 840/1845 transitions.
Support contains 48 out of 380 places after structural reductions.
[2024-05-23 05:06:40] [INFO ] Flatten gal took : 138 ms
[2024-05-23 05:06:40] [INFO ] Flatten gal took : 88 ms
[2024-05-23 05:06:41] [INFO ] Input system was already deterministic with 840 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (8 resets) in 3491 ms. (11 steps per ms) remains 13/28 properties
BEST_FIRST walk for 40002 steps (8 resets) in 254 ms. (156 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
[2024-05-23 05:06:42] [INFO ] Invariant cache hit.
[2024-05-23 05:06:42] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 206/216 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 149/365 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 15/380 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 840/1220 variables, 380/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1220 variables, 72/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1220 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1220 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 473 constraints, problems are : Problem set: 0 solved, 4 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 380/380 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 206/216 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 149/365 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 15/380 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 05:06:44] [INFO ] Deduced a trap composed of 81 places in 272 ms of which 5 ms to minimize.
[2024-05-23 05:06:44] [INFO ] Deduced a trap composed of 78 places in 309 ms of which 4 ms to minimize.
[2024-05-23 05:06:44] [INFO ] Deduced a trap composed of 189 places in 343 ms of which 4 ms to minimize.
[2024-05-23 05:06:45] [INFO ] Deduced a trap composed of 83 places in 303 ms of which 4 ms to minimize.
[2024-05-23 05:06:45] [INFO ] Deduced a trap composed of 192 places in 370 ms of which 4 ms to minimize.
[2024-05-23 05:06:45] [INFO ] Deduced a trap composed of 141 places in 324 ms of which 4 ms to minimize.
[2024-05-23 05:06:46] [INFO ] Deduced a trap composed of 133 places in 386 ms of which 4 ms to minimize.
[2024-05-23 05:06:46] [INFO ] Deduced a trap composed of 177 places in 330 ms of which 4 ms to minimize.
[2024-05-23 05:06:46] [INFO ] Deduced a trap composed of 139 places in 329 ms of which 3 ms to minimize.
[2024-05-23 05:06:47] [INFO ] Deduced a trap composed of 89 places in 340 ms of which 4 ms to minimize.
[2024-05-23 05:06:47] [INFO ] Deduced a trap composed of 119 places in 339 ms of which 4 ms to minimize.
[2024-05-23 05:06:48] [INFO ] Deduced a trap composed of 145 places in 352 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 05:06:48] [INFO ] Deduced a trap composed of 166 places in 405 ms of which 4 ms to minimize.
[2024-05-23 05:06:48] [INFO ] Deduced a trap composed of 175 places in 377 ms of which 5 ms to minimize.
SMT process timed out in 6344ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 380 transition count 769
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 309 transition count 769
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 157 place count 294 transition count 546
Iterating global reduction 0 with 15 rules applied. Total rules applied 172 place count 294 transition count 546
Applied a total of 172 rules in 94 ms. Remains 294 /380 variables (removed 86) and now considering 546/840 (removed 294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 294/380 places, 546/840 transitions.
RANDOM walk for 40000 steps (8 resets) in 539 ms. (74 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
// Phase 1: matrix 546 rows 294 cols
[2024-05-23 05:06:49] [INFO ] Computed 21 invariants in 12 ms
[2024-05-23 05:06:49] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 271/279 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 6/285 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/294 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 05:06:49] [INFO ] Deduced a trap composed of 128 places in 244 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 546/840 variables, 294/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 72/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/840 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 388 constraints, problems are : Problem set: 0 solved, 3 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 294/294 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 271/279 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 6/285 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/294 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 05:06:50] [INFO ] Deduced a trap composed of 113 places in 256 ms of which 4 ms to minimize.
[2024-05-23 05:06:51] [INFO ] Deduced a trap composed of 111 places in 265 ms of which 3 ms to minimize.
[2024-05-23 05:06:51] [INFO ] Deduced a trap composed of 73 places in 253 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 546/840 variables, 294/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/840 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/840 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 394 constraints, problems are : Problem set: 0 solved, 3 unsolved in 21855 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 294/294 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 22841ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1408 ms.
Support contains 8 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 546/546 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 293 transition count 529
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 293 transition count 529
Applied a total of 2 rules in 42 ms. Remains 293 /294 variables (removed 1) and now considering 529/546 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 293/294 places, 529/546 transitions.
RANDOM walk for 40000 steps (8 resets) in 292 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 696458 steps, run timeout after 3032 ms. (steps per millisecond=229 ) properties seen :2 out of 3
Probabilistic random walk after 696458 steps, saw 484568 distinct states, run finished after 3039 ms. (steps per millisecond=229 ) properties seen :2
// Phase 1: matrix 529 rows 293 cols
[2024-05-23 05:07:17] [INFO ] Computed 21 invariants in 13 ms
[2024-05-23 05:07:17] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/283 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/293 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 529/822 variables, 293/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 72/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/822 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 386 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 293/293 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/283 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/293 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 529/822 variables, 293/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 72/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/822 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 822/822 variables, and 387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 293/293 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 819ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 529/529 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 293 transition count 528
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 292 transition count 528
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 290 transition count 494
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 290 transition count 494
Applied a total of 6 rules in 49 ms. Remains 290 /293 variables (removed 3) and now considering 494/529 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 290/293 places, 494/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1041282 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 1
Probabilistic random walk after 1041282 steps, saw 732388 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
// Phase 1: matrix 494 rows 290 cols
[2024-05-23 05:07:21] [INFO ] Computed 21 invariants in 26 ms
[2024-05-23 05:07:21] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 261/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/280 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/290 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 494/784 variables, 290/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 72/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/784 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 383 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 290/290 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 261/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/280 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/290 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 494/784 variables, 290/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 72/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/784 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 290/290 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 494/494 transitions.
Applied a total of 0 rules in 33 ms. Remains 290 /290 variables (removed 0) and now considering 494/494 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 290/290 places, 494/494 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 494/494 transitions.
Applied a total of 0 rules in 13 ms. Remains 290 /290 variables (removed 0) and now considering 494/494 (removed 0) transitions.
[2024-05-23 05:07:21] [INFO ] Invariant cache hit.
[2024-05-23 05:07:22] [INFO ] Implicit Places using invariants in 468 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 474 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 289/290 places, 494/494 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 209 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 208 transition count 413
Applied a total of 162 rules in 31 ms. Remains 208 /289 variables (removed 81) and now considering 413/494 (removed 81) transitions.
// Phase 1: matrix 413 rows 208 cols
[2024-05-23 05:07:22] [INFO ] Computed 20 invariants in 5 ms
[2024-05-23 05:07:22] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-23 05:07:22] [INFO ] Invariant cache hit.
[2024-05-23 05:07:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:07:23] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/290 places, 413/494 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1617 ms. Remains : 208/290 places, 413/494 transitions.
RANDOM walk for 40000 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1147659 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 1
Probabilistic random walk after 1147659 steps, saw 773929 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
[2024-05-23 05:07:26] [INFO ] Invariant cache hit.
[2024-05-23 05:07:26] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 413/621 variables, 208/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 72/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/621 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 413/621 variables, 208/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 72/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/621 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 621/621 variables, and 301 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 413/413 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 208/208 places, 413/413 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 413/413 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2024-05-23 05:07:27] [INFO ] Invariant cache hit.
[2024-05-23 05:07:27] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-23 05:07:27] [INFO ] Invariant cache hit.
[2024-05-23 05:07:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:07:28] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2024-05-23 05:07:28] [INFO ] Redundant transitions in 28 ms returned []
Running 404 sub problems to find dead transitions.
[2024-05-23 05:07:28] [INFO ] Invariant cache hit.
[2024-05-23 05:07:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-23 05:07:32] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:07:32] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 3 ms to minimize.
[2024-05-23 05:07:32] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:07:32] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-23 05:07:32] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 2 ms to minimize.
[2024-05-23 05:07:33] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 2 ms to minimize.
[2024-05-23 05:07:33] [INFO ] Deduced a trap composed of 109 places in 153 ms of which 2 ms to minimize.
[2024-05-23 05:07:33] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:07:33] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 2 ms to minimize.
[2024-05-23 05:07:33] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 2 ms to minimize.
[2024-05-23 05:07:34] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:07:34] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
[2024-05-23 05:07:34] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-23 05:07:34] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 2 ms to minimize.
[2024-05-23 05:07:34] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 3 ms to minimize.
[2024-05-23 05:07:34] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 2 ms to minimize.
[2024-05-23 05:07:35] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:07:35] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 3 ms to minimize.
[2024-05-23 05:07:35] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 3 ms to minimize.
[2024-05-23 05:07:35] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-23 05:07:36] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 3 ms to minimize.
[2024-05-23 05:07:37] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-05-23 05:07:37] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:07:37] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 3 ms to minimize.
[2024-05-23 05:07:37] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 3 ms to minimize.
[2024-05-23 05:07:37] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-05-23 05:07:37] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 2 ms to minimize.
[2024-05-23 05:07:38] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 2 ms to minimize.
[2024-05-23 05:07:38] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 3 ms to minimize.
[2024-05-23 05:07:38] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-23 05:07:38] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 2 ms to minimize.
[2024-05-23 05:07:38] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:07:38] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 2 ms to minimize.
[2024-05-23 05:07:39] [INFO ] Deduced a trap composed of 85 places in 161 ms of which 4 ms to minimize.
[2024-05-23 05:07:39] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:07:39] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 3 ms to minimize.
[2024-05-23 05:07:39] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-05-23 05:07:39] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 2 ms to minimize.
[2024-05-23 05:07:39] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 3 ms to minimize.
[2024-05-23 05:07:40] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-23 05:07:43] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 2 ms to minimize.
[2024-05-23 05:07:44] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:07:44] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 3 ms to minimize.
[2024-05-23 05:07:44] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 3 ms to minimize.
[2024-05-23 05:07:44] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 3 ms to minimize.
[2024-05-23 05:07:44] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 2 ms to minimize.
[2024-05-23 05:07:45] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:07:45] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 2 ms to minimize.
[2024-05-23 05:07:45] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 3 ms to minimize.
[2024-05-23 05:07:45] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 2 ms to minimize.
[2024-05-23 05:07:45] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 2 ms to minimize.
[2024-05-23 05:07:45] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:07:46] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2024-05-23 05:07:46] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-05-23 05:07:46] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 3 ms to minimize.
[2024-05-23 05:07:46] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 3 ms to minimize.
[2024-05-23 05:07:46] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:07:46] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 2 ms to minimize.
[2024-05-23 05:07:47] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:07:47] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-23 05:07:49] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 2 ms to minimize.
[2024-05-23 05:07:49] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:07:49] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:07:49] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 2 ms to minimize.
[2024-05-23 05:07:49] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:07:50] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 3 ms to minimize.
[2024-05-23 05:07:50] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:07:50] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 3 ms to minimize.
[2024-05-23 05:07:50] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 2 ms to minimize.
[2024-05-23 05:07:50] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 3 ms to minimize.
[2024-05-23 05:07:50] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:07:51] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-05-23 05:07:51] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 3 ms to minimize.
[2024-05-23 05:07:51] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:07:51] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:07:51] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 2 ms to minimize.
[2024-05-23 05:07:51] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:07:52] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
[2024-05-23 05:07:52] [INFO ] Deduced a trap composed of 85 places in 166 ms of which 3 ms to minimize.
[2024-05-23 05:07:52] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-23 05:07:54] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 3 ms to minimize.
[2024-05-23 05:07:54] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 2 ms to minimize.
[2024-05-23 05:07:54] [INFO ] Deduced a trap composed of 88 places in 176 ms of which 2 ms to minimize.
[2024-05-23 05:07:55] [INFO ] Deduced a trap composed of 105 places in 162 ms of which 3 ms to minimize.
[2024-05-23 05:07:55] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:07:55] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 3 ms to minimize.
[2024-05-23 05:07:55] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 3 ms to minimize.
[2024-05-23 05:07:55] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 2 ms to minimize.
[2024-05-23 05:07:56] [INFO ] Deduced a trap composed of 81 places in 161 ms of which 3 ms to minimize.
[2024-05-23 05:07:56] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 3 ms to minimize.
[2024-05-23 05:07:56] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 2 ms to minimize.
[2024-05-23 05:07:56] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 3 ms to minimize.
[2024-05-23 05:07:56] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 2 ms to minimize.
[2024-05-23 05:07:57] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 3 ms to minimize.
[2024-05-23 05:07:57] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:07:57] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 3 ms to minimize.
[2024-05-23 05:07:57] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 2 ms to minimize.
[2024-05-23 05:07:57] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:07:57] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 3 ms to minimize.
[2024-05-23 05:07:58] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/621 variables, and 120 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/208 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 208/621 variables, and 120 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/208 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/404 constraints, Known Traps: 100/100 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61433 ms. Remains : 208/208 places, 413/413 transitions.
FORMULA Anderson-PT-09-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 290 transition count 494
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 290 transition count 494
Applied a total of 180 rules in 42 ms. Remains 290 /380 variables (removed 90) and now considering 494/840 (removed 346) transitions.
// Phase 1: matrix 494 rows 290 cols
[2024-05-23 05:08:29] [INFO ] Computed 21 invariants in 7 ms
[2024-05-23 05:08:29] [INFO ] Implicit Places using invariants in 590 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 592 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/380 places, 494/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 289 transition count 432
Reduce places removed 62 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 71 rules applied. Total rules applied 133 place count 227 transition count 423
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 142 place count 218 transition count 423
Applied a total of 142 rules in 23 ms. Remains 218 /289 variables (removed 71) and now considering 423/494 (removed 71) transitions.
// Phase 1: matrix 423 rows 218 cols
[2024-05-23 05:08:29] [INFO ] Computed 20 invariants in 8 ms
[2024-05-23 05:08:29] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-23 05:08:29] [INFO ] Invariant cache hit.
[2024-05-23 05:08:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:08:30] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 218/380 places, 423/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1829 ms. Remains : 218/380 places, 423/840 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 355 ms.
Stack based approach found an accepted trace after 1442 steps with 0 reset with depth 1443 and stack size 1146 in 5 ms.
FORMULA Anderson-PT-09-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-03 finished in 2566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 161 place count 291 transition count 511
Iterating global reduction 0 with 17 rules applied. Total rules applied 178 place count 291 transition count 511
Applied a total of 178 rules in 35 ms. Remains 291 /380 variables (removed 89) and now considering 511/840 (removed 329) transitions.
// Phase 1: matrix 511 rows 291 cols
[2024-05-23 05:08:31] [INFO ] Computed 21 invariants in 8 ms
[2024-05-23 05:08:32] [INFO ] Implicit Places using invariants in 514 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 516 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/380 places, 511/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 290 transition count 432
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 211 transition count 432
Applied a total of 158 rules in 18 ms. Remains 211 /290 variables (removed 79) and now considering 432/511 (removed 79) transitions.
// Phase 1: matrix 432 rows 211 cols
[2024-05-23 05:08:32] [INFO ] Computed 20 invariants in 3 ms
[2024-05-23 05:08:32] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 05:08:32] [INFO ] Invariant cache hit.
[2024-05-23 05:08:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:08:33] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/380 places, 432/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1729 ms. Remains : 211/380 places, 432/840 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-04
Product exploration explored 100000 steps with 2 reset in 224 ms.
Product exploration explored 100000 steps with 0 reset in 327 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4984 steps (0 resets) in 26 ms. (184 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 8 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-05-23 05:08:34] [INFO ] Invariant cache hit.
[2024-05-23 05:08:34] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-23 05:08:34] [INFO ] Invariant cache hit.
[2024-05-23 05:08:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:08:35] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2024-05-23 05:08:35] [INFO ] Redundant transitions in 3 ms returned []
Running 423 sub problems to find dead transitions.
[2024-05-23 05:08:35] [INFO ] Invariant cache hit.
[2024-05-23 05:08:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:08:38] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 2 ms to minimize.
[2024-05-23 05:08:38] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:08:39] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 3 ms to minimize.
[2024-05-23 05:08:39] [INFO ] Deduced a trap composed of 78 places in 169 ms of which 2 ms to minimize.
[2024-05-23 05:08:39] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 3 ms to minimize.
[2024-05-23 05:08:39] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:08:40] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 3 ms to minimize.
[2024-05-23 05:08:40] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:08:40] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 3 ms to minimize.
[2024-05-23 05:08:41] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:08:41] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 3 ms to minimize.
[2024-05-23 05:08:41] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:08:41] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 3 ms to minimize.
[2024-05-23 05:08:41] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:08:42] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 3 ms to minimize.
[2024-05-23 05:08:42] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 2 ms to minimize.
[2024-05-23 05:08:42] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 2 ms to minimize.
[2024-05-23 05:08:42] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:08:42] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-05-23 05:08:42] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:08:44] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:08:44] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 2 ms to minimize.
[2024-05-23 05:08:44] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 2 ms to minimize.
[2024-05-23 05:08:45] [INFO ] Deduced a trap composed of 84 places in 168 ms of which 3 ms to minimize.
[2024-05-23 05:08:45] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 2 ms to minimize.
[2024-05-23 05:08:45] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 3 ms to minimize.
[2024-05-23 05:08:45] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 3 ms to minimize.
[2024-05-23 05:08:45] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 3 ms to minimize.
[2024-05-23 05:08:45] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
[2024-05-23 05:08:46] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:08:46] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 2 ms to minimize.
[2024-05-23 05:08:46] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 3 ms to minimize.
[2024-05-23 05:08:46] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 3 ms to minimize.
[2024-05-23 05:08:46] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 3 ms to minimize.
[2024-05-23 05:08:47] [INFO ] Deduced a trap composed of 110 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:08:47] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 3 ms to minimize.
[2024-05-23 05:08:47] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 3 ms to minimize.
[2024-05-23 05:08:47] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 2 ms to minimize.
[2024-05-23 05:08:47] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-23 05:08:48] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:08:51] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:08:51] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 2 ms to minimize.
[2024-05-23 05:08:51] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 3 ms to minimize.
[2024-05-23 05:08:51] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:08:53] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:08:53] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 3 ms to minimize.
[2024-05-23 05:08:53] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:08:55] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 3 ms to minimize.
[2024-05-23 05:08:55] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 2 ms to minimize.
[2024-05-23 05:08:56] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:08:56] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 3 ms to minimize.
[2024-05-23 05:08:56] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 3 ms to minimize.
[2024-05-23 05:08:57] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:08:57] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:08:57] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 2 ms to minimize.
[2024-05-23 05:08:58] [INFO ] Deduced a trap composed of 66 places in 170 ms of which 3 ms to minimize.
[2024-05-23 05:08:58] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:08:58] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 2 ms to minimize.
[2024-05-23 05:08:58] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 3 ms to minimize.
[2024-05-23 05:08:58] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-23 05:08:58] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 3 ms to minimize.
[2024-05-23 05:08:59] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 3 ms to minimize.
[2024-05-23 05:08:59] [INFO ] Deduced a trap composed of 91 places in 170 ms of which 2 ms to minimize.
[2024-05-23 05:08:59] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 3 ms to minimize.
[2024-05-23 05:08:59] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:08:59] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 2 ms to minimize.
[2024-05-23 05:09:00] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:09:01] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:09:02] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 2 ms to minimize.
[2024-05-23 05:09:03] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 3 ms to minimize.
[2024-05-23 05:09:03] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 3 ms to minimize.
[2024-05-23 05:09:03] [INFO ] Deduced a trap composed of 77 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:09:03] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:09:03] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 2 ms to minimize.
[2024-05-23 05:09:03] [INFO ] Deduced a trap composed of 86 places in 169 ms of which 2 ms to minimize.
[2024-05-23 05:09:04] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:09:04] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 2 ms to minimize.
[2024-05-23 05:09:04] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 2 ms to minimize.
[2024-05-23 05:09:04] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 3 ms to minimize.
[2024-05-23 05:09:04] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:09:05] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 2 ms to minimize.
[2024-05-23 05:09:05] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 3 ms to minimize.
[2024-05-23 05:09:05] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:09:05] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 3 ms to minimize.
[2024-05-23 05:09:05] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 211/643 variables, and 105 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 85/105 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:09:33] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 2 ms to minimize.
[2024-05-23 05:09:33] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/643 variables, and 107 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/423 constraints, Known Traps: 87/87 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61488 ms. Remains : 211/211 places, 432/432 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 9582 steps (1 resets) in 11 ms. (798 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 209 ms.
Built C files in :
/tmp/ltsmin1960387587427563263
[2024-05-23 05:09:37] [INFO ] Computing symmetric may disable matrix : 432 transitions.
[2024-05-23 05:09:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:09:37] [INFO ] Computing symmetric may enable matrix : 432 transitions.
[2024-05-23 05:09:37] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:09:37] [INFO ] Computing Do-Not-Accords matrix : 432 transitions.
[2024-05-23 05:09:37] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:09:37] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1960387587427563263
Running compilation step : cd /tmp/ltsmin1960387587427563263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2096 ms.
Running link step : cd /tmp/ltsmin1960387587427563263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin1960387587427563263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10591579612529395837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 8 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-05-23 05:09:52] [INFO ] Invariant cache hit.
[2024-05-23 05:09:52] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-23 05:09:52] [INFO ] Invariant cache hit.
[2024-05-23 05:09:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:09:53] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2024-05-23 05:09:53] [INFO ] Redundant transitions in 2 ms returned []
Running 423 sub problems to find dead transitions.
[2024-05-23 05:09:53] [INFO ] Invariant cache hit.
[2024-05-23 05:09:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:09:56] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 3 ms to minimize.
[2024-05-23 05:09:56] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 3 ms to minimize.
[2024-05-23 05:09:57] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 3 ms to minimize.
[2024-05-23 05:09:57] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:09:57] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:09:57] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 2 ms to minimize.
[2024-05-23 05:09:58] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 3 ms to minimize.
[2024-05-23 05:09:58] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 3 ms to minimize.
[2024-05-23 05:09:58] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 2 ms to minimize.
[2024-05-23 05:09:58] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-23 05:09:58] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 2 ms to minimize.
[2024-05-23 05:09:59] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 2 ms to minimize.
[2024-05-23 05:09:59] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:09:59] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 3 ms to minimize.
[2024-05-23 05:09:59] [INFO ] Deduced a trap composed of 75 places in 184 ms of which 3 ms to minimize.
[2024-05-23 05:09:59] [INFO ] Deduced a trap composed of 69 places in 166 ms of which 3 ms to minimize.
[2024-05-23 05:10:00] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 2 ms to minimize.
[2024-05-23 05:10:00] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:10:00] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 3 ms to minimize.
[2024-05-23 05:10:00] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:10:02] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2024-05-23 05:10:02] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:10:02] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 3 ms to minimize.
[2024-05-23 05:10:02] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 3 ms to minimize.
[2024-05-23 05:10:02] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 3 ms to minimize.
[2024-05-23 05:10:03] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 3 ms to minimize.
[2024-05-23 05:10:03] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-05-23 05:10:03] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2024-05-23 05:10:03] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:10:03] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 2 ms to minimize.
[2024-05-23 05:10:03] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 2 ms to minimize.
[2024-05-23 05:10:04] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 2 ms to minimize.
[2024-05-23 05:10:04] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:10:04] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:10:04] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 2 ms to minimize.
[2024-05-23 05:10:05] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 2 ms to minimize.
[2024-05-23 05:10:05] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 2 ms to minimize.
[2024-05-23 05:10:05] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:10:05] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 2 ms to minimize.
[2024-05-23 05:10:05] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:10:09] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 2 ms to minimize.
[2024-05-23 05:10:09] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 2 ms to minimize.
[2024-05-23 05:10:09] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:10:09] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:10:10] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-05-23 05:10:11] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:10:11] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:10:13] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2024-05-23 05:10:13] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 3 ms to minimize.
[2024-05-23 05:10:14] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
[2024-05-23 05:10:14] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 3 ms to minimize.
[2024-05-23 05:10:14] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:10:15] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 2 ms to minimize.
[2024-05-23 05:10:15] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 2 ms to minimize.
[2024-05-23 05:10:15] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 2 ms to minimize.
[2024-05-23 05:10:15] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 3 ms to minimize.
[2024-05-23 05:10:15] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:10:16] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-23 05:10:16] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 2 ms to minimize.
[2024-05-23 05:10:16] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-23 05:10:16] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 3 ms to minimize.
[2024-05-23 05:10:16] [INFO ] Deduced a trap composed of 95 places in 177 ms of which 2 ms to minimize.
[2024-05-23 05:10:17] [INFO ] Deduced a trap composed of 91 places in 182 ms of which 3 ms to minimize.
[2024-05-23 05:10:17] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 3 ms to minimize.
[2024-05-23 05:10:17] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:10:17] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:10:17] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:10:19] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 2 ms to minimize.
[2024-05-23 05:10:20] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 3 ms to minimize.
[2024-05-23 05:10:20] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 2 ms to minimize.
[2024-05-23 05:10:21] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 2 ms to minimize.
[2024-05-23 05:10:21] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:10:21] [INFO ] Deduced a trap composed of 86 places in 173 ms of which 2 ms to minimize.
[2024-05-23 05:10:21] [INFO ] Deduced a trap composed of 75 places in 172 ms of which 2 ms to minimize.
[2024-05-23 05:10:21] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 2 ms to minimize.
[2024-05-23 05:10:21] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 3 ms to minimize.
[2024-05-23 05:10:22] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 2 ms to minimize.
[2024-05-23 05:10:22] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-23 05:10:22] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 2 ms to minimize.
[2024-05-23 05:10:22] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 3 ms to minimize.
[2024-05-23 05:10:22] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:10:23] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 2 ms to minimize.
[2024-05-23 05:10:23] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 2 ms to minimize.
[2024-05-23 05:10:23] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 211/643 variables, and 104 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 84/104 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:10:27] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-23 05:10:28] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-05-23 05:10:28] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:10:28] [INFO ] Deduced a trap composed of 68 places in 183 ms of which 3 ms to minimize.
[2024-05-23 05:10:28] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 3 ms to minimize.
[2024-05-23 05:10:28] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 2 ms to minimize.
[2024-05-23 05:10:28] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-05-23 05:10:29] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 2 ms to minimize.
[2024-05-23 05:10:29] [INFO ] Deduced a trap composed of 77 places in 188 ms of which 2 ms to minimize.
[2024-05-23 05:10:29] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 3 ms to minimize.
[2024-05-23 05:10:29] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:10:29] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
[2024-05-23 05:10:30] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:10:30] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:10:30] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 3 ms to minimize.
[2024-05-23 05:10:30] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 3 ms to minimize.
[2024-05-23 05:10:30] [INFO ] Deduced a trap composed of 60 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:10:30] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:10:31] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:10:31] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/643 variables, and 124 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/423 constraints, Known Traps: 104/104 constraints]
After SMT, in 60318ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61526 ms. Remains : 211/211 places, 432/432 transitions.
Built C files in :
/tmp/ltsmin3565739621046064749
[2024-05-23 05:10:53] [INFO ] Computing symmetric may disable matrix : 432 transitions.
[2024-05-23 05:10:53] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:10:53] [INFO ] Computing symmetric may enable matrix : 432 transitions.
[2024-05-23 05:10:53] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:10:53] [INFO ] Computing Do-Not-Accords matrix : 432 transitions.
[2024-05-23 05:10:53] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:10:53] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3565739621046064749
Running compilation step : cd /tmp/ltsmin3565739621046064749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1835 ms.
Running link step : cd /tmp/ltsmin3565739621046064749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3565739621046064749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10522285697147703138.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 05:11:08] [INFO ] Flatten gal took : 35 ms
[2024-05-23 05:11:08] [INFO ] Flatten gal took : 36 ms
[2024-05-23 05:11:08] [INFO ] Time to serialize gal into /tmp/LTL9846249570083934683.gal : 7 ms
[2024-05-23 05:11:09] [INFO ] Time to serialize properties into /tmp/LTL15458887555120625031.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9846249570083934683.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15019786604360196224.hoa' '-atoms' '/tmp/LTL15458887555120625031.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15458887555120625031.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15019786604360196224.hoa
Detected timeout of ITS tools.
[2024-05-23 05:11:24] [INFO ] Flatten gal took : 31 ms
[2024-05-23 05:11:24] [INFO ] Flatten gal took : 26 ms
[2024-05-23 05:11:24] [INFO ] Time to serialize gal into /tmp/LTL7419474029283849321.gal : 6 ms
[2024-05-23 05:11:24] [INFO ] Time to serialize properties into /tmp/LTL18122756523644134278.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7419474029283849321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18122756523644134278.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((next_9!=1)||(ncs_1_4!=1))||((next_7==1)&&(ncs_3_1==1)))"))))
Formula 0 simplified : FG!"(((next_9!=1)||(ncs_1_4!=1))||((next_7==1)&&(ncs_3_1==1)))"
Detected timeout of ITS tools.
[2024-05-23 05:11:39] [INFO ] Flatten gal took : 22 ms
[2024-05-23 05:11:39] [INFO ] Applying decomposition
[2024-05-23 05:11:39] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17765963953404846366.txt' '-o' '/tmp/graph17765963953404846366.bin' '-w' '/tmp/graph17765963953404846366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17765963953404846366.bin' '-l' '-1' '-v' '-w' '/tmp/graph17765963953404846366.weights' '-q' '0' '-e' '0.001'
[2024-05-23 05:11:39] [INFO ] Decomposing Gal with order
[2024-05-23 05:11:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 05:11:39] [INFO ] Removed a total of 750 redundant transitions.
[2024-05-23 05:11:39] [INFO ] Flatten gal took : 119 ms
[2024-05-23 05:11:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 27 ms.
[2024-05-23 05:11:39] [INFO ] Time to serialize gal into /tmp/LTL2826131252739951051.gal : 11 ms
[2024-05-23 05:11:39] [INFO ] Time to serialize properties into /tmp/LTL6393006490665196221.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2826131252739951051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6393006490665196221.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i1.i1.u7.next_9!=1)||(u31.ncs_1_4!=1))||((i2.i0.u6.next_7==1)&&(i6.u47.ncs_3_1==1)))"))))
Formula 0 simplified : FG!"(((i1.i1.u7.next_9!=1)||(u31.ncs_1_4!=1))||((i2.i0.u6.next_7==1)&&(i6.u47.ncs_3_1==1)))"
Detected timeout of ITS tools.
Treatment of property Anderson-PT-09-LTLFireability-04 finished in 203257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U p1)&&F(p2)))))'
Support contains 6 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 363 transition count 583
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 363 transition count 583
Applied a total of 34 rules in 11 ms. Remains 363 /380 variables (removed 17) and now considering 583/840 (removed 257) transitions.
// Phase 1: matrix 583 rows 363 cols
[2024-05-23 05:11:54] [INFO ] Computed 21 invariants in 8 ms
[2024-05-23 05:11:55] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-23 05:11:55] [INFO ] Invariant cache hit.
[2024-05-23 05:11:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:11:57] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 2749 ms to find 0 implicit places.
Running 574 sub problems to find dead transitions.
[2024-05-23 05:11:57] [INFO ] Invariant cache hit.
[2024-05-23 05:11:57] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 05:12:04] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 6 ms to minimize.
[2024-05-23 05:12:04] [INFO ] Deduced a trap composed of 209 places in 305 ms of which 3 ms to minimize.
[2024-05-23 05:12:04] [INFO ] Deduced a trap composed of 120 places in 300 ms of which 3 ms to minimize.
[2024-05-23 05:12:06] [INFO ] Deduced a trap composed of 151 places in 327 ms of which 4 ms to minimize.
[2024-05-23 05:12:06] [INFO ] Deduced a trap composed of 93 places in 282 ms of which 4 ms to minimize.
[2024-05-23 05:12:07] [INFO ] Deduced a trap composed of 201 places in 291 ms of which 3 ms to minimize.
[2024-05-23 05:12:07] [INFO ] Deduced a trap composed of 219 places in 293 ms of which 4 ms to minimize.
[2024-05-23 05:12:08] [INFO ] Deduced a trap composed of 197 places in 280 ms of which 3 ms to minimize.
[2024-05-23 05:12:08] [INFO ] Deduced a trap composed of 151 places in 291 ms of which 4 ms to minimize.
[2024-05-23 05:12:08] [INFO ] Deduced a trap composed of 160 places in 309 ms of which 4 ms to minimize.
[2024-05-23 05:12:10] [INFO ] Deduced a trap composed of 137 places in 317 ms of which 4 ms to minimize.
[2024-05-23 05:12:10] [INFO ] Deduced a trap composed of 102 places in 301 ms of which 4 ms to minimize.
[2024-05-23 05:12:11] [INFO ] Deduced a trap composed of 106 places in 307 ms of which 3 ms to minimize.
[2024-05-23 05:12:11] [INFO ] Deduced a trap composed of 63 places in 298 ms of which 4 ms to minimize.
[2024-05-23 05:12:12] [INFO ] Deduced a trap composed of 63 places in 304 ms of which 3 ms to minimize.
[2024-05-23 05:12:12] [INFO ] Deduced a trap composed of 71 places in 311 ms of which 4 ms to minimize.
[2024-05-23 05:12:13] [INFO ] Deduced a trap composed of 154 places in 310 ms of which 3 ms to minimize.
[2024-05-23 05:12:13] [INFO ] Deduced a trap composed of 162 places in 292 ms of which 4 ms to minimize.
[2024-05-23 05:12:14] [INFO ] Deduced a trap composed of 104 places in 284 ms of which 3 ms to minimize.
[2024-05-23 05:12:14] [INFO ] Deduced a trap composed of 105 places in 288 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 05:12:16] [INFO ] Deduced a trap composed of 116 places in 321 ms of which 3 ms to minimize.
[2024-05-23 05:12:16] [INFO ] Deduced a trap composed of 197 places in 317 ms of which 4 ms to minimize.
[2024-05-23 05:12:16] [INFO ] Deduced a trap composed of 200 places in 292 ms of which 4 ms to minimize.
[2024-05-23 05:12:17] [INFO ] Deduced a trap composed of 155 places in 300 ms of which 4 ms to minimize.
[2024-05-23 05:12:17] [INFO ] Deduced a trap composed of 110 places in 263 ms of which 3 ms to minimize.
[2024-05-23 05:12:17] [INFO ] Deduced a trap composed of 139 places in 296 ms of which 4 ms to minimize.
[2024-05-23 05:12:17] [INFO ] Deduced a trap composed of 126 places in 293 ms of which 4 ms to minimize.
[2024-05-23 05:12:20] [INFO ] Deduced a trap composed of 151 places in 294 ms of which 4 ms to minimize.
[2024-05-23 05:12:20] [INFO ] Deduced a trap composed of 127 places in 298 ms of which 4 ms to minimize.
[2024-05-23 05:12:20] [INFO ] Deduced a trap composed of 183 places in 339 ms of which 5 ms to minimize.
[2024-05-23 05:12:21] [INFO ] Deduced a trap composed of 219 places in 374 ms of which 6 ms to minimize.
[2024-05-23 05:12:21] [INFO ] Deduced a trap composed of 97 places in 299 ms of which 4 ms to minimize.
[2024-05-23 05:12:22] [INFO ] Deduced a trap composed of 175 places in 312 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/946 variables, and 54 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 05:12:31] [INFO ] Deduced a trap composed of 136 places in 305 ms of which 4 ms to minimize.
[2024-05-23 05:12:31] [INFO ] Deduced a trap composed of 137 places in 260 ms of which 3 ms to minimize.
[2024-05-23 05:12:31] [INFO ] Deduced a trap composed of 155 places in 291 ms of which 4 ms to minimize.
[2024-05-23 05:12:31] [INFO ] Deduced a trap composed of 155 places in 279 ms of which 3 ms to minimize.
[2024-05-23 05:12:32] [INFO ] Deduced a trap composed of 139 places in 288 ms of which 5 ms to minimize.
[2024-05-23 05:12:32] [INFO ] Deduced a trap composed of 159 places in 405 ms of which 6 ms to minimize.
[2024-05-23 05:12:33] [INFO ] Deduced a trap composed of 161 places in 314 ms of which 4 ms to minimize.
[2024-05-23 05:12:33] [INFO ] Deduced a trap composed of 135 places in 307 ms of which 4 ms to minimize.
[2024-05-23 05:12:33] [INFO ] Deduced a trap composed of 144 places in 338 ms of which 6 ms to minimize.
[2024-05-23 05:12:34] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 4 ms to minimize.
[2024-05-23 05:12:34] [INFO ] Deduced a trap composed of 161 places in 300 ms of which 4 ms to minimize.
[2024-05-23 05:12:35] [INFO ] Deduced a trap composed of 102 places in 325 ms of which 4 ms to minimize.
[2024-05-23 05:12:35] [INFO ] Deduced a trap composed of 93 places in 305 ms of which 4 ms to minimize.
[2024-05-23 05:12:35] [INFO ] Deduced a trap composed of 193 places in 297 ms of which 5 ms to minimize.
[2024-05-23 05:12:36] [INFO ] Deduced a trap composed of 170 places in 398 ms of which 6 ms to minimize.
[2024-05-23 05:12:36] [INFO ] Deduced a trap composed of 148 places in 323 ms of which 4 ms to minimize.
[2024-05-23 05:12:36] [INFO ] Deduced a trap composed of 202 places in 325 ms of which 5 ms to minimize.
[2024-05-23 05:12:37] [INFO ] Deduced a trap composed of 118 places in 396 ms of which 4 ms to minimize.
[2024-05-23 05:12:37] [INFO ] Deduced a trap composed of 120 places in 295 ms of which 4 ms to minimize.
[2024-05-23 05:12:37] [INFO ] Deduced a trap composed of 103 places in 298 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 05:12:40] [INFO ] Deduced a trap composed of 173 places in 297 ms of which 4 ms to minimize.
[2024-05-23 05:12:41] [INFO ] Deduced a trap composed of 163 places in 303 ms of which 4 ms to minimize.
[2024-05-23 05:12:41] [INFO ] Deduced a trap composed of 167 places in 303 ms of which 3 ms to minimize.
[2024-05-23 05:12:42] [INFO ] Deduced a trap composed of 121 places in 322 ms of which 4 ms to minimize.
[2024-05-23 05:12:42] [INFO ] Deduced a trap composed of 212 places in 295 ms of which 4 ms to minimize.
[2024-05-23 05:12:42] [INFO ] Deduced a trap composed of 136 places in 295 ms of which 4 ms to minimize.
[2024-05-23 05:12:43] [INFO ] Deduced a trap composed of 164 places in 390 ms of which 6 ms to minimize.
[2024-05-23 05:12:43] [INFO ] Deduced a trap composed of 82 places in 309 ms of which 4 ms to minimize.
[2024-05-23 05:12:44] [INFO ] Deduced a trap composed of 105 places in 320 ms of which 4 ms to minimize.
[2024-05-23 05:12:45] [INFO ] Deduced a trap composed of 164 places in 335 ms of which 5 ms to minimize.
[2024-05-23 05:12:45] [INFO ] Deduced a trap composed of 191 places in 395 ms of which 3 ms to minimize.
[2024-05-23 05:12:46] [INFO ] Deduced a trap composed of 180 places in 298 ms of which 3 ms to minimize.
[2024-05-23 05:12:46] [INFO ] Deduced a trap composed of 200 places in 255 ms of which 3 ms to minimize.
[2024-05-23 05:12:46] [INFO ] Deduced a trap composed of 189 places in 304 ms of which 3 ms to minimize.
[2024-05-23 05:12:46] [INFO ] Deduced a trap composed of 253 places in 296 ms of which 3 ms to minimize.
[2024-05-23 05:12:47] [INFO ] Deduced a trap composed of 141 places in 315 ms of which 6 ms to minimize.
[2024-05-23 05:12:47] [INFO ] Deduced a trap composed of 238 places in 404 ms of which 4 ms to minimize.
[2024-05-23 05:12:47] [INFO ] Deduced a trap composed of 219 places in 297 ms of which 4 ms to minimize.
[2024-05-23 05:12:48] [INFO ] Deduced a trap composed of 170 places in 297 ms of which 4 ms to minimize.
[2024-05-23 05:12:48] [INFO ] Deduced a trap composed of 118 places in 295 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 05:12:55] [INFO ] Deduced a trap composed of 151 places in 314 ms of which 4 ms to minimize.
[2024-05-23 05:12:55] [INFO ] Deduced a trap composed of 157 places in 314 ms of which 4 ms to minimize.
[2024-05-23 05:12:56] [INFO ] Deduced a trap composed of 171 places in 331 ms of which 3 ms to minimize.
[2024-05-23 05:12:56] [INFO ] Deduced a trap composed of 124 places in 307 ms of which 4 ms to minimize.
[2024-05-23 05:12:57] [INFO ] Deduced a trap composed of 202 places in 300 ms of which 3 ms to minimize.
[2024-05-23 05:12:57] [INFO ] Deduced a trap composed of 138 places in 308 ms of which 3 ms to minimize.
[2024-05-23 05:12:57] [INFO ] Deduced a trap composed of 146 places in 306 ms of which 3 ms to minimize.
[2024-05-23 05:12:58] [INFO ] Deduced a trap composed of 191 places in 294 ms of which 4 ms to minimize.
SMT process timed out in 60629ms, After SMT, problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60635ms
Starting structural reductions in LTL mode, iteration 1 : 363/380 places, 583/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63399 ms. Remains : 363/380 places, 583/840 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 263 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 95 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-05 finished in 63991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||G(!p1))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 566
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 566
Applied a total of 36 rules in 12 ms. Remains 362 /380 variables (removed 18) and now considering 566/840 (removed 274) transitions.
// Phase 1: matrix 566 rows 362 cols
[2024-05-23 05:12:58] [INFO ] Computed 21 invariants in 8 ms
[2024-05-23 05:12:59] [INFO ] Implicit Places using invariants in 615 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 616 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 566/840 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 633 ms. Remains : 361/380 places, 566/840 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-06 finished in 1252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 380 transition count 769
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 309 transition count 769
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 159 place count 292 transition count 512
Iterating global reduction 0 with 17 rules applied. Total rules applied 176 place count 292 transition count 512
Applied a total of 176 rules in 26 ms. Remains 292 /380 variables (removed 88) and now considering 512/840 (removed 328) transitions.
// Phase 1: matrix 512 rows 292 cols
[2024-05-23 05:13:00] [INFO ] Computed 21 invariants in 4 ms
[2024-05-23 05:13:00] [INFO ] Implicit Places using invariants in 550 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 552 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/380 places, 512/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 291 transition count 451
Reduce places removed 61 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 70 rules applied. Total rules applied 131 place count 230 transition count 442
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 140 place count 221 transition count 442
Applied a total of 140 rules in 13 ms. Remains 221 /291 variables (removed 70) and now considering 442/512 (removed 70) transitions.
// Phase 1: matrix 442 rows 221 cols
[2024-05-23 05:13:00] [INFO ] Computed 20 invariants in 4 ms
[2024-05-23 05:13:00] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-23 05:13:00] [INFO ] Invariant cache hit.
[2024-05-23 05:13:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:13:01] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 221/380 places, 442/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1779 ms. Remains : 221/380 places, 442/840 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 190 ms.
Stack based approach found an accepted trace after 90 steps with 0 reset with depth 91 and stack size 91 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-07 finished in 2018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
Support contains 7 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 161 place count 291 transition count 511
Iterating global reduction 0 with 17 rules applied. Total rules applied 178 place count 291 transition count 511
Applied a total of 178 rules in 21 ms. Remains 291 /380 variables (removed 89) and now considering 511/840 (removed 329) transitions.
// Phase 1: matrix 511 rows 291 cols
[2024-05-23 05:13:02] [INFO ] Computed 21 invariants in 4 ms
[2024-05-23 05:13:02] [INFO ] Implicit Places using invariants in 510 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 511 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/380 places, 511/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 290 transition count 432
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 211 transition count 432
Applied a total of 158 rules in 10 ms. Remains 211 /290 variables (removed 79) and now considering 432/511 (removed 79) transitions.
// Phase 1: matrix 432 rows 211 cols
[2024-05-23 05:13:02] [INFO ] Computed 20 invariants in 2 ms
[2024-05-23 05:13:02] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-23 05:13:02] [INFO ] Invariant cache hit.
[2024-05-23 05:13:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:13:03] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/380 places, 432/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1697 ms. Remains : 211/380 places, 432/840 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), true, (AND (NOT p0) (NOT p1)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 109 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/4 properties
BEST_FIRST walk for 7569 steps (0 resets) in 9 ms. (756 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 17 factoid took 219 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 211 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-05-23 05:13:04] [INFO ] Invariant cache hit.
[2024-05-23 05:13:05] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 05:13:05] [INFO ] Invariant cache hit.
[2024-05-23 05:13:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:13:06] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2024-05-23 05:13:06] [INFO ] Redundant transitions in 2 ms returned []
Running 423 sub problems to find dead transitions.
[2024-05-23 05:13:06] [INFO ] Invariant cache hit.
[2024-05-23 05:13:06] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:13:09] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 2 ms to minimize.
[2024-05-23 05:13:09] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 2 ms to minimize.
[2024-05-23 05:13:09] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:13:09] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 2 ms to minimize.
[2024-05-23 05:13:10] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:13:10] [INFO ] Deduced a trap composed of 72 places in 168 ms of which 3 ms to minimize.
[2024-05-23 05:13:10] [INFO ] Deduced a trap composed of 72 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:13:10] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-05-23 05:13:10] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 3 ms to minimize.
[2024-05-23 05:13:10] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 3 ms to minimize.
[2024-05-23 05:13:11] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 2 ms to minimize.
[2024-05-23 05:13:11] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:13:11] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 3 ms to minimize.
[2024-05-23 05:13:11] [INFO ] Deduced a trap composed of 90 places in 212 ms of which 2 ms to minimize.
[2024-05-23 05:13:11] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:13:12] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 3 ms to minimize.
[2024-05-23 05:13:12] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:13:12] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:13:12] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:13:12] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:13:13] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 3 ms to minimize.
[2024-05-23 05:13:14] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 2 ms to minimize.
[2024-05-23 05:13:14] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:13:14] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:13:14] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:13:15] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:13:15] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 3 ms to minimize.
[2024-05-23 05:13:15] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 3 ms to minimize.
[2024-05-23 05:13:15] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:13:15] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 2 ms to minimize.
[2024-05-23 05:13:16] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2024-05-23 05:13:16] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 2 ms to minimize.
[2024-05-23 05:13:16] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:13:16] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:13:16] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:13:16] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:13:17] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 3 ms to minimize.
[2024-05-23 05:13:17] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 2 ms to minimize.
[2024-05-23 05:13:17] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:13:17] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:13:20] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 3 ms to minimize.
[2024-05-23 05:13:21] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 2 ms to minimize.
[2024-05-23 05:13:22] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
[2024-05-23 05:13:22] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:13:23] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 2 ms to minimize.
[2024-05-23 05:13:23] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:13:23] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:13:24] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 2 ms to minimize.
[2024-05-23 05:13:24] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2024-05-23 05:13:24] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 3 ms to minimize.
[2024-05-23 05:13:24] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:13:24] [INFO ] Deduced a trap composed of 62 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:13:24] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 2 ms to minimize.
[2024-05-23 05:13:25] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 3 ms to minimize.
[2024-05-23 05:13:25] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 3 ms to minimize.
[2024-05-23 05:13:25] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:13:25] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:13:25] [INFO ] Deduced a trap composed of 68 places in 175 ms of which 2 ms to minimize.
[2024-05-23 05:13:25] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 3 ms to minimize.
[2024-05-23 05:13:26] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 3 ms to minimize.
[2024-05-23 05:13:26] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 3 ms to minimize.
[2024-05-23 05:13:26] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:13:26] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-05-23 05:13:26] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:13:27] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
[2024-05-23 05:13:28] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:13:28] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:13:28] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 3 ms to minimize.
[2024-05-23 05:13:28] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 2 ms to minimize.
[2024-05-23 05:13:28] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 3 ms to minimize.
[2024-05-23 05:13:29] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 2 ms to minimize.
[2024-05-23 05:13:29] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:13:30] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 2 ms to minimize.
[2024-05-23 05:13:30] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:13:30] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:13:30] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:13:30] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 3 ms to minimize.
[2024-05-23 05:13:31] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:13:31] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 3 ms to minimize.
[2024-05-23 05:13:31] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 2 ms to minimize.
[2024-05-23 05:13:32] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 3 ms to minimize.
[2024-05-23 05:13:32] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:13:32] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 2 ms to minimize.
[2024-05-23 05:13:32] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:13:36] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:13:36] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 2 ms to minimize.
SMT process timed out in 30344ms, After SMT, problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 30349ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31533 ms. Remains : 211/211 places, 432/432 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 338 ms. (117 steps per ms) remains 2/4 properties
BEST_FIRST walk for 10929 steps (1 resets) in 16 ms. (642 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 231 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 198 ms.
Built C files in :
/tmp/ltsmin574718384435554557
[2024-05-23 05:13:37] [INFO ] Computing symmetric may disable matrix : 432 transitions.
[2024-05-23 05:13:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:13:37] [INFO ] Computing symmetric may enable matrix : 432 transitions.
[2024-05-23 05:13:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:13:37] [INFO ] Computing Do-Not-Accords matrix : 432 transitions.
[2024-05-23 05:13:37] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:13:37] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin574718384435554557
Running compilation step : cd /tmp/ltsmin574718384435554557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2054 ms.
Running link step : cd /tmp/ltsmin574718384435554557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin574718384435554557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16296473132334850321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-05-23 05:13:52] [INFO ] Invariant cache hit.
[2024-05-23 05:13:53] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-23 05:13:53] [INFO ] Invariant cache hit.
[2024-05-23 05:13:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:13:53] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2024-05-23 05:13:53] [INFO ] Redundant transitions in 2 ms returned []
Running 423 sub problems to find dead transitions.
[2024-05-23 05:13:53] [INFO ] Invariant cache hit.
[2024-05-23 05:13:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:13:56] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 3 ms to minimize.
[2024-05-23 05:13:57] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 2 ms to minimize.
[2024-05-23 05:13:57] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 3 ms to minimize.
[2024-05-23 05:13:57] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 2 ms to minimize.
[2024-05-23 05:13:57] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:13:57] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 3 ms to minimize.
[2024-05-23 05:13:58] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 3 ms to minimize.
[2024-05-23 05:13:58] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:13:58] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 2 ms to minimize.
[2024-05-23 05:13:58] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 2 ms to minimize.
[2024-05-23 05:13:58] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 2 ms to minimize.
[2024-05-23 05:13:58] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
[2024-05-23 05:13:59] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 2 ms to minimize.
[2024-05-23 05:13:59] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:13:59] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 2 ms to minimize.
[2024-05-23 05:13:59] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2024-05-23 05:13:59] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 2 ms to minimize.
[2024-05-23 05:13:59] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:14:00] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 2 ms to minimize.
[2024-05-23 05:14:00] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:14:01] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2024-05-23 05:14:02] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:14:02] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 2 ms to minimize.
[2024-05-23 05:14:02] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:14:02] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 2 ms to minimize.
[2024-05-23 05:14:02] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 3 ms to minimize.
[2024-05-23 05:14:02] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
[2024-05-23 05:14:03] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 3 ms to minimize.
[2024-05-23 05:14:03] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:14:03] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 2 ms to minimize.
[2024-05-23 05:14:03] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 2 ms to minimize.
[2024-05-23 05:14:03] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 3 ms to minimize.
[2024-05-23 05:14:04] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:14:04] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:14:04] [INFO ] Deduced a trap composed of 68 places in 158 ms of which 2 ms to minimize.
[2024-05-23 05:14:04] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:14:04] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:14:04] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:14:05] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:14:05] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:14:08] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:14:09] [INFO ] Deduced a trap composed of 87 places in 176 ms of which 2 ms to minimize.
[2024-05-23 05:14:09] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:14:10] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:14:11] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 2 ms to minimize.
[2024-05-23 05:14:11] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 3 ms to minimize.
[2024-05-23 05:14:11] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 4 ms to minimize.
[2024-05-23 05:14:11] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 3 ms to minimize.
[2024-05-23 05:14:11] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-05-23 05:14:12] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:14:12] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 2 ms to minimize.
[2024-05-23 05:14:12] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:14:12] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 2 ms to minimize.
[2024-05-23 05:14:12] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 2 ms to minimize.
[2024-05-23 05:14:13] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 2 ms to minimize.
[2024-05-23 05:14:13] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 2 ms to minimize.
[2024-05-23 05:14:13] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-05-23 05:14:13] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:14:13] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 2 ms to minimize.
[2024-05-23 05:14:13] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 2 ms to minimize.
[2024-05-23 05:14:14] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:14:14] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 2 ms to minimize.
[2024-05-23 05:14:14] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-05-23 05:14:14] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:14:15] [INFO ] Deduced a trap composed of 75 places in 175 ms of which 3 ms to minimize.
[2024-05-23 05:14:15] [INFO ] Deduced a trap composed of 85 places in 174 ms of which 3 ms to minimize.
[2024-05-23 05:14:16] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 2 ms to minimize.
[2024-05-23 05:14:16] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 3 ms to minimize.
[2024-05-23 05:14:16] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 2 ms to minimize.
[2024-05-23 05:14:16] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 2 ms to minimize.
[2024-05-23 05:14:16] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2024-05-23 05:14:17] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 2 ms to minimize.
[2024-05-23 05:14:18] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 3 ms to minimize.
[2024-05-23 05:14:18] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 3 ms to minimize.
[2024-05-23 05:14:18] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 2 ms to minimize.
[2024-05-23 05:14:18] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 3 ms to minimize.
[2024-05-23 05:14:18] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 2 ms to minimize.
[2024-05-23 05:14:19] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 2 ms to minimize.
[2024-05-23 05:14:19] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 2 ms to minimize.
[2024-05-23 05:14:19] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 2 ms to minimize.
[2024-05-23 05:14:19] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 3 ms to minimize.
[2024-05-23 05:14:20] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 2 ms to minimize.
[2024-05-23 05:14:20] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2024-05-23 05:14:20] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-23 05:14:24] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
SMT process timed out in 30353ms, After SMT, problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 30362ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31456 ms. Remains : 211/211 places, 432/432 transitions.
Built C files in :
/tmp/ltsmin14302061589891889276
[2024-05-23 05:14:24] [INFO ] Computing symmetric may disable matrix : 432 transitions.
[2024-05-23 05:14:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:14:24] [INFO ] Computing symmetric may enable matrix : 432 transitions.
[2024-05-23 05:14:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:14:24] [INFO ] Computing Do-Not-Accords matrix : 432 transitions.
[2024-05-23 05:14:24] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:14:24] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14302061589891889276
Running compilation step : cd /tmp/ltsmin14302061589891889276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1885 ms.
Running link step : cd /tmp/ltsmin14302061589891889276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14302061589891889276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11991775453008183769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 05:14:39] [INFO ] Flatten gal took : 21 ms
[2024-05-23 05:14:39] [INFO ] Flatten gal took : 19 ms
[2024-05-23 05:14:39] [INFO ] Time to serialize gal into /tmp/LTL11210341296929887485.gal : 5 ms
[2024-05-23 05:14:39] [INFO ] Time to serialize properties into /tmp/LTL6659450835018263853.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11210341296929887485.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10860737174445123044.hoa' '-atoms' '/tmp/LTL6659450835018263853.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6659450835018263853.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10860737174445123044.hoa
Detected timeout of ITS tools.
[2024-05-23 05:14:54] [INFO ] Flatten gal took : 18 ms
[2024-05-23 05:14:54] [INFO ] Flatten gal took : 18 ms
[2024-05-23 05:14:54] [INFO ] Time to serialize gal into /tmp/LTL1511439103703754089.gal : 5 ms
[2024-05-23 05:14:54] [INFO ] Time to serialize properties into /tmp/LTL12598467035171912075.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1511439103703754089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12598467035171912075.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G(("((next_1!=1)||(ncs_2_6!=1))")||(F("((next_1!=1)||(ncs_0_3!=1))")))))&&((!("((next_11==1)&&(p1_6_8==1))"))U(("((!((next_12==1...249
Formula 0 simplified : G(F!"((next_1!=1)||(ncs_2_6!=1))" & FG!"((next_1!=1)||(ncs_0_3!=1))") | ("((next_11==1)&&(p1_6_8==1))" M !"((!((next_12==1)&&(p1_5_8...196
Detected timeout of ITS tools.
[2024-05-23 05:15:09] [INFO ] Flatten gal took : 18 ms
[2024-05-23 05:15:09] [INFO ] Applying decomposition
[2024-05-23 05:15:09] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6485656434921212656.txt' '-o' '/tmp/graph6485656434921212656.bin' '-w' '/tmp/graph6485656434921212656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6485656434921212656.bin' '-l' '-1' '-v' '-w' '/tmp/graph6485656434921212656.weights' '-q' '0' '-e' '0.001'
[2024-05-23 05:15:09] [INFO ] Decomposing Gal with order
[2024-05-23 05:15:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 05:15:09] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-23 05:15:09] [INFO ] Flatten gal took : 57 ms
[2024-05-23 05:15:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 25 ms.
[2024-05-23 05:15:09] [INFO ] Time to serialize gal into /tmp/LTL4213234838327075058.gal : 5 ms
[2024-05-23 05:15:09] [INFO ] Time to serialize properties into /tmp/LTL1795728811629970449.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4213234838327075058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1795728811629970449.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F(G(("((i2.u4.next_1!=1)||(i5.u50.ncs_2_6!=1))")||(F("((i2.u4.next_1!=1)||(i3.u12.ncs_0_3!=1))")))))&&((!("((i2.u8.next_11==1)&&(i...327
Formula 0 simplified : G(F!"((i2.u4.next_1!=1)||(i5.u50.ncs_2_6!=1))" & FG!"((i2.u4.next_1!=1)||(i3.u12.ncs_0_3!=1))") | ("((i2.u8.next_11==1)&&(i2.u28.p1_...261
Detected timeout of ITS tools.
Treatment of property Anderson-PT-09-LTLFireability-08 finished in 142905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 163 place count 289 transition count 477
Iterating global reduction 0 with 19 rules applied. Total rules applied 182 place count 289 transition count 477
Applied a total of 182 rules in 22 ms. Remains 289 /380 variables (removed 91) and now considering 477/840 (removed 363) transitions.
// Phase 1: matrix 477 rows 289 cols
[2024-05-23 05:15:24] [INFO ] Computed 21 invariants in 5 ms
[2024-05-23 05:15:25] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-23 05:15:25] [INFO ] Invariant cache hit.
[2024-05-23 05:15:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:15:26] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
[2024-05-23 05:15:26] [INFO ] Redundant transitions in 3 ms returned []
Running 468 sub problems to find dead transitions.
[2024-05-23 05:15:26] [INFO ] Invariant cache hit.
[2024-05-23 05:15:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-23 05:15:32] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 4 ms to minimize.
[2024-05-23 05:15:32] [INFO ] Deduced a trap composed of 130 places in 244 ms of which 3 ms to minimize.
[2024-05-23 05:15:32] [INFO ] Deduced a trap composed of 90 places in 263 ms of which 4 ms to minimize.
[2024-05-23 05:15:33] [INFO ] Deduced a trap composed of 91 places in 347 ms of which 5 ms to minimize.
[2024-05-23 05:15:33] [INFO ] Deduced a trap composed of 123 places in 251 ms of which 3 ms to minimize.
[2024-05-23 05:15:33] [INFO ] Deduced a trap composed of 127 places in 244 ms of which 4 ms to minimize.
[2024-05-23 05:15:34] [INFO ] Deduced a trap composed of 93 places in 346 ms of which 4 ms to minimize.
[2024-05-23 05:15:34] [INFO ] Deduced a trap composed of 71 places in 284 ms of which 4 ms to minimize.
[2024-05-23 05:15:34] [INFO ] Deduced a trap composed of 91 places in 246 ms of which 3 ms to minimize.
[2024-05-23 05:15:34] [INFO ] Deduced a trap composed of 99 places in 334 ms of which 5 ms to minimize.
[2024-05-23 05:15:35] [INFO ] Deduced a trap composed of 88 places in 302 ms of which 3 ms to minimize.
[2024-05-23 05:15:35] [INFO ] Deduced a trap composed of 100 places in 231 ms of which 4 ms to minimize.
[2024-05-23 05:15:35] [INFO ] Deduced a trap composed of 153 places in 252 ms of which 3 ms to minimize.
[2024-05-23 05:15:36] [INFO ] Deduced a trap composed of 152 places in 241 ms of which 3 ms to minimize.
[2024-05-23 05:15:36] [INFO ] Deduced a trap composed of 78 places in 331 ms of which 5 ms to minimize.
[2024-05-23 05:15:36] [INFO ] Deduced a trap composed of 111 places in 249 ms of which 3 ms to minimize.
[2024-05-23 05:15:37] [INFO ] Deduced a trap composed of 133 places in 251 ms of which 4 ms to minimize.
[2024-05-23 05:15:37] [INFO ] Deduced a trap composed of 144 places in 239 ms of which 3 ms to minimize.
[2024-05-23 05:15:37] [INFO ] Deduced a trap composed of 90 places in 250 ms of which 4 ms to minimize.
[2024-05-23 05:15:38] [INFO ] Deduced a trap composed of 135 places in 337 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-23 05:15:40] [INFO ] Deduced a trap composed of 111 places in 183 ms of which 3 ms to minimize.
[2024-05-23 05:15:41] [INFO ] Deduced a trap composed of 83 places in 249 ms of which 3 ms to minimize.
[2024-05-23 05:15:41] [INFO ] Deduced a trap composed of 116 places in 241 ms of which 3 ms to minimize.
[2024-05-23 05:15:41] [INFO ] Deduced a trap composed of 107 places in 255 ms of which 3 ms to minimize.
[2024-05-23 05:15:42] [INFO ] Deduced a trap composed of 93 places in 240 ms of which 3 ms to minimize.
[2024-05-23 05:15:42] [INFO ] Deduced a trap composed of 103 places in 228 ms of which 3 ms to minimize.
[2024-05-23 05:15:42] [INFO ] Deduced a trap composed of 149 places in 250 ms of which 3 ms to minimize.
[2024-05-23 05:15:42] [INFO ] Deduced a trap composed of 83 places in 247 ms of which 3 ms to minimize.
[2024-05-23 05:15:43] [INFO ] Deduced a trap composed of 87 places in 251 ms of which 3 ms to minimize.
[2024-05-23 05:15:43] [INFO ] Deduced a trap composed of 136 places in 356 ms of which 5 ms to minimize.
[2024-05-23 05:15:43] [INFO ] Deduced a trap composed of 82 places in 261 ms of which 3 ms to minimize.
[2024-05-23 05:15:44] [INFO ] Deduced a trap composed of 185 places in 253 ms of which 3 ms to minimize.
[2024-05-23 05:15:44] [INFO ] Deduced a trap composed of 102 places in 241 ms of which 3 ms to minimize.
[2024-05-23 05:15:44] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 3 ms to minimize.
[2024-05-23 05:15:44] [INFO ] Deduced a trap composed of 177 places in 246 ms of which 3 ms to minimize.
[2024-05-23 05:15:45] [INFO ] Deduced a trap composed of 176 places in 231 ms of which 3 ms to minimize.
[2024-05-23 05:15:45] [INFO ] Deduced a trap composed of 101 places in 246 ms of which 4 ms to minimize.
[2024-05-23 05:15:45] [INFO ] Deduced a trap composed of 170 places in 173 ms of which 3 ms to minimize.
[2024-05-23 05:15:45] [INFO ] Deduced a trap composed of 113 places in 253 ms of which 3 ms to minimize.
[2024-05-23 05:15:46] [INFO ] Deduced a trap composed of 174 places in 244 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-23 05:15:55] [INFO ] Deduced a trap composed of 158 places in 233 ms of which 4 ms to minimize.
[2024-05-23 05:15:56] [INFO ] Deduced a trap composed of 102 places in 231 ms of which 3 ms to minimize.
[2024-05-23 05:15:56] [INFO ] Deduced a trap composed of 157 places in 266 ms of which 4 ms to minimize.
[2024-05-23 05:15:56] [INFO ] Deduced a trap composed of 120 places in 328 ms of which 5 ms to minimize.
[2024-05-23 05:15:56] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 3 ms to minimize.
[2024-05-23 05:15:57] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 3 ms to minimize.
[2024-05-23 05:15:57] [INFO ] Deduced a trap composed of 124 places in 263 ms of which 4 ms to minimize.
SMT process timed out in 30566ms, After SMT, problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 30572ms
Starting structural reductions in SI_LTL mode, iteration 1 : 289/380 places, 477/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32503 ms. Remains : 289/380 places, 477/840 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-09
Product exploration explored 100000 steps with 36 reset in 256 ms.
Product exploration explored 100000 steps with 23 reset in 255 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13838 steps (3 resets) in 39 ms. (345 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 8 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2024-05-23 05:15:58] [INFO ] Invariant cache hit.
[2024-05-23 05:15:58] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-23 05:15:58] [INFO ] Invariant cache hit.
[2024-05-23 05:15:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:16:00] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2024-05-23 05:16:00] [INFO ] Redundant transitions in 3 ms returned []
Running 468 sub problems to find dead transitions.
[2024-05-23 05:16:00] [INFO ] Invariant cache hit.
[2024-05-23 05:16:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-23 05:16:05] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 3 ms to minimize.
[2024-05-23 05:16:05] [INFO ] Deduced a trap composed of 130 places in 236 ms of which 3 ms to minimize.
[2024-05-23 05:16:06] [INFO ] Deduced a trap composed of 90 places in 248 ms of which 3 ms to minimize.
[2024-05-23 05:16:06] [INFO ] Deduced a trap composed of 91 places in 203 ms of which 3 ms to minimize.
[2024-05-23 05:16:06] [INFO ] Deduced a trap composed of 123 places in 254 ms of which 3 ms to minimize.
[2024-05-23 05:16:07] [INFO ] Deduced a trap composed of 127 places in 241 ms of which 3 ms to minimize.
[2024-05-23 05:16:07] [INFO ] Deduced a trap composed of 93 places in 265 ms of which 4 ms to minimize.
[2024-05-23 05:16:07] [INFO ] Deduced a trap composed of 71 places in 341 ms of which 5 ms to minimize.
[2024-05-23 05:16:07] [INFO ] Deduced a trap composed of 91 places in 249 ms of which 4 ms to minimize.
[2024-05-23 05:16:08] [INFO ] Deduced a trap composed of 99 places in 244 ms of which 3 ms to minimize.
[2024-05-23 05:16:08] [INFO ] Deduced a trap composed of 88 places in 231 ms of which 3 ms to minimize.
[2024-05-23 05:16:08] [INFO ] Deduced a trap composed of 100 places in 237 ms of which 3 ms to minimize.
[2024-05-23 05:16:08] [INFO ] Deduced a trap composed of 153 places in 176 ms of which 3 ms to minimize.
[2024-05-23 05:16:09] [INFO ] Deduced a trap composed of 152 places in 240 ms of which 4 ms to minimize.
[2024-05-23 05:16:09] [INFO ] Deduced a trap composed of 78 places in 244 ms of which 3 ms to minimize.
[2024-05-23 05:16:09] [INFO ] Deduced a trap composed of 111 places in 248 ms of which 3 ms to minimize.
[2024-05-23 05:16:10] [INFO ] Deduced a trap composed of 133 places in 233 ms of which 4 ms to minimize.
[2024-05-23 05:16:10] [INFO ] Deduced a trap composed of 144 places in 240 ms of which 3 ms to minimize.
[2024-05-23 05:16:10] [INFO ] Deduced a trap composed of 90 places in 246 ms of which 3 ms to minimize.
[2024-05-23 05:16:10] [INFO ] Deduced a trap composed of 135 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-23 05:16:13] [INFO ] Deduced a trap composed of 111 places in 242 ms of which 4 ms to minimize.
[2024-05-23 05:16:14] [INFO ] Deduced a trap composed of 83 places in 267 ms of which 3 ms to minimize.
[2024-05-23 05:16:14] [INFO ] Deduced a trap composed of 116 places in 261 ms of which 3 ms to minimize.
[2024-05-23 05:16:14] [INFO ] Deduced a trap composed of 107 places in 253 ms of which 3 ms to minimize.
[2024-05-23 05:16:14] [INFO ] Deduced a trap composed of 93 places in 238 ms of which 4 ms to minimize.
[2024-05-23 05:16:15] [INFO ] Deduced a trap composed of 103 places in 241 ms of which 3 ms to minimize.
[2024-05-23 05:16:15] [INFO ] Deduced a trap composed of 149 places in 345 ms of which 5 ms to minimize.
[2024-05-23 05:16:15] [INFO ] Deduced a trap composed of 83 places in 303 ms of which 3 ms to minimize.
[2024-05-23 05:16:16] [INFO ] Deduced a trap composed of 87 places in 254 ms of which 3 ms to minimize.
[2024-05-23 05:16:16] [INFO ] Deduced a trap composed of 136 places in 347 ms of which 5 ms to minimize.
[2024-05-23 05:16:16] [INFO ] Deduced a trap composed of 82 places in 288 ms of which 3 ms to minimize.
[2024-05-23 05:16:17] [INFO ] Deduced a trap composed of 185 places in 247 ms of which 3 ms to minimize.
[2024-05-23 05:16:17] [INFO ] Deduced a trap composed of 102 places in 264 ms of which 4 ms to minimize.
[2024-05-23 05:16:17] [INFO ] Deduced a trap composed of 109 places in 315 ms of which 3 ms to minimize.
[2024-05-23 05:16:18] [INFO ] Deduced a trap composed of 177 places in 247 ms of which 3 ms to minimize.
[2024-05-23 05:16:18] [INFO ] Deduced a trap composed of 176 places in 296 ms of which 5 ms to minimize.
[2024-05-23 05:16:18] [INFO ] Deduced a trap composed of 101 places in 345 ms of which 3 ms to minimize.
[2024-05-23 05:16:19] [INFO ] Deduced a trap composed of 170 places in 252 ms of which 3 ms to minimize.
[2024-05-23 05:16:19] [INFO ] Deduced a trap composed of 113 places in 247 ms of which 4 ms to minimize.
[2024-05-23 05:16:19] [INFO ] Deduced a trap composed of 174 places in 245 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-23 05:16:29] [INFO ] Deduced a trap composed of 158 places in 238 ms of which 3 ms to minimize.
[2024-05-23 05:16:29] [INFO ] Deduced a trap composed of 102 places in 234 ms of which 4 ms to minimize.
[2024-05-23 05:16:29] [INFO ] Deduced a trap composed of 157 places in 239 ms of which 3 ms to minimize.
[2024-05-23 05:16:29] [INFO ] Deduced a trap composed of 120 places in 318 ms of which 4 ms to minimize.
[2024-05-23 05:16:30] [INFO ] Deduced a trap composed of 166 places in 290 ms of which 3 ms to minimize.
[2024-05-23 05:16:30] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-05-23 05:16:30] [INFO ] Deduced a trap composed of 124 places in 276 ms of which 5 ms to minimize.
[2024-05-23 05:16:31] [INFO ] Deduced a trap composed of 168 places in 331 ms of which 4 ms to minimize.
SMT process timed out in 30797ms, After SMT, problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 30803ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32688 ms. Remains : 289/289 places, 477/477 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17720 steps (3 resets) in 47 ms. (369 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18 reset in 208 ms.
Product exploration explored 100000 steps with 22 reset in 244 ms.
Built C files in :
/tmp/ltsmin6847747547620600527
[2024-05-23 05:16:32] [INFO ] Computing symmetric may disable matrix : 477 transitions.
[2024-05-23 05:16:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:16:32] [INFO ] Computing symmetric may enable matrix : 477 transitions.
[2024-05-23 05:16:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:16:32] [INFO ] Computing Do-Not-Accords matrix : 477 transitions.
[2024-05-23 05:16:32] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:16:32] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6847747547620600527
Running compilation step : cd /tmp/ltsmin6847747547620600527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2167 ms.
Running link step : cd /tmp/ltsmin6847747547620600527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6847747547620600527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16250006433585389115.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 9 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2024-05-23 05:16:47] [INFO ] Invariant cache hit.
[2024-05-23 05:16:47] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-23 05:16:47] [INFO ] Invariant cache hit.
[2024-05-23 05:16:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:16:49] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
[2024-05-23 05:16:49] [INFO ] Redundant transitions in 2 ms returned []
Running 468 sub problems to find dead transitions.
[2024-05-23 05:16:49] [INFO ] Invariant cache hit.
[2024-05-23 05:16:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-23 05:16:54] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 3 ms to minimize.
[2024-05-23 05:16:54] [INFO ] Deduced a trap composed of 130 places in 245 ms of which 3 ms to minimize.
[2024-05-23 05:16:54] [INFO ] Deduced a trap composed of 90 places in 246 ms of which 4 ms to minimize.
[2024-05-23 05:16:55] [INFO ] Deduced a trap composed of 91 places in 267 ms of which 5 ms to minimize.
[2024-05-23 05:16:55] [INFO ] Deduced a trap composed of 123 places in 289 ms of which 4 ms to minimize.
[2024-05-23 05:16:55] [INFO ] Deduced a trap composed of 127 places in 246 ms of which 3 ms to minimize.
[2024-05-23 05:16:56] [INFO ] Deduced a trap composed of 93 places in 258 ms of which 5 ms to minimize.
[2024-05-23 05:16:56] [INFO ] Deduced a trap composed of 71 places in 260 ms of which 4 ms to minimize.
[2024-05-23 05:16:56] [INFO ] Deduced a trap composed of 91 places in 264 ms of which 3 ms to minimize.
[2024-05-23 05:16:56] [INFO ] Deduced a trap composed of 99 places in 255 ms of which 3 ms to minimize.
[2024-05-23 05:16:57] [INFO ] Deduced a trap composed of 88 places in 254 ms of which 3 ms to minimize.
[2024-05-23 05:16:57] [INFO ] Deduced a trap composed of 100 places in 239 ms of which 3 ms to minimize.
[2024-05-23 05:16:57] [INFO ] Deduced a trap composed of 153 places in 237 ms of which 3 ms to minimize.
[2024-05-23 05:16:58] [INFO ] Deduced a trap composed of 152 places in 245 ms of which 3 ms to minimize.
[2024-05-23 05:16:58] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 3 ms to minimize.
[2024-05-23 05:16:58] [INFO ] Deduced a trap composed of 111 places in 240 ms of which 3 ms to minimize.
[2024-05-23 05:16:59] [INFO ] Deduced a trap composed of 133 places in 248 ms of which 3 ms to minimize.
[2024-05-23 05:16:59] [INFO ] Deduced a trap composed of 144 places in 224 ms of which 3 ms to minimize.
[2024-05-23 05:16:59] [INFO ] Deduced a trap composed of 90 places in 243 ms of which 3 ms to minimize.
[2024-05-23 05:16:59] [INFO ] Deduced a trap composed of 135 places in 246 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-23 05:17:02] [INFO ] Deduced a trap composed of 111 places in 278 ms of which 3 ms to minimize.
[2024-05-23 05:17:03] [INFO ] Deduced a trap composed of 83 places in 241 ms of which 3 ms to minimize.
[2024-05-23 05:17:03] [INFO ] Deduced a trap composed of 116 places in 179 ms of which 3 ms to minimize.
[2024-05-23 05:17:03] [INFO ] Deduced a trap composed of 107 places in 246 ms of which 3 ms to minimize.
[2024-05-23 05:17:03] [INFO ] Deduced a trap composed of 93 places in 253 ms of which 3 ms to minimize.
[2024-05-23 05:17:04] [INFO ] Deduced a trap composed of 103 places in 248 ms of which 4 ms to minimize.
[2024-05-23 05:17:04] [INFO ] Deduced a trap composed of 149 places in 292 ms of which 5 ms to minimize.
[2024-05-23 05:17:04] [INFO ] Deduced a trap composed of 83 places in 318 ms of which 3 ms to minimize.
[2024-05-23 05:17:05] [INFO ] Deduced a trap composed of 87 places in 250 ms of which 3 ms to minimize.
[2024-05-23 05:17:05] [INFO ] Deduced a trap composed of 136 places in 270 ms of which 4 ms to minimize.
[2024-05-23 05:17:05] [INFO ] Deduced a trap composed of 82 places in 242 ms of which 3 ms to minimize.
[2024-05-23 05:17:05] [INFO ] Deduced a trap composed of 185 places in 242 ms of which 3 ms to minimize.
[2024-05-23 05:17:06] [INFO ] Deduced a trap composed of 102 places in 264 ms of which 3 ms to minimize.
[2024-05-23 05:17:06] [INFO ] Deduced a trap composed of 109 places in 373 ms of which 4 ms to minimize.
[2024-05-23 05:17:06] [INFO ] Deduced a trap composed of 177 places in 253 ms of which 4 ms to minimize.
[2024-05-23 05:17:07] [INFO ] Deduced a trap composed of 176 places in 254 ms of which 3 ms to minimize.
[2024-05-23 05:17:07] [INFO ] Deduced a trap composed of 101 places in 341 ms of which 5 ms to minimize.
[2024-05-23 05:17:07] [INFO ] Deduced a trap composed of 170 places in 259 ms of which 3 ms to minimize.
[2024-05-23 05:17:08] [INFO ] Deduced a trap composed of 113 places in 244 ms of which 3 ms to minimize.
[2024-05-23 05:17:08] [INFO ] Deduced a trap composed of 174 places in 248 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-23 05:17:18] [INFO ] Deduced a trap composed of 158 places in 294 ms of which 5 ms to minimize.
[2024-05-23 05:17:18] [INFO ] Deduced a trap composed of 102 places in 329 ms of which 4 ms to minimize.
[2024-05-23 05:17:18] [INFO ] Deduced a trap composed of 157 places in 251 ms of which 3 ms to minimize.
[2024-05-23 05:17:19] [INFO ] Deduced a trap composed of 120 places in 232 ms of which 3 ms to minimize.
[2024-05-23 05:17:19] [INFO ] Deduced a trap composed of 166 places in 322 ms of which 4 ms to minimize.
[2024-05-23 05:17:19] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
SMT process timed out in 30628ms, After SMT, problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 30633ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32481 ms. Remains : 289/289 places, 477/477 transitions.
Built C files in :
/tmp/ltsmin14349108643035923099
[2024-05-23 05:17:19] [INFO ] Computing symmetric may disable matrix : 477 transitions.
[2024-05-23 05:17:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:17:19] [INFO ] Computing symmetric may enable matrix : 477 transitions.
[2024-05-23 05:17:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:17:19] [INFO ] Computing Do-Not-Accords matrix : 477 transitions.
[2024-05-23 05:17:19] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:17:19] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14349108643035923099
Running compilation step : cd /tmp/ltsmin14349108643035923099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2225 ms.
Running link step : cd /tmp/ltsmin14349108643035923099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14349108643035923099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11594274455061762004.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 05:17:34] [INFO ] Flatten gal took : 20 ms
[2024-05-23 05:17:34] [INFO ] Flatten gal took : 17 ms
[2024-05-23 05:17:34] [INFO ] Time to serialize gal into /tmp/LTL8543282738228010837.gal : 4 ms
[2024-05-23 05:17:34] [INFO ] Time to serialize properties into /tmp/LTL11480026976556469338.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8543282738228010837.gal' '-t' 'CGAL' '-hoa' '/tmp/aut894973037970139260.hoa' '-atoms' '/tmp/LTL11480026976556469338.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL11480026976556469338.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut894973037970139260.hoa
Detected timeout of ITS tools.
[2024-05-23 05:17:49] [INFO ] Flatten gal took : 15 ms
[2024-05-23 05:17:49] [INFO ] Flatten gal took : 14 ms
[2024-05-23 05:17:49] [INFO ] Time to serialize gal into /tmp/LTL11680420242155971355.gal : 4 ms
[2024-05-23 05:17:49] [INFO ] Time to serialize properties into /tmp/LTL9819492150428387722.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11680420242155971355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9819492150428387722.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((slot_F.F.F.F.F.F.F.F.F==0)||(cs_6_8==0))"))))
Formula 0 simplified : FG!"((slot_F.F.F.F.F.F.F.F.F==0)||(cs_6_8==0))"
Detected timeout of ITS tools.
[2024-05-23 05:18:05] [INFO ] Flatten gal took : 14 ms
[2024-05-23 05:18:05] [INFO ] Applying decomposition
[2024-05-23 05:18:05] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4426265143254668587.txt' '-o' '/tmp/graph4426265143254668587.bin' '-w' '/tmp/graph4426265143254668587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4426265143254668587.bin' '-l' '-1' '-v' '-w' '/tmp/graph4426265143254668587.weights' '-q' '0' '-e' '0.001'
[2024-05-23 05:18:05] [INFO ] Decomposing Gal with order
[2024-05-23 05:18:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 05:18:05] [INFO ] Removed a total of 792 redundant transitions.
[2024-05-23 05:18:05] [INFO ] Flatten gal took : 64 ms
[2024-05-23 05:18:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 18 ms.
[2024-05-23 05:18:05] [INFO ] Time to serialize gal into /tmp/LTL1868446640769280150.gal : 6 ms
[2024-05-23 05:18:05] [INFO ] Time to serialize properties into /tmp/LTL2321361676475380485.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1868446640769280150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2321361676475380485.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u0.slot_F.F.F.F.F.F.F.F.F==0)||(i0.u0.cs_6_8==0))"))))
Formula 0 simplified : FG!"((i0.u0.slot_F.F.F.F.F.F.F.F.F==0)||(i0.u0.cs_6_8==0))"
Detected timeout of ITS tools.
Treatment of property Anderson-PT-09-LTLFireability-09 finished in 175413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X(X(X(!p1))))||G(!p1)))))'
Support contains 6 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 364 transition count 600
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 364 transition count 600
Applied a total of 32 rules in 11 ms. Remains 364 /380 variables (removed 16) and now considering 600/840 (removed 240) transitions.
// Phase 1: matrix 600 rows 364 cols
[2024-05-23 05:18:20] [INFO ] Computed 21 invariants in 5 ms
[2024-05-23 05:18:20] [INFO ] Implicit Places using invariants in 601 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 602 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/380 places, 600/840 transitions.
Applied a total of 0 rules in 5 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 618 ms. Remains : 363/380 places, 600/840 transitions.
Stuttering acceptance computed with spot in 396 ms :[p1, p1, p1, p1, p1, p1, p1, p1, p1]
Running random walk in product with property : Anderson-PT-09-LTLFireability-10
Product exploration explored 100000 steps with 14 reset in 280 ms.
Product exploration explored 100000 steps with 13 reset in 211 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 148 ms. Reduced automaton from 9 states, 27 edges and 2 AP (stutter sensitive) to 9 states, 27 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 464 ms :[p1, p1, p1, p1, p1, p1, p1, p1, p1]
RANDOM walk for 40000 steps (8 resets) in 203 ms. (196 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 1/3 properties
// Phase 1: matrix 600 rows 363 cols
[2024-05-23 05:18:22] [INFO ] Computed 20 invariants in 4 ms
[2024-05-23 05:18:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/355 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 363/963 variables, and 20 constraints, problems are : Problem set: 1 solved, 0 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 14 factoid took 459 ms. Reduced automaton from 9 states, 27 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 298 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Applied a total of 0 rules in 4 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-05-23 05:18:23] [INFO ] Invariant cache hit.
[2024-05-23 05:18:24] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-23 05:18:24] [INFO ] Invariant cache hit.
[2024-05-23 05:18:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:18:26] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-23 05:18:26] [INFO ] Invariant cache hit.
[2024-05-23 05:18:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 05:18:32] [INFO ] Deduced a trap composed of 188 places in 290 ms of which 3 ms to minimize.
[2024-05-23 05:18:33] [INFO ] Deduced a trap composed of 133 places in 300 ms of which 4 ms to minimize.
[2024-05-23 05:18:34] [INFO ] Deduced a trap composed of 99 places in 289 ms of which 4 ms to minimize.
[2024-05-23 05:18:34] [INFO ] Deduced a trap composed of 236 places in 310 ms of which 4 ms to minimize.
[2024-05-23 05:18:35] [INFO ] Deduced a trap composed of 156 places in 302 ms of which 4 ms to minimize.
[2024-05-23 05:18:37] [INFO ] Deduced a trap composed of 89 places in 304 ms of which 4 ms to minimize.
[2024-05-23 05:18:38] [INFO ] Deduced a trap composed of 108 places in 314 ms of which 4 ms to minimize.
[2024-05-23 05:18:38] [INFO ] Deduced a trap composed of 102 places in 299 ms of which 4 ms to minimize.
[2024-05-23 05:18:38] [INFO ] Deduced a trap composed of 106 places in 301 ms of which 3 ms to minimize.
[2024-05-23 05:18:39] [INFO ] Deduced a trap composed of 167 places in 300 ms of which 4 ms to minimize.
[2024-05-23 05:18:39] [INFO ] Deduced a trap composed of 145 places in 402 ms of which 5 ms to minimize.
[2024-05-23 05:18:39] [INFO ] Deduced a trap composed of 176 places in 338 ms of which 4 ms to minimize.
[2024-05-23 05:18:40] [INFO ] Deduced a trap composed of 94 places in 318 ms of which 4 ms to minimize.
[2024-05-23 05:18:40] [INFO ] Deduced a trap composed of 136 places in 296 ms of which 4 ms to minimize.
[2024-05-23 05:18:41] [INFO ] Deduced a trap composed of 155 places in 393 ms of which 6 ms to minimize.
[2024-05-23 05:18:41] [INFO ] Deduced a trap composed of 169 places in 339 ms of which 4 ms to minimize.
[2024-05-23 05:18:41] [INFO ] Deduced a trap composed of 104 places in 307 ms of which 6 ms to minimize.
[2024-05-23 05:18:42] [INFO ] Deduced a trap composed of 102 places in 408 ms of which 5 ms to minimize.
[2024-05-23 05:18:42] [INFO ] Deduced a trap composed of 174 places in 307 ms of which 4 ms to minimize.
[2024-05-23 05:18:42] [INFO ] Deduced a trap composed of 94 places in 313 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 05:18:44] [INFO ] Deduced a trap composed of 218 places in 295 ms of which 3 ms to minimize.
[2024-05-23 05:18:45] [INFO ] Deduced a trap composed of 161 places in 290 ms of which 4 ms to minimize.
[2024-05-23 05:18:45] [INFO ] Deduced a trap composed of 96 places in 297 ms of which 4 ms to minimize.
[2024-05-23 05:18:46] [INFO ] Deduced a trap composed of 158 places in 299 ms of which 4 ms to minimize.
[2024-05-23 05:18:46] [INFO ] Deduced a trap composed of 135 places in 280 ms of which 4 ms to minimize.
[2024-05-23 05:18:47] [INFO ] Deduced a trap composed of 97 places in 310 ms of which 4 ms to minimize.
[2024-05-23 05:18:47] [INFO ] Deduced a trap composed of 190 places in 327 ms of which 6 ms to minimize.
[2024-05-23 05:18:48] [INFO ] Deduced a trap composed of 62 places in 393 ms of which 4 ms to minimize.
[2024-05-23 05:18:48] [INFO ] Deduced a trap composed of 180 places in 305 ms of which 3 ms to minimize.
[2024-05-23 05:18:48] [INFO ] Deduced a trap composed of 128 places in 301 ms of which 3 ms to minimize.
[2024-05-23 05:18:49] [INFO ] Deduced a trap composed of 195 places in 303 ms of which 4 ms to minimize.
[2024-05-23 05:18:49] [INFO ] Deduced a trap composed of 182 places in 300 ms of which 3 ms to minimize.
[2024-05-23 05:18:50] [INFO ] Deduced a trap composed of 159 places in 384 ms of which 6 ms to minimize.
[2024-05-23 05:18:50] [INFO ] Deduced a trap composed of 171 places in 341 ms of which 4 ms to minimize.
[2024-05-23 05:18:50] [INFO ] Deduced a trap composed of 163 places in 300 ms of which 5 ms to minimize.
[2024-05-23 05:18:51] [INFO ] Deduced a trap composed of 131 places in 416 ms of which 5 ms to minimize.
[2024-05-23 05:18:51] [INFO ] Deduced a trap composed of 216 places in 255 ms of which 3 ms to minimize.
[2024-05-23 05:18:51] [INFO ] Deduced a trap composed of 167 places in 328 ms of which 4 ms to minimize.
[2024-05-23 05:18:52] [INFO ] Deduced a trap composed of 179 places in 289 ms of which 4 ms to minimize.
[2024-05-23 05:18:52] [INFO ] Deduced a trap composed of 145 places in 303 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/963 variables, and 60 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 05:19:00] [INFO ] Deduced a trap composed of 177 places in 303 ms of which 4 ms to minimize.
[2024-05-23 05:19:00] [INFO ] Deduced a trap composed of 127 places in 308 ms of which 4 ms to minimize.
[2024-05-23 05:19:01] [INFO ] Deduced a trap composed of 173 places in 284 ms of which 4 ms to minimize.
[2024-05-23 05:19:01] [INFO ] Deduced a trap composed of 100 places in 298 ms of which 3 ms to minimize.
[2024-05-23 05:19:01] [INFO ] Deduced a trap composed of 94 places in 284 ms of which 3 ms to minimize.
[2024-05-23 05:19:02] [INFO ] Deduced a trap composed of 138 places in 275 ms of which 3 ms to minimize.
[2024-05-23 05:19:03] [INFO ] Deduced a trap composed of 153 places in 213 ms of which 4 ms to minimize.
[2024-05-23 05:19:03] [INFO ] Deduced a trap composed of 234 places in 300 ms of which 4 ms to minimize.
[2024-05-23 05:19:04] [INFO ] Deduced a trap composed of 138 places in 299 ms of which 4 ms to minimize.
[2024-05-23 05:19:04] [INFO ] Deduced a trap composed of 167 places in 421 ms of which 4 ms to minimize.
[2024-05-23 05:19:05] [INFO ] Deduced a trap composed of 148 places in 304 ms of which 4 ms to minimize.
[2024-05-23 05:19:05] [INFO ] Deduced a trap composed of 150 places in 281 ms of which 4 ms to minimize.
[2024-05-23 05:19:05] [INFO ] Deduced a trap composed of 148 places in 301 ms of which 3 ms to minimize.
[2024-05-23 05:19:05] [INFO ] Deduced a trap composed of 170 places in 301 ms of which 4 ms to minimize.
[2024-05-23 05:19:06] [INFO ] Deduced a trap composed of 99 places in 304 ms of which 4 ms to minimize.
[2024-05-23 05:19:06] [INFO ] Deduced a trap composed of 136 places in 345 ms of which 4 ms to minimize.
[2024-05-23 05:19:07] [INFO ] Deduced a trap composed of 111 places in 288 ms of which 4 ms to minimize.
[2024-05-23 05:19:07] [INFO ] Deduced a trap composed of 159 places in 324 ms of which 5 ms to minimize.
[2024-05-23 05:19:07] [INFO ] Deduced a trap composed of 125 places in 359 ms of which 4 ms to minimize.
[2024-05-23 05:19:08] [INFO ] Deduced a trap composed of 133 places in 298 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 05:19:11] [INFO ] Deduced a trap composed of 173 places in 322 ms of which 4 ms to minimize.
[2024-05-23 05:19:11] [INFO ] Deduced a trap composed of 154 places in 305 ms of which 6 ms to minimize.
[2024-05-23 05:19:12] [INFO ] Deduced a trap composed of 133 places in 394 ms of which 5 ms to minimize.
[2024-05-23 05:19:12] [INFO ] Deduced a trap composed of 151 places in 238 ms of which 3 ms to minimize.
[2024-05-23 05:19:12] [INFO ] Deduced a trap composed of 170 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:19:12] [INFO ] Deduced a trap composed of 145 places in 287 ms of which 3 ms to minimize.
[2024-05-23 05:19:13] [INFO ] Deduced a trap composed of 171 places in 281 ms of which 4 ms to minimize.
[2024-05-23 05:19:13] [INFO ] Deduced a trap composed of 156 places in 311 ms of which 3 ms to minimize.
[2024-05-23 05:19:13] [INFO ] Deduced a trap composed of 160 places in 306 ms of which 4 ms to minimize.
[2024-05-23 05:19:14] [INFO ] Deduced a trap composed of 156 places in 322 ms of which 4 ms to minimize.
[2024-05-23 05:19:14] [INFO ] Deduced a trap composed of 193 places in 300 ms of which 4 ms to minimize.
[2024-05-23 05:19:15] [INFO ] Deduced a trap composed of 145 places in 412 ms of which 6 ms to minimize.
[2024-05-23 05:19:15] [INFO ] Deduced a trap composed of 141 places in 341 ms of which 4 ms to minimize.
[2024-05-23 05:19:15] [INFO ] Deduced a trap composed of 172 places in 296 ms of which 3 ms to minimize.
[2024-05-23 05:19:16] [INFO ] Deduced a trap composed of 142 places in 299 ms of which 4 ms to minimize.
[2024-05-23 05:19:16] [INFO ] Deduced a trap composed of 163 places in 301 ms of which 3 ms to minimize.
[2024-05-23 05:19:16] [INFO ] Deduced a trap composed of 126 places in 286 ms of which 4 ms to minimize.
[2024-05-23 05:19:17] [INFO ] Deduced a trap composed of 175 places in 388 ms of which 5 ms to minimize.
[2024-05-23 05:19:17] [INFO ] Deduced a trap composed of 165 places in 354 ms of which 4 ms to minimize.
[2024-05-23 05:19:17] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/963 variables, and 100 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 80/80 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Finished structural reductions in LTL mode , in 1 iterations and 62782 ms. Remains : 363/363 places, 600/600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
RANDOM walk for 40000 steps (8 resets) in 262 ms. (152 steps per ms) remains 1/2 properties
BEST_FIRST walk for 38653 steps (8 resets) in 36 ms. (1044 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 295 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 295 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 10 reset in 145 ms.
Product exploration explored 100000 steps with 5 reset in 195 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, false]
Stuttering acceptance computed with spot in 288 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 363 transition count 600
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 78 place count 363 transition count 600
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 150 place count 363 transition count 600
Deduced a syphon composed of 150 places in 0 ms
Applied a total of 150 rules in 30 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-05-23 05:19:29] [INFO ] Redundant transitions in 4 ms returned []
Running 591 sub problems to find dead transitions.
// Phase 1: matrix 600 rows 363 cols
[2024-05-23 05:19:29] [INFO ] Computed 20 invariants in 4 ms
[2024-05-23 05:19:29] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 05:19:35] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-23 05:19:35] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-23 05:19:35] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-23 05:19:35] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-23 05:19:35] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 5 ms to minimize.
[2024-05-23 05:19:35] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-23 05:19:36] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-23 05:19:36] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 3 ms to minimize.
[2024-05-23 05:19:36] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 3 ms to minimize.
[2024-05-23 05:19:36] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 3 ms to minimize.
[2024-05-23 05:19:37] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 4 ms to minimize.
[2024-05-23 05:19:38] [INFO ] Deduced a trap composed of 86 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:19:39] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 4 ms to minimize.
[2024-05-23 05:19:39] [INFO ] Deduced a trap composed of 73 places in 290 ms of which 7 ms to minimize.
[2024-05-23 05:19:39] [INFO ] Deduced a trap composed of 59 places in 296 ms of which 4 ms to minimize.
[2024-05-23 05:19:40] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:19:40] [INFO ] Deduced a trap composed of 55 places in 264 ms of which 4 ms to minimize.
[2024-05-23 05:19:40] [INFO ] Deduced a trap composed of 78 places in 258 ms of which 4 ms to minimize.
[2024-05-23 05:19:41] [INFO ] Deduced a trap composed of 90 places in 291 ms of which 6 ms to minimize.
[2024-05-23 05:19:41] [INFO ] Deduced a trap composed of 81 places in 406 ms of which 5 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 20/40 constraints. Problems are: Problem set: 150 solved, 441 unsolved
[2024-05-23 05:19:43] [INFO ] Deduced a trap composed of 52 places in 277 ms of which 4 ms to minimize.
[2024-05-23 05:19:43] [INFO ] Deduced a trap composed of 78 places in 280 ms of which 4 ms to minimize.
[2024-05-23 05:19:44] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:19:45] [INFO ] Deduced a trap composed of 87 places in 297 ms of which 4 ms to minimize.
[2024-05-23 05:19:45] [INFO ] Deduced a trap composed of 84 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:19:46] [INFO ] Deduced a trap composed of 73 places in 303 ms of which 4 ms to minimize.
[2024-05-23 05:19:46] [INFO ] Deduced a trap composed of 81 places in 306 ms of which 4 ms to minimize.
[2024-05-23 05:19:46] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 3 ms to minimize.
[2024-05-23 05:19:47] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 3 ms to minimize.
[2024-05-23 05:19:47] [INFO ] Deduced a trap composed of 61 places in 289 ms of which 4 ms to minimize.
[2024-05-23 05:19:47] [INFO ] Deduced a trap composed of 82 places in 285 ms of which 3 ms to minimize.
[2024-05-23 05:19:48] [INFO ] Deduced a trap composed of 67 places in 405 ms of which 6 ms to minimize.
[2024-05-23 05:19:48] [INFO ] Deduced a trap composed of 70 places in 332 ms of which 4 ms to minimize.
[2024-05-23 05:19:48] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 6 ms to minimize.
[2024-05-23 05:19:49] [INFO ] Deduced a trap composed of 65 places in 421 ms of which 6 ms to minimize.
[2024-05-23 05:19:49] [INFO ] Deduced a trap composed of 66 places in 313 ms of which 4 ms to minimize.
[2024-05-23 05:19:49] [INFO ] Deduced a trap composed of 58 places in 332 ms of which 6 ms to minimize.
[2024-05-23 05:19:50] [INFO ] Deduced a trap composed of 66 places in 395 ms of which 4 ms to minimize.
[2024-05-23 05:19:50] [INFO ] Deduced a trap composed of 80 places in 279 ms of which 4 ms to minimize.
[2024-05-23 05:19:50] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/60 constraints. Problems are: Problem set: 150 solved, 441 unsolved
[2024-05-23 05:19:56] [INFO ] Deduced a trap composed of 76 places in 281 ms of which 4 ms to minimize.
[2024-05-23 05:19:57] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 5 ms to minimize.
[2024-05-23 05:19:57] [INFO ] Deduced a trap composed of 99 places in 234 ms of which 3 ms to minimize.
[2024-05-23 05:19:57] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 3 ms to minimize.
[2024-05-23 05:19:58] [INFO ] Deduced a trap composed of 60 places in 302 ms of which 4 ms to minimize.
[2024-05-23 05:19:58] [INFO ] Deduced a trap composed of 81 places in 294 ms of which 4 ms to minimize.
[2024-05-23 05:19:59] [INFO ] Deduced a trap composed of 65 places in 302 ms of which 4 ms to minimize.
[2024-05-23 05:19:59] [INFO ] Deduced a trap composed of 75 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:19:59] [INFO ] Deduced a trap composed of 87 places in 289 ms of which 3 ms to minimize.
SMT process timed out in 30506ms, After SMT, problems are : Problem set: 150 solved, 441 unsolved
Search for dead transitions found 150 dead transitions in 30514ms
Found 150 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 150 transitions
Dead transitions reduction (with SMT) removed 150 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 363/363 places, 450/600 transitions.
Graph (complete) has 1169 edges and 363 vertex of which 213 are kept as prefixes of interest. Removing 150 places using SCC suffix rule.3 ms
Discarding 150 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 213 /363 variables (removed 150) and now considering 450/450 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 213/363 places, 450/600 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30570 ms. Remains : 213/363 places, 450/600 transitions.
Built C files in :
/tmp/ltsmin14711018114256050853
[2024-05-23 05:19:59] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14711018114256050853
Running compilation step : cd /tmp/ltsmin14711018114256050853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1866 ms.
Running link step : cd /tmp/ltsmin14711018114256050853;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14711018114256050853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13288421526883607942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Applied a total of 0 rules in 11 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 363 cols
[2024-05-23 05:20:15] [INFO ] Computed 20 invariants in 4 ms
[2024-05-23 05:20:15] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-23 05:20:15] [INFO ] Invariant cache hit.
[2024-05-23 05:20:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:20:17] [INFO ] Implicit Places using invariants and state equation in 2093 ms returned []
Implicit Place search using SMT with State Equation took 2532 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-23 05:20:17] [INFO ] Invariant cache hit.
[2024-05-23 05:20:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 05:20:24] [INFO ] Deduced a trap composed of 188 places in 317 ms of which 3 ms to minimize.
[2024-05-23 05:20:25] [INFO ] Deduced a trap composed of 133 places in 318 ms of which 4 ms to minimize.
[2024-05-23 05:20:25] [INFO ] Deduced a trap composed of 99 places in 312 ms of which 3 ms to minimize.
[2024-05-23 05:20:26] [INFO ] Deduced a trap composed of 236 places in 306 ms of which 4 ms to minimize.
[2024-05-23 05:20:27] [INFO ] Deduced a trap composed of 156 places in 304 ms of which 3 ms to minimize.
[2024-05-23 05:20:29] [INFO ] Deduced a trap composed of 89 places in 305 ms of which 4 ms to minimize.
[2024-05-23 05:20:29] [INFO ] Deduced a trap composed of 108 places in 305 ms of which 4 ms to minimize.
[2024-05-23 05:20:30] [INFO ] Deduced a trap composed of 102 places in 305 ms of which 3 ms to minimize.
[2024-05-23 05:20:30] [INFO ] Deduced a trap composed of 106 places in 305 ms of which 4 ms to minimize.
[2024-05-23 05:20:30] [INFO ] Deduced a trap composed of 167 places in 321 ms of which 3 ms to minimize.
[2024-05-23 05:20:31] [INFO ] Deduced a trap composed of 145 places in 332 ms of which 5 ms to minimize.
[2024-05-23 05:20:31] [INFO ] Deduced a trap composed of 176 places in 407 ms of which 4 ms to minimize.
[2024-05-23 05:20:32] [INFO ] Deduced a trap composed of 94 places in 312 ms of which 3 ms to minimize.
[2024-05-23 05:20:32] [INFO ] Deduced a trap composed of 136 places in 247 ms of which 3 ms to minimize.
[2024-05-23 05:20:32] [INFO ] Deduced a trap composed of 155 places in 304 ms of which 4 ms to minimize.
[2024-05-23 05:20:32] [INFO ] Deduced a trap composed of 169 places in 305 ms of which 4 ms to minimize.
[2024-05-23 05:20:33] [INFO ] Deduced a trap composed of 104 places in 286 ms of which 3 ms to minimize.
[2024-05-23 05:20:33] [INFO ] Deduced a trap composed of 102 places in 320 ms of which 3 ms to minimize.
[2024-05-23 05:20:33] [INFO ] Deduced a trap composed of 174 places in 317 ms of which 4 ms to minimize.
[2024-05-23 05:20:34] [INFO ] Deduced a trap composed of 94 places in 343 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 05:20:36] [INFO ] Deduced a trap composed of 218 places in 302 ms of which 4 ms to minimize.
[2024-05-23 05:20:36] [INFO ] Deduced a trap composed of 161 places in 298 ms of which 3 ms to minimize.
[2024-05-23 05:20:37] [INFO ] Deduced a trap composed of 96 places in 312 ms of which 4 ms to minimize.
[2024-05-23 05:20:37] [INFO ] Deduced a trap composed of 158 places in 317 ms of which 4 ms to minimize.
[2024-05-23 05:20:38] [INFO ] Deduced a trap composed of 135 places in 292 ms of which 3 ms to minimize.
[2024-05-23 05:20:39] [INFO ] Deduced a trap composed of 97 places in 304 ms of which 3 ms to minimize.
[2024-05-23 05:20:39] [INFO ] Deduced a trap composed of 190 places in 256 ms of which 3 ms to minimize.
[2024-05-23 05:20:39] [INFO ] Deduced a trap composed of 62 places in 312 ms of which 4 ms to minimize.
[2024-05-23 05:20:40] [INFO ] Deduced a trap composed of 180 places in 334 ms of which 4 ms to minimize.
[2024-05-23 05:20:40] [INFO ] Deduced a trap composed of 128 places in 327 ms of which 4 ms to minimize.
[2024-05-23 05:20:40] [INFO ] Deduced a trap composed of 195 places in 329 ms of which 4 ms to minimize.
[2024-05-23 05:20:41] [INFO ] Deduced a trap composed of 182 places in 318 ms of which 5 ms to minimize.
[2024-05-23 05:20:41] [INFO ] Deduced a trap composed of 159 places in 417 ms of which 4 ms to minimize.
[2024-05-23 05:20:41] [INFO ] Deduced a trap composed of 171 places in 315 ms of which 4 ms to minimize.
[2024-05-23 05:20:42] [INFO ] Deduced a trap composed of 163 places in 333 ms of which 4 ms to minimize.
[2024-05-23 05:20:42] [INFO ] Deduced a trap composed of 131 places in 321 ms of which 4 ms to minimize.
[2024-05-23 05:20:42] [INFO ] Deduced a trap composed of 216 places in 310 ms of which 3 ms to minimize.
[2024-05-23 05:20:43] [INFO ] Deduced a trap composed of 167 places in 316 ms of which 4 ms to minimize.
[2024-05-23 05:20:43] [INFO ] Deduced a trap composed of 179 places in 313 ms of which 4 ms to minimize.
[2024-05-23 05:20:44] [INFO ] Deduced a trap composed of 145 places in 304 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/963 variables, and 60 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 05:20:51] [INFO ] Deduced a trap composed of 177 places in 299 ms of which 4 ms to minimize.
[2024-05-23 05:20:52] [INFO ] Deduced a trap composed of 127 places in 307 ms of which 6 ms to minimize.
[2024-05-23 05:20:52] [INFO ] Deduced a trap composed of 173 places in 396 ms of which 6 ms to minimize.
[2024-05-23 05:20:52] [INFO ] Deduced a trap composed of 100 places in 299 ms of which 4 ms to minimize.
[2024-05-23 05:20:53] [INFO ] Deduced a trap composed of 94 places in 333 ms of which 5 ms to minimize.
[2024-05-23 05:20:54] [INFO ] Deduced a trap composed of 138 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:20:55] [INFO ] Deduced a trap composed of 153 places in 319 ms of which 4 ms to minimize.
[2024-05-23 05:20:55] [INFO ] Deduced a trap composed of 234 places in 298 ms of which 3 ms to minimize.
[2024-05-23 05:20:55] [INFO ] Deduced a trap composed of 138 places in 349 ms of which 6 ms to minimize.
[2024-05-23 05:20:56] [INFO ] Deduced a trap composed of 167 places in 370 ms of which 4 ms to minimize.
[2024-05-23 05:20:56] [INFO ] Deduced a trap composed of 148 places in 311 ms of which 4 ms to minimize.
[2024-05-23 05:20:57] [INFO ] Deduced a trap composed of 150 places in 412 ms of which 5 ms to minimize.
[2024-05-23 05:20:57] [INFO ] Deduced a trap composed of 148 places in 345 ms of which 4 ms to minimize.
[2024-05-23 05:20:57] [INFO ] Deduced a trap composed of 170 places in 352 ms of which 5 ms to minimize.
[2024-05-23 05:20:58] [INFO ] Deduced a trap composed of 99 places in 395 ms of which 4 ms to minimize.
[2024-05-23 05:20:58] [INFO ] Deduced a trap composed of 136 places in 311 ms of which 3 ms to minimize.
[2024-05-23 05:20:59] [INFO ] Deduced a trap composed of 111 places in 312 ms of which 4 ms to minimize.
[2024-05-23 05:20:59] [INFO ] Deduced a trap composed of 159 places in 378 ms of which 5 ms to minimize.
[2024-05-23 05:20:59] [INFO ] Deduced a trap composed of 125 places in 367 ms of which 4 ms to minimize.
[2024-05-23 05:21:00] [INFO ] Deduced a trap composed of 133 places in 329 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 05:21:03] [INFO ] Deduced a trap composed of 173 places in 315 ms of which 4 ms to minimize.
[2024-05-23 05:21:03] [INFO ] Deduced a trap composed of 154 places in 312 ms of which 5 ms to minimize.
[2024-05-23 05:21:04] [INFO ] Deduced a trap composed of 133 places in 418 ms of which 6 ms to minimize.
[2024-05-23 05:21:04] [INFO ] Deduced a trap composed of 151 places in 298 ms of which 3 ms to minimize.
[2024-05-23 05:21:04] [INFO ] Deduced a trap composed of 170 places in 322 ms of which 5 ms to minimize.
[2024-05-23 05:21:05] [INFO ] Deduced a trap composed of 145 places in 388 ms of which 3 ms to minimize.
[2024-05-23 05:21:05] [INFO ] Deduced a trap composed of 171 places in 289 ms of which 3 ms to minimize.
[2024-05-23 05:21:05] [INFO ] Deduced a trap composed of 156 places in 338 ms of which 5 ms to minimize.
[2024-05-23 05:21:06] [INFO ] Deduced a trap composed of 160 places in 376 ms of which 4 ms to minimize.
[2024-05-23 05:21:06] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 4 ms to minimize.
[2024-05-23 05:21:06] [INFO ] Deduced a trap composed of 193 places in 291 ms of which 4 ms to minimize.
[2024-05-23 05:21:07] [INFO ] Deduced a trap composed of 145 places in 296 ms of which 3 ms to minimize.
[2024-05-23 05:21:07] [INFO ] Deduced a trap composed of 141 places in 403 ms of which 5 ms to minimize.
[2024-05-23 05:21:07] [INFO ] Deduced a trap composed of 172 places in 326 ms of which 3 ms to minimize.
[2024-05-23 05:21:08] [INFO ] Deduced a trap composed of 142 places in 283 ms of which 4 ms to minimize.
[2024-05-23 05:21:08] [INFO ] Deduced a trap composed of 163 places in 261 ms of which 4 ms to minimize.
[2024-05-23 05:21:08] [INFO ] Deduced a trap composed of 126 places in 295 ms of which 4 ms to minimize.
[2024-05-23 05:21:09] [INFO ] Deduced a trap composed of 175 places in 279 ms of which 4 ms to minimize.
[2024-05-23 05:21:09] [INFO ] Deduced a trap composed of 165 places in 367 ms of which 6 ms to minimize.
[2024-05-23 05:21:10] [INFO ] Deduced a trap composed of 168 places in 291 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/963 variables, and 100 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 80/80 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60342ms
Finished structural reductions in LTL mode , in 1 iterations and 62887 ms. Remains : 363/363 places, 600/600 transitions.
Built C files in :
/tmp/ltsmin10890257802391496864
[2024-05-23 05:21:17] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10890257802391496864
Running compilation step : cd /tmp/ltsmin10890257802391496864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1852 ms.
Running link step : cd /tmp/ltsmin10890257802391496864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10890257802391496864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4355340547119921663.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 05:21:33] [INFO ] Flatten gal took : 18 ms
[2024-05-23 05:21:33] [INFO ] Flatten gal took : 18 ms
[2024-05-23 05:21:33] [INFO ] Time to serialize gal into /tmp/LTL2515044780214088476.gal : 5 ms
[2024-05-23 05:21:33] [INFO ] Time to serialize properties into /tmp/LTL16892440545229762367.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2515044780214088476.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1940790000836062999.hoa' '-atoms' '/tmp/LTL16892440545229762367.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16892440545229762367.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1940790000836062999.hoa
Detected timeout of ITS tools.
[2024-05-23 05:21:48] [INFO ] Flatten gal took : 16 ms
[2024-05-23 05:21:48] [INFO ] Flatten gal took : 17 ms
[2024-05-23 05:21:48] [INFO ] Time to serialize gal into /tmp/LTL11946856544508686886.gal : 4 ms
[2024-05-23 05:21:48] [INFO ] Time to serialize properties into /tmp/LTL15267070689613505370.ltl : 36 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11946856544508686886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15267070689613505370.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((next_3!=1)||(ncs_8_4!=1))"))||(((X(X(X("((next_3!=1)||(ncs_8_4!=1))"))))&&("((next_14!=1)||(ncs_7_3!=1))"))&&("((next_11!...180
Formula 0 simplified : G(F!"((next_3!=1)||(ncs_8_4!=1))" & FG(!"((next_11!=1)||(ncs_5_3!=1))" | !"((next_14!=1)||(ncs_7_3!=1))" | XXX!"((next_3!=1)||(ncs_8...165
Detected timeout of ITS tools.
[2024-05-23 05:22:03] [INFO ] Flatten gal took : 19 ms
[2024-05-23 05:22:03] [INFO ] Applying decomposition
[2024-05-23 05:22:03] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5280119698610616742.txt' '-o' '/tmp/graph5280119698610616742.bin' '-w' '/tmp/graph5280119698610616742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5280119698610616742.bin' '-l' '-1' '-v' '-w' '/tmp/graph5280119698610616742.weights' '-q' '0' '-e' '0.001'
[2024-05-23 05:22:03] [INFO ] Decomposing Gal with order
[2024-05-23 05:22:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 05:22:03] [INFO ] Removed a total of 1044 redundant transitions.
[2024-05-23 05:22:03] [INFO ] Flatten gal took : 46 ms
[2024-05-23 05:22:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 8 ms.
[2024-05-23 05:22:03] [INFO ] Time to serialize gal into /tmp/LTL16767585337687607357.gal : 8 ms
[2024-05-23 05:22:03] [INFO ] Time to serialize properties into /tmp/LTL361039378855385735.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16767585337687607357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL361039378855385735.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i0.i0.u1.next_3!=1)||(i2.u52.ncs_8_4!=1))"))||(((X(X(X("((i0.i0.u1.next_3!=1)||(i2.u52.ncs_8_4!=1))"))))&&("((i0.i1.u7.ne...244
Formula 0 simplified : G(F!"((i0.i0.u1.next_3!=1)||(i2.u52.ncs_8_4!=1))" & FG(!"((i0.i0.u5.next_11!=1)||(i5.u34.ncs_5_3!=1))" | !"((i0.i1.u7.next_14!=1)||(...229
Detected timeout of ITS tools.
Treatment of property Anderson-PT-09-LTLFireability-10 finished in 238367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(((p1 U p2)&&F(p3))))&&p0))))'
Support contains 6 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 364 transition count 600
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 364 transition count 600
Applied a total of 32 rules in 14 ms. Remains 364 /380 variables (removed 16) and now considering 600/840 (removed 240) transitions.
// Phase 1: matrix 600 rows 364 cols
[2024-05-23 05:22:18] [INFO ] Computed 21 invariants in 5 ms
[2024-05-23 05:22:19] [INFO ] Implicit Places using invariants in 606 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 607 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/380 places, 600/840 transitions.
Applied a total of 0 rules in 5 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 628 ms. Remains : 363/380 places, 600/840 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p3), (NOT p2), (OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 148 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 1 ms.
FORMULA Anderson-PT-09-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-12 finished in 1019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(F(!p0))||(!p1&&F(!p0)))))))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 566
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 566
Applied a total of 36 rules in 11 ms. Remains 362 /380 variables (removed 18) and now considering 566/840 (removed 274) transitions.
// Phase 1: matrix 566 rows 362 cols
[2024-05-23 05:22:19] [INFO ] Computed 21 invariants in 4 ms
[2024-05-23 05:22:20] [INFO ] Implicit Places using invariants in 604 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 606 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 566/840 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 623 ms. Remains : 361/380 places, 566/840 transitions.
Stuttering acceptance computed with spot in 222 ms :[p0, p0, p0, p0, p0, p0]
Running random walk in product with property : Anderson-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 20000 reset in 245 ms.
Product exploration explored 100000 steps with 20000 reset in 230 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
// Phase 1: matrix 566 rows 361 cols
[2024-05-23 05:22:21] [INFO ] Computed 20 invariants in 3 ms
[2024-05-23 05:22:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/927 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1108ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 566/566 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 361 transition count 503
Reduce places removed 63 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 71 rules applied. Total rules applied 134 place count 298 transition count 495
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 142 place count 290 transition count 495
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 142 place count 290 transition count 424
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 284 place count 219 transition count 424
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 293 place count 219 transition count 415
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 302 place count 210 transition count 415
Applied a total of 302 rules in 26 ms. Remains 210 /361 variables (removed 151) and now considering 415/566 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 210/361 places, 415/566 transitions.
RANDOM walk for 40000 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30364 steps (6 resets) in 28 ms. (1047 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 217 ms :[p0, p0, p0, p0, p0, p0]
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 566/566 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2024-05-23 05:22:23] [INFO ] Invariant cache hit.
[2024-05-23 05:22:23] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-23 05:22:23] [INFO ] Invariant cache hit.
[2024-05-23 05:22:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:22:25] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2024-05-23 05:22:25] [INFO ] Invariant cache hit.
[2024-05-23 05:22:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-05-23 05:22:33] [INFO ] Deduced a trap composed of 212 places in 299 ms of which 4 ms to minimize.
[2024-05-23 05:22:33] [INFO ] Deduced a trap composed of 160 places in 326 ms of which 4 ms to minimize.
[2024-05-23 05:22:33] [INFO ] Deduced a trap composed of 108 places in 317 ms of which 4 ms to minimize.
[2024-05-23 05:22:34] [INFO ] Deduced a trap composed of 126 places in 323 ms of which 4 ms to minimize.
[2024-05-23 05:22:34] [INFO ] Deduced a trap composed of 81 places in 317 ms of which 4 ms to minimize.
[2024-05-23 05:22:34] [INFO ] Deduced a trap composed of 218 places in 302 ms of which 4 ms to minimize.
[2024-05-23 05:22:35] [INFO ] Deduced a trap composed of 133 places in 317 ms of which 5 ms to minimize.
[2024-05-23 05:22:35] [INFO ] Deduced a trap composed of 168 places in 394 ms of which 4 ms to minimize.
[2024-05-23 05:22:35] [INFO ] Deduced a trap composed of 100 places in 300 ms of which 3 ms to minimize.
[2024-05-23 05:22:36] [INFO ] Deduced a trap composed of 183 places in 294 ms of which 4 ms to minimize.
[2024-05-23 05:22:36] [INFO ] Deduced a trap composed of 210 places in 295 ms of which 3 ms to minimize.
[2024-05-23 05:22:36] [INFO ] Deduced a trap composed of 108 places in 385 ms of which 6 ms to minimize.
[2024-05-23 05:22:37] [INFO ] Deduced a trap composed of 200 places in 257 ms of which 3 ms to minimize.
[2024-05-23 05:22:37] [INFO ] Deduced a trap composed of 208 places in 294 ms of which 4 ms to minimize.
[2024-05-23 05:22:38] [INFO ] Deduced a trap composed of 190 places in 295 ms of which 4 ms to minimize.
[2024-05-23 05:22:38] [INFO ] Deduced a trap composed of 221 places in 404 ms of which 5 ms to minimize.
[2024-05-23 05:22:38] [INFO ] Deduced a trap composed of 190 places in 292 ms of which 3 ms to minimize.
[2024-05-23 05:22:39] [INFO ] Deduced a trap composed of 122 places in 282 ms of which 3 ms to minimize.
[2024-05-23 05:22:39] [INFO ] Deduced a trap composed of 206 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:22:40] [INFO ] Deduced a trap composed of 116 places in 297 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-05-23 05:22:42] [INFO ] Deduced a trap composed of 66 places in 304 ms of which 4 ms to minimize.
[2024-05-23 05:22:43] [INFO ] Deduced a trap composed of 165 places in 289 ms of which 3 ms to minimize.
[2024-05-23 05:22:43] [INFO ] Deduced a trap composed of 145 places in 289 ms of which 4 ms to minimize.
[2024-05-23 05:22:43] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:22:43] [INFO ] Deduced a trap composed of 166 places in 311 ms of which 4 ms to minimize.
[2024-05-23 05:22:44] [INFO ] Deduced a trap composed of 204 places in 323 ms of which 5 ms to minimize.
[2024-05-23 05:22:44] [INFO ] Deduced a trap composed of 108 places in 387 ms of which 4 ms to minimize.
[2024-05-23 05:22:44] [INFO ] Deduced a trap composed of 151 places in 306 ms of which 4 ms to minimize.
[2024-05-23 05:22:45] [INFO ] Deduced a trap composed of 190 places in 292 ms of which 4 ms to minimize.
[2024-05-23 05:22:45] [INFO ] Deduced a trap composed of 156 places in 287 ms of which 4 ms to minimize.
[2024-05-23 05:22:46] [INFO ] Deduced a trap composed of 176 places in 313 ms of which 5 ms to minimize.
[2024-05-23 05:22:46] [INFO ] Deduced a trap composed of 162 places in 384 ms of which 4 ms to minimize.
[2024-05-23 05:22:46] [INFO ] Deduced a trap composed of 210 places in 296 ms of which 4 ms to minimize.
[2024-05-23 05:22:47] [INFO ] Deduced a trap composed of 209 places in 337 ms of which 5 ms to minimize.
[2024-05-23 05:22:47] [INFO ] Deduced a trap composed of 182 places in 386 ms of which 3 ms to minimize.
[2024-05-23 05:22:48] [INFO ] Deduced a trap composed of 106 places in 298 ms of which 4 ms to minimize.
[2024-05-23 05:22:48] [INFO ] Deduced a trap composed of 223 places in 304 ms of which 3 ms to minimize.
[2024-05-23 05:22:48] [INFO ] Deduced a trap composed of 247 places in 289 ms of which 4 ms to minimize.
[2024-05-23 05:22:49] [INFO ] Deduced a trap composed of 198 places in 297 ms of which 4 ms to minimize.
[2024-05-23 05:22:49] [INFO ] Deduced a trap composed of 161 places in 292 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-05-23 05:22:56] [INFO ] Deduced a trap composed of 165 places in 299 ms of which 4 ms to minimize.
SMT process timed out in 30472ms, After SMT, problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 30478ms
Finished structural reductions in LTL mode , in 1 iterations and 33006 ms. Remains : 361/361 places, 566/566 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-05-23 05:22:56] [INFO ] Invariant cache hit.
[2024-05-23 05:22:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 927/927 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1572ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 566/566 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 361 transition count 503
Reduce places removed 63 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 71 rules applied. Total rules applied 134 place count 298 transition count 495
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 142 place count 290 transition count 495
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 142 place count 290 transition count 424
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 284 place count 219 transition count 424
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 293 place count 219 transition count 415
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 302 place count 210 transition count 415
Applied a total of 302 rules in 27 ms. Remains 210 /361 variables (removed 151) and now considering 415/566 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 210/361 places, 415/566 transitions.
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 38620 steps (8 resets) in 34 ms. (1103 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 224 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 230 ms :[p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 20000 reset in 212 ms.
Product exploration explored 100000 steps with 20000 reset in 239 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 320 ms :[p0, p0, p0, p0, p0, p0]
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 566/566 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 361 transition count 566
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 71 Pre rules applied. Total rules applied 71 place count 361 transition count 566
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 142 place count 361 transition count 566
Deduced a syphon composed of 142 places in 0 ms
Applied a total of 142 rules in 16 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2024-05-23 05:23:00] [INFO ] Redundant transitions in 4 ms returned []
Running 557 sub problems to find dead transitions.
// Phase 1: matrix 566 rows 361 cols
[2024-05-23 05:23:00] [INFO ] Computed 20 invariants in 4 ms
[2024-05-23 05:23:00] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-05-23 05:23:05] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-23 05:23:05] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-23 05:23:05] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-23 05:23:05] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-23 05:23:05] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 4 ms to minimize.
[2024-05-23 05:23:06] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 4 ms to minimize.
[2024-05-23 05:23:06] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-23 05:23:06] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-23 05:23:06] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 4 ms to minimize.
[2024-05-23 05:23:07] [INFO ] Deduced a trap composed of 54 places in 294 ms of which 3 ms to minimize.
[2024-05-23 05:23:07] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 4 ms to minimize.
[2024-05-23 05:23:07] [INFO ] Deduced a trap composed of 60 places in 270 ms of which 4 ms to minimize.
[2024-05-23 05:23:07] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-23 05:23:08] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-23 05:23:09] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 4 ms to minimize.
[2024-05-23 05:23:09] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 3 ms to minimize.
[2024-05-23 05:23:09] [INFO ] Deduced a trap composed of 59 places in 313 ms of which 4 ms to minimize.
[2024-05-23 05:23:10] [INFO ] Deduced a trap composed of 62 places in 292 ms of which 3 ms to minimize.
[2024-05-23 05:23:10] [INFO ] Deduced a trap composed of 47 places in 288 ms of which 3 ms to minimize.
[2024-05-23 05:23:10] [INFO ] Deduced a trap composed of 45 places in 311 ms of which 5 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/40 constraints. Problems are: Problem set: 142 solved, 415 unsolved
[2024-05-23 05:23:12] [INFO ] Deduced a trap composed of 42 places in 280 ms of which 4 ms to minimize.
[2024-05-23 05:23:12] [INFO ] Deduced a trap composed of 72 places in 220 ms of which 4 ms to minimize.
[2024-05-23 05:23:12] [INFO ] Deduced a trap composed of 77 places in 293 ms of which 4 ms to minimize.
[2024-05-23 05:23:13] [INFO ] Deduced a trap composed of 61 places in 281 ms of which 4 ms to minimize.
[2024-05-23 05:23:14] [INFO ] Deduced a trap composed of 73 places in 296 ms of which 4 ms to minimize.
[2024-05-23 05:23:14] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 4 ms to minimize.
[2024-05-23 05:23:15] [INFO ] Deduced a trap composed of 60 places in 291 ms of which 5 ms to minimize.
[2024-05-23 05:23:15] [INFO ] Deduced a trap composed of 76 places in 406 ms of which 6 ms to minimize.
[2024-05-23 05:23:15] [INFO ] Deduced a trap composed of 66 places in 309 ms of which 4 ms to minimize.
[2024-05-23 05:23:16] [INFO ] Deduced a trap composed of 77 places in 290 ms of which 5 ms to minimize.
[2024-05-23 05:23:16] [INFO ] Deduced a trap composed of 74 places in 382 ms of which 5 ms to minimize.
[2024-05-23 05:23:16] [INFO ] Deduced a trap composed of 81 places in 285 ms of which 4 ms to minimize.
[2024-05-23 05:23:17] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2024-05-23 05:23:17] [INFO ] Deduced a trap composed of 68 places in 303 ms of which 4 ms to minimize.
[2024-05-23 05:23:18] [INFO ] Deduced a trap composed of 68 places in 277 ms of which 3 ms to minimize.
[2024-05-23 05:23:18] [INFO ] Deduced a trap composed of 70 places in 261 ms of which 3 ms to minimize.
[2024-05-23 05:23:18] [INFO ] Deduced a trap composed of 114 places in 281 ms of which 4 ms to minimize.
[2024-05-23 05:23:19] [INFO ] Deduced a trap composed of 73 places in 395 ms of which 5 ms to minimize.
[2024-05-23 05:23:19] [INFO ] Deduced a trap composed of 62 places in 304 ms of which 4 ms to minimize.
[2024-05-23 05:23:19] [INFO ] Deduced a trap composed of 82 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/60 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/60 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 566/927 variables, 361/421 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 134/555 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 927/927 variables, and 555 constraints, problems are : Problem set: 142 solved, 415 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 142 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 40/40 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/40 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 142/361 variables, 11/51 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 9/60 constraints. Problems are: Problem set: 142 solved, 415 unsolved
[2024-05-23 05:23:35] [INFO ] Deduced a trap composed of 63 places in 278 ms of which 4 ms to minimize.
[2024-05-23 05:23:35] [INFO ] Deduced a trap composed of 58 places in 284 ms of which 4 ms to minimize.
[2024-05-23 05:23:37] [INFO ] Deduced a trap composed of 76 places in 301 ms of which 4 ms to minimize.
[2024-05-23 05:23:37] [INFO ] Deduced a trap composed of 77 places in 308 ms of which 4 ms to minimize.
[2024-05-23 05:23:38] [INFO ] Deduced a trap composed of 77 places in 314 ms of which 4 ms to minimize.
[2024-05-23 05:23:38] [INFO ] Deduced a trap composed of 69 places in 296 ms of which 4 ms to minimize.
[2024-05-23 05:23:39] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 4 ms to minimize.
[2024-05-23 05:23:39] [INFO ] Deduced a trap composed of 69 places in 288 ms of which 3 ms to minimize.
[2024-05-23 05:23:39] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 4 ms to minimize.
[2024-05-23 05:23:40] [INFO ] Deduced a trap composed of 54 places in 283 ms of which 3 ms to minimize.
[2024-05-23 05:23:40] [INFO ] Deduced a trap composed of 83 places in 295 ms of which 4 ms to minimize.
[2024-05-23 05:23:40] [INFO ] Deduced a trap composed of 60 places in 300 ms of which 6 ms to minimize.
[2024-05-23 05:23:41] [INFO ] Deduced a trap composed of 63 places in 415 ms of which 6 ms to minimize.
[2024-05-23 05:23:41] [INFO ] Deduced a trap composed of 74 places in 287 ms of which 3 ms to minimize.
[2024-05-23 05:23:41] [INFO ] Deduced a trap composed of 73 places in 293 ms of which 5 ms to minimize.
[2024-05-23 05:23:42] [INFO ] Deduced a trap composed of 62 places in 263 ms of which 5 ms to minimize.
[2024-05-23 05:23:42] [INFO ] Deduced a trap composed of 75 places in 269 ms of which 4 ms to minimize.
[2024-05-23 05:23:43] [INFO ] Deduced a trap composed of 75 places in 289 ms of which 4 ms to minimize.
[2024-05-23 05:23:43] [INFO ] Deduced a trap composed of 68 places in 286 ms of which 4 ms to minimize.
[2024-05-23 05:23:43] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/80 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/927 variables, and 80 constraints, problems are : Problem set: 142 solved, 415 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/134 constraints, PredecessorRefiner: 0/557 constraints, Known Traps: 60/60 constraints]
After SMT, in 60462ms problems are : Problem set: 142 solved, 415 unsolved
Search for dead transitions found 142 dead transitions in 60467ms
Found 142 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 142 transitions
Dead transitions reduction (with SMT) removed 142 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 361/361 places, 424/566 transitions.
Graph (complete) has 1124 edges and 361 vertex of which 219 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.1 ms
Discarding 142 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 219 /361 variables (removed 142) and now considering 424/424 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 219/361 places, 424/566 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60507 ms. Remains : 219/361 places, 424/566 transitions.
Built C files in :
/tmp/ltsmin11009586193369724420
[2024-05-23 05:24:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11009586193369724420
Running compilation step : cd /tmp/ltsmin11009586193369724420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1768 ms.
Running link step : cd /tmp/ltsmin11009586193369724420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11009586193369724420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10023877370808134481.hoa' '--buchi-type=spotba'
LTSmin run took 625 ms.
FORMULA Anderson-PT-09-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-09-LTLFireability-13 finished in 103311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 290 transition count 494
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 290 transition count 494
Applied a total of 180 rules in 21 ms. Remains 290 /380 variables (removed 90) and now considering 494/840 (removed 346) transitions.
// Phase 1: matrix 494 rows 290 cols
[2024-05-23 05:24:03] [INFO ] Computed 21 invariants in 6 ms
[2024-05-23 05:24:03] [INFO ] Implicit Places using invariants in 571 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 572 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/380 places, 494/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 9 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2024-05-23 05:24:03] [INFO ] Computed 20 invariants in 2 ms
[2024-05-23 05:24:03] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-23 05:24:03] [INFO ] Invariant cache hit.
[2024-05-23 05:24:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 05:24:04] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/380 places, 414/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1727 ms. Remains : 209/380 places, 414/840 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 164 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA Anderson-PT-09-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-14 finished in 1941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||G(p2)||p0)))))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 363 transition count 567
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 363 transition count 567
Applied a total of 34 rules in 10 ms. Remains 363 /380 variables (removed 17) and now considering 567/840 (removed 273) transitions.
// Phase 1: matrix 567 rows 363 cols
[2024-05-23 05:24:04] [INFO ] Computed 21 invariants in 5 ms
[2024-05-23 05:24:05] [INFO ] Implicit Places using invariants in 615 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 616 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/840 transitions.
Applied a total of 0 rules in 4 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 633 ms. Remains : 362/380 places, 567/840 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 235 ms.
Product exploration explored 100000 steps with 33333 reset in 254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-15 finished in 1278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X(X(X(!p1))))||G(!p1)))))'
[2024-05-23 05:24:06] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6496738994654145646
[2024-05-23 05:24:06] [INFO ] Computing symmetric may disable matrix : 840 transitions.
[2024-05-23 05:24:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:24:06] [INFO ] Applying decomposition
[2024-05-23 05:24:06] [INFO ] Computing symmetric may enable matrix : 840 transitions.
[2024-05-23 05:24:06] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:24:06] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12780875077659094157.txt' '-o' '/tmp/graph12780875077659094157.bin' '-w' '/tmp/graph12780875077659094157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12780875077659094157.bin' '-l' '-1' '-v' '-w' '/tmp/graph12780875077659094157.weights' '-q' '0' '-e' '0.001'
[2024-05-23 05:24:06] [INFO ] Decomposing Gal with order
[2024-05-23 05:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 05:24:06] [INFO ] Computing Do-Not-Accords matrix : 840 transitions.
[2024-05-23 05:24:06] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 05:24:06] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6496738994654145646
Running compilation step : cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 05:24:07] [INFO ] Removed a total of 1453 redundant transitions.
[2024-05-23 05:24:07] [INFO ] Flatten gal took : 67 ms
[2024-05-23 05:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 12 ms.
[2024-05-23 05:24:07] [INFO ] Time to serialize gal into /tmp/LTLFireability15187542737262321907.gal : 7 ms
[2024-05-23 05:24:07] [INFO ] Time to serialize properties into /tmp/LTLFireability9302307605778493953.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15187542737262321907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9302307605778493953.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((G(F("(((i2.u5.next_9!=1)||(i5.u49.ncs_1_4!=1))||((i3.u4.next_7==1)&&(i8.u59.ncs_3_1==1)))"))))
Formula 0 simplified : FG!"(((i2.u5.next_9!=1)||(i5.u49.ncs_1_4!=1))||((i3.u4.next_7==1)&&(i8.u59.ncs_3_1==1)))"
Compilation finished in 4848 ms.
Running link step : cd /tmp/ltsmin6496738994654145646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((<>((LTLAPp2==true))||(LTLAPp1==true))))&&(!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((<>((LTLAPp2==true))||(LTLAPp1==true))))&&(!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(LTLAPp6==true)&&X(X(X(!(LTLAPp7==true)))))||[](!(LTLAPp7==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(LTLAPp6==true)&&X(X(X(!(LTLAPp7==true)))))||[](!(LTLAPp7==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin6496738994654145646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 05:50:17] [INFO ] Applying decomposition
[2024-05-23 05:50:17] [INFO ] Flatten gal took : 56 ms
[2024-05-23 05:50:17] [INFO ] Decomposing Gal with order
[2024-05-23 05:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 05:50:18] [INFO ] Removed a total of 986 redundant transitions.
[2024-05-23 05:50:18] [INFO ] Flatten gal took : 190 ms
[2024-05-23 05:50:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 40 ms.
[2024-05-23 05:50:18] [INFO ] Time to serialize gal into /tmp/LTLFireability13748020831233605297.gal : 18 ms
[2024-05-23 05:50:18] [INFO ] Time to serialize properties into /tmp/LTLFireability2751704320977385438.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13748020831233605297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2751704320977385438.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((G(F("(((u10.next_9!=1)||(u7.ncs_1_4!=1))||((u10.next_7==1)&&(u9.ncs_3_1==1)))"))))
Formula 0 simplified : FG!"(((u10.next_9!=1)||(u7.ncs_1_4!=1))||((u10.next_7==1)&&(u9.ncs_3_1==1)))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t7, t8, t20, t21, t22, t40, t41, t42, t51, t52, t53, t54, t72, t73, t85, t90,...1198
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
10957 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,109.652,1681756,1,0,2.15488e+06,1.00616e+06,4878,2.24362e+06,2377,6.83038e+06,10231342
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Anderson-PT-09-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(G(("((u10.next_1!=1)||(u8.ncs_2_6!=1))")||(F("((u10.next_1!=1)||(u6.ncs_0_3!=1))")))))&&((!("((u10.next_11==1)&&(u3.p1_6_8==1))"...291
Formula 1 simplified : G(F!"((u10.next_1!=1)||(u8.ncs_2_6!=1))" & FG!"((u10.next_1!=1)||(u6.ncs_0_3!=1))") | ("((u10.next_11==1)&&(u3.p1_6_8==1))" M !"((!(...231
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
340 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,113.063,1757776,1,0,2.2772e+06,1.01426e+06,4956,2.33468e+06,2383,6.85071e+06,10864649
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Anderson-PT-09-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F("((u11.slot_F.F.F.F.F.F.F.F.F==0)||(u3.cs_6_8==0))"))))
Formula 2 simplified : FG!"((u11.slot_F.F.F.F.F.F.F.F.F==0)||(u3.cs_6_8==0))"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
124 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,114.296,1792624,1,0,2.32619e+06,1.01877e+06,5026,2.34859e+06,2385,6.8618e+06,11158496
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Anderson-PT-09-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(((!("(((u10.next_14==1)&&(u4.ncs_7_3==1))||((u10.next_11==1)&&(u2.ncs_5_3==1)))"))&&(X(X(X(!("((u10.next_3==1)&&(u5.ncs_8_4==1)...213
Formula 3 simplified : G(F"((u10.next_3==1)&&(u5.ncs_8_4==1))" & FG("(((u10.next_14==1)&&(u4.ncs_7_3==1))||((u10.next_11==1)&&(u2.ncs_5_3==1)))" | XXX"((u1...188
36 unique states visited
0 strongly connected components in search stack
36 transitions explored
33 items max in DFS search stack
2219 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,136.49,2149484,1,0,2.84716e+06,1.01877e+06,5283,2.9193e+06,2389,6.86523e+06,14406137
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Anderson-PT-09-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3027863 ms.
BK_STOP 1716443761918
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="Anderson-PT-09"
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-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-09, 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 r004-smll-171620118400356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 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 ;