About the Execution of GreatSPN+red for ShieldPPPs-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12431.951 | 3600000.00 | 6330988.00 | 6884.70 | ??F?F?FFF?F???FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683758800476.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 greatspnxred
Input is ShieldPPPs-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758800476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 992K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 11:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 13 11:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 528K May 18 16:43 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 ShieldPPPs-PT-030B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716980806126
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 11:06:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 11:06:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:06:47] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-05-29 11:06:47] [INFO ] Transformed 2043 places.
[2024-05-29 11:06:47] [INFO ] Transformed 1893 transitions.
[2024-05-29 11:06:47] [INFO ] Found NUPN structural information;
[2024-05-29 11:06:47] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-030B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Discarding 201 places :
Symmetric choice reduction at 0 with 201 rule applications. Total rules 201 place count 1842 transition count 1692
Iterating global reduction 0 with 201 rules applied. Total rules applied 402 place count 1842 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 403 place count 1841 transition count 1691
Iterating global reduction 0 with 1 rules applied. Total rules applied 404 place count 1841 transition count 1691
Applied a total of 404 rules in 585 ms. Remains 1841 /2043 variables (removed 202) and now considering 1691/1893 (removed 202) transitions.
// Phase 1: matrix 1691 rows 1841 cols
[2024-05-29 11:06:48] [INFO ] Computed 331 invariants in 35 ms
[2024-05-29 11:06:49] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-05-29 11:06:49] [INFO ] Invariant cache hit.
[2024-05-29 11:06:51] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2815 ms to find 0 implicit places.
Running 1690 sub problems to find dead transitions.
[2024-05-29 11:06:51] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1840/3532 variables, and 0 constraints, problems are : Problem set: 0 solved, 1690 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1841 constraints, PredecessorRefiner: 1690/1690 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1690 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1840/3532 variables, and 0 constraints, problems are : Problem set: 0 solved, 1690 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1841 constraints, PredecessorRefiner: 0/1690 constraints, Known Traps: 0/0 constraints]
After SMT, in 60583ms problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 60618ms
Starting structural reductions in LTL mode, iteration 1 : 1841/2043 places, 1691/1893 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64063 ms. Remains : 1841/2043 places, 1691/1893 transitions.
Support contains 36 out of 1841 places after structural reductions.
[2024-05-29 11:07:52] [INFO ] Flatten gal took : 142 ms
[2024-05-29 11:07:52] [INFO ] Flatten gal took : 81 ms
[2024-05-29 11:07:52] [INFO ] Input system was already deterministic with 1691 transitions.
RANDOM walk for 40000 steps (8 resets) in 2003 ms. (19 steps per ms) remains 3/22 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 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
[2024-05-29 11:07:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1763/1841 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1691/3532 variables, 1841/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3532 variables, 0/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3532 variables, 0/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3532/3532 variables, and 2172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 1841/1841 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1763/1841 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 11:07:54] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 25 ms to minimize.
[2024-05-29 11:07:55] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-29 11:07:55] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-29 11:07:55] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-29 11:07:55] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:07:55] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:07:55] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-29 11:07:55] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:07:55] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 9/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1691/3532 variables, 1841/2181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3532 variables, 3/2184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 11:07:56] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 6 ms to minimize.
[2024-05-29 11:07:57] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 5 ms to minimize.
[2024-05-29 11:07:57] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 5 ms to minimize.
[2024-05-29 11:07:57] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 4 ms to minimize.
[2024-05-29 11:07:57] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 5 ms to minimize.
[2024-05-29 11:07:58] [INFO ] Deduced a trap composed of 52 places in 244 ms of which 5 ms to minimize.
[2024-05-29 11:07:58] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 5 ms to minimize.
[2024-05-29 11:07:58] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 4 ms to minimize.
[2024-05-29 11:07:58] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 4 ms to minimize.
[2024-05-29 11:07:59] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 3 ms to minimize.
[2024-05-29 11:07:59] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3532/3532 variables, and 2195 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 1841/1841 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 6052ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1841 transition count 1480
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1630 transition count 1480
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1630 transition count 1330
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1480 transition count 1330
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 730 place count 1472 transition count 1322
Iterating global reduction 2 with 8 rules applied. Total rules applied 738 place count 1472 transition count 1322
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 738 place count 1472 transition count 1315
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 752 place count 1465 transition count 1315
Performed 530 Post agglomeration using F-continuation condition.Transition count delta: 530
Deduced a syphon composed of 530 places in 3 ms
Reduce places removed 530 places and 0 transitions.
Iterating global reduction 2 with 1060 rules applied. Total rules applied 1812 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions (Partial Free agglomeration) removed 267 transitions
Iterating global reduction 2 with 267 rules applied. Total rules applied 2079 place count 935 transition count 785
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2080 place count 934 transition count 784
Applied a total of 2080 rules in 520 ms. Remains 934 /1841 variables (removed 907) and now considering 784/1691 (removed 907) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 521 ms. Remains : 934/1841 places, 784/1691 transitions.
RANDOM walk for 10529 steps (0 resets) in 165 ms. (63 steps per ms) remains 0/3 properties
Computed a total of 366 stabilizing places and 366 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)))'
Support contains 3 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1840 transition count 1479
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1629 transition count 1479
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1629 transition count 1329
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1479 transition count 1329
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 730 place count 1471 transition count 1321
Iterating global reduction 2 with 8 rules applied. Total rules applied 738 place count 1471 transition count 1321
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 738 place count 1471 transition count 1314
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 752 place count 1464 transition count 1314
Performed 529 Post agglomeration using F-continuation condition.Transition count delta: 529
Deduced a syphon composed of 529 places in 1 ms
Reduce places removed 529 places and 0 transitions.
Iterating global reduction 2 with 1058 rules applied. Total rules applied 1810 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1812 place count 933 transition count 783
Applied a total of 1812 rules in 252 ms. Remains 933 /1841 variables (removed 908) and now considering 783/1691 (removed 908) transitions.
// Phase 1: matrix 783 rows 933 cols
[2024-05-29 11:08:00] [INFO ] Computed 331 invariants in 6 ms
[2024-05-29 11:08:00] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-29 11:08:00] [INFO ] Invariant cache hit.
[2024-05-29 11:08:01] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2024-05-29 11:08:01] [INFO ] Redundant transitions in 36 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:08:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:08:20] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1716 variables, and 331 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 1/933 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:08:54] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:08:54] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:08:55] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:08:55] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:08:55] [INFO ] Deduced a trap composed of 87 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:08:55] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 2 ms to minimize.
[2024-05-29 11:08:56] [INFO ] Deduced a trap composed of 116 places in 56 ms of which 2 ms to minimize.
[2024-05-29 11:08:56] [INFO ] Deduced a trap composed of 131 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:08:56] [INFO ] Deduced a trap composed of 145 places in 68 ms of which 5 ms to minimize.
[2024-05-29 11:08:56] [INFO ] Deduced a trap composed of 163 places in 69 ms of which 1 ms to minimize.
[2024-05-29 11:08:57] [INFO ] Deduced a trap composed of 177 places in 75 ms of which 2 ms to minimize.
[2024-05-29 11:08:57] [INFO ] Deduced a trap composed of 188 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:08:57] [INFO ] Deduced a trap composed of 208 places in 86 ms of which 9 ms to minimize.
[2024-05-29 11:08:57] [INFO ] Deduced a trap composed of 218 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:08:58] [INFO ] Deduced a trap composed of 232 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:08:58] [INFO ] Deduced a trap composed of 250 places in 95 ms of which 2 ms to minimize.
[2024-05-29 11:08:58] [INFO ] Deduced a trap composed of 264 places in 96 ms of which 2 ms to minimize.
[2024-05-29 11:08:59] [INFO ] Deduced a trap composed of 278 places in 108 ms of which 2 ms to minimize.
[2024-05-29 11:08:59] [INFO ] Deduced a trap composed of 290 places in 104 ms of which 3 ms to minimize.
[2024-05-29 11:08:59] [INFO ] Deduced a trap composed of 305 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 352 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 21/21 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1841 places, 783/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61645 ms. Remains : 933/1841 places, 783/1691 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-00
Product exploration explored 100000 steps with 89 reset in 724 ms.
Product exploration explored 100000 steps with 85 reset in 805 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2497 steps (0 resets) in 37 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:09:04] [INFO ] Invariant cache hit.
[2024-05-29 11:09:04] [INFO ] [Real]Absence check using 331 positive place invariants in 144 ms returned sat
[2024-05-29 11:09:06] [INFO ] [Real]Absence check using state equation in 1628 ms returned sat
[2024-05-29 11:09:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:09:07] [INFO ] [Nat]Absence check using 331 positive place invariants in 143 ms returned sat
[2024-05-29 11:09:08] [INFO ] [Nat]Absence check using state equation in 1376 ms returned sat
[2024-05-29 11:09:08] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-29 11:09:08] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:09:08] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-29 11:09:08] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:09:08] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:09:08] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-29 11:09:09] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-05-29 11:09:09] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:09:09] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 11:09:09] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-29 11:09:09] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:09:09] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:09:09] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-05-29 11:09:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1313 ms
[2024-05-29 11:09:09] [INFO ] Computed and/alt/rep : 780/1497/780 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-29 11:09:21] [INFO ] Added : 655 causal constraints over 131 iterations in 11713 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 31 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 11:09:21] [INFO ] Invariant cache hit.
[2024-05-29 11:09:21] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-29 11:09:21] [INFO ] Invariant cache hit.
[2024-05-29 11:09:22] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2024-05-29 11:09:22] [INFO ] Redundant transitions in 63 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:09:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:09:41] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1716 variables, and 331 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 1/933 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:10:15] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:10:15] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:10:15] [INFO ] Deduced a trap composed of 60 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:10:16] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:10:16] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:10:16] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:10:16] [INFO ] Deduced a trap composed of 116 places in 60 ms of which 2 ms to minimize.
[2024-05-29 11:10:16] [INFO ] Deduced a trap composed of 131 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:10:17] [INFO ] Deduced a trap composed of 145 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:10:17] [INFO ] Deduced a trap composed of 163 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:10:17] [INFO ] Deduced a trap composed of 177 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:10:17] [INFO ] Deduced a trap composed of 188 places in 70 ms of which 2 ms to minimize.
[2024-05-29 11:10:18] [INFO ] Deduced a trap composed of 208 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:10:18] [INFO ] Deduced a trap composed of 218 places in 89 ms of which 2 ms to minimize.
[2024-05-29 11:10:18] [INFO ] Deduced a trap composed of 232 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:10:18] [INFO ] Deduced a trap composed of 250 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:10:19] [INFO ] Deduced a trap composed of 264 places in 103 ms of which 2 ms to minimize.
[2024-05-29 11:10:19] [INFO ] Deduced a trap composed of 278 places in 102 ms of which 3 ms to minimize.
[2024-05-29 11:10:20] [INFO ] Deduced a trap composed of 290 places in 110 ms of which 3 ms to minimize.
[2024-05-29 11:10:20] [INFO ] Deduced a trap composed of 305 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 1)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 1)
(s347 0)
(s348 1)
(s349 0)
(s350 1)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 1)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 1)
(s409 0)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 1)
(s447 0)
(s448 1)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 0)
(s460 1)
(s461 0)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 1)
(s471 0)
(s472 1)
(s473 0)
(s474 1)
(s475 0)
(s476 0)
(s477 1)
(s478 0)
(s479 1)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 0)
(s486 0)
(s487 1)
(s488 0)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 1)
(s500 0)
(s501 1)
(s502 0)
(s503 1)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 1)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 1)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 0)
(s522 1)
(s523 0)
(s524 0)
(s525 1)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 1)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 1)
(s542 0)
(s543 0)
(s544 1)
(s545 0)
(s546 1)
(s547 0)
(s548 0)
(s549 1)
(s550 0)
(s551 0)
(s552 0)
(s553 1)
(s554 0)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 0)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 1)
(s566 0)
(s567 1)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 1)
(s573 0)
(s574 0)
(s575 1)
(s576 0)
(s577 1)
(s578 0)
(s579 0)
(s580 1)
(s581 0)
(s582 0)
(s583 0)
(s584 1)
(s585 0)
(s586 0)
(s587 1)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 1)
(s593 0)
(s594 1)
(s595 0)
(s596 1)
(s597 0)
(s598 1)
(s599 0)
(s600 0)
(s601 1)
(s602 0)
(s603 1)
(s604 0)
(s605 0)
(s606 1)
(s607 0)
(s608 1)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 0)
(s614 0)
(s615 1)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 1)
(s624 0)
(s625 1)
(s626 0)
(s627 1)
(s628 0)
(s629 1)
(s630 0)
(s631 0)
(s632 1)
(s633 0)
(s634 1)
(s635 0)
(s636 0)
(s637 1)
(s638 0)
(s639 1)
(s640 0)
(s641 0)
(s642 1)
(s643 0)
(s644 0)
(s645 0)
(s646 1)
(s647 0)
(s648 0)
(s649 1)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 1)
(s655 0)
(s656 1)
(s657 0)
(s658 1)
(s659 0)
(s660 1)
(s661 0)
(s662 0)
(s663 1)
(s664 0)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 1)
(s671 0)
(s672 0)
(s673 1)
(s674 0)
(s675 0)
(s676 0)
(s677 1)
(s678 0)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 1)
(s686 0)
(s687 1)
(s688 0)
(s689 1)
(s690 0)
(s691 1)
(s692 0)
(s693 0)
(s694 1)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 1)
(s700 0)
(s701 1)
(s702 0)
(s703 0)
(s704 1)
(s705 0)
(s706 0)
(s707 0)
(s708 1)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 1)
(s717 0)
(s718 1)
(s719 0)
(s720 1)
(s721 0)
(s722 1)
(s723 0)
(s724 0)
(s725 1)
(s726 0)
(s727 1)
(s728 0)
(s729 0)
(s730 1)
(s731 0)
(s732 1)
(s733 0)
(s734 0)
(s735 1)
(s736 0)
(s737 0)
(s738 0)
(s739 1)
(s740 0)
(s741 0)
(s742 1)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 1)
(s748 0)
(s749 1)
(s750 0)
(s751 1)
(s752 0)
(s753 1)
(s754 0)
(s755 0)
(s756 1)
(s757 0)
(s758 1)
(s759 0)
(s760 0)
(s761 1)
(s762 0)
(s763 1)
(s764 0)
(s765 0)
(s766 1)
(s767 0)
(s768 0)
(s769 0)
(s770 1)
(s771 0)
(s772 0)
(s773 1)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 1)
(s779 0)
(s780 1)
(s781 0)
(s782 1)
(s783 0)
(s784 1)
(s785 0)
(s786 0)
(s787 1)
(s788 0)
(s789 1)
(s790 0)
(s791 0)
(s792 1)
(s793 0)
(s794 1)
(s795 0)
(s796 0)
(s797 1)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 1)
(s803 0)
(s804 0)
(s805 1)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 1)
(s811 0)
(s812 1)
(s813 0)
(s814 1)
(s815 0)
(s816 1)
(s817 0)
(s818 0)
(s819 1)
(s820 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 352 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 21/21 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61400 ms. Remains : 933/933 places, 783/783 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4036 steps (0 resets) in 45 ms. (87 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:10:23] [INFO ] Invariant cache hit.
[2024-05-29 11:10:23] [INFO ] [Real]Absence check using 331 positive place invariants in 150 ms returned sat
[2024-05-29 11:10:25] [INFO ] [Real]Absence check using state equation in 1634 ms returned sat
[2024-05-29 11:10:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:10:26] [INFO ] [Nat]Absence check using 331 positive place invariants in 139 ms returned sat
[2024-05-29 11:10:27] [INFO ] [Nat]Absence check using state equation in 1321 ms returned sat
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1185 ms
[2024-05-29 11:10:28] [INFO ] Computed and/alt/rep : 780/1497/780 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-29 11:10:40] [INFO ] Added : 665 causal constraints over 133 iterations in 11914 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 85 reset in 624 ms.
Product exploration explored 100000 steps with 90 reset in 767 ms.
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 24 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 11:10:42] [INFO ] Invariant cache hit.
[2024-05-29 11:10:42] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-29 11:10:42] [INFO ] Invariant cache hit.
[2024-05-29 11:10:43] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2024-05-29 11:10:43] [INFO ] Redundant transitions in 6 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:10:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:11:02] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1716 variables, and 331 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 1/933 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:11:36] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:11:36] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:11:36] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:11:37] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:11:37] [INFO ] Deduced a trap composed of 87 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:11:37] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:11:37] [INFO ] Deduced a trap composed of 116 places in 49 ms of which 2 ms to minimize.
[2024-05-29 11:11:37] [INFO ] Deduced a trap composed of 131 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:11:38] [INFO ] Deduced a trap composed of 145 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:11:38] [INFO ] Deduced a trap composed of 163 places in 66 ms of which 1 ms to minimize.
[2024-05-29 11:11:38] [INFO ] Deduced a trap composed of 177 places in 72 ms of which 2 ms to minimize.
[2024-05-29 11:11:38] [INFO ] Deduced a trap composed of 188 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:11:39] [INFO ] Deduced a trap composed of 208 places in 99 ms of which 2 ms to minimize.
[2024-05-29 11:11:39] [INFO ] Deduced a trap composed of 218 places in 85 ms of which 1 ms to minimize.
[2024-05-29 11:11:39] [INFO ] Deduced a trap composed of 232 places in 89 ms of which 2 ms to minimize.
[2024-05-29 11:11:40] [INFO ] Deduced a trap composed of 250 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:11:40] [INFO ] Deduced a trap composed of 264 places in 95 ms of which 2 ms to minimize.
[2024-05-29 11:11:40] [INFO ] Deduced a trap composed of 278 places in 104 ms of which 2 ms to minimize.
[2024-05-29 11:11:41] [INFO ] Deduced a trap composed of 290 places in 110 ms of which 2 ms to minimize.
[2024-05-29 11:11:41] [INFO ] Deduced a trap composed of 305 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 352 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 21/21 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61552 ms. Remains : 933/933 places, 783/783 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-00 finished in 223517 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((G(p1)||p0))))'
Support contains 4 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1840 transition count 1478
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1628 transition count 1478
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 424 place count 1628 transition count 1329
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 722 place count 1479 transition count 1329
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 731 place count 1470 transition count 1320
Iterating global reduction 2 with 9 rules applied. Total rules applied 740 place count 1470 transition count 1320
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 740 place count 1470 transition count 1313
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 754 place count 1463 transition count 1313
Performed 527 Post agglomeration using F-continuation condition.Transition count delta: 527
Deduced a syphon composed of 527 places in 1 ms
Reduce places removed 527 places and 0 transitions.
Iterating global reduction 2 with 1054 rules applied. Total rules applied 1808 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1810 place count 934 transition count 784
Applied a total of 1810 rules in 283 ms. Remains 934 /1841 variables (removed 907) and now considering 784/1691 (removed 907) transitions.
// Phase 1: matrix 784 rows 934 cols
[2024-05-29 11:11:44] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 11:11:44] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-29 11:11:44] [INFO ] Invariant cache hit.
[2024-05-29 11:11:45] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2024-05-29 11:11:45] [INFO ] Redundant transitions in 7 ms returned []
Running 782 sub problems to find dead transitions.
[2024-05-29 11:11:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:12:03] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:12:03] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:12:03] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:12:03] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:12:03] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-05-29 11:12:04] [INFO ] Deduced a trap composed of 70 places in 45 ms of which 4 ms to minimize.
[2024-05-29 11:12:04] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 0 ms to minimize.
[2024-05-29 11:12:04] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 2 ms to minimize.
[2024-05-29 11:12:04] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 2 ms to minimize.
[2024-05-29 11:12:05] [INFO ] Deduced a trap composed of 112 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:12:05] [INFO ] Deduced a trap composed of 127 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:12:05] [INFO ] Deduced a trap composed of 142 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:12:05] [INFO ] Deduced a trap composed of 154 places in 75 ms of which 2 ms to minimize.
[2024-05-29 11:12:06] [INFO ] Deduced a trap composed of 171 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:12:06] [INFO ] Deduced a trap composed of 183 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:12:06] [INFO ] Deduced a trap composed of 197 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:12:06] [INFO ] Deduced a trap composed of 208 places in 89 ms of which 2 ms to minimize.
[2024-05-29 11:12:07] [INFO ] Deduced a trap composed of 226 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:12:07] [INFO ] Deduced a trap composed of 244 places in 104 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1718 variables, and 350 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:12:24] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 0 ms to minimize.
[2024-05-29 11:12:24] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:12:24] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:12:24] [INFO ] Deduced a trap composed of 96 places in 50 ms of which 2 ms to minimize.
[2024-05-29 11:12:25] [INFO ] Deduced a trap composed of 141 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:12:25] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (OVERLAPS) 784/1718 variables, 934/1290 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1718 variables, 782/2072 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2072 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 934/934 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 25/25 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in SI_LTL mode, iteration 1 : 934/1841 places, 784/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61669 ms. Remains : 934/1841 places, 784/1691 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-01
Product exploration explored 100000 steps with 49 reset in 656 ms.
Product exploration explored 100000 steps with 49 reset in 768 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 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7346 steps (0 resets) in 77 ms. (94 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 324 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 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 21 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2024-05-29 11:12:47] [INFO ] Invariant cache hit.
[2024-05-29 11:12:47] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-29 11:12:47] [INFO ] Invariant cache hit.
[2024-05-29 11:12:48] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2024-05-29 11:12:48] [INFO ] Redundant transitions in 7 ms returned []
Running 782 sub problems to find dead transitions.
[2024-05-29 11:12:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:13:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:13:06] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:13:06] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 11:13:06] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:13:07] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2024-05-29 11:13:07] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:13:07] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:13:07] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 2 ms to minimize.
[2024-05-29 11:13:07] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 2 ms to minimize.
[2024-05-29 11:13:08] [INFO ] Deduced a trap composed of 112 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:13:08] [INFO ] Deduced a trap composed of 127 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:13:08] [INFO ] Deduced a trap composed of 142 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:13:08] [INFO ] Deduced a trap composed of 154 places in 70 ms of which 1 ms to minimize.
[2024-05-29 11:13:09] [INFO ] Deduced a trap composed of 171 places in 73 ms of which 2 ms to minimize.
[2024-05-29 11:13:09] [INFO ] Deduced a trap composed of 183 places in 86 ms of which 1 ms to minimize.
[2024-05-29 11:13:09] [INFO ] Deduced a trap composed of 197 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:13:09] [INFO ] Deduced a trap composed of 208 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:13:10] [INFO ] Deduced a trap composed of 226 places in 95 ms of which 2 ms to minimize.
[2024-05-29 11:13:10] [INFO ] Deduced a trap composed of 244 places in 97 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 782 unsolved
(s900 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 1.0)
(s632 0.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 1.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 1.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 1.0)
(s749 0.0)
(s750 1.0)
(s751 1.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 1.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 1.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 1.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 1.0)
(s781 0.0)
(s782 1.0)
(s783 0.0)
(s784 0.0)
(s785 1.0)
(s786 0.0)
(s787 1.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 1.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 1.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 1.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 1.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 1.0)
(s817 0.0)
(s818 1.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 0.0)
(s823 1.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 0.0)
(s828 1.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 1.0)
(s833 0.0)
(s834 1.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 1.0)
(s845 0.0)
(s846 0.0)
(s847 1.0)
(s848 0.0)
(s849 1.0)
(s850 0.0)
(s851 0.0)
(s852 1.0)
(s853 0.0)
(s854 1.0)
(s855 0.0)
(s856 0.0)
(s857 1.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 1.0)
(s864 0.0)
(s865 1.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 1.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 1.0)
(s874 0.0)
(s875 1.0)
(s876 0.0)
(s877 0.0)
(s878 1.0)
(s879 0.0)
(s880 1.0)
(s881 0.0)
(s882 0.0)
(s883 1.0)
(s884 0.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 1.0)
(s895 0.0)
(s896 1.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1718 variables, and 350 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:13:27] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:13:27] [INFO ] Deduced a trap composed of 53 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:13:27] [INFO ] Deduced a trap composed of 53 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:13:28] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:13:28] [INFO ] Deduced a trap composed of 141 places in 77 ms of which 2 ms to minimize.
[2024-05-29 11:13:28] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (OVERLAPS) 784/1718 variables, 934/1290 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1718 variables, 782/2072 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2072 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 934/934 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 25/25 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61290 ms. Remains : 934/934 places, 784/784 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 p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7219 steps (0 resets) in 80 ms. (89 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 256 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 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 49 reset in 644 ms.
Product exploration explored 100000 steps with 49 reset in 779 ms.
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 17 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2024-05-29 11:13:51] [INFO ] Invariant cache hit.
[2024-05-29 11:13:51] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-29 11:13:51] [INFO ] Invariant cache hit.
[2024-05-29 11:13:52] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2024-05-29 11:13:52] [INFO ] Redundant transitions in 6 ms returned []
Running 782 sub problems to find dead transitions.
[2024-05-29 11:13:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:14:10] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:14:10] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-29 11:14:10] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:14:10] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
[2024-05-29 11:14:10] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:14:11] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:14:11] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:14:11] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:14:11] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 2 ms to minimize.
[2024-05-29 11:14:11] [INFO ] Deduced a trap composed of 112 places in 59 ms of which 2 ms to minimize.
[2024-05-29 11:14:12] [INFO ] Deduced a trap composed of 127 places in 64 ms of which 2 ms to minimize.
[2024-05-29 11:14:12] [INFO ] Deduced a trap composed of 142 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:14:12] [INFO ] Deduced a trap composed of 154 places in 69 ms of which 2 ms to minimize.
[2024-05-29 11:14:12] [INFO ] Deduced a trap composed of 171 places in 69 ms of which 1 ms to minimize.
[2024-05-29 11:14:13] [INFO ] Deduced a trap composed of 183 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:14:13] [INFO ] Deduced a trap composed of 197 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:14:13] [INFO ] Deduced a trap composed of 208 places in 88 ms of which 3 ms to minimize.
[2024-05-29 11:14:14] [INFO ] Deduced a trap composed of 226 places in 96 ms of which 2 ms to minimize.
[2024-05-29 11:14:14] [INFO ] Deduced a trap composed of 244 places in 101 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1718 variables, and 350 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:14:31] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:14:31] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:14:31] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:14:31] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:14:32] [INFO ] Deduced a trap composed of 141 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:14:32] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (OVERLAPS) 784/1718 variables, 934/1290 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1718 variables, 782/2072 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2072 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 934/934 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 25/25 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61270 ms. Remains : 934/934 places, 784/784 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-01 finished in 188619 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((p0&&X(G(p1)))))'
Support contains 3 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1840 transition count 1478
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1628 transition count 1478
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1628 transition count 1328
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1478 transition count 1328
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 732 place count 1470 transition count 1320
Iterating global reduction 2 with 8 rules applied. Total rules applied 740 place count 1470 transition count 1320
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 740 place count 1470 transition count 1314
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 752 place count 1464 transition count 1314
Performed 530 Post agglomeration using F-continuation condition.Transition count delta: 530
Deduced a syphon composed of 530 places in 1 ms
Reduce places removed 530 places and 0 transitions.
Iterating global reduction 2 with 1060 rules applied. Total rules applied 1812 place count 934 transition count 784
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1814 place count 932 transition count 782
Applied a total of 1814 rules in 241 ms. Remains 932 /1841 variables (removed 909) and now considering 782/1691 (removed 909) transitions.
// Phase 1: matrix 782 rows 932 cols
[2024-05-29 11:14:52] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 11:14:53] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-29 11:14:53] [INFO ] Invariant cache hit.
[2024-05-29 11:14:53] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2024-05-29 11:14:53] [INFO ] Redundant transitions in 7 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:14:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:15:12] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:15:13] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:15:13] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:15:13] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:15:13] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:15:13] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:15:14] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:15:14] [INFO ] Deduced a trap composed of 113 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:15:14] [INFO ] Deduced a trap composed of 129 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:15:14] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:15:15] [INFO ] Deduced a trap composed of 159 places in 60 ms of which 2 ms to minimize.
[2024-05-29 11:15:15] [INFO ] Deduced a trap composed of 175 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:15:15] [INFO ] Deduced a trap composed of 191 places in 77 ms of which 1 ms to minimize.
[2024-05-29 11:15:15] [INFO ] Deduced a trap composed of 205 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:15:16] [INFO ] Deduced a trap composed of 215 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:15:16] [INFO ] Deduced a trap composed of 235 places in 89 ms of which 2 ms to minimize.
[2024-05-29 11:15:16] [INFO ] Deduced a trap composed of 248 places in 95 ms of which 2 ms to minimize.
[2024-05-29 11:15:17] [INFO ] Deduced a trap composed of 269 places in 102 ms of which 2 ms to minimize.
[2024-05-29 11:15:17] [INFO ] Deduced a trap composed of 276 places in 105 ms of which 3 ms to minimize.
[2024-05-29 11:15:17] [INFO ] Deduced a trap composed of 294 places in 109 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1714 variables, and 351 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/932 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:15:33] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 113 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 113 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 130 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 130 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 130 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 131 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 132 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 131 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 130 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 129 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:15:35] [INFO ] Deduced a trap composed of 130 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:15:35] [INFO ] Deduced a trap composed of 130 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:15:35] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:15:35] [INFO ] Deduced a trap composed of 143 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:15:35] [INFO ] Deduced a trap composed of 158 places in 73 ms of which 1 ms to minimize.
[2024-05-29 11:15:36] [INFO ] Deduced a trap composed of 189 places in 77 ms of which 2 ms to minimize.
[2024-05-29 11:15:36] [INFO ] Deduced a trap composed of 189 places in 78 ms of which 1 ms to minimize.
[2024-05-29 11:15:36] [INFO ] Deduced a trap composed of 189 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:15:45] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 2 ms to minimize.
[2024-05-29 11:15:45] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:15:45] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:15:46] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:15:46] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:15:46] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 2 ms to minimize.
[2024-05-29 11:15:47] [INFO ] Deduced a trap composed of 129 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:15:47] [INFO ] Deduced a trap composed of 143 places in 98 ms of which 3 ms to minimize.
[2024-05-29 11:15:48] [INFO ] Deduced a trap composed of 173 places in 95 ms of which 2 ms to minimize.
[2024-05-29 11:15:49] [INFO ] Deduced a trap composed of 231 places in 109 ms of which 3 ms to minimize.
[2024-05-29 11:15:49] [INFO ] Deduced a trap composed of 246 places in 118 ms of which 2 ms to minimize.
[2024-05-29 11:15:49] [INFO ] Deduced a trap composed of 259 places in 125 ms of which 3 ms to minimize.
[2024-05-29 11:15:50] [INFO ] Deduced a trap composed of 272 places in 126 ms of which 3 ms to minimize.
[2024-05-29 11:15:50] [INFO ] Deduced a trap composed of 291 places in 132 ms of which 3 ms to minimize.
[2024-05-29 11:15:51] [INFO ] Deduced a trap composed of 302 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/932 variables, 15/386 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1714 variables, and 386 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/932 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 55/55 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in SI_LTL mode, iteration 1 : 932/1841 places, 782/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61747 ms. Remains : 932/1841 places, 782/1691 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-02
Stuttering criterion allowed to conclude after 2075 steps with 0 reset in 19 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-02 finished in 61875 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(((p0||G(p1)) U X(p2))))'
Support contains 5 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1832 transition count 1682
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1832 transition count 1682
Applied a total of 18 rules in 106 ms. Remains 1832 /1841 variables (removed 9) and now considering 1682/1691 (removed 9) transitions.
// Phase 1: matrix 1682 rows 1832 cols
[2024-05-29 11:15:54] [INFO ] Computed 331 invariants in 11 ms
[2024-05-29 11:15:54] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-29 11:15:54] [INFO ] Invariant cache hit.
[2024-05-29 11:15:56] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Running 1681 sub problems to find dead transitions.
[2024-05-29 11:15:56] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1831/3514 variables, and 0 constraints, problems are : Problem set: 0 solved, 1681 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1832 constraints, PredecessorRefiner: 1681/1681 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1831/3514 variables, and 0 constraints, problems are : Problem set: 0 solved, 1681 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1832 constraints, PredecessorRefiner: 0/1681 constraints, Known Traps: 0/0 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 1681 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in LTL mode, iteration 1 : 1832/1841 places, 1682/1691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62568 ms. Remains : 1832/1841 places, 1682/1691 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-03
Product exploration explored 100000 steps with 33456 reset in 362 ms.
Product exploration explored 100000 steps with 33328 reset in 358 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1832 stabilizing places and 359/1682 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 120 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (8 resets) in 401 ms. (99 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
[2024-05-29 11:16:58] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 5/3514 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p0 (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (OR p2 (NOT p0)) (OR p2 (NOT p1))))), (F p1), (F p0)]
Knowledge based reduction with 20 factoid took 563 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Support contains 5 out of 1832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1832/1832 places, 1682/1682 transitions.
Applied a total of 0 rules in 51 ms. Remains 1832 /1832 variables (removed 0) and now considering 1682/1682 (removed 0) transitions.
[2024-05-29 11:16:59] [INFO ] Invariant cache hit.
[2024-05-29 11:16:59] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-29 11:16:59] [INFO ] Invariant cache hit.
[2024-05-29 11:17:01] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
Running 1681 sub problems to find dead transitions.
[2024-05-29 11:17:01] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1831/3514 variables, and 0 constraints, problems are : Problem set: 0 solved, 1681 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1832 constraints, PredecessorRefiner: 1681/1681 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1831/3514 variables, and 0 constraints, problems are : Problem set: 0 solved, 1681 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1832 constraints, PredecessorRefiner: 0/1681 constraints, Known Traps: 0/0 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 1681 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Finished structural reductions in LTL mode , in 1 iterations and 62525 ms. Remains : 1832/1832 places, 1682/1682 transitions.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1832 stabilizing places and 359/1682 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 148 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (NOT p2), (NOT p2), true]
RANDOM walk for 35978 steps (8 resets) in 316 ms. (113 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 (NOT p0)))), (F p1), (F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 397 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 33197 reset in 348 ms.
Product exploration explored 100000 steps with 33281 reset in 354 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Support contains 5 out of 1832 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1832/1832 places, 1682/1682 transitions.
Performed 209 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 1832 transition count 1682
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 63 Pre rules applied. Total rules applied 209 place count 1832 transition count 1683
Deduced a syphon composed of 272 places in 2 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 272 place count 1832 transition count 1683
Performed 623 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 895 places in 1 ms
Iterating global reduction 1 with 623 rules applied. Total rules applied 895 place count 1832 transition count 1683
Renaming transitions due to excessive name length > 1024 char.
Discarding 212 places :
Symmetric choice reduction at 1 with 212 rule applications. Total rules 1107 place count 1620 transition count 1471
Deduced a syphon composed of 683 places in 1 ms
Iterating global reduction 1 with 212 rules applied. Total rules applied 1319 place count 1620 transition count 1471
Deduced a syphon composed of 683 places in 1 ms
Applied a total of 1319 rules in 546 ms. Remains 1620 /1832 variables (removed 212) and now considering 1471/1682 (removed 211) transitions.
[2024-05-29 11:18:04] [INFO ] Redundant transitions in 24 ms returned []
Running 1470 sub problems to find dead transitions.
// Phase 1: matrix 1471 rows 1620 cols
[2024-05-29 11:18:04] [INFO ] Computed 331 invariants in 12 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1619/3091 variables, and 0 constraints, problems are : Problem set: 0 solved, 1470 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1620 constraints, PredecessorRefiner: 1470/1470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1619/3091 variables, and 0 constraints, problems are : Problem set: 0 solved, 1470 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1620 constraints, PredecessorRefiner: 0/1470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60912ms problems are : Problem set: 0 solved, 1470 unsolved
Search for dead transitions found 0 dead transitions in 60924ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1620/1832 places, 1471/1682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61531 ms. Remains : 1620/1832 places, 1471/1682 transitions.
Support contains 5 out of 1832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1832/1832 places, 1682/1682 transitions.
Applied a total of 0 rules in 58 ms. Remains 1832 /1832 variables (removed 0) and now considering 1682/1682 (removed 0) transitions.
// Phase 1: matrix 1682 rows 1832 cols
[2024-05-29 11:19:05] [INFO ] Computed 331 invariants in 9 ms
[2024-05-29 11:19:06] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-29 11:19:06] [INFO ] Invariant cache hit.
[2024-05-29 11:19:07] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
Running 1681 sub problems to find dead transitions.
[2024-05-29 11:19:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1831/3514 variables, and 0 constraints, problems are : Problem set: 0 solved, 1681 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1832 constraints, PredecessorRefiner: 1681/1681 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1831/3514 variables, and 0 constraints, problems are : Problem set: 0 solved, 1681 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1832 constraints, PredecessorRefiner: 0/1681 constraints, Known Traps: 0/0 constraints]
After SMT, in 60392ms problems are : Problem set: 0 solved, 1681 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Finished structural reductions in LTL mode , in 1 iterations and 62622 ms. Remains : 1832/1832 places, 1682/1682 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-03 finished in 253858 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(p0)||G((p1||F(p0)))))'
Support contains 3 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1840 transition count 1480
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1630 transition count 1480
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 420 place count 1630 transition count 1330
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 720 place count 1480 transition count 1330
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 728 place count 1472 transition count 1322
Iterating global reduction 2 with 8 rules applied. Total rules applied 736 place count 1472 transition count 1322
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 736 place count 1472 transition count 1316
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 748 place count 1466 transition count 1316
Performed 530 Post agglomeration using F-continuation condition.Transition count delta: 530
Deduced a syphon composed of 530 places in 1 ms
Reduce places removed 530 places and 0 transitions.
Iterating global reduction 2 with 1060 rules applied. Total rules applied 1808 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1810 place count 934 transition count 784
Applied a total of 1810 rules in 259 ms. Remains 934 /1841 variables (removed 907) and now considering 784/1691 (removed 907) transitions.
// Phase 1: matrix 784 rows 934 cols
[2024-05-29 11:20:08] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 11:20:08] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-29 11:20:08] [INFO ] Invariant cache hit.
[2024-05-29 11:20:09] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
[2024-05-29 11:20:09] [INFO ] Redundant transitions in 7 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:20:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 2/934 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:20:39] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 11:20:39] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1718 variables, and 333 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 2/934 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (OVERLAPS) 784/1718 variables, 934/1267 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1718 variables, 780/2047 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2047 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 934/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 2/2 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 934/1841 places, 784/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61678 ms. Remains : 934/1841 places, 784/1691 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-05
Product exploration explored 100000 steps with 54 reset in 637 ms.
Product exploration explored 100000 steps with 55 reset in 771 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/934 stabilizing places and 2/784 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 420 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7373 steps (0 resets) in 71 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 4 factoid took 459 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:21:12] [INFO ] Invariant cache hit.
[2024-05-29 11:21:13] [INFO ] [Real]Absence check using 331 positive place invariants in 144 ms returned sat
[2024-05-29 11:21:14] [INFO ] [Real]Absence check using state equation in 1579 ms returned sat
[2024-05-29 11:21:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:21:15] [INFO ] [Nat]Absence check using 331 positive place invariants in 143 ms returned sat
[2024-05-29 11:21:16] [INFO ] [Nat]Absence check using state equation in 1344 ms returned sat
[2024-05-29 11:21:16] [INFO ] Computed and/alt/rep : 780/1501/780 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-29 11:21:28] [INFO ] Added : 644 causal constraints over 129 iterations in 11917 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 934 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 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 24 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2024-05-29 11:21:28] [INFO ] Invariant cache hit.
[2024-05-29 11:21:29] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-29 11:21:29] [INFO ] Invariant cache hit.
[2024-05-29 11:21:29] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
[2024-05-29 11:21:29] [INFO ] Redundant transitions in 7 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:21:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 2/934 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:21:59] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:21:59] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1718 variables, and 333 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 2/934 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (OVERLAPS) 784/1718 variables, 934/1267 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1718 variables, 780/2047 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2047 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 934/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 2/2 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61334 ms. Remains : 934/934 places, 784/784 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7408 steps (0 resets) in 80 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 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 74 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:22:30] [INFO ] Invariant cache hit.
[2024-05-29 11:22:31] [INFO ] [Real]Absence check using 331 positive place invariants in 143 ms returned sat
[2024-05-29 11:22:32] [INFO ] [Real]Absence check using state equation in 1608 ms returned sat
[2024-05-29 11:22:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:22:33] [INFO ] [Nat]Absence check using 331 positive place invariants in 148 ms returned sat
[2024-05-29 11:22:34] [INFO ] [Nat]Absence check using state equation in 1375 ms returned sat
[2024-05-29 11:22:34] [INFO ] Computed and/alt/rep : 780/1501/780 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-29 11:22:46] [INFO ] Added : 644 causal constraints over 129 iterations in 12019 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 55 reset in 631 ms.
Product exploration explored 100000 steps with 55 reset in 784 ms.
Support contains 2 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 932 transition count 782
Applied a total of 1 rules in 36 ms. Remains 932 /934 variables (removed 2) and now considering 782/784 (removed 2) transitions.
// Phase 1: matrix 782 rows 932 cols
[2024-05-29 11:22:48] [INFO ] Computed 331 invariants in 6 ms
[2024-05-29 11:22:48] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-29 11:22:48] [INFO ] Invariant cache hit.
[2024-05-29 11:22:49] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
[2024-05-29 11:22:49] [INFO ] Redundant transitions in 7 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:22:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (OVERLAPS) 1/932 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
(s291 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0timeout
)
(s292 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1714 variables, and 331 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/932 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (OVERLAPS) 1/932 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/932 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 4 (OVERLAPS) 782/1714 variables, 932/1263 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1714 variables, 779/2042 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1714/1714 variables, and 2042 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 932/932 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 932/934 places, 782/784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61377 ms. Remains : 932/934 places, 782/784 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-05 finished in 221575 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' '!((((p0 U p1) U !p0)||G(!p1)))'
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1840 transition count 1479
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1629 transition count 1479
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1629 transition count 1329
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1479 transition count 1329
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 729 place count 1472 transition count 1322
Iterating global reduction 2 with 7 rules applied. Total rules applied 736 place count 1472 transition count 1322
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 736 place count 1472 transition count 1316
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 748 place count 1466 transition count 1316
Performed 531 Post agglomeration using F-continuation condition.Transition count delta: 531
Deduced a syphon composed of 531 places in 1 ms
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 2 with 1062 rules applied. Total rules applied 1810 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1812 place count 933 transition count 783
Applied a total of 1812 rules in 200 ms. Remains 933 /1841 variables (removed 908) and now considering 783/1691 (removed 908) transitions.
// Phase 1: matrix 783 rows 933 cols
[2024-05-29 11:23:49] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 11:23:50] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-29 11:23:50] [INFO ] Invariant cache hit.
[2024-05-29 11:23:51] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
[2024-05-29 11:23:51] [INFO ] Redundant transitions in 8 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:23:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:24:10] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:24:10] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:24:10] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-05-29 11:24:10] [INFO ] Deduced a trap composed of 56 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:24:11] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:24:11] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 2 ms to minimize.
[2024-05-29 11:24:11] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:24:11] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 2 ms to minimize.
[2024-05-29 11:24:12] [INFO ] Deduced a trap composed of 142 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:24:12] [INFO ] Deduced a trap composed of 158 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:24:12] [INFO ] Deduced a trap composed of 176 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:24:12] [INFO ] Deduced a trap composed of 188 places in 77 ms of which 2 ms to minimize.
[2024-05-29 11:24:13] [INFO ] Deduced a trap composed of 206 places in 87 ms of which 5 ms to minimize.
[2024-05-29 11:24:13] [INFO ] Deduced a trap composed of 216 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:24:13] [INFO ] Deduced a trap composed of 231 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:24:14] [INFO ] Deduced a trap composed of 247 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:24:14] [INFO ] Deduced a trap composed of 264 places in 103 ms of which 2 ms to minimize.
[2024-05-29 11:24:14] [INFO ] Deduced a trap composed of 276 places in 108 ms of which 3 ms to minimize.
[2024-05-29 11:24:15] [INFO ] Deduced a trap composed of 292 places in 108 ms of which 2 ms to minimize.
[2024-05-29 11:24:15] [INFO ] Deduced a trap composed of 303 places in 114 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1716 variables, and 350 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 104 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 101 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 101 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 99 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:24:32] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:24:32] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 2 ms to minimize.
[2024-05-29 11:24:32] [INFO ] Deduced a trap composed of 103 places in 72 ms of which 2 ms to minimize.
[2024-05-29 11:24:32] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 2 ms to minimize.
[2024-05-29 11:24:32] [INFO ] Deduced a trap composed of 114 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:24:33] [INFO ] Deduced a trap composed of 141 places in 79 ms of which 2 ms to minimize.
[2024-05-29 11:24:33] [INFO ] Deduced a trap composed of 156 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:24:33] [INFO ] Deduced a trap composed of 169 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:24:34] [INFO ] Deduced a trap composed of 168 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:24:34] [INFO ] Deduced a trap composed of 188 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:24:35] [INFO ] Deduced a trap composed of 246 places in 122 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:24:44] [INFO ] Deduced a trap composed of 100 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:24:44] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:24:44] [INFO ] Deduced a trap composed of 104 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 101 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 100 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 101 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 101 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 101 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 99 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 103 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 2 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:24:46] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:24:46] [INFO ] Deduced a trap composed of 112 places in 61 ms of which 2 ms to minimize.
[2024-05-29 11:24:47] [INFO ] Deduced a trap composed of 157 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:24:47] [INFO ] Deduced a trap composed of 172 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:24:47] [INFO ] Deduced a trap composed of 186 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:24:47] [INFO ] Deduced a trap composed of 186 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/932 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1716 variables, and 390 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 60/60 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1841 places, 783/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61591 ms. Remains : 933/1841 places, 783/1691 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, p0, (OR (NOT p1) p0), (AND p0 p1), (AND p0 p1), p1]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-06
Stuttering criterion allowed to conclude after 1980 steps with 0 reset in 19 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-06 finished in 61810 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(p0)))'
Support contains 1 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1833 transition count 1683
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1833 transition count 1683
Applied a total of 16 rules in 112 ms. Remains 1833 /1841 variables (removed 8) and now considering 1683/1691 (removed 8) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2024-05-29 11:24:51] [INFO ] Computed 331 invariants in 15 ms
[2024-05-29 11:24:52] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-29 11:24:52] [INFO ] Invariant cache hit.
[2024-05-29 11:24:53] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 11:24:53] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in LTL mode, iteration 1 : 1833/1841 places, 1683/1691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62579 ms. Remains : 1833/1841 places, 1683/1691 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-08 finished in 62694 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||F(p1)))))'
Support contains 4 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1840 transition count 1479
Reduce places removed 211 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 212 rules applied. Total rules applied 423 place count 1629 transition count 1478
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 424 place count 1628 transition count 1478
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 424 place count 1628 transition count 1328
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 724 place count 1478 transition count 1328
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 733 place count 1469 transition count 1319
Iterating global reduction 3 with 9 rules applied. Total rules applied 742 place count 1469 transition count 1319
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 742 place count 1469 transition count 1312
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 756 place count 1462 transition count 1312
Performed 529 Post agglomeration using F-continuation condition.Transition count delta: 529
Deduced a syphon composed of 529 places in 0 ms
Reduce places removed 529 places and 0 transitions.
Iterating global reduction 3 with 1058 rules applied. Total rules applied 1814 place count 933 transition count 783
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1816 place count 931 transition count 781
Applied a total of 1816 rules in 206 ms. Remains 931 /1841 variables (removed 910) and now considering 781/1691 (removed 910) transitions.
// Phase 1: matrix 781 rows 931 cols
[2024-05-29 11:25:54] [INFO ] Computed 331 invariants in 4 ms
[2024-05-29 11:25:54] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-29 11:25:54] [INFO ] Invariant cache hit.
[2024-05-29 11:25:55] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2024-05-29 11:25:55] [INFO ] Redundant transitions in 8 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:26:16] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:26:16] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:26:16] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:26:16] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:26:17] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:26:17] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:26:17] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 2 ms to minimize.
[2024-05-29 11:26:17] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:26:17] [INFO ] Deduced a trap composed of 129 places in 61 ms of which 2 ms to minimize.
[2024-05-29 11:26:18] [INFO ] Deduced a trap composed of 144 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:26:18] [INFO ] Deduced a trap composed of 159 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:26:18] [INFO ] Deduced a trap composed of 175 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:26:18] [INFO ] Deduced a trap composed of 190 places in 76 ms of which 1 ms to minimize.
[2024-05-29 11:26:19] [INFO ] Deduced a trap composed of 206 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:26:19] [INFO ] Deduced a trap composed of 219 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:26:19] [INFO ] Deduced a trap composed of 232 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:26:20] [INFO ] Deduced a trap composed of 252 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:26:20] [INFO ] Deduced a trap composed of 267 places in 108 ms of which 3 ms to minimize.
[2024-05-29 11:26:20] [INFO ] Deduced a trap composed of 277 places in 109 ms of which 2 ms to minimize.
[2024-05-29 11:26:21] [INFO ] Deduced a trap composed of 293 places in 111 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1712 variables, and 351 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:26:35] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2024-05-29 11:26:36] [INFO ] Deduced a trap composed of 142 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:26:36] [INFO ] Deduced a trap composed of 146 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:26:38] [INFO ] Deduced a trap composed of 310 places in 116 ms of which 2 ms to minimize.
[2024-05-29 11:26:39] [INFO ] Deduced a trap composed of 323 places in 121 ms of which 2 ms to minimize.
[2024-05-29 11:26:39] [INFO ] Deduced a trap composed of 333 places in 123 ms of which 3 ms to minimize.
[2024-05-29 11:26:39] [INFO ] Deduced a trap composed of 352 places in 134 ms of which 3 ms to minimize.
[2024-05-29 11:26:40] [INFO ] Deduced a trap composed of 367 places in 135 ms of which 3 ms to minimize.
[2024-05-29 11:26:40] [INFO ] Deduced a trap composed of 379 places in 146 ms of which 3 ms to minimize.
[2024-05-29 11:26:41] [INFO ] Deduced a trap composed of 391 places in 154 ms of which 4 ms to minimize.
[2024-05-29 11:26:41] [INFO ] Deduced a trap composed of 409 places in 162 ms of which 4 ms to minimize.
[2024-05-29 11:26:42] [INFO ] Deduced a trap composed of 424 places in 166 ms of which 3 ms to minimize.
[2024-05-29 11:26:42] [INFO ] Deduced a trap composed of 436 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 13/364 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:26:53] [INFO ] Deduced a trap composed of 169 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:26:53] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:26:54] [INFO ] Deduced a trap composed of 247 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:26:54] [INFO ] Deduced a trap composed of 252 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:26:54] [INFO ] Deduced a trap composed of 248 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:26:55] [INFO ] Deduced a trap composed of 247 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:26:55] [INFO ] Deduced a trap composed of 247 places in 99 ms of which 2 ms to minimize.
[2024-05-29 11:26:55] [INFO ] Deduced a trap composed of 248 places in 93 ms of which 2 ms to minimize.
[2024-05-29 11:26:55] [INFO ] Deduced a trap composed of 247 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:26:55] [INFO ] Deduced a trap composed of 247 places in 92 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 1)
(s345 0)
(s346 1)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 1)
(s359 0)
(s360 0)
(s361 1)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 1)
(s405 0)
(s406 1)
(s407 0)
(s408 1)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 1)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 1)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 1)
(s445 0)
(s446 1)
(s447 0)
(s448 0)
(s449 1)
(s450 0)
(s451 1)
(s452 0)
(s453 0)
(s454 1)
(s455 0)
(s456 0)
(s457 0)
(s458 1)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 1)
(s469 0)
(s470 1)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 1)
(s476 0)
(s477 1)
(s478 0)
(s479 0)
(s480 1)
(s481 0)
(s482 1)
(s483 0)
(s484 0)
(s485 1)
(s486 0)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 1)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 1)
(s498 0)
(s499 1)
(s500 0)
(s501 1)
(s502 0)
(s503 1)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 1)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 0)
(s516 1)
(s517 0)
(s518 0)
(s519 0)
(s520 1)
(s521 0)
(s522 0)
(s523 1)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 1)
(s529 0)
(s530 1)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 0)
(s537 1)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 1)
(s543 0)
(s544 1)
(s545 0)
(s546 0)
(s547 0)
(s548 1)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 0)
(s554 1)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 1)
(s560 1)
(s561 0)
(s562 0)
(s563 1)
(s564 0)
(s565 1)
(s566 0)
(s567 0)
(s568 1)
(s569 0)
(s570 1)
(s571 0)
(s572 0)
(s573 1)
(s574 0)
(s575 1)
(s576 0)
(s577 1)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 1)
(s585 0)
(s586 0)
(s587 1)
(s588 0)
(s589 0)
(s590 0)
(s591 1)
(s592 0)
(s593 0)
(s594 1)
(s595 0)
(s596 1)
(s597 0)
(s598 0)
(s599 1)
(s600 0)
(s601 1)
(s602 0)
(s603 0)
(s604 1)
(s605 0)
(s606 1)
(s607 0)
(s608 1)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 1)
(s614 1)
(s615 0)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 0)
(s622 1)
(s623 0)
(s624 0)
(s625 1)
(s626 0)
(s627 1)
(s628 0)
(s629 0)
(s630 1)
(s631 0)
(s632 1)
(s633 0)
(s634 0)
(s635 1)
(s636 0)
(s637 1)
(s638 0)
(s639 1)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 1)
(s645 1)
(s646 0)
(s647 0)
(s648 0)
(s649 1)
(s650 0)
(s651 0)
(s652 0)
(s653 1)
(s654 0)
(s655 0)
(s656 1)
(s657 0)
(s658 1)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 0)
(s666 1)
(s667 0)
(s668 1)
(s669 0)
(s670 1)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 1)
(s676 1)
(s677 0)
(s678 0)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 0)
(s684 1)
(s685 0)
(s686 0)
(s687 1)
(s688 0)
(s689 1)
(s690 0)
(s691 0)
(s692 1)
(s693 0)
(s694 1)
(s695 0)
(s696 0)
(s697 1)
(s698 0)
(s699 1)
(s700 0)
(s701 1)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 1)
(s707 1)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 0)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 1)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 1)
(s724 0)
(s725 1)
(s726 0)
(s727 0)
(s728 1)
(s729 0)
(s730 1)
(s731 0)
(s732 1)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 1)
(s738 1)
(s739 0)
(s740 0)
(s741 0)
(s742 1)
(s743 0)
(s744 0)
(s745 0)
(s746 1)
(s747 0)
(s748 0)
(s749 1)
(s750 0)
(s751 1)
(s752 0)
(s753 0)
(s754 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/1712 variables, and 374 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 43/43 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1841 places, 781/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61531 ms. Remains : 931/1841 places, 781/1691 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-09
Product exploration explored 100000 steps with 72 reset in 647 ms.
Product exploration explored 100000 steps with 72 reset in 785 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 p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 81 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6438 steps (1 resets) in 81 ms. (78 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 218 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 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 11:26:57] [INFO ] Invariant cache hit.
[2024-05-29 11:26:58] [INFO ] [Real]Absence check using 331 positive place invariants in 148 ms returned sat
[2024-05-29 11:27:00] [INFO ] [Real]Absence check using state equation in 1578 ms returned sat
[2024-05-29 11:27:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:27:00] [INFO ] [Nat]Absence check using 331 positive place invariants in 148 ms returned sat
[2024-05-29 11:27:02] [INFO ] [Nat]Absence check using state equation in 1470 ms returned sat
[2024-05-29 11:27:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 11:27:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-05-29 11:27:02] [INFO ] Computed and/alt/rep : 779/1494/779 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-29 11:27:15] [INFO ] Added : 650 causal constraints over 130 iterations in 12800 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 23 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2024-05-29 11:27:15] [INFO ] Invariant cache hit.
[2024-05-29 11:27:15] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-29 11:27:15] [INFO ] Invariant cache hit.
[2024-05-29 11:27:16] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2024-05-29 11:27:16] [INFO ] Redundant transitions in 6 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:27:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:27:35] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 11:27:35] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:27:35] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:27:36] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:27:36] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:27:36] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:27:36] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:27:37] [INFO ] Deduced a trap composed of 113 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:27:37] [INFO ] Deduced a trap composed of 129 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:27:37] [INFO ] Deduced a trap composed of 144 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:27:37] [INFO ] Deduced a trap composed of 159 places in 68 ms of which 2 ms to minimize.
[2024-05-29 11:27:37] [INFO ] Deduced a trap composed of 175 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:27:38] [INFO ] Deduced a trap composed of 190 places in 80 ms of which 1 ms to minimize.
[2024-05-29 11:27:38] [INFO ] Deduced a trap composed of 206 places in 75 ms of which 2 ms to minimize.
[2024-05-29 11:27:38] [INFO ] Deduced a trap composed of 219 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:27:39] [INFO ] Deduced a trap composed of 232 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:27:39] [INFO ] Deduced a trap composed of 252 places in 94 ms of which 3 ms to minimize.
[2024-05-29 11:27:39] [INFO ] Deduced a trap composed of 267 places in 101 ms of which 2 ms to minimize.
[2024-05-29 11:27:40] [INFO ] Deduced a trap composed of 277 places in 111 ms of which 2 ms to minimize.
[2024-05-29 11:27:40] [INFO ] Deduced a trap composed of 293 places in 110 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1712 variables, and 351 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:27:56] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:27:56] [INFO ] Deduced a trap composed of 142 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:27:56] [INFO ] Deduced a trap composed of 146 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:27:59] [INFO ] Deduced a trap composed of 310 places in 120 ms of which 2 ms to minimize.
[2024-05-29 11:27:59] [INFO ] Deduced a trap composed of 323 places in 114 ms of which 2 ms to minimize.
[2024-05-29 11:28:00] [INFO ] Deduced a trap composed of 333 places in 124 ms of which 3 ms to minimize.
[2024-05-29 11:28:00] [INFO ] Deduced a trap composed of 352 places in 135 ms of which 2 ms to minimize.
[2024-05-29 11:28:00] [INFO ] Deduced a trap composed of 367 places in 136 ms of which 3 ms to minimize.
[2024-05-29 11:28:01] [INFO ] Deduced a trap composed of 379 places in 140 ms of which 3 ms to minimize.
[2024-05-29 11:28:01] [INFO ] Deduced a trap composed of 391 places in 147 ms of which 4 ms to minimize.
[2024-05-29 11:28:02] [INFO ] Deduced a trap composed of 409 places in 155 ms of which 3 ms to minimize.
[2024-05-29 11:28:02] [INFO ] Deduced a trap composed of 424 places in 148 ms of which 3 ms to minimize.
[2024-05-29 11:28:03] [INFO ] Deduced a trap composed of 436 places in 164 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 13/364 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:28:13] [INFO ] Deduced a trap composed of 169 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:28:13] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-29 11:28:15] [INFO ] Deduced a trap composed of 247 places in 96 ms of which 2 ms to minimize.
[2024-05-29 11:28:15] [INFO ] Deduced a trap composed of 252 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:28:15] [INFO ] Deduced a trap composed of 248 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:28:15] [INFO ] Deduced a trap composed of 247 places in 89 ms of which 2 ms to minimize.
[2024-05-29 11:28:15] [INFO ] Deduced a trap composed of 247 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:28:15] [INFO ] Deduced a trap composed of 248 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:28:15] [INFO ] Deduced a trap composed of 247 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:28:15] [INFO ] Deduced a trap composed of 247 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/1712 variables, and 374 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 43/43 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61355 ms. Remains : 931/931 places, 781/781 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 p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 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 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5723 steps (0 resets) in 48 ms. (116 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 217 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 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 11:28:17] [INFO ] Invariant cache hit.
[2024-05-29 11:28:17] [INFO ] [Real]Absence check using 331 positive place invariants in 147 ms returned sat
[2024-05-29 11:28:19] [INFO ] [Real]Absence check using state equation in 1584 ms returned sat
[2024-05-29 11:28:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:28:19] [INFO ] [Nat]Absence check using 331 positive place invariants in 152 ms returned sat
[2024-05-29 11:28:21] [INFO ] [Nat]Absence check using state equation in 1475 ms returned sat
[2024-05-29 11:28:21] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-29 11:28:21] [INFO ] Computed and/alt/rep : 779/1494/779 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-29 11:28:34] [INFO ] Added : 655 causal constraints over 131 iterations in 12775 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 73 reset in 647 ms.
Product exploration explored 100000 steps with 73 reset in 821 ms.
Support contains 4 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 18 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2024-05-29 11:28:35] [INFO ] Invariant cache hit.
[2024-05-29 11:28:36] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-29 11:28:36] [INFO ] Invariant cache hit.
[2024-05-29 11:28:36] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2024-05-29 11:28:37] [INFO ] Redundant transitions in 8 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:28:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:28:56] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-29 11:28:56] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:28:56] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:28:56] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
[2024-05-29 11:28:57] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:28:57] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:28:57] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:28:57] [INFO ] Deduced a trap composed of 113 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:28:58] [INFO ] Deduced a trap composed of 129 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:28:58] [INFO ] Deduced a trap composed of 144 places in 70 ms of which 2 ms to minimize.
[2024-05-29 11:28:58] [INFO ] Deduced a trap composed of 159 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:28:58] [INFO ] Deduced a trap composed of 175 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:28:59] [INFO ] Deduced a trap composed of 190 places in 70 ms of which 2 ms to minimize.
[2024-05-29 11:28:59] [INFO ] Deduced a trap composed of 206 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:28:59] [INFO ] Deduced a trap composed of 219 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:28:59] [INFO ] Deduced a trap composed of 232 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:29:00] [INFO ] Deduced a trap composed of 252 places in 101 ms of which 3 ms to minimize.
[2024-05-29 11:29:00] [INFO ] Deduced a trap composed of 267 places in 101 ms of which 2 ms to minimize.
[2024-05-29 11:29:01] [INFO ] Deduced a trap composed of 277 places in 106 ms of which 3 ms to minimize.
[2024-05-29 11:29:01] [INFO ] Deduced a trap composed of 293 places in 110 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1712 variables, and 351 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:29:16] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:29:17] [INFO ] Deduced a trap composed of 142 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:29:17] [INFO ] Deduced a trap composed of 146 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:29:20] [INFO ] Deduced a trap composed of 310 places in 109 ms of which 2 ms to minimize.
[2024-05-29 11:29:20] [INFO ] Deduced a trap composed of 323 places in 117 ms of which 3 ms to minimize.
[2024-05-29 11:29:21] [INFO ] Deduced a trap composed of 333 places in 129 ms of which 2 ms to minimize.
[2024-05-29 11:29:21] [INFO ] Deduced a trap composed of 352 places in 129 ms of which 2 ms to minimize.
[2024-05-29 11:29:21] [INFO ] Deduced a trap composed of 367 places in 139 ms of which 3 ms to minimize.
[2024-05-29 11:29:22] [INFO ] Deduced a trap composed of 379 places in 134 ms of which 3 ms to minimize.
[2024-05-29 11:29:22] [INFO ] Deduced a trap composed of 391 places in 157 ms of which 3 ms to minimize.
[2024-05-29 11:29:23] [INFO ] Deduced a trap composed of 409 places in 156 ms of which 3 ms to minimize.
[2024-05-29 11:29:23] [INFO ] Deduced a trap composed of 424 places in 162 ms of which 4 ms to minimize.
[2024-05-29 11:29:24] [INFO ] Deduced a trap composed of 436 places in 168 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 13/364 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:29:35] [INFO ] Deduced a trap composed of 169 places in 69 ms of which 2 ms to minimize.
[2024-05-29 11:29:35] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-29 11:29:36] [INFO ] Deduced a trap composed of 247 places in 98 ms of which 3 ms to minimize.
[2024-05-29 11:29:36] [INFO ] Deduced a trap composed of 252 places in 91 ms of which 3 ms to minimize.
[2024-05-29 11:29:36] [INFO ] Deduced a trap composed of 248 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:29:36] [INFO ] Deduced a trap composed of 247 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:29:36] [INFO ] Deduced a trap composed of 247 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:29:37] [INFO ] Deduced a trap composed of 248 places in 89 ms of which 2 ms to minimize.
[2024-05-29 11:29:37] [INFO ] Deduced a trap composed of 247 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:29:37] [INFO ] Deduced a trap composed of 247 places in 91 ms of which 2 ms to minimize.
SMT process timed out in 60208ms, After SMT, problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61402 ms. Remains : 931/931 places, 781/781 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-09 finished in 223099 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(p0)&&X(X(F(p1)))))))'
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1833 transition count 1683
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1833 transition count 1683
Applied a total of 16 rules in 113 ms. Remains 1833 /1841 variables (removed 8) and now considering 1683/1691 (removed 8) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2024-05-29 11:29:37] [INFO ] Computed 331 invariants in 15 ms
[2024-05-29 11:29:37] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-29 11:29:37] [INFO ] Invariant cache hit.
[2024-05-29 11:29:39] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 11:29:39] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60388ms
Starting structural reductions in LTL mode, iteration 1 : 1833/1841 places, 1683/1691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62670 ms. Remains : 1833/1841 places, 1683/1691 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-11
Product exploration explored 100000 steps with 46 reset in 597 ms.
Product exploration explored 100000 steps with 79 reset in 649 ms.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 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 218 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 12121 steps (0 resets) in 113 ms. (106 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 127 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 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
[2024-05-29 11:30:42] [INFO ] Invariant cache hit.
[2024-05-29 11:30:43] [INFO ] [Real]Absence check using 331 positive place invariants in 384 ms returned sat
[2024-05-29 11:30:54] [INFO ] [Real]Absence check using state equation in 10445 ms returned sat
[2024-05-29 11:30:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:30:55] [INFO ] [Nat]Absence check using 331 positive place invariants in 384 ms returned sat
[2024-05-29 11:31:06] [INFO ] [Nat]Absence check using state equation in 11292 ms returned sat
[2024-05-29 11:31:06] [INFO ] Computed and/alt/rep : 1682/2973/1682 causal constraints (skipped 0 transitions) in 76 ms.
[2024-05-29 11:31:09] [INFO ] Added : 75 causal constraints over 15 iterations in 2372 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-29 11:31:09] [INFO ] Invariant cache hit.
[2024-05-29 11:31:10] [INFO ] [Real]Absence check using 331 positive place invariants in 365 ms returned sat
[2024-05-29 11:31:22] [INFO ] [Real]Absence check using state equation in 12306 ms returned sat
[2024-05-29 11:31:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:31:23] [INFO ] [Nat]Absence check using 331 positive place invariants in 358 ms returned sat
[2024-05-29 11:31:34] [INFO ] [Nat]Absence check using state equation in 10290 ms returned sat
[2024-05-29 11:31:34] [INFO ] Computed and/alt/rep : 1682/2973/1682 causal constraints (skipped 0 transitions) in 75 ms.
Could not prove EG (NOT p1)
Support contains 2 out of 1833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 56 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
[2024-05-29 11:31:37] [INFO ] Invariant cache hit.
[2024-05-29 11:31:38] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-29 11:31:38] [INFO ] Invariant cache hit.
[2024-05-29 11:31:39] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 11:31:39] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Finished structural reductions in LTL mode , in 1 iterations and 62477 ms. Remains : 1833/1833 places, 1683/1683 transitions.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 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 232 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 12495 steps (0 resets) in 105 ms. (117 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 1 factoid took 131 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 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
[2024-05-29 11:32:41] [INFO ] Invariant cache hit.
[2024-05-29 11:32:42] [INFO ] [Real]Absence check using 331 positive place invariants in 371 ms returned sat
[2024-05-29 11:32:52] [INFO ] [Real]Absence check using state equation in 9876 ms returned sat
[2024-05-29 11:32:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:32:53] [INFO ] [Nat]Absence check using 331 positive place invariants in 372 ms returned sat
[2024-05-29 11:33:04] [INFO ] [Nat]Absence check using state equation in 11070 ms returned sat
[2024-05-29 11:33:04] [INFO ] Computed and/alt/rep : 1682/2973/1682 causal constraints (skipped 0 transitions) in 69 ms.
[2024-05-29 11:33:07] [INFO ] Added : 85 causal constraints over 17 iterations in 2663 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-29 11:33:07] [INFO ] Invariant cache hit.
[2024-05-29 11:33:08] [INFO ] [Real]Absence check using 331 positive place invariants in 367 ms returned sat
[2024-05-29 11:33:21] [INFO ] [Real]Absence check using state equation in 12393 ms returned sat
[2024-05-29 11:33:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:33:22] [INFO ] [Nat]Absence check using 331 positive place invariants in 396 ms returned sat
[2024-05-29 11:33:33] [INFO ] [Nat]Absence check using state equation in 10688 ms returned sat
[2024-05-29 11:33:33] [INFO ] Computed and/alt/rep : 1682/2973/1682 causal constraints (skipped 0 transitions) in 79 ms.
[2024-05-29 11:33:36] [INFO ] Added : 100 causal constraints over 20 iterations in 2985 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 56 reset in 556 ms.
Product exploration explored 100000 steps with 51 reset in 676 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1683
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 62 Pre rules applied. Total rules applied 210 place count 1833 transition count 1685
Deduced a syphon composed of 272 places in 3 ms
Iterating global reduction 1 with 62 rules applied. Total rules applied 272 place count 1833 transition count 1685
Performed 627 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 899 places in 1 ms
Iterating global reduction 1 with 627 rules applied. Total rules applied 899 place count 1833 transition count 1685
Renaming transitions due to excessive name length > 1024 char.
Discarding 209 places :
Symmetric choice reduction at 1 with 209 rule applications. Total rules 1108 place count 1624 transition count 1476
Deduced a syphon composed of 690 places in 1 ms
Iterating global reduction 1 with 209 rules applied. Total rules applied 1317 place count 1624 transition count 1476
Deduced a syphon composed of 690 places in 1 ms
Applied a total of 1317 rules in 288 ms. Remains 1624 /1833 variables (removed 209) and now considering 1476/1683 (removed 207) transitions.
[2024-05-29 11:33:38] [INFO ] Redundant transitions in 24 ms returned []
Running 1475 sub problems to find dead transitions.
// Phase 1: matrix 1476 rows 1624 cols
[2024-05-29 11:33:38] [INFO ] Computed 331 invariants in 16 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1623/3100 variables, and 0 constraints, problems are : Problem set: 0 solved, 1475 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1624 constraints, PredecessorRefiner: 1475/1475 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1475 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1623/3100 variables, and 0 constraints, problems are : Problem set: 0 solved, 1475 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1624 constraints, PredecessorRefiner: 0/1475 constraints, Known Traps: 0/0 constraints]
After SMT, in 60868ms problems are : Problem set: 0 solved, 1475 unsolved
Search for dead transitions found 0 dead transitions in 60880ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1624/1833 places, 1476/1683 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61204 ms. Remains : 1624/1833 places, 1476/1683 transitions.
Support contains 2 out of 1833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 52 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2024-05-29 11:34:39] [INFO ] Computed 331 invariants in 10 ms
[2024-05-29 11:34:39] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-29 11:34:39] [INFO ] Invariant cache hit.
[2024-05-29 11:34:41] [INFO ] Implicit Places using invariants and state equation in 1519 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 11:34:41] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Finished structural reductions in LTL mode , in 1 iterations and 62515 ms. Remains : 1833/1833 places, 1683/1683 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-11 finished in 364516 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 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1840 transition count 1479
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1629 transition count 1479
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 422 place count 1629 transition count 1328
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 724 place count 1478 transition count 1328
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 733 place count 1469 transition count 1319
Iterating global reduction 2 with 9 rules applied. Total rules applied 742 place count 1469 transition count 1319
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 742 place count 1469 transition count 1312
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 756 place count 1462 transition count 1312
Performed 528 Post agglomeration using F-continuation condition.Transition count delta: 528
Deduced a syphon composed of 528 places in 1 ms
Reduce places removed 528 places and 0 transitions.
Iterating global reduction 2 with 1056 rules applied. Total rules applied 1812 place count 934 transition count 784
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1814 place count 932 transition count 782
Applied a total of 1814 rules in 182 ms. Remains 932 /1841 variables (removed 909) and now considering 782/1691 (removed 909) transitions.
// Phase 1: matrix 782 rows 932 cols
[2024-05-29 11:35:41] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 11:35:42] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-29 11:35:42] [INFO ] Invariant cache hit.
[2024-05-29 11:35:43] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2024-05-29 11:35:43] [INFO ] Redundant transitions in 8 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:35:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:36:01] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:36:02] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:36:02] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:36:02] [INFO ] Deduced a trap composed of 56 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1714 variables, and 328 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 324/331 constraints, State Equation: 0/932 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (OVERLAPS) 1/932 variables, 7/335 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:36:36] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:36:36] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:36:36] [INFO ] Deduced a trap composed of 115 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:36:36] [INFO ] Deduced a trap composed of 131 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:36:37] [INFO ] Deduced a trap composed of 149 places in 68 ms of which 1 ms to minimize.
[2024-05-29 11:36:37] [INFO ] Deduced a trap composed of 159 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:36:37] [INFO ] Deduced a trap composed of 175 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:36:37] [INFO ] Deduced a trap composed of 187 places in 77 ms of which 2 ms to minimize.
[2024-05-29 11:36:38] [INFO ] Deduced a trap composed of 202 places in 78 ms of which 1 ms to minimize.
[2024-05-29 11:36:38] [INFO ] Deduced a trap composed of 218 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:36:38] [INFO ] Deduced a trap composed of 233 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:36:39] [INFO ] Deduced a trap composed of 248 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:36:39] [INFO ] Deduced a trap composed of 262 places in 96 ms of which 2 ms to minimize.
[2024-05-29 11:36:39] [INFO ] Deduced a trap composed of 272 places in 109 ms of which 2 ms to minimize.
[2024-05-29 11:36:40] [INFO ] Deduced a trap composed of 293 places in 109 ms of which 2 ms to minimize.
[2024-05-29 11:36:40] [INFO ] Deduced a trap composed of 316 places in 107 ms of which 3 ms to minimize.
[2024-05-29 11:36:40] [INFO ] Deduced a trap composed of 319 places in 107 ms of which 3 ms to minimize.
[2024-05-29 11:36:41] [INFO ] Deduced a trap composed of 330 places in 118 ms of which 2 ms to minimize.
[2024-05-29 11:36:41] [INFO ] Deduced a trap composed of 351 places in 115 ms of which 2 ms to minimize.
[2024-05-29 11:36:41] [INFO ] Deduced a trap composed of 364 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1714 variables, and 355 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/932 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 24/24 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 932/1841 places, 782/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61507 ms. Remains : 932/1841 places, 782/1691 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-12
Product exploration explored 100000 steps with 72 reset in 596 ms.
Product exploration explored 100000 steps with 72 reset in 749 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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)]
RANDOM walk for 5675 steps (0 resets) in 56 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 75 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:36:45] [INFO ] Invariant cache hit.
[2024-05-29 11:36:45] [INFO ] [Real]Absence check using 331 positive place invariants in 143 ms returned sat
[2024-05-29 11:36:47] [INFO ] [Real]Absence check using state equation in 1534 ms returned sat
[2024-05-29 11:36:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:36:47] [INFO ] [Nat]Absence check using 331 positive place invariants in 139 ms returned sat
[2024-05-29 11:36:49] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2024-05-29 11:36:49] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:36:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2024-05-29 11:36:49] [INFO ] Computed and/alt/rep : 779/1502/779 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-29 11:37:02] [INFO ] Added : 565 causal constraints over 113 iterations in 12869 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 782/782 transitions.
Applied a total of 0 rules in 17 ms. Remains 932 /932 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2024-05-29 11:37:02] [INFO ] Invariant cache hit.
[2024-05-29 11:37:02] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-29 11:37:02] [INFO ] Invariant cache hit.
[2024-05-29 11:37:03] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2024-05-29 11:37:03] [INFO ] Redundant transitions in 7 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:37:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:37:21] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:37:21] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:37:21] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:37:22] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1714 variables, and 328 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 324/331 constraints, State Equation: 0/932 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (OVERLAPS) 1/932 variables, 7/335 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:37:56] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:37:56] [INFO ] Deduced a trap composed of 98 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:37:56] [INFO ] Deduced a trap composed of 115 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:37:56] [INFO ] Deduced a trap composed of 131 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:37:57] [INFO ] Deduced a trap composed of 149 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:37:57] [INFO ] Deduced a trap composed of 159 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:37:57] [INFO ] Deduced a trap composed of 175 places in 70 ms of which 2 ms to minimize.
[2024-05-29 11:37:57] [INFO ] Deduced a trap composed of 187 places in 74 ms of which 2 ms to minimize.
[2024-05-29 11:37:58] [INFO ] Deduced a trap composed of 202 places in 79 ms of which 2 ms to minimize.
[2024-05-29 11:37:58] [INFO ] Deduced a trap composed of 218 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:37:58] [INFO ] Deduced a trap composed of 233 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:37:59] [INFO ] Deduced a trap composed of 248 places in 93 ms of which 2 ms to minimize.
[2024-05-29 11:37:59] [INFO ] Deduced a trap composed of 262 places in 98 ms of which 2 ms to minimize.
[2024-05-29 11:37:59] [INFO ] Deduced a trap composed of 272 places in 105 ms of which 2 ms to minimize.
[2024-05-29 11:38:00] [INFO ] Deduced a trap composed of 293 places in 99 ms of which 2 ms to minimize.
[2024-05-29 11:38:00] [INFO ] Deduced a trap composed of 316 places in 112 ms of which 3 ms to minimize.
[2024-05-29 11:38:00] [INFO ] Deduced a trap composed of 319 places in 123 ms of which 3 ms to minimize.
[2024-05-29 11:38:01] [INFO ] Deduced a trap composed of 330 places in 125 ms of which 3 ms to minimize.
[2024-05-29 11:38:01] [INFO ] Deduced a trap composed of 351 places in 127 ms of which 3 ms to minimize.
[2024-05-29 11:38:02] [INFO ] Deduced a trap composed of 364 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1714 variables, and 355 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/932 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 24/24 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61288 ms. Remains : 932/932 places, 782/782 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 5630 steps (0 resets) in 50 ms. (110 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:38:04] [INFO ] Invariant cache hit.
[2024-05-29 11:38:04] [INFO ] [Real]Absence check using 331 positive place invariants in 158 ms returned sat
[2024-05-29 11:38:06] [INFO ] [Real]Absence check using state equation in 1539 ms returned sat
[2024-05-29 11:38:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:38:06] [INFO ] [Nat]Absence check using 331 positive place invariants in 144 ms returned sat
[2024-05-29 11:38:08] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2024-05-29 11:38:08] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-29 11:38:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-05-29 11:38:08] [INFO ] Computed and/alt/rep : 779/1502/779 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-29 11:38:21] [INFO ] Added : 560 causal constraints over 112 iterations in 12798 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 73 reset in 600 ms.
Product exploration explored 100000 steps with 71 reset in 751 ms.
Support contains 2 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 782/782 transitions.
Applied a total of 0 rules in 26 ms. Remains 932 /932 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2024-05-29 11:38:22] [INFO ] Invariant cache hit.
[2024-05-29 11:38:23] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-29 11:38:23] [INFO ] Invariant cache hit.
[2024-05-29 11:38:23] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
[2024-05-29 11:38:23] [INFO ] Redundant transitions in 8 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:38:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:38:42] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:38:42] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-05-29 11:38:42] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:38:43] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1714 variables, and 328 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 324/331 constraints, State Equation: 0/932 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (OVERLAPS) 1/932 variables, 7/335 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:39:16] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:39:17] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:39:17] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:39:17] [INFO ] Deduced a trap composed of 131 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:39:17] [INFO ] Deduced a trap composed of 149 places in 63 ms of which 2 ms to minimize.
[2024-05-29 11:39:18] [INFO ] Deduced a trap composed of 159 places in 62 ms of which 2 ms to minimize.
[2024-05-29 11:39:18] [INFO ] Deduced a trap composed of 175 places in 79 ms of which 2 ms to minimize.
[2024-05-29 11:39:18] [INFO ] Deduced a trap composed of 187 places in 76 ms of which 1 ms to minimize.
[2024-05-29 11:39:18] [INFO ] Deduced a trap composed of 202 places in 80 ms of which 2 ms to minimize.
[2024-05-29 11:39:19] [INFO ] Deduced a trap composed of 218 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:39:19] [INFO ] Deduced a trap composed of 233 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:39:19] [INFO ] Deduced a trap composed of 248 places in 93 ms of which 2 ms to minimize.
[2024-05-29 11:39:20] [INFO ] Deduced a trap composed of 262 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:39:20] [INFO ] Deduced a trap composed of 272 places in 103 ms of which 2 ms to minimize.
[2024-05-29 11:39:20] [INFO ] Deduced a trap composed of 293 places in 109 ms of which 3 ms to minimize.
[2024-05-29 11:39:21] [INFO ] Deduced a trap composed of 316 places in 116 ms of which 2 ms to minimize.
[2024-05-29 11:39:21] [INFO ] Deduced a trap composed of 319 places in 117 ms of which 2 ms to minimize.
[2024-05-29 11:39:22] [INFO ] Deduced a trap composed of 330 places in 127 ms of which 2 ms to minimize.
[2024-05-29 11:39:22] [INFO ] Deduced a trap composed of 351 places in 128 ms of which 2 ms to minimize.
[2024-05-29 11:39:22] [INFO ] Deduced a trap composed of 364 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1714 variables, and 355 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/932 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 24/24 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61310 ms. Remains : 932/932 places, 782/782 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-12 finished in 222310 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(p0))'
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1840 transition count 1478
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1628 transition count 1478
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1628 transition count 1328
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1478 transition count 1328
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 732 place count 1470 transition count 1320
Iterating global reduction 2 with 8 rules applied. Total rules applied 740 place count 1470 transition count 1320
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 740 place count 1470 transition count 1314
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 752 place count 1464 transition count 1314
Performed 531 Post agglomeration using F-continuation condition.Transition count delta: 531
Deduced a syphon composed of 531 places in 1 ms
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 2 with 1062 rules applied. Total rules applied 1814 place count 933 transition count 783
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1816 place count 931 transition count 781
Applied a total of 1816 rules in 170 ms. Remains 931 /1841 variables (removed 910) and now considering 781/1691 (removed 910) transitions.
// Phase 1: matrix 781 rows 931 cols
[2024-05-29 11:39:24] [INFO ] Computed 331 invariants in 13 ms
[2024-05-29 11:39:24] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-29 11:39:24] [INFO ] Invariant cache hit.
[2024-05-29 11:39:25] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2024-05-29 11:39:25] [INFO ] Redundant transitions in 7 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:39:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:39:44] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:39:44] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:39:44] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:39:44] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 2 ms to minimize.
[2024-05-29 11:39:45] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 0 ms to minimize.
[2024-05-29 11:39:45] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:39:45] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:39:45] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:39:45] [INFO ] Deduced a trap composed of 129 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:39:46] [INFO ] Deduced a trap composed of 144 places in 61 ms of which 2 ms to minimize.
[2024-05-29 11:39:46] [INFO ] Deduced a trap composed of 159 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:39:46] [INFO ] Deduced a trap composed of 175 places in 72 ms of which 1 ms to minimize.
[2024-05-29 11:39:46] [INFO ] Deduced a trap composed of 191 places in 75 ms of which 1 ms to minimize.
[2024-05-29 11:39:47] [INFO ] Deduced a trap composed of 206 places in 79 ms of which 2 ms to minimize.
[2024-05-29 11:39:47] [INFO ] Deduced a trap composed of 214 places in 80 ms of which 2 ms to minimize.
[2024-05-29 11:39:47] [INFO ] Deduced a trap composed of 236 places in 93 ms of which 2 ms to minimize.
[2024-05-29 11:39:48] [INFO ] Deduced a trap composed of 247 places in 100 ms of which 2 ms to minimize.
[2024-05-29 11:39:48] [INFO ] Deduced a trap composed of 270 places in 98 ms of which 2 ms to minimize.
[2024-05-29 11:39:48] [INFO ] Deduced a trap composed of 277 places in 109 ms of which 2 ms to minimize.
[2024-05-29 11:39:49] [INFO ] Deduced a trap composed of 294 places in 110 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1712 variables, and 351 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:40:05] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:40:05] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 2 ms to minimize.
[2024-05-29 11:40:05] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:40:05] [INFO ] Deduced a trap composed of 113 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 130 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 130 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 128 places in 57 ms of which 2 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 129 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 130 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 131 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:40:06] [INFO ] Deduced a trap composed of 101 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:40:07] [INFO ] Deduced a trap composed of 132 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:40:07] [INFO ] Deduced a trap composed of 127 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:40:07] [INFO ] Deduced a trap composed of 128 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:40:15] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:40:16] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:40:16] [INFO ] Deduced a trap composed of 103 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:40:16] [INFO ] Deduced a trap composed of 98 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:40:16] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-29 11:40:17] [INFO ] Deduced a trap composed of 175 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:40:17] [INFO ] Deduced a trap composed of 176 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:40:17] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-29 11:40:17] [INFO ] Deduced a trap composed of 174 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:40:17] [INFO ] Deduced a trap composed of 173 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:40:18] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-05-29 11:40:18] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
[2024-05-29 11:40:18] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:40:18] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:40:18] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:40:19] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:40:19] [INFO ] Deduced a trap composed of 115 places in 93 ms of which 3 ms to minimize.
[2024-05-29 11:40:19] [INFO ] Deduced a trap composed of 129 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:40:20] [INFO ] Deduced a trap composed of 143 places in 104 ms of which 2 ms to minimize.
[2024-05-29 11:40:20] [INFO ] Deduced a trap composed of 174 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/931 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/1712 variables, and 391 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 60/60 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1841 places, 781/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61485 ms. Remains : 931/1841 places, 781/1691 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-13
Product exploration explored 100000 steps with 109 reset in 595 ms.
Product exploration explored 100000 steps with 107 reset in 729 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 3718 steps (0 resets) in 39 ms. (92 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-29 11:40:27] [INFO ] Invariant cache hit.
[2024-05-29 11:40:27] [INFO ] [Real]Absence check using 331 positive place invariants in 148 ms returned sat
[2024-05-29 11:40:29] [INFO ] [Real]Absence check using state equation in 1809 ms returned sat
[2024-05-29 11:40:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:40:30] [INFO ] [Nat]Absence check using 331 positive place invariants in 143 ms returned sat
[2024-05-29 11:40:31] [INFO ] [Nat]Absence check using state equation in 1488 ms returned sat
[2024-05-29 11:40:31] [INFO ] Computed and/alt/rep : 779/1494/779 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-29 11:40:44] [INFO ] Added : 694 causal constraints over 139 iterations in 12183 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 17 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2024-05-29 11:40:44] [INFO ] Invariant cache hit.
[2024-05-29 11:40:44] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-29 11:40:44] [INFO ] Invariant cache hit.
[2024-05-29 11:40:45] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2024-05-29 11:40:45] [INFO ] Redundant transitions in 8 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:40:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:41:05] [INFO ] Deduced a trap composed of 103 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:41:05] [INFO ] Deduced a trap composed of 113 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:41:05] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:41:05] [INFO ] Deduced a trap composed of 144 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:41:06] [INFO ] Deduced a trap composed of 159 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:41:06] [INFO ] Deduced a trap composed of 175 places in 66 ms of which 2 ms to minimize.
[2024-05-29 11:41:06] [INFO ] Deduced a trap composed of 191 places in 72 ms of which 2 ms to minimize.
[2024-05-29 11:41:06] [INFO ] Deduced a trap composed of 206 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:41:07] [INFO ] Deduced a trap composed of 214 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:41:07] [INFO ] Deduced a trap composed of 236 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:41:07] [INFO ] Deduced a trap composed of 247 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:41:08] [INFO ] Deduced a trap composed of 270 places in 105 ms of which 3 ms to minimize.
[2024-05-29 11:41:08] [INFO ] Deduced a trap composed of 277 places in 110 ms of which 2 ms to minimize.
[2024-05-29 11:41:08] [INFO ] Deduced a trap composed of 294 places in 115 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1712 variables, and 351 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:41:24] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:41:24] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:41:25] [INFO ] Deduced a trap composed of 113 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:41:25] [INFO ] Deduced a trap composed of 113 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:41:25] [INFO ] Deduced a trap composed of 130 places in 63 ms of which 2 ms to minimize.
[2024-05-29 11:41:25] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:41:25] [INFO ] Deduced a trap composed of 130 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:41:25] [INFO ] Deduced a trap composed of 130 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:41:25] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 2 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 128 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 129 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 130 places in 52 ms of which 2 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 131 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 101 places in 54 ms of which 2 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 132 places in 53 ms of which 2 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 127 places in 50 ms of which 2 ms to minimize.
[2024-05-29 11:41:26] [INFO ] Deduced a trap composed of 128 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:41:35] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:41:35] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:41:35] [INFO ] Deduced a trap composed of 103 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:41:36] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:41:36] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:41:37] [INFO ] Deduced a trap composed of 175 places in 72 ms of which 2 ms to minimize.
[2024-05-29 11:41:37] [INFO ] Deduced a trap composed of 176 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:41:37] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-29 11:41:37] [INFO ] Deduced a trap composed of 174 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:41:37] [INFO ] Deduced a trap composed of 173 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:41:37] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:41:37] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:41:37] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:41:38] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-05-29 11:41:38] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:41:38] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:41:38] [INFO ] Deduced a trap composed of 115 places in 102 ms of which 2 ms to minimize.
[2024-05-29 11:41:39] [INFO ] Deduced a trap composed of 129 places in 99 ms of which 2 ms to minimize.
[2024-05-29 11:41:39] [INFO ] Deduced a trap composed of 143 places in 104 ms of which 2 ms to minimize.
[2024-05-29 11:41:40] [INFO ] Deduced a trap composed of 174 places in 107 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/931 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/1712 variables, and 391 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 60/60 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61338 ms. Remains : 931/931 places, 781/781 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 3537 steps (0 resets) in 36 ms. (95 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-29 11:41:45] [INFO ] Invariant cache hit.
[2024-05-29 11:41:46] [INFO ] [Real]Absence check using 331 positive place invariants in 150 ms returned sat
[2024-05-29 11:41:48] [INFO ] [Real]Absence check using state equation in 1749 ms returned sat
[2024-05-29 11:41:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:41:48] [INFO ] [Nat]Absence check using 331 positive place invariants in 143 ms returned sat
[2024-05-29 11:41:50] [INFO ] [Nat]Absence check using state equation in 1482 ms returned sat
[2024-05-29 11:41:50] [INFO ] Computed and/alt/rep : 779/1494/779 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-29 11:42:03] [INFO ] Added : 694 causal constraints over 139 iterations in 12847 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 107 reset in 603 ms.
Product exploration explored 100000 steps with 107 reset in 740 ms.
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 17 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2024-05-29 11:42:04] [INFO ] Invariant cache hit.
[2024-05-29 11:42:04] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-29 11:42:04] [INFO ] Invariant cache hit.
[2024-05-29 11:42:05] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
[2024-05-29 11:42:05] [INFO ] Redundant transitions in 7 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:42:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:42:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:42:24] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-29 11:42:24] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:42:24] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:42:25] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:42:25] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:42:25] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:42:25] [INFO ] Deduced a trap composed of 113 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:42:25] [INFO ] Deduced a trap composed of 129 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:42:26] [INFO ] Deduced a trap composed of 144 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:42:26] [INFO ] Deduced a trap composed of 159 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:42:26] [INFO ] Deduced a trap composed of 175 places in 68 ms of which 2 ms to minimize.
[2024-05-29 11:42:26] [INFO ] Deduced a trap composed of 191 places in 80 ms of which 2 ms to minimize.
[2024-05-29 11:42:27] [INFO ] Deduced a trap composed of 206 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:42:27] [INFO ] Deduced a trap composed of 214 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:42:27] [INFO ] Deduced a trap composed of 236 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:42:28] [INFO ] Deduced a trap composed of 247 places in 93 ms of which 2 ms to minimize.
[2024-05-29 11:42:28] [INFO ] Deduced a trap composed of 270 places in 100 ms of which 2 ms to minimize.
[2024-05-29 11:42:28] [INFO ] Deduced a trap composed of 277 places in 106 ms of which 2 ms to minimize.
[2024-05-29 11:42:29] [INFO ] Deduced a trap composed of 294 places in 105 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1712 variables, and 351 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:42:45] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 0 ms to minimize.
[2024-05-29 11:42:45] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:42:45] [INFO ] Deduced a trap composed of 113 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:42:45] [INFO ] Deduced a trap composed of 113 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 130 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 130 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 130 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 130 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 128 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 129 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 130 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 131 places in 50 ms of which 2 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:42:46] [INFO ] Deduced a trap composed of 132 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:42:47] [INFO ] Deduced a trap composed of 127 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:42:47] [INFO ] Deduced a trap composed of 128 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:42:55] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:42:55] [INFO ] Deduced a trap composed of 102 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:42:55] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:42:55] [INFO ] Deduced a trap composed of 98 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:42:56] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:42:56] [INFO ] Deduced a trap composed of 175 places in 71 ms of which 1 ms to minimize.
[2024-05-29 11:42:57] [INFO ] Deduced a trap composed of 176 places in 68 ms of which 2 ms to minimize.
[2024-05-29 11:42:57] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:42:57] [INFO ] Deduced a trap composed of 174 places in 77 ms of which 2 ms to minimize.
[2024-05-29 11:42:57] [INFO ] Deduced a trap composed of 173 places in 62 ms of which 2 ms to minimize.
[2024-05-29 11:42:57] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-29 11:42:57] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-05-29 11:42:57] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-05-29 11:42:58] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-05-29 11:42:58] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2024-05-29 11:42:58] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-05-29 11:42:58] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:42:59] [INFO ] Deduced a trap composed of 129 places in 98 ms of which 3 ms to minimize.
[2024-05-29 11:42:59] [INFO ] Deduced a trap composed of 143 places in 106 ms of which 2 ms to minimize.
[2024-05-29 11:43:00] [INFO ] Deduced a trap composed of 174 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/931 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/1712 variables, and 391 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 60/60 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61327 ms. Remains : 931/931 places, 781/781 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-13 finished in 221737 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(G(p0))&&F(p1))))'
Support contains 3 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1840 transition count 1480
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1630 transition count 1480
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 420 place count 1630 transition count 1330
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 720 place count 1480 transition count 1330
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 728 place count 1472 transition count 1322
Iterating global reduction 2 with 8 rules applied. Total rules applied 736 place count 1472 transition count 1322
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 736 place count 1472 transition count 1316
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 748 place count 1466 transition count 1316
Performed 530 Post agglomeration using F-continuation condition.Transition count delta: 530
Deduced a syphon composed of 530 places in 0 ms
Reduce places removed 530 places and 0 transitions.
Iterating global reduction 2 with 1060 rules applied. Total rules applied 1808 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1810 place count 934 transition count 784
Applied a total of 1810 rules in 199 ms. Remains 934 /1841 variables (removed 907) and now considering 784/1691 (removed 907) transitions.
// Phase 1: matrix 784 rows 934 cols
[2024-05-29 11:43:06] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 11:43:06] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-29 11:43:06] [INFO ] Invariant cache hit.
[2024-05-29 11:43:07] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2024-05-29 11:43:07] [INFO ] Redundant transitions in 7 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:43:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:43:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:43:25] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:43:26] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:43:26] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:43:26] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:43:26] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:43:26] [INFO ] Deduced a trap composed of 103 places in 56 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1718 variables, and 336 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 329/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 2/934 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:43:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:43:56] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 11:44:00] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:44:00] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:44:01] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2024-05-29 11:44:01] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:44:01] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:44:01] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:44:02] [INFO ] Deduced a trap composed of 113 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:44:02] [INFO ] Deduced a trap composed of 129 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:44:02] [INFO ] Deduced a trap composed of 143 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:44:02] [INFO ] Deduced a trap composed of 157 places in 76 ms of which 1 ms to minimize.
[2024-05-29 11:44:03] [INFO ] Deduced a trap composed of 173 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:44:03] [INFO ] Deduced a trap composed of 184 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:44:03] [INFO ] Deduced a trap composed of 200 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:44:04] [INFO ] Deduced a trap composed of 211 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:44:04] [INFO ] Deduced a trap composed of 232 places in 101 ms of which 2 ms to minimize.
[2024-05-29 11:44:04] [INFO ] Deduced a trap composed of 241 places in 115 ms of which 2 ms to minimize.
[2024-05-29 11:44:05] [INFO ] Deduced a trap composed of 264 places in 100 ms of which 2 ms to minimize.
[2024-05-29 11:44:05] [INFO ] Deduced a trap composed of 272 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 934/1718 variables, and 358 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 27/27 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 934/1841 places, 784/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61510 ms. Remains : 934/1841 places, 784/1691 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-14
Stuttering criterion allowed to conclude after 2284 steps with 1 reset in 18 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-14 finished in 61656 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(p0))'
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1840 transition count 1478
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1628 transition count 1478
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1628 transition count 1328
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1478 transition count 1328
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 733 place count 1469 transition count 1319
Iterating global reduction 2 with 9 rules applied. Total rules applied 742 place count 1469 transition count 1319
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 742 place count 1469 transition count 1312
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 756 place count 1462 transition count 1312
Performed 529 Post agglomeration using F-continuation condition.Transition count delta: 529
Deduced a syphon composed of 529 places in 0 ms
Reduce places removed 529 places and 0 transitions.
Iterating global reduction 2 with 1058 rules applied. Total rules applied 1814 place count 933 transition count 783
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1816 place count 931 transition count 781
Applied a total of 1816 rules in 244 ms. Remains 931 /1841 variables (removed 910) and now considering 781/1691 (removed 910) transitions.
// Phase 1: matrix 781 rows 931 cols
[2024-05-29 11:44:07] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 11:44:08] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-29 11:44:08] [INFO ] Invariant cache hit.
[2024-05-29 11:44:08] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2024-05-29 11:44:08] [INFO ] Redundant transitions in 7 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:44:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:44:27] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 11:44:27] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:44:27] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-05-29 11:44:28] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:44:28] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2024-05-29 11:44:28] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:44:28] [INFO ] Deduced a trap composed of 103 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:44:28] [INFO ] Deduced a trap composed of 113 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:44:29] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 2 ms to minimize.
[2024-05-29 11:44:29] [INFO ] Deduced a trap composed of 144 places in 55 ms of which 2 ms to minimize.
[2024-05-29 11:44:29] [INFO ] Deduced a trap composed of 159 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:44:29] [INFO ] Deduced a trap composed of 175 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:44:30] [INFO ] Deduced a trap composed of 190 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:44:30] [INFO ] Deduced a trap composed of 206 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:44:30] [INFO ] Deduced a trap composed of 219 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:44:31] [INFO ] Deduced a trap composed of 232 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:44:31] [INFO ] Deduced a trap composed of 252 places in 94 ms of which 3 ms to minimize.
[2024-05-29 11:44:31] [INFO ] Deduced a trap composed of 267 places in 103 ms of which 2 ms to minimize.
[2024-05-29 11:44:32] [INFO ] Deduced a trap composed of 277 places in 120 ms of which 3 ms to minimize.
[2024-05-29 11:44:32] [INFO ] Deduced a trap composed of 293 places in 109 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1712 variables, and 351 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:44:48] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-05-29 11:44:49] [INFO ] Deduced a trap composed of 142 places in 63 ms of which 2 ms to minimize.
[2024-05-29 11:44:49] [INFO ] Deduced a trap composed of 146 places in 87 ms of which 1 ms to minimize.
[2024-05-29 11:44:51] [INFO ] Deduced a trap composed of 310 places in 108 ms of which 2 ms to minimize.
[2024-05-29 11:44:52] [INFO ] Deduced a trap composed of 323 places in 117 ms of which 3 ms to minimize.
[2024-05-29 11:44:52] [INFO ] Deduced a trap composed of 333 places in 127 ms of which 2 ms to minimize.
[2024-05-29 11:44:52] [INFO ] Deduced a trap composed of 352 places in 132 ms of which 3 ms to minimize.
[2024-05-29 11:44:53] [INFO ] Deduced a trap composed of 367 places in 132 ms of which 3 ms to minimize.
[2024-05-29 11:44:53] [INFO ] Deduced a trap composed of 379 places in 137 ms of which 3 ms to minimize.
[2024-05-29 11:44:54] [INFO ] Deduced a trap composed of 391 places in 146 ms of which 3 ms to minimize.
[2024-05-29 11:44:54] [INFO ] Deduced a trap composed of 409 places in 149 ms of which 3 ms to minimize.
[2024-05-29 11:44:54] [INFO ] Deduced a trap composed of 424 places in 160 ms of which 3 ms to minimize.
[2024-05-29 11:44:55] [INFO ] Deduced a trap composed of 436 places in 164 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 13/364 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:45:05] [INFO ] Deduced a trap composed of 169 places in 70 ms of which 2 ms to minimize.
[2024-05-29 11:45:05] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:45:06] [INFO ] Deduced a trap composed of 254 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:45:06] [INFO ] Deduced a trap composed of 252 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:45:06] [INFO ] Deduced a trap composed of 253 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:45:06] [INFO ] Deduced a trap composed of 247 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:45:06] [INFO ] Deduced a trap composed of 251 places in 83 ms of which 1 ms to minimize.
[2024-05-29 11:45:07] [INFO ] Deduced a trap composed of 266 places in 99 ms of which 3 ms to minimize.
[2024-05-29 11:45:08] [INFO ] Deduced a trap composed of 350 places in 129 ms of which 2 ms to minimize.
[2024-05-29 11:45:09] [INFO ] Deduced a trap composed of 350 places in 127 ms of which 2 ms to minimize.
SMT process timed out in 60232ms, After SMT, problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1841 places, 781/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61577 ms. Remains : 931/1841 places, 781/1691 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-15
Stuttering criterion allowed to conclude after 2387 steps with 2 reset in 16 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-15 finished in 61641 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' '!(G(F((G(p1)||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(((p0||G(p1)) U X(p2))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-030B-LTLFireability-03
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 5 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1840 transition count 1480
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1630 transition count 1480
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 420 place count 1630 transition count 1328
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 724 place count 1478 transition count 1328
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 733 place count 1469 transition count 1319
Iterating global reduction 2 with 9 rules applied. Total rules applied 742 place count 1469 transition count 1319
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 742 place count 1469 transition count 1312
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 756 place count 1462 transition count 1312
Performed 524 Post agglomeration using F-continuation condition.Transition count delta: 524
Deduced a syphon composed of 524 places in 1 ms
Reduce places removed 524 places and 0 transitions.
Iterating global reduction 2 with 1048 rules applied. Total rules applied 1804 place count 938 transition count 788
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1806 place count 936 transition count 786
Applied a total of 1806 rules in 205 ms. Remains 936 /1841 variables (removed 905) and now considering 786/1691 (removed 905) transitions.
// Phase 1: matrix 786 rows 936 cols
[2024-05-29 11:45:09] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 11:45:10] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-29 11:45:10] [INFO ] Invariant cache hit.
[2024-05-29 11:45:10] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-05-29 11:45:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 3/936 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 936/1722 variables, and 331 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 3/936 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-29 11:46:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:46:02] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:46:02] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:46:02] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-05-29 11:46:02] [INFO ] Deduced a trap composed of 56 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:46:02] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:46:03] [INFO ] Deduced a trap composed of 88 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:46:03] [INFO ] Deduced a trap composed of 99 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:46:03] [INFO ] Deduced a trap composed of 117 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:46:03] [INFO ] Deduced a trap composed of 129 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:46:04] [INFO ] Deduced a trap composed of 145 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:46:04] [INFO ] Deduced a trap composed of 163 places in 69 ms of which 1 ms to minimize.
[2024-05-29 11:46:04] [INFO ] Deduced a trap composed of 173 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:46:04] [INFO ] Deduced a trap composed of 193 places in 77 ms of which 2 ms to minimize.
[2024-05-29 11:46:05] [INFO ] Deduced a trap composed of 202 places in 82 ms of which 1 ms to minimize.
[2024-05-29 11:46:05] [INFO ] Deduced a trap composed of 218 places in 91 ms of which 1 ms to minimize.
[2024-05-29 11:46:05] [INFO ] Deduced a trap composed of 234 places in 85 ms of which 1 ms to minimize.
[2024-05-29 11:46:06] [INFO ] Deduced a trap composed of 258 places in 103 ms of which 3 ms to minimize.
[2024-05-29 11:46:06] [INFO ] Deduced a trap composed of 278 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:46:06] [INFO ] Deduced a trap composed of 292 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/936 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 351 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/781 constraints, Known Traps: 20/20 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LI_LTL mode, iteration 1 : 936/1841 places, 786/1691 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61473 ms. Remains : 936/1841 places, 786/1691 transitions.
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-03
Product exploration explored 100000 steps with 34144 reset in 518 ms.
Product exploration explored 100000 steps with 34311 reset in 620 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/936 stabilizing places and 4/786 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 16 factoid took 320 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (17 resets) in 345 ms. (115 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
[2024-05-29 11:46:13] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 5/1722 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p1) p2)), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (OR (NOT p1) p2) (OR p2 (NOT p0))))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p2 p0))), (F p0), (F p1)]
Knowledge based reduction with 18 factoid took 776 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Support contains 5 out of 936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 936/936 places, 786/786 transitions.
Applied a total of 0 rules in 18 ms. Remains 936 /936 variables (removed 0) and now considering 786/786 (removed 0) transitions.
[2024-05-29 11:46:14] [INFO ] Invariant cache hit.
[2024-05-29 11:46:14] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-29 11:46:14] [INFO ] Invariant cache hit.
[2024-05-29 11:46:15] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-05-29 11:46:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 3/936 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 936/1722 variables, and 331 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 3/936 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-29 11:47:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:47:06] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:47:06] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:47:07] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
[2024-05-29 11:47:07] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:47:07] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:47:07] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:47:07] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:47:08] [INFO ] Deduced a trap composed of 117 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:47:08] [INFO ] Deduced a trap composed of 129 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:47:08] [INFO ] Deduced a trap composed of 145 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:47:08] [INFO ] Deduced a trap composed of 163 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:47:09] [INFO ] Deduced a trap composed of 173 places in 66 ms of which 2 ms to minimize.
[2024-05-29 11:47:09] [INFO ] Deduced a trap composed of 193 places in 73 ms of which 2 ms to minimize.
[2024-05-29 11:47:09] [INFO ] Deduced a trap composed of 202 places in 77 ms of which 1 ms to minimize.
[2024-05-29 11:47:09] [INFO ] Deduced a trap composed of 218 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:47:10] [INFO ] Deduced a trap composed of 234 places in 97 ms of which 1 ms to minimize.
[2024-05-29 11:47:10] [INFO ] Deduced a trap composed of 258 places in 100 ms of which 2 ms to minimize.
[2024-05-29 11:47:11] [INFO ] Deduced a trap composed of 278 places in 100 ms of which 3 ms to minimize.
[2024-05-29 11:47:11] [INFO ] Deduced a trap composed of 292 places in 107 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/936 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 351 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/781 constraints, Known Traps: 20/20 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in LTL mode , in 1 iterations and 61304 ms. Remains : 936/936 places, 786/786 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/936 stabilizing places and 4/786 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 143 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (NOT p2), (NOT p2), true]
RANDOM walk for 11213 steps (4 resets) in 112 ms. (99 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 (NOT p0)))), (F p1), (F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 398 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 34207 reset in 520 ms.
Product exploration explored 100000 steps with 34231 reset in 618 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Support contains 5 out of 936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 936/936 places, 786/786 transitions.
Applied a total of 0 rules in 21 ms. Remains 936 /936 variables (removed 0) and now considering 786/786 (removed 0) transitions.
[2024-05-29 11:47:17] [INFO ] Redundant transitions in 12 ms returned []
Running 781 sub problems to find dead transitions.
[2024-05-29 11:47:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 3/936 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 936/1722 variables, and 331 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 3/936 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-29 11:48:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:48:08] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:08] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:48:09] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:48:09] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:48:09] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:48:09] [INFO ] Deduced a trap composed of 88 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:48:09] [INFO ] Deduced a trap composed of 99 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:48:10] [INFO ] Deduced a trap composed of 117 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:48:10] [INFO ] Deduced a trap composed of 129 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:48:10] [INFO ] Deduced a trap composed of 145 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:48:10] [INFO ] Deduced a trap composed of 163 places in 68 ms of which 1 ms to minimize.
[2024-05-29 11:48:11] [INFO ] Deduced a trap composed of 173 places in 68 ms of which 2 ms to minimize.
[2024-05-29 11:48:11] [INFO ] Deduced a trap composed of 193 places in 73 ms of which 2 ms to minimize.
[2024-05-29 11:48:11] [INFO ] Deduced a trap composed of 202 places in 73 ms of which 2 ms to minimize.
[2024-05-29 11:48:11] [INFO ] Deduced a trap composed of 218 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:48:12] [INFO ] Deduced a trap composed of 234 places in 93 ms of which 2 ms to minimize.
[2024-05-29 11:48:12] [INFO ] Deduced a trap composed of 258 places in 98 ms of which 2 ms to minimize.
[2024-05-29 11:48:13] [INFO ] Deduced a trap composed of 278 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:48:13] [INFO ] Deduced a trap composed of 292 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/936 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 351 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/781 constraints, Known Traps: 20/20 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60188 ms. Remains : 936/936 places, 786/786 transitions.
Support contains 5 out of 936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 936/936 places, 786/786 transitions.
Applied a total of 0 rules in 12 ms. Remains 936 /936 variables (removed 0) and now considering 786/786 (removed 0) transitions.
[2024-05-29 11:48:18] [INFO ] Invariant cache hit.
[2024-05-29 11:48:18] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-29 11:48:18] [INFO ] Invariant cache hit.
[2024-05-29 11:48:19] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-05-29 11:48:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 3/936 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 936/1722 variables, and 331 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 3/936 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-29 11:49:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:49:10] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 11:49:10] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-29 11:49:10] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:49:11] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 0 ms to minimize.
[2024-05-29 11:49:11] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:49:11] [INFO ] Deduced a trap composed of 88 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:49:11] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:49:11] [INFO ] Deduced a trap composed of 117 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:49:12] [INFO ] Deduced a trap composed of 129 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:49:12] [INFO ] Deduced a trap composed of 145 places in 64 ms of which 2 ms to minimize.
[2024-05-29 11:49:12] [INFO ] Deduced a trap composed of 163 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:49:12] [INFO ] Deduced a trap composed of 173 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:49:13] [INFO ] Deduced a trap composed of 193 places in 75 ms of which 2 ms to minimize.
[2024-05-29 11:49:13] [INFO ] Deduced a trap composed of 202 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:49:13] [INFO ] Deduced a trap composed of 218 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:49:13] [INFO ] Deduced a trap composed of 234 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:49:14] [INFO ] Deduced a trap composed of 258 places in 104 ms of which 2 ms to minimize.
[2024-05-29 11:49:14] [INFO ] Deduced a trap composed of 278 places in 101 ms of which 2 ms to minimize.
[2024-05-29 11:49:15] [INFO ] Deduced a trap composed of 292 places in 108 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/936 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 351 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/781 constraints, Known Traps: 20/20 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 61324 ms. Remains : 936/936 places, 786/786 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-03 finished in 250114 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(p0)||G((p1||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((p0||F(p1)))))'
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(p0)&&X(X(F(p1)))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-030B-LTLFireability-11
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1840 transition count 1479
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1629 transition count 1479
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 422 place count 1629 transition count 1330
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 720 place count 1480 transition count 1330
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 728 place count 1472 transition count 1322
Iterating global reduction 2 with 8 rules applied. Total rules applied 736 place count 1472 transition count 1322
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 736 place count 1472 transition count 1316
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 748 place count 1466 transition count 1316
Performed 531 Post agglomeration using F-continuation condition.Transition count delta: 531
Deduced a syphon composed of 531 places in 1 ms
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 2 with 1062 rules applied. Total rules applied 1810 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1812 place count 933 transition count 783
Applied a total of 1812 rules in 207 ms. Remains 933 /1841 variables (removed 908) and now considering 783/1691 (removed 908) transitions.
// Phase 1: matrix 783 rows 933 cols
[2024-05-29 11:49:20] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 11:49:20] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-29 11:49:20] [INFO ] Invariant cache hit.
[2024-05-29 11:49:21] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2024-05-29 11:49:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:49:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:49:40] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:49:40] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:49:40] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:49:40] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:49:40] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:49:41] [INFO ] Deduced a trap composed of 103 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:49:41] [INFO ] Deduced a trap composed of 115 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:49:41] [INFO ] Deduced a trap composed of 131 places in 64 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1716 variables, and 339 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 1/933 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:50:14] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:50:14] [INFO ] Deduced a trap composed of 101 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:50:14] [INFO ] Deduced a trap composed of 102 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:50:14] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:50:14] [INFO ] Deduced a trap composed of 103 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:50:14] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:50:15] [INFO ] Deduced a trap composed of 146 places in 63 ms of which 2 ms to minimize.
[2024-05-29 11:50:15] [INFO ] Deduced a trap composed of 164 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:50:15] [INFO ] Deduced a trap composed of 179 places in 71 ms of which 1 ms to minimize.
[2024-05-29 11:50:16] [INFO ] Deduced a trap composed of 193 places in 72 ms of which 2 ms to minimize.
[2024-05-29 11:50:16] [INFO ] Deduced a trap composed of 203 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:50:16] [INFO ] Deduced a trap composed of 220 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:50:16] [INFO ] Deduced a trap composed of 233 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:50:17] [INFO ] Deduced a trap composed of 255 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:50:17] [INFO ] Deduced a trap composed of 268 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:50:17] [INFO ] Deduced a trap composed of 284 places in 103 ms of which 2 ms to minimize.
[2024-05-29 11:50:18] [INFO ] Deduced a trap composed of 293 places in 107 ms of which 2 ms to minimize.
[2024-05-29 11:50:18] [INFO ] Deduced a trap composed of 310 places in 105 ms of which 2 ms to minimize.
[2024-05-29 11:50:18] [INFO ] Deduced a trap composed of 324 places in 115 ms of which 2 ms to minimize.
[2024-05-29 11:50:19] [INFO ] Deduced a trap composed of 334 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 360 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 29/29 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LI_LTL mode, iteration 1 : 933/1841 places, 783/1691 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61515 ms. Remains : 933/1841 places, 783/1691 transitions.
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-11
Product exploration explored 100000 steps with 97 reset in 608 ms.
Product exploration explored 100000 steps with 101 reset in 744 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 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 213 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 5093 steps (0 resets) in 48 ms. (103 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 138 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 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
[2024-05-29 11:50:23] [INFO ] Invariant cache hit.
[2024-05-29 11:50:24] [INFO ] [Real]Absence check using 331 positive place invariants in 147 ms returned sat
[2024-05-29 11:50:26] [INFO ] [Real]Absence check using state equation in 1563 ms returned sat
[2024-05-29 11:50:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:50:26] [INFO ] [Nat]Absence check using 331 positive place invariants in 135 ms returned sat
[2024-05-29 11:50:28] [INFO ] [Nat]Absence check using state equation in 1534 ms returned sat
[2024-05-29 11:50:28] [INFO ] Computed and/alt/rep : 780/1497/780 causal constraints (skipped 0 transitions) in 38 ms.
Could not prove EG (NOT p0)
[2024-05-29 11:50:41] [INFO ] Invariant cache hit.
[2024-05-29 11:50:41] [INFO ] [Real]Absence check using 331 positive place invariants in 135 ms returned sat
[2024-05-29 11:50:43] [INFO ] [Real]Absence check using state equation in 2062 ms returned sat
[2024-05-29 11:50:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:50:44] [INFO ] [Nat]Absence check using 331 positive place invariants in 139 ms returned sat
[2024-05-29 11:50:45] [INFO ] [Nat]Absence check using state equation in 1541 ms returned sat
[2024-05-29 11:50:46] [INFO ] Computed and/alt/rep : 780/1497/780 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-29 11:50:58] [INFO ] Added : 685 causal constraints over 137 iterations in 12820 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 18 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 11:50:58] [INFO ] Invariant cache hit.
[2024-05-29 11:50:59] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-29 11:50:59] [INFO ] Invariant cache hit.
[2024-05-29 11:50:59] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2024-05-29 11:50:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:51:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:51:19] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:51:19] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:51:19] [INFO ] Deduced a trap composed of 56 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:51:20] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:51:20] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:51:20] [INFO ] Deduced a trap composed of 103 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:51:20] [INFO ] Deduced a trap composed of 115 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:51:20] [INFO ] Deduced a trap composed of 131 places in 53 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1716 variables, and 339 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 1/933 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:51:53] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:51:53] [INFO ] Deduced a trap composed of 101 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:51:53] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:51:53] [INFO ] Deduced a trap composed of 103 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:51:53] [INFO ] Deduced a trap composed of 103 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:51:53] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:51:54] [INFO ] Deduced a trap composed of 146 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:51:54] [INFO ] Deduced a trap composed of 164 places in 71 ms of which 1 ms to minimize.
[2024-05-29 11:51:55] [INFO ] Deduced a trap composed of 179 places in 77 ms of which 1 ms to minimize.
[2024-05-29 11:51:55] [INFO ] Deduced a trap composed of 193 places in 80 ms of which 2 ms to minimize.
[2024-05-29 11:51:55] [INFO ] Deduced a trap composed of 203 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:51:55] [INFO ] Deduced a trap composed of 220 places in 89 ms of which 3 ms to minimize.
[2024-05-29 11:51:56] [INFO ] Deduced a trap composed of 233 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:51:56] [INFO ] Deduced a trap composed of 255 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:51:56] [INFO ] Deduced a trap composed of 268 places in 100 ms of which 2 ms to minimize.
[2024-05-29 11:51:57] [INFO ] Deduced a trap composed of 284 places in 105 ms of which 3 ms to minimize.
[2024-05-29 11:51:57] [INFO ] Deduced a trap composed of 293 places in 108 ms of which 3 ms to minimize.
[2024-05-29 11:51:57] [INFO ] Deduced a trap composed of 310 places in 112 ms of which 3 ms to minimize.
[2024-05-29 11:51:58] [INFO ] Deduced a trap composed of 324 places in 116 ms of which 3 ms to minimize.
[2024-05-29 11:51:58] [INFO ] Deduced a trap composed of 334 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 360 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 29/29 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Finished structural reductions in LTL mode , in 1 iterations and 61255 ms. Remains : 933/933 places, 783/783 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 p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 133 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 231 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 5293 steps (0 resets) in 49 ms. (105 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 163 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 282 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
[2024-05-29 11:52:01] [INFO ] Invariant cache hit.
[2024-05-29 11:52:01] [INFO ] [Real]Absence check using 331 positive place invariants in 152 ms returned sat
[2024-05-29 11:52:03] [INFO ] [Real]Absence check using state equation in 1636 ms returned sat
[2024-05-29 11:52:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:52:03] [INFO ] [Nat]Absence check using 331 positive place invariants in 143 ms returned sat
[2024-05-29 11:52:05] [INFO ] [Nat]Absence check using state equation in 1480 ms returned sat
[2024-05-29 11:52:05] [INFO ] Computed and/alt/rep : 780/1497/780 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-29 11:52:18] [INFO ] Added : 700 causal constraints over 140 iterations in 12909 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-29 11:52:18] [INFO ] Invariant cache hit.
[2024-05-29 11:52:19] [INFO ] [Real]Absence check using 331 positive place invariants in 147 ms returned sat
[2024-05-29 11:52:21] [INFO ] [Real]Absence check using state equation in 2133 ms returned sat
[2024-05-29 11:52:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:52:21] [INFO ] [Nat]Absence check using 331 positive place invariants in 144 ms returned sat
[2024-05-29 11:52:23] [INFO ] [Nat]Absence check using state equation in 1605 ms returned sat
[2024-05-29 11:52:23] [INFO ] Computed and/alt/rep : 780/1497/780 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-29 11:52:36] [INFO ] Added : 665 causal constraints over 133 iterations in 12761 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 100 reset in 608 ms.
Product exploration explored 100000 steps with 96 reset in 752 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 20 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 11:52:38] [INFO ] Redundant transitions in 7 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:52:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:52:56] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 11:52:56] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 11:52:57] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:52:57] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:52:57] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 2 ms to minimize.
[2024-05-29 11:52:57] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:52:58] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:52:58] [INFO ] Deduced a trap composed of 115 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:52:58] [INFO ] Deduced a trap composed of 131 places in 58 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1716 variables, and 339 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 1/933 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:53:31] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:53:31] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:53:31] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:53:32] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:53:32] [INFO ] Deduced a trap composed of 103 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:53:32] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:53:32] [INFO ] Deduced a trap composed of 146 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:53:32] [INFO ] Deduced a trap composed of 164 places in 70 ms of which 1 ms to minimize.
[2024-05-29 11:53:33] [INFO ] Deduced a trap composed of 179 places in 74 ms of which 2 ms to minimize.
[2024-05-29 11:53:33] [INFO ] Deduced a trap composed of 193 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:53:33] [INFO ] Deduced a trap composed of 203 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:53:34] [INFO ] Deduced a trap composed of 220 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:53:34] [INFO ] Deduced a trap composed of 233 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:53:34] [INFO ] Deduced a trap composed of 255 places in 92 ms of which 3 ms to minimize.
[2024-05-29 11:53:35] [INFO ] Deduced a trap composed of 268 places in 101 ms of which 3 ms to minimize.
[2024-05-29 11:53:35] [INFO ] Deduced a trap composed of 284 places in 104 ms of which 2 ms to minimize.
[2024-05-29 11:53:35] [INFO ] Deduced a trap composed of 293 places in 106 ms of which 2 ms to minimize.
[2024-05-29 11:53:36] [INFO ] Deduced a trap composed of 310 places in 107 ms of which 3 ms to minimize.
[2024-05-29 11:53:36] [INFO ] Deduced a trap composed of 324 places in 114 ms of which 3 ms to minimize.
[2024-05-29 11:53:36] [INFO ] Deduced a trap composed of 334 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 360 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 29/29 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60188 ms. Remains : 933/933 places, 783/783 transitions.
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 12 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 11:53:38] [INFO ] Invariant cache hit.
[2024-05-29 11:53:38] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-29 11:53:38] [INFO ] Invariant cache hit.
[2024-05-29 11:53:39] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2024-05-29 11:53:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:53:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:53:58] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:53:58] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:53:58] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:53:59] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:53:59] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:53:59] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:53:59] [INFO ] Deduced a trap composed of 115 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:54:00] [INFO ] Deduced a trap composed of 131 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1716 variables, and 339 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 1/933 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 101 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 102 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 103 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 103 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 146 places in 63 ms of which 2 ms to minimize.
[2024-05-29 11:54:34] [INFO ] Deduced a trap composed of 164 places in 72 ms of which 1 ms to minimize.
[2024-05-29 11:54:34] [INFO ] Deduced a trap composed of 179 places in 71 ms of which 1 ms to minimize.
[2024-05-29 11:54:34] [INFO ] Deduced a trap composed of 193 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:54:35] [INFO ] Deduced a trap composed of 203 places in 85 ms of which 1 ms to minimize.
[2024-05-29 11:54:35] [INFO ] Deduced a trap composed of 220 places in 89 ms of which 1 ms to minimize.
[2024-05-29 11:54:35] [INFO ] Deduced a trap composed of 233 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:54:35] [INFO ] Deduced a trap composed of 255 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:54:36] [INFO ] Deduced a trap composed of 268 places in 94 ms of which 3 ms to minimize.
[2024-05-29 11:54:36] [INFO ] Deduced a trap composed of 284 places in 103 ms of which 4 ms to minimize.
[2024-05-29 11:54:37] [INFO ] Deduced a trap composed of 293 places in 115 ms of which 2 ms to minimize.
[2024-05-29 11:54:37] [INFO ] Deduced a trap composed of 310 places in 116 ms of which 3 ms to minimize.
[2024-05-29 11:54:37] [INFO ] Deduced a trap composed of 324 places in 117 ms of which 2 ms to minimize.
[2024-05-29 11:54:38] [INFO ] Deduced a trap composed of 334 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 1)
(s284 0)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 1)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 1)
(s334 0)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 1)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 1)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 1)
(s381 0)
(s382 1)
(s383 0)
(s384 0)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 1)
(s422 0)
(s423 1)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 1)
(s439 0)
(s440 1)
(s441 0)
(s442 1)
(s443 0)
(s444 1)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 1)
(s450 0)
(s451 0)
(s452 1)
(s453 0)
(s454 1)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 1)
(s470 0)
(s471 1)
(s472 0)
(s473 1)
(s474 0)
(s475 1)
(s476 0)
(s477 0)
(s478 1)
(s479 0)
(s480 1)
(s481 0)
(s482 0)
(s483 1)
(s484 0)
(s485 1)
(s486 0)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 0)
(s492 1)
(s493 0)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s502 1)
(s503 0)
(s504 1)
(s505 0)
(s506 1)
(s507 0)
(s508 0)
(s509 1)
(s510 0)
(s511 1)
(s512 0)
(s513 0)
(s514 1)
(s515 0)
(s516 1)
(s517 0)
(s518 0)
(s519 1)
(s520 timeout
0)
(s521 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 360 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 29/29 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 61302 ms. Remains : 933/933 places, 783/783 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-11 finished in 319969 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(p0))'
[2024-05-29 11:54:39] [INFO ] Flatten gal took : 57 ms
[2024-05-29 11:54:39] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 11:54:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1841 places, 1691 transitions and 4822 arcs took 8 ms.
Total runtime 2872654 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldPPPs-PT-030B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1841
TRANSITIONS: 1691
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.004s]
SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 5949
MODEL NAME: /home/mcc/execution/409/model
1841 places, 1691 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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="ShieldPPPs-PT-030B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldPPPs-PT-030B, 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 r355-tall-171683758800476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030B.tgz
mv ShieldPPPs-PT-030B 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 ;