Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024700108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024700108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.7K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 332K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652928954874

Running Version 202205111006
[2022-05-19 02:55:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 02:55:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 02:55:56] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-05-19 02:55:56] [INFO ] Transformed 1203 places.
[2022-05-19 02:55:56] [INFO ] Transformed 1183 transitions.
[2022-05-19 02:55:56] [INFO ] Found NUPN structural information;
[2022-05-19 02:55:56] [INFO ] Parsed PT model containing 1203 places and 1183 transitions in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-020B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 129 places :
Symmetric choice reduction at 0 with 129 rule applications. Total rules 129 place count 1074 transition count 1054
Iterating global reduction 0 with 129 rules applied. Total rules applied 258 place count 1074 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 259 place count 1073 transition count 1053
Iterating global reduction 0 with 1 rules applied. Total rules applied 260 place count 1073 transition count 1053
Applied a total of 260 rules in 245 ms. Remains 1073 /1203 variables (removed 130) and now considering 1053/1183 (removed 130) transitions.
// Phase 1: matrix 1053 rows 1073 cols
[2022-05-19 02:55:56] [INFO ] Computed 181 place invariants in 27 ms
[2022-05-19 02:55:57] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 1053 rows 1073 cols
[2022-05-19 02:55:57] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 02:55:58] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
// Phase 1: matrix 1053 rows 1073 cols
[2022-05-19 02:55:58] [INFO ] Computed 181 place invariants in 11 ms
[2022-05-19 02:55:58] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1073/1203 places, 1053/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1073/1203 places, 1053/1183 transitions.
Support contains 42 out of 1073 places after structural reductions.
[2022-05-19 02:55:59] [INFO ] Flatten gal took : 112 ms
[2022-05-19 02:55:59] [INFO ] Flatten gal took : 61 ms
[2022-05-19 02:55:59] [INFO ] Input system was already deterministic with 1053 transitions.
Support contains 36 out of 1073 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 25) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1053 rows 1073 cols
[2022-05-19 02:56:03] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 02:56:03] [INFO ] [Real]Absence check using 181 positive place invariants in 58 ms returned sat
[2022-05-19 02:56:03] [INFO ] After 416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 02:56:04] [INFO ] [Nat]Absence check using 181 positive place invariants in 49 ms returned sat
[2022-05-19 02:56:04] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 02:56:05] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 4 ms to minimize.
[2022-05-19 02:56:05] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2022-05-19 02:56:05] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 1 ms to minimize.
[2022-05-19 02:56:05] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 1 ms to minimize.
[2022-05-19 02:56:06] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2022-05-19 02:56:06] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 1 ms to minimize.
[2022-05-19 02:56:06] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 1 ms to minimize.
[2022-05-19 02:56:06] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 1 ms to minimize.
[2022-05-19 02:56:06] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 1 ms to minimize.
[2022-05-19 02:56:07] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 1 ms to minimize.
[2022-05-19 02:56:07] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2022-05-19 02:56:07] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 1 ms to minimize.
[2022-05-19 02:56:07] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 0 ms to minimize.
[2022-05-19 02:56:07] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2022-05-19 02:56:08] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 1 ms to minimize.
[2022-05-19 02:56:08] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 1 ms to minimize.
[2022-05-19 02:56:08] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2022-05-19 02:56:08] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 0 ms to minimize.
[2022-05-19 02:56:08] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 1 ms to minimize.
[2022-05-19 02:56:09] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 0 ms to minimize.
[2022-05-19 02:56:09] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2022-05-19 02:56:09] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2022-05-19 02:56:09] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-19 02:56:09] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 0 ms to minimize.
[2022-05-19 02:56:10] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2022-05-19 02:56:10] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 0 ms to minimize.
[2022-05-19 02:56:10] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 0 ms to minimize.
[2022-05-19 02:56:10] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2022-05-19 02:56:10] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2022-05-19 02:56:11] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2022-05-19 02:56:11] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
[2022-05-19 02:56:11] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2022-05-19 02:56:11] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 0 ms to minimize.
[2022-05-19 02:56:11] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 2 ms to minimize.
[2022-05-19 02:56:12] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2022-05-19 02:56:12] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 1 ms to minimize.
[2022-05-19 02:56:12] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 0 ms to minimize.
[2022-05-19 02:56:12] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2022-05-19 02:56:12] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 0 ms to minimize.
[2022-05-19 02:56:12] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2022-05-19 02:56:12] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 0 ms to minimize.
[2022-05-19 02:56:13] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 1 ms to minimize.
[2022-05-19 02:56:13] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 0 ms to minimize.
[2022-05-19 02:56:13] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2022-05-19 02:56:13] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 0 ms to minimize.
[2022-05-19 02:56:13] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2022-05-19 02:56:13] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 8885 ms
[2022-05-19 02:56:13] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2022-05-19 02:56:14] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2022-05-19 02:56:14] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2022-05-19 02:56:14] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2022-05-19 02:56:14] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2022-05-19 02:56:14] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-19 02:56:14] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-19 02:56:14] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2022-05-19 02:56:14] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 0 ms to minimize.
[2022-05-19 02:56:15] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 5 ms to minimize.
[2022-05-19 02:56:15] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2022-05-19 02:56:15] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2022-05-19 02:56:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1457 ms
[2022-05-19 02:56:15] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2022-05-19 02:56:15] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2022-05-19 02:56:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2022-05-19 02:56:15] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 0 ms to minimize.
[2022-05-19 02:56:15] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2022-05-19 02:56:16] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 0 ms to minimize.
[2022-05-19 02:56:16] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2022-05-19 02:56:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 515 ms
[2022-05-19 02:56:16] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 1 ms to minimize.
[2022-05-19 02:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-19 02:56:16] [INFO ] After 12255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 258 ms.
[2022-05-19 02:56:16] [INFO ] After 12885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 183 ms.
Support contains 7 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1073 transition count 953
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 973 transition count 953
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 973 transition count 852
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 872 transition count 852
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 410 place count 864 transition count 844
Iterating global reduction 2 with 8 rules applied. Total rules applied 418 place count 864 transition count 844
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 418 place count 864 transition count 843
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 420 place count 863 transition count 843
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 358
Deduced a syphon composed of 358 places in 1 ms
Reduce places removed 358 places and 0 transitions.
Iterating global reduction 2 with 716 rules applied. Total rules applied 1136 place count 505 transition count 485
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 136 times.
Drop transitions removed 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 1272 place count 505 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1273 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1274 place count 503 transition count 484
Applied a total of 1274 rules in 190 ms. Remains 503 /1073 variables (removed 570) and now considering 484/1053 (removed 569) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/1073 places, 484/1053 transitions.
Finished random walk after 1670 steps, including 0 resets, run visited all 6 properties in 25 ms. (steps per millisecond=66 )
Computed a total of 244 stabilizing places and 244 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(X(p1))))'
Support contains 2 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1063 transition count 1043
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1063 transition count 1043
Applied a total of 20 rules in 90 ms. Remains 1063 /1073 variables (removed 10) and now considering 1043/1053 (removed 10) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:56:17] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 02:56:17] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:56:17] [INFO ] Computed 181 place invariants in 18 ms
[2022-05-19 02:56:18] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 02:56:18] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 02:56:19] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1073 places, 1043/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1073 places, 1043/1053 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s470 0), p0:(EQ s592 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 789 ms.
Product exploration explored 100000 steps with 50000 reset in 745 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 1119 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-020B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLFireability-00 finished in 4674 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1072 transition count 951
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 971 transition count 951
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 971 transition count 850
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 870 transition count 850
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 415 place count 859 transition count 839
Iterating global reduction 2 with 11 rules applied. Total rules applied 426 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 426 place count 859 transition count 838
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 858 transition count 838
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 0 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1134 place count 505 transition count 485
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 1136 place count 503 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1137 place count 502 transition count 483
Applied a total of 1137 rules in 140 ms. Remains 502 /1073 variables (removed 571) and now considering 483/1053 (removed 570) transitions.
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 02:56:22] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:56:22] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 02:56:22] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:56:22] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2022-05-19 02:56:23] [INFO ] Redundant transitions in 83 ms returned [482]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:56:23] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:56:23] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/1073 places, 482/1053 transitions.
Applied a total of 0 rules in 12 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 502/1073 places, 482/1053 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s389 1) (EQ s411 1)), p1:(OR (EQ s12 0) (EQ s21 0) (EQ s25 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 683 reset in 491 ms.
Product exploration explored 100000 steps with 703 reset in 567 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 : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1907 steps, including 1 resets, run visited all 2 properties in 19 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:56:25] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:56:25] [INFO ] [Real]Absence check using 180 positive place invariants in 52 ms returned sat
[2022-05-19 02:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:56:26] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2022-05-19 02:56:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:56:29] [INFO ] [Nat]Absence check using 180 positive place invariants in 28 ms returned sat
[2022-05-19 02:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:56:29] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-05-19 02:56:29] [INFO ] Computed and/alt/rep : 480/1198/480 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-19 02:56:33] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2022-05-19 02:56:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-19 02:56:33] [INFO ] Added : 432 causal constraints over 88 iterations in 3913 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 482/482 transitions.
Applied a total of 0 rules in 17 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:56:33] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:56:33] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:56:33] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:56:33] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2022-05-19 02:56:34] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:56:34] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:56:34] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/502 places, 482/482 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 : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2023 steps, including 1 resets, run visited all 2 properties in 16 ms. (steps per millisecond=126 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:56:35] [INFO ] Computed 180 place invariants in 12 ms
[2022-05-19 02:56:35] [INFO ] [Real]Absence check using 180 positive place invariants in 54 ms returned sat
[2022-05-19 02:56:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 02:56:35] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2022-05-19 02:56:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 02:56:36] [INFO ] [Nat]Absence check using 180 positive place invariants in 55 ms returned sat
[2022-05-19 02:56:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 02:56:36] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2022-05-19 02:56:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2022-05-19 02:56:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2022-05-19 02:56:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2022-05-19 02:56:36] [INFO ] Computed and/alt/rep : 480/1198/480 causal constraints (skipped 0 transitions) in 28 ms.
[2022-05-19 02:56:41] [INFO ] Added : 408 causal constraints over 82 iterations in 4974 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 700 reset in 481 ms.
Product exploration explored 100000 steps with 705 reset in 523 ms.
Built C files in :
/tmp/ltsmin2341010747508083619
[2022-05-19 02:56:43] [INFO ] Computing symmetric may disable matrix : 482 transitions.
[2022-05-19 02:56:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:56:43] [INFO ] Computing symmetric may enable matrix : 482 transitions.
[2022-05-19 02:56:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:56:43] [INFO ] Computing Do-Not-Accords matrix : 482 transitions.
[2022-05-19 02:56:43] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:56:43] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2341010747508083619
Running compilation step : cd /tmp/ltsmin2341010747508083619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1292 ms.
Running link step : cd /tmp/ltsmin2341010747508083619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin2341010747508083619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15070478594296728711.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 482/482 transitions.
Applied a total of 0 rules in 14 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:56:58] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:56:58] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:56:58] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:56:58] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2022-05-19 02:56:58] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:56:58] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:56:59] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/502 places, 482/482 transitions.
Built C files in :
/tmp/ltsmin4536043668016707402
[2022-05-19 02:56:59] [INFO ] Computing symmetric may disable matrix : 482 transitions.
[2022-05-19 02:56:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:56:59] [INFO ] Computing symmetric may enable matrix : 482 transitions.
[2022-05-19 02:56:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:56:59] [INFO ] Computing Do-Not-Accords matrix : 482 transitions.
[2022-05-19 02:56:59] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:56:59] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4536043668016707402
Running compilation step : cd /tmp/ltsmin4536043668016707402;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1037 ms.
Running link step : cd /tmp/ltsmin4536043668016707402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4536043668016707402;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12617494158435276764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 02:57:14] [INFO ] Flatten gal took : 30 ms
[2022-05-19 02:57:14] [INFO ] Flatten gal took : 32 ms
[2022-05-19 02:57:14] [INFO ] Time to serialize gal into /tmp/LTL12643278159142366406.gal : 6 ms
[2022-05-19 02:57:14] [INFO ] Time to serialize properties into /tmp/LTL11627770984726319497.ltl : 39 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12643278159142366406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11627770984726319497.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1264327...268
Read 1 LTL properties
Checking formula 0 : !((G((F("((p934==1)&&(p985==1))"))&&(F(G("(((p46==0)||(p65==0))||(p76==0))"))))))
Formula 0 simplified : !G(F"((p934==1)&&(p985==1))" & FG"(((p46==0)||(p65==0))||(p76==0))")
Detected timeout of ITS tools.
[2022-05-19 02:57:29] [INFO ] Flatten gal took : 29 ms
[2022-05-19 02:57:29] [INFO ] Applying decomposition
[2022-05-19 02:57:29] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2381975591629961531.txt' '-o' '/tmp/graph2381975591629961531.bin' '-w' '/tmp/graph2381975591629961531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2381975591629961531.bin' '-l' '-1' '-v' '-w' '/tmp/graph2381975591629961531.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:57:29] [INFO ] Decomposing Gal with order
[2022-05-19 02:57:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:57:29] [INFO ] Removed a total of 315 redundant transitions.
[2022-05-19 02:57:29] [INFO ] Flatten gal took : 129 ms
[2022-05-19 02:57:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 304 labels/synchronizations in 18 ms.
[2022-05-19 02:57:29] [INFO ] Time to serialize gal into /tmp/LTL14022688255278382015.gal : 8 ms
[2022-05-19 02:57:29] [INFO ] Time to serialize properties into /tmp/LTL12161434800328639025.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14022688255278382015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12161434800328639025.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1402268...247
Read 1 LTL properties
Checking formula 0 : !((G((F("((i15.i1.u141.p934==1)&&(i16.i1.u148.p985==1))"))&&(F(G("(((i0.i2.u5.p46==0)||(i0.i2.u8.p65==0))||(i0.i1.u9.p76==0))"))))))
Formula 0 simplified : !G(F"((i15.i1.u141.p934==1)&&(i16.i1.u148.p985==1))" & FG"(((i0.i2.u5.p46==0)||(i0.i2.u8.p65==0))||(i0.i1.u9.p76==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9853064497286204005
[2022-05-19 02:57:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9853064497286204005
Running compilation step : cd /tmp/ltsmin9853064497286204005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 747 ms.
Running link step : cd /tmp/ltsmin9853064497286204005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9853064497286204005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-01 finished in 97867 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1072 transition count 952
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 972 transition count 952
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 972 transition count 852
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 872 transition count 852
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 410 place count 862 transition count 842
Iterating global reduction 2 with 10 rules applied. Total rules applied 420 place count 862 transition count 842
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 420 place count 862 transition count 841
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 422 place count 861 transition count 841
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 0 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 2 with 712 rules applied. Total rules applied 1134 place count 505 transition count 485
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 1136 place count 503 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1137 place count 502 transition count 483
Applied a total of 1137 rules in 106 ms. Remains 502 /1073 variables (removed 571) and now considering 483/1053 (removed 570) transitions.
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 02:58:00] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:58:00] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 02:58:00] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:58:00] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2022-05-19 02:58:00] [INFO ] Redundant transitions in 50 ms returned [482]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:58:00] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:58:01] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/1073 places, 482/1053 transitions.
Applied a total of 0 rules in 10 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 502/1073 places, 482/1053 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (NEQ s312 1) (NEQ s321 1) (NEQ s327 1)), p0:(EQ s344 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24024 reset in 510 ms.
Product exploration explored 100000 steps with 23805 reset in 570 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/502 stabilizing places and 2/482 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 380 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 244 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 482/482 transitions.
Applied a total of 0 rules in 16 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:58:02] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:58:03] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:58:03] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:58:03] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2022-05-19 02:58:03] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:58:03] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:58:03] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/502 places, 482/482 transitions.
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/502 stabilizing places and 2/482 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 459 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 345 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 23920 reset in 518 ms.
Product exploration explored 100000 steps with 24009 reset in 570 ms.
Built C files in :
/tmp/ltsmin18107680569955235342
[2022-05-19 02:58:05] [INFO ] Computing symmetric may disable matrix : 482 transitions.
[2022-05-19 02:58:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:58:05] [INFO ] Computing symmetric may enable matrix : 482 transitions.
[2022-05-19 02:58:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:58:05] [INFO ] Computing Do-Not-Accords matrix : 482 transitions.
[2022-05-19 02:58:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:58:05] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18107680569955235342
Running compilation step : cd /tmp/ltsmin18107680569955235342;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1125 ms.
Running link step : cd /tmp/ltsmin18107680569955235342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18107680569955235342;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1146300223774332439.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 482/482 transitions.
Applied a total of 0 rules in 13 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:58:20] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:58:20] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:58:20] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:58:21] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2022-05-19 02:58:21] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 02:58:21] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:58:21] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/502 places, 482/482 transitions.
Built C files in :
/tmp/ltsmin14703606161492114810
[2022-05-19 02:58:21] [INFO ] Computing symmetric may disable matrix : 482 transitions.
[2022-05-19 02:58:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:58:21] [INFO ] Computing symmetric may enable matrix : 482 transitions.
[2022-05-19 02:58:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:58:21] [INFO ] Computing Do-Not-Accords matrix : 482 transitions.
[2022-05-19 02:58:21] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:58:21] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14703606161492114810
Running compilation step : cd /tmp/ltsmin14703606161492114810;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1069 ms.
Running link step : cd /tmp/ltsmin14703606161492114810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14703606161492114810;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13810931452442886293.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 02:58:36] [INFO ] Flatten gal took : 21 ms
[2022-05-19 02:58:36] [INFO ] Flatten gal took : 20 ms
[2022-05-19 02:58:36] [INFO ] Time to serialize gal into /tmp/LTL14073160874963669130.gal : 3 ms
[2022-05-19 02:58:36] [INFO ] Time to serialize properties into /tmp/LTL7587237892841366841.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14073160874963669130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7587237892841366841.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1407316...267
Read 1 LTL properties
Checking formula 0 : !((F(("(p824==1)")||(G("(((p754!=1)||(p773!=1))||(p787!=1))")))))
Formula 0 simplified : !F("(p824==1)" | G"(((p754!=1)||(p773!=1))||(p787!=1))")
Detected timeout of ITS tools.
[2022-05-19 02:58:51] [INFO ] Flatten gal took : 24 ms
[2022-05-19 02:58:51] [INFO ] Applying decomposition
[2022-05-19 02:58:52] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16791322136774370308.txt' '-o' '/tmp/graph16791322136774370308.bin' '-w' '/tmp/graph16791322136774370308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16791322136774370308.bin' '-l' '-1' '-v' '-w' '/tmp/graph16791322136774370308.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:58:52] [INFO ] Decomposing Gal with order
[2022-05-19 02:58:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:58:52] [INFO ] Removed a total of 318 redundant transitions.
[2022-05-19 02:58:52] [INFO ] Flatten gal took : 44 ms
[2022-05-19 02:58:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 7 ms.
[2022-05-19 02:58:52] [INFO ] Time to serialize gal into /tmp/LTL18211465499136801574.gal : 4 ms
[2022-05-19 02:58:52] [INFO ] Time to serialize properties into /tmp/LTL5892750594885056711.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18211465499136801574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5892750594885056711.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1821146...246
Read 1 LTL properties
Checking formula 0 : !((F(("(i13.u125.p824==1)")||(G("(((i12.i2.u113.p754!=1)||(i12.i2.u116.p773!=1))||(i12.i0.u118.p787!=1))")))))
Formula 0 simplified : !F("(i13.u125.p824==1)" | G"(((i12.i2.u113.p754!=1)||(i12.i2.u116.p773!=1))||(i12.i0.u118.p787!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11000832088725406362
[2022-05-19 02:59:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11000832088725406362
Running compilation step : cd /tmp/ltsmin11000832088725406362;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1085 ms.
Running link step : cd /tmp/ltsmin11000832088725406362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11000832088725406362;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-02 finished in 82331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(p1))&&G(F(G(p2)))))'
Support contains 3 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1065 transition count 1045
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1065 transition count 1045
Applied a total of 16 rules in 38 ms. Remains 1065 /1073 variables (removed 8) and now considering 1045/1053 (removed 8) transitions.
// Phase 1: matrix 1045 rows 1065 cols
[2022-05-19 02:59:22] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 02:59:22] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 1045 rows 1065 cols
[2022-05-19 02:59:22] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 02:59:23] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
// Phase 1: matrix 1045 rows 1065 cols
[2022-05-19 02:59:23] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 02:59:23] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1065/1073 places, 1045/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 1065/1073 places, 1045/1053 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) p1), p1, p1, (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s791 1), p1:(EQ s55 1), p2:(EQ s316 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 73 reset in 529 ms.
Product exploration explored 100000 steps with 83 reset in 586 ms.
Computed a total of 241 stabilizing places and 241 stable transitions
Computed a total of 241 stabilizing places and 241 stable transitions
Detected a total of 241/1065 stabilizing places and 241/1045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), true, (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 349 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
Finished random walk after 329 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=164 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), true, (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 10 factoid took 762 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Support contains 1 out of 1065 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 : 1065/1065 places, 1045/1045 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1064 transition count 943
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 963 transition count 943
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 202 place count 963 transition count 844
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 400 place count 864 transition count 844
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 1114 place count 507 transition count 487
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 1116 place count 505 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1117 place count 504 transition count 485
Applied a total of 1117 rules in 68 ms. Remains 504 /1065 variables (removed 561) and now considering 485/1045 (removed 560) transitions.
// Phase 1: matrix 485 rows 504 cols
[2022-05-19 02:59:26] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 02:59:26] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 485 rows 504 cols
[2022-05-19 02:59:26] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 02:59:27] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2022-05-19 02:59:27] [INFO ] Redundant transitions in 46 ms returned [484]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 484 rows 504 cols
[2022-05-19 02:59:27] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:59:27] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1065 places, 484/1045 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 504/1065 places, 484/1045 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/504 stabilizing places and 4/484 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p2, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p2)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p2, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Product exploration explored 100000 steps with 95 reset in 505 ms.
Product exploration explored 100000 steps with 95 reset in 578 ms.
Built C files in :
/tmp/ltsmin8942041018771670409
[2022-05-19 02:59:29] [INFO ] Computing symmetric may disable matrix : 484 transitions.
[2022-05-19 02:59:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:59:29] [INFO ] Computing symmetric may enable matrix : 484 transitions.
[2022-05-19 02:59:29] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:59:29] [INFO ] Computing Do-Not-Accords matrix : 484 transitions.
[2022-05-19 02:59:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:59:29] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8942041018771670409
Running compilation step : cd /tmp/ltsmin8942041018771670409;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1034 ms.
Running link step : cd /tmp/ltsmin8942041018771670409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8942041018771670409;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16282266399479724994.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 484/484 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 501 transition count 481
Applied a total of 3 rules in 29 ms. Remains 501 /504 variables (removed 3) and now considering 481/484 (removed 3) transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:59:44] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:59:44] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:59:44] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:59:45] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2022-05-19 02:59:45] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 02:59:45] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 02:59:45] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/504 places, 481/484 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/504 places, 481/484 transitions.
Built C files in :
/tmp/ltsmin736002101410184510
[2022-05-19 02:59:45] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2022-05-19 02:59:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:59:45] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2022-05-19 02:59:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:59:45] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2022-05-19 02:59:45] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 02:59:45] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin736002101410184510
Running compilation step : cd /tmp/ltsmin736002101410184510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1018 ms.
Running link step : cd /tmp/ltsmin736002101410184510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin736002101410184510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5947425998318132496.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 03:00:00] [INFO ] Flatten gal took : 18 ms
[2022-05-19 03:00:00] [INFO ] Flatten gal took : 22 ms
[2022-05-19 03:00:00] [INFO ] Time to serialize gal into /tmp/LTL16228329624048846519.gal : 2 ms
[2022-05-19 03:00:00] [INFO ] Time to serialize properties into /tmp/LTL3444034287867678791.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16228329624048846519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3444034287867678791.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1622832...267
Read 1 LTL properties
Checking formula 0 : !(((!(("(p890==1)")U(X("(p57==1)"))))&&(G(F(G("(p352==0)"))))))
Formula 0 simplified : !(!("(p890==1)" U X"(p57==1)") & GFG"(p352==0)")
Detected timeout of ITS tools.
[2022-05-19 03:00:15] [INFO ] Flatten gal took : 21 ms
[2022-05-19 03:00:15] [INFO ] Applying decomposition
[2022-05-19 03:00:15] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8765292924240397500.txt' '-o' '/tmp/graph8765292924240397500.bin' '-w' '/tmp/graph8765292924240397500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8765292924240397500.bin' '-l' '-1' '-v' '-w' '/tmp/graph8765292924240397500.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:00:15] [INFO ] Decomposing Gal with order
[2022-05-19 03:00:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:00:15] [INFO ] Removed a total of 315 redundant transitions.
[2022-05-19 03:00:15] [INFO ] Flatten gal took : 32 ms
[2022-05-19 03:00:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 296 labels/synchronizations in 6 ms.
[2022-05-19 03:00:15] [INFO ] Time to serialize gal into /tmp/LTL3017466646415450890.gal : 3 ms
[2022-05-19 03:00:15] [INFO ] Time to serialize properties into /tmp/LTL9733252845862630531.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3017466646415450890.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9733252845862630531.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3017466...245
Read 1 LTL properties
Checking formula 0 : !(((!(("(i14.i2.u134.p890==1)")U(X("(i0.i0.u7.p57==1)"))))&&(G(F(G("(i5.u52.p352==0)"))))))
Formula 0 simplified : !(!("(i14.i2.u134.p890==1)" U X"(i0.i0.u7.p57==1)") & GFG"(i5.u52.p352==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12090028755110993997
[2022-05-19 03:00:30] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12090028755110993997
Running compilation step : cd /tmp/ltsmin12090028755110993997;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 746 ms.
Running link step : cd /tmp/ltsmin12090028755110993997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12090028755110993997;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!((LTLAPp0==true) U X((LTLAPp1==true)))&&[](<>([]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-03 finished in 83427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(G(p0))&&p0)))&&(X(p1)||F(X(p2)))))'
Support contains 5 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1063 transition count 1043
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1063 transition count 1043
Applied a total of 20 rules in 49 ms. Remains 1063 /1073 variables (removed 10) and now considering 1043/1053 (removed 10) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:00:45] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 03:00:46] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:00:46] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 03:00:47] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:00:47] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 03:00:47] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1073 places, 1043/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1073 places, 1043/1053 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s150 0) (EQ s168 0) (EQ s175 0)), p1:(EQ s335 1), p2:(EQ s572 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4541 steps with 1 reset in 28 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-04 finished in 2254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 2 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1064 transition count 1044
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1064 transition count 1044
Applied a total of 18 rules in 36 ms. Remains 1064 /1073 variables (removed 9) and now considering 1044/1053 (removed 9) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2022-05-19 03:00:48] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 03:00:48] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 1044 rows 1064 cols
[2022-05-19 03:00:48] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:00:49] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
// Phase 1: matrix 1044 rows 1064 cols
[2022-05-19 03:00:49] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 03:00:49] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1064/1073 places, 1044/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 1064/1073 places, 1044/1053 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s623 1), p0:(EQ s323 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-05 finished in 1697 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(p0) U (G(!X(p2))&&p1))))'
Support contains 6 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1063 transition count 1043
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1063 transition count 1043
Applied a total of 20 rules in 42 ms. Remains 1063 /1073 variables (removed 10) and now considering 1043/1053 (removed 10) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:00:49] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 03:00:50] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:00:50] [INFO ] Computed 181 place invariants in 10 ms
[2022-05-19 03:00:50] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:00:50] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:00:51] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1073 places, 1043/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1073 places, 1043/1053 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s323 1), p1:(AND (EQ s827 1) (EQ s843 1) (EQ s852 1)), p2:(AND (EQ s409 1) (EQ s477 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 535 ms.
Product exploration explored 100000 steps with 43 reset in 581 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 963 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:00:54] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 03:00:54] [INFO ] [Real]Absence check using 181 positive place invariants in 42 ms returned sat
[2022-05-19 03:00:54] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:00:54] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2022-05-19 03:00:55] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:00:55] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 1 ms to minimize.
[2022-05-19 03:00:55] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 0 ms to minimize.
[2022-05-19 03:00:55] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2022-05-19 03:00:56] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2022-05-19 03:00:56] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2022-05-19 03:00:56] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 1 ms to minimize.
[2022-05-19 03:00:56] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 0 ms to minimize.
[2022-05-19 03:00:56] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 0 ms to minimize.
[2022-05-19 03:00:57] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2022-05-19 03:00:57] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2022-05-19 03:00:57] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 0 ms to minimize.
[2022-05-19 03:00:57] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2022-05-19 03:00:57] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2022-05-19 03:00:58] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 1 ms to minimize.
[2022-05-19 03:00:58] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 0 ms to minimize.
[2022-05-19 03:00:58] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 4 ms to minimize.
[2022-05-19 03:00:58] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 1 ms to minimize.
[2022-05-19 03:00:58] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 0 ms to minimize.
[2022-05-19 03:00:59] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2022-05-19 03:00:59] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2022-05-19 03:00:59] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 0 ms to minimize.
[2022-05-19 03:00:59] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2022-05-19 03:00:59] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2022-05-19 03:00:59] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 0 ms to minimize.
[2022-05-19 03:01:00] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2022-05-19 03:01:00] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2022-05-19 03:01:00] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2022-05-19 03:01:00] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 1 ms to minimize.
[2022-05-19 03:01:00] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 1 ms to minimize.
[2022-05-19 03:01:01] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 1 ms to minimize.
[2022-05-19 03:01:01] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 0 ms to minimize.
[2022-05-19 03:01:01] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 1 ms to minimize.
[2022-05-19 03:01:01] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 0 ms to minimize.
[2022-05-19 03:01:01] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 1 ms to minimize.
[2022-05-19 03:01:01] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 0 ms to minimize.
[2022-05-19 03:01:02] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2022-05-19 03:01:02] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 0 ms to minimize.
[2022-05-19 03:01:02] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 1 ms to minimize.
[2022-05-19 03:01:02] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 0 ms to minimize.
[2022-05-19 03:01:02] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 0 ms to minimize.
[2022-05-19 03:01:02] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2022-05-19 03:01:03] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2022-05-19 03:01:03] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2022-05-19 03:01:03] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 7897 ms
[2022-05-19 03:01:03] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2022-05-19 03:01:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-19 03:01:03] [INFO ] After 8551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-19 03:01:03] [INFO ] After 8830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 60 ms.
Support contains 6 out of 1063 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1063 transition count 942
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 962 transition count 841
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 861 transition count 841
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 1 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 2 with 712 rules applied. Total rules applied 1116 place count 505 transition count 485
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 134 times.
Drop transitions removed 134 transitions
Iterating global reduction 2 with 134 rules applied. Total rules applied 1250 place count 505 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1251 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1252 place count 503 transition count 484
Applied a total of 1252 rules in 88 ms. Remains 503 /1063 variables (removed 560) and now considering 484/1043 (removed 559) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/1063 places, 484/1043 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 249120 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249120 steps, saw 89081 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:01:06] [INFO ] Computed 180 place invariants in 23 ms
[2022-05-19 03:01:07] [INFO ] [Real]Absence check using 176 positive place invariants in 21 ms returned sat
[2022-05-19 03:01:07] [INFO ] [Real]Absence check using 176 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 03:01:07] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:01:07] [INFO ] [Nat]Absence check using 176 positive place invariants in 27 ms returned sat
[2022-05-19 03:01:07] [INFO ] [Nat]Absence check using 176 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 03:01:07] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:01:07] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2022-05-19 03:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2022-05-19 03:01:07] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-19 03:01:07] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:01:07] [INFO ] Computed 180 place invariants in 9 ms
[2022-05-19 03:01:08] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:01:08] [INFO ] Computed 180 place invariants in 9 ms
[2022-05-19 03:01:08] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2022-05-19 03:01:08] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:01:08] [INFO ] Computed 180 place invariants in 4 ms
[2022-05-19 03:01:08] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:01:08] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:01:08] [INFO ] [Real]Absence check using 176 positive place invariants in 22 ms returned sat
[2022-05-19 03:01:08] [INFO ] [Real]Absence check using 176 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 03:01:09] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:01:09] [INFO ] [Nat]Absence check using 176 positive place invariants in 22 ms returned sat
[2022-05-19 03:01:09] [INFO ] [Nat]Absence check using 176 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 03:01:09] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:01:09] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2022-05-19 03:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-05-19 03:01:09] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-19 03:01:09] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-19 03:01:09] [INFO ] Flatten gal took : 18 ms
[2022-05-19 03:01:09] [INFO ] Flatten gal took : 18 ms
[2022-05-19 03:01:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8988819365066865124.gal : 4 ms
[2022-05-19 03:01:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4782583216504318573.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3553867194616359962;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8988819365066865124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4782583216504318573.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4782583216504318573.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 95
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :95 after 161
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :161 after 1848
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1848 after 2809
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2809 after 13222
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :13222 after 215653
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :215653 after 3.94074e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.94074e+06 after 1.28005e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.28005e+08 after 1.50946e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.50946e+10 after 2.67786e+10
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.67786e+10 after 5.63994e+11
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :5.63994e+11 after 5.61521e+13
Detected timeout of ITS tools.
[2022-05-19 03:01:24] [INFO ] Flatten gal took : 18 ms
[2022-05-19 03:01:24] [INFO ] Applying decomposition
[2022-05-19 03:01:24] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1331533841268932485.txt' '-o' '/tmp/graph1331533841268932485.bin' '-w' '/tmp/graph1331533841268932485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1331533841268932485.bin' '-l' '-1' '-v' '-w' '/tmp/graph1331533841268932485.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:01:24] [INFO ] Decomposing Gal with order
[2022-05-19 03:01:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:01:24] [INFO ] Removed a total of 377 redundant transitions.
[2022-05-19 03:01:24] [INFO ] Flatten gal took : 34 ms
[2022-05-19 03:01:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 8 ms.
[2022-05-19 03:01:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9182759959678228648.gal : 3 ms
[2022-05-19 03:01:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7055975054442133800.prop : 110 ms
Invoking ITS tools like this :cd /tmp/redAtoms3553867194616359962;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9182759959678228648.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7055975054442133800.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality7055975054442133800.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2 after 547056
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :547056 after 1.12454e+32
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6999450376210116821
[2022-05-19 03:01:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6999450376210116821
Running compilation step : cd /tmp/ltsmin6999450376210116821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 796 ms.
Running link step : cd /tmp/ltsmin6999450376210116821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6999450376210116821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (AND p0 p1)), (F p1), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 17 factoid took 1036 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Support contains 6 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1063 /1063 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:01:56] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 03:01:56] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:01:56] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:01:57] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:01:57] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 03:01:58] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1063 places, 1043/1043 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 640 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:01:59] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 03:01:59] [INFO ] [Real]Absence check using 181 positive place invariants in 45 ms returned sat
[2022-05-19 03:01:59] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:02:00] [INFO ] [Nat]Absence check using 181 positive place invariants in 43 ms returned sat
[2022-05-19 03:02:00] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:02:00] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 1 ms to minimize.
[2022-05-19 03:02:00] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 0 ms to minimize.
[2022-05-19 03:02:01] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2022-05-19 03:02:01] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2022-05-19 03:02:01] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 1 ms to minimize.
[2022-05-19 03:02:01] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 1 ms to minimize.
[2022-05-19 03:02:01] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2022-05-19 03:02:02] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
[2022-05-19 03:02:02] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 1 ms to minimize.
[2022-05-19 03:02:02] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2022-05-19 03:02:02] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 1 ms to minimize.
[2022-05-19 03:02:02] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2022-05-19 03:02:03] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2022-05-19 03:02:03] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2022-05-19 03:02:03] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 1 ms to minimize.
[2022-05-19 03:02:03] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2022-05-19 03:02:03] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 0 ms to minimize.
[2022-05-19 03:02:04] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 0 ms to minimize.
[2022-05-19 03:02:04] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 1 ms to minimize.
[2022-05-19 03:02:04] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2022-05-19 03:02:04] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 1 ms to minimize.
[2022-05-19 03:02:04] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2022-05-19 03:02:04] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2022-05-19 03:02:05] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2022-05-19 03:02:05] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2022-05-19 03:02:05] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 0 ms to minimize.
[2022-05-19 03:02:05] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 0 ms to minimize.
[2022-05-19 03:02:05] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 1 ms to minimize.
[2022-05-19 03:02:06] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 1 ms to minimize.
[2022-05-19 03:02:06] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 0 ms to minimize.
[2022-05-19 03:02:06] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2022-05-19 03:02:06] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 0 ms to minimize.
[2022-05-19 03:02:06] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 1 ms to minimize.
[2022-05-19 03:02:06] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2022-05-19 03:02:07] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 0 ms to minimize.
[2022-05-19 03:02:07] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 0 ms to minimize.
[2022-05-19 03:02:07] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 0 ms to minimize.
[2022-05-19 03:02:07] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2022-05-19 03:02:07] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 1 ms to minimize.
[2022-05-19 03:02:07] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2022-05-19 03:02:08] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 0 ms to minimize.
[2022-05-19 03:02:08] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-19 03:02:08] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2022-05-19 03:02:08] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 7871 ms
[2022-05-19 03:02:08] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2022-05-19 03:02:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-19 03:02:08] [INFO ] After 8510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-19 03:02:08] [INFO ] After 8798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 42 ms.
Support contains 6 out of 1063 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1063 transition count 942
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 962 transition count 841
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 861 transition count 841
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 0 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 2 with 712 rules applied. Total rules applied 1116 place count 505 transition count 485
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 134 times.
Drop transitions removed 134 transitions
Iterating global reduction 2 with 134 rules applied. Total rules applied 1250 place count 505 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1251 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1252 place count 503 transition count 484
Applied a total of 1252 rules in 66 ms. Remains 503 /1063 variables (removed 560) and now considering 484/1043 (removed 559) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/1063 places, 484/1043 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 273671 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273671 steps, saw 93424 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:02:12] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:02:12] [INFO ] [Real]Absence check using 176 positive place invariants in 21 ms returned sat
[2022-05-19 03:02:12] [INFO ] [Real]Absence check using 176 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 03:02:12] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:02:12] [INFO ] [Nat]Absence check using 176 positive place invariants in 24 ms returned sat
[2022-05-19 03:02:12] [INFO ] [Nat]Absence check using 176 positive and 4 generalized place invariants in 16 ms returned sat
[2022-05-19 03:02:12] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:02:12] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-05-19 03:02:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-05-19 03:02:12] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-19 03:02:12] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:02:12] [INFO ] Computed 180 place invariants in 4 ms
[2022-05-19 03:02:13] [INFO ] Implicit Places using invariants in 390 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:02:13] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:02:13] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2022-05-19 03:02:13] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:02:13] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:02:14] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:02:14] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:02:14] [INFO ] [Real]Absence check using 176 positive place invariants in 20 ms returned sat
[2022-05-19 03:02:14] [INFO ] [Real]Absence check using 176 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 03:02:14] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:02:14] [INFO ] [Nat]Absence check using 176 positive place invariants in 22 ms returned sat
[2022-05-19 03:02:14] [INFO ] [Nat]Absence check using 176 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-19 03:02:14] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:02:14] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2022-05-19 03:02:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-19 03:02:14] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-19 03:02:14] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-19 03:02:14] [INFO ] Flatten gal took : 18 ms
[2022-05-19 03:02:14] [INFO ] Flatten gal took : 19 ms
[2022-05-19 03:02:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1250233983029633838.gal : 5 ms
[2022-05-19 03:02:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17873252612019222895.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2994463160282195426;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1250233983029633838.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17873252612019222895.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17873252612019222895.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 95
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :95 after 161
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :161 after 1848
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1848 after 2809
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2809 after 13222
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :13222 after 215653
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :215653 after 3.94074e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.94074e+06 after 1.28005e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.28005e+08 after 1.50946e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.50946e+10 after 2.67786e+10
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.67786e+10 after 5.63994e+11
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :5.63994e+11 after 5.61521e+13
Detected timeout of ITS tools.
[2022-05-19 03:02:29] [INFO ] Flatten gal took : 19 ms
[2022-05-19 03:02:29] [INFO ] Applying decomposition
[2022-05-19 03:02:29] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17870305106965962556.txt' '-o' '/tmp/graph17870305106965962556.bin' '-w' '/tmp/graph17870305106965962556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17870305106965962556.bin' '-l' '-1' '-v' '-w' '/tmp/graph17870305106965962556.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:02:30] [INFO ] Decomposing Gal with order
[2022-05-19 03:02:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:02:30] [INFO ] Removed a total of 373 redundant transitions.
[2022-05-19 03:02:30] [INFO ] Flatten gal took : 38 ms
[2022-05-19 03:02:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 408 labels/synchronizations in 7 ms.
[2022-05-19 03:02:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11569041478813077903.gal : 3 ms
[2022-05-19 03:02:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality583802865345173854.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2994463160282195426;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11569041478813077903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality583802865345173854.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality583802865345173854.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :547056 after 5.88483e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5.88483e+09 after 1.68016e+30
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4471139628643907305
[2022-05-19 03:02:45] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4471139628643907305
Running compilation step : cd /tmp/ltsmin4471139628643907305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 926 ms.
Running link step : cd /tmp/ltsmin4471139628643907305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4471139628643907305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (AND p0 p1)), (F p1), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 17 factoid took 877 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 478 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Product exploration explored 100000 steps with 42 reset in 502 ms.
Product exploration explored 100000 steps with 42 reset in 560 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 161 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Support contains 6 out of 1063 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1063 transition count 1043
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 100 place count 1063 transition count 1045
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 141 place count 1063 transition count 1045
Performed 417 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 558 places in 0 ms
Iterating global reduction 1 with 417 rules applied. Total rules applied 558 place count 1063 transition count 1045
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 699 place count 922 transition count 904
Deduced a syphon composed of 417 places in 0 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 840 place count 922 transition count 904
Deduced a syphon composed of 417 places in 1 ms
Applied a total of 840 rules in 284 ms. Remains 922 /1063 variables (removed 141) and now considering 904/1043 (removed 139) transitions.
[2022-05-19 03:03:03] [INFO ] Redundant transitions in 52 ms returned [903]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 903 rows 922 cols
[2022-05-19 03:03:03] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 03:03:04] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 922/1063 places, 903/1043 transitions.
Deduced a syphon composed of 417 places in 1 ms
Applied a total of 0 rules in 21 ms. Remains 922 /922 variables (removed 0) and now considering 903/903 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 922/1063 places, 903/1043 transitions.
Product exploration explored 100000 steps with 42 reset in 512 ms.
Product exploration explored 100000 steps with 41 reset in 597 ms.
Built C files in :
/tmp/ltsmin1362898743902867406
[2022-05-19 03:03:05] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1362898743902867406
Running compilation step : cd /tmp/ltsmin1362898743902867406;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1731 ms.
Running link step : cd /tmp/ltsmin1362898743902867406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1362898743902867406;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13348120759008429311.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Applied a total of 0 rules in 22 ms. Remains 1063 /1063 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:03:20] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 03:03:20] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:03:20] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:03:21] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:03:21] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:03:21] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1063 places, 1043/1043 transitions.
Built C files in :
/tmp/ltsmin16966783937025070354
[2022-05-19 03:03:21] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16966783937025070354
Running compilation step : cd /tmp/ltsmin16966783937025070354;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2254 ms.
Running link step : cd /tmp/ltsmin16966783937025070354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16966783937025070354;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3318803310317974815.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 03:03:37] [INFO ] Flatten gal took : 26 ms
[2022-05-19 03:03:37] [INFO ] Flatten gal took : 26 ms
[2022-05-19 03:03:37] [INFO ] Time to serialize gal into /tmp/LTL1872876082081233289.gal : 3 ms
[2022-05-19 03:03:37] [INFO ] Time to serialize properties into /tmp/LTL5121685096296707201.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1872876082081233289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5121685096296707201.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1872876...266
Read 1 LTL properties
Checking formula 0 : !((F(!((F("(p361!=1)"))U(((G(!(X("((p457==1)&&(p535==1))"))))&&("(p931==1)"))&&("((p950==1)&&(p961==1))"))))))
Formula 0 simplified : !F!(F"(p361!=1)" U ("((p950==1)&&(p961==1))" & "(p931==1)" & G!X"((p457==1)&&(p535==1))"))
Detected timeout of ITS tools.
[2022-05-19 03:03:52] [INFO ] Flatten gal took : 34 ms
[2022-05-19 03:03:52] [INFO ] Applying decomposition
[2022-05-19 03:03:52] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9138656866281095198.txt' '-o' '/tmp/graph9138656866281095198.bin' '-w' '/tmp/graph9138656866281095198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9138656866281095198.bin' '-l' '-1' '-v' '-w' '/tmp/graph9138656866281095198.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:03:52] [INFO ] Decomposing Gal with order
[2022-05-19 03:03:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:03:52] [INFO ] Removed a total of 460 redundant transitions.
[2022-05-19 03:03:52] [INFO ] Flatten gal took : 50 ms
[2022-05-19 03:03:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-19 03:03:52] [INFO ] Time to serialize gal into /tmp/LTL5198597391581350934.gal : 6 ms
[2022-05-19 03:03:52] [INFO ] Time to serialize properties into /tmp/LTL6751929485613234419.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5198597391581350934.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6751929485613234419.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5198597...245
Read 1 LTL properties
Checking formula 0 : !((F(!((F("(i5.u120.p361!=1)"))U(((G(!(X("((i7.u153.p457==1)&&(i8.u179.p535==1))"))))&&("(i15.u308.p931==1)"))&&("((i15.u314.p950==1)&...182
Formula 0 simplified : !F!(F"(i5.u120.p361!=1)" U ("((i15.u314.p950==1)&&(i15.u317.p961==1))" & "(i15.u308.p931==1)" & G!X"((i7.u153.p457==1)&&(i8.u179.p53...164
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin198951567091249071
[2022-05-19 03:04:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin198951567091249071
Running compilation step : cd /tmp/ltsmin198951567091249071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1665 ms.
Running link step : cd /tmp/ltsmin198951567091249071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin198951567091249071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(<>((LTLAPp0==true)) U ([](!X((LTLAPp2==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-06 finished in 212861 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(p0))))))'
Support contains 1 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1072 transition count 951
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 971 transition count 951
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 971 transition count 850
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 870 transition count 850
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 415 place count 859 transition count 839
Iterating global reduction 2 with 11 rules applied. Total rules applied 426 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 426 place count 859 transition count 838
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 858 transition count 838
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1136 place count 504 transition count 484
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 1138 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1139 place count 501 transition count 482
Applied a total of 1139 rules in 87 ms. Remains 501 /1073 variables (removed 572) and now considering 482/1053 (removed 571) transitions.
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 03:04:22] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 03:04:22] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 482 rows 501 cols
[2022-05-19 03:04:22] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:04:23] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2022-05-19 03:04:23] [INFO ] Redundant transitions in 49 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 03:04:23] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:04:23] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1073 places, 481/1053 transitions.
Applied a total of 0 rules in 7 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 501/1073 places, 481/1053 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s445 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 382 reset in 522 ms.
Product exploration explored 100000 steps with 312 reset in 566 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/501 stabilizing places and 2/481 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 16 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 03:04:25] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:04:25] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 03:04:25] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:04:25] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2022-05-19 03:04:25] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 03:04:25] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:04:26] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 481/481 transitions.
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/501 stabilizing places and 2/481 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 332 reset in 490 ms.
Product exploration explored 100000 steps with 298 reset in 576 ms.
Built C files in :
/tmp/ltsmin13762089202901117112
[2022-05-19 03:04:27] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2022-05-19 03:04:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 03:04:27] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2022-05-19 03:04:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 03:04:27] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2022-05-19 03:04:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 03:04:27] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13762089202901117112
Running compilation step : cd /tmp/ltsmin13762089202901117112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1017 ms.
Running link step : cd /tmp/ltsmin13762089202901117112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13762089202901117112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11167041115097666002.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 16 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 03:04:42] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:04:43] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 03:04:43] [INFO ] Computed 180 place invariants in 0 ms
[2022-05-19 03:04:43] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2022-05-19 03:04:43] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 481 rows 501 cols
[2022-05-19 03:04:43] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:04:43] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 481/481 transitions.
Built C files in :
/tmp/ltsmin14935627101183130913
[2022-05-19 03:04:43] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2022-05-19 03:04:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 03:04:43] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2022-05-19 03:04:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 03:04:43] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2022-05-19 03:04:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 03:04:43] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14935627101183130913
Running compilation step : cd /tmp/ltsmin14935627101183130913;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1048 ms.
Running link step : cd /tmp/ltsmin14935627101183130913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14935627101183130913;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8044262543382349139.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 03:04:58] [INFO ] Flatten gal took : 16 ms
[2022-05-19 03:04:58] [INFO ] Flatten gal took : 16 ms
[2022-05-19 03:04:58] [INFO ] Time to serialize gal into /tmp/LTL963160044915195501.gal : 2 ms
[2022-05-19 03:04:58] [INFO ] Time to serialize properties into /tmp/LTL441373987118385369.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL963160044915195501.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL441373987118385369.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9631600...264
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(F("(p1064==0)")))))))
Formula 0 simplified : !FGFGF"(p1064==0)"
Detected timeout of ITS tools.
[2022-05-19 03:05:14] [INFO ] Flatten gal took : 16 ms
[2022-05-19 03:05:14] [INFO ] Applying decomposition
[2022-05-19 03:05:14] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10512994484063887966.txt' '-o' '/tmp/graph10512994484063887966.bin' '-w' '/tmp/graph10512994484063887966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10512994484063887966.bin' '-l' '-1' '-v' '-w' '/tmp/graph10512994484063887966.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:05:14] [INFO ] Decomposing Gal with order
[2022-05-19 03:05:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:05:14] [INFO ] Removed a total of 317 redundant transitions.
[2022-05-19 03:05:14] [INFO ] Flatten gal took : 27 ms
[2022-05-19 03:05:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 5 ms.
[2022-05-19 03:05:14] [INFO ] Time to serialize gal into /tmp/LTL2291649067251399180.gal : 3 ms
[2022-05-19 03:05:14] [INFO ] Time to serialize properties into /tmp/LTL10084540249245798499.ltl : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2291649067251399180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10084540249245798499.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2291649...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(F("(i17.i1.u161.p1064==0)")))))))
Formula 0 simplified : !FGFGF"(i17.i1.u161.p1064==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1901082142258041140
[2022-05-19 03:05:29] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1901082142258041140
Running compilation step : cd /tmp/ltsmin1901082142258041140;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 736 ms.
Running link step : cd /tmp/ltsmin1901082142258041140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1901082142258041140;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>([](<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-07 finished in 81697 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1062 transition count 1042
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1062 transition count 1042
Applied a total of 22 rules in 31 ms. Remains 1062 /1073 variables (removed 11) and now considering 1042/1053 (removed 11) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:05:44] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 03:05:44] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:05:44] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 03:05:45] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:05:45] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 03:05:45] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1073 places, 1042/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1073 places, 1042/1053 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s623 1) (AND (EQ s928 1) (EQ s996 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 477 reset in 312 ms.
Product exploration explored 100000 steps with 472 reset in 325 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 219 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=109 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:05:47] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 03:05:47] [INFO ] [Real]Absence check using 181 positive place invariants in 116 ms returned sat
[2022-05-19 03:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:05:50] [INFO ] [Real]Absence check using state equation in 2269 ms returned sat
[2022-05-19 03:05:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:05:50] [INFO ] [Nat]Absence check using 181 positive place invariants in 125 ms returned sat
[2022-05-19 03:05:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:05:53] [INFO ] [Nat]Absence check using state equation in 2714 ms returned sat
[2022-05-19 03:05:53] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-19 03:06:05] [INFO ] Added : 575 causal constraints over 115 iterations in 11748 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 32 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:06:05] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:06:05] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:06:05] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:06:06] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:06:06] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 03:06:06] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1042/1042 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 172 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:06:07] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 03:06:07] [INFO ] [Real]Absence check using 181 positive place invariants in 119 ms returned sat
[2022-05-19 03:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:06:10] [INFO ] [Real]Absence check using state equation in 2323 ms returned sat
[2022-05-19 03:06:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:06:10] [INFO ] [Nat]Absence check using 181 positive place invariants in 132 ms returned sat
[2022-05-19 03:06:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:06:13] [INFO ] [Nat]Absence check using state equation in 2766 ms returned sat
[2022-05-19 03:06:13] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 56 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 03:06:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 475 reset in 287 ms.
Product exploration explored 100000 steps with 471 reset in 321 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1062 transition count 1042
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 100 place count 1062 transition count 1044
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 141 place count 1062 transition count 1044
Performed 417 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 558 places in 1 ms
Iterating global reduction 1 with 417 rules applied. Total rules applied 558 place count 1062 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 699 place count 921 transition count 903
Deduced a syphon composed of 417 places in 0 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 840 place count 921 transition count 903
Deduced a syphon composed of 417 places in 0 ms
Applied a total of 840 rules in 145 ms. Remains 921 /1062 variables (removed 141) and now considering 903/1042 (removed 139) transitions.
[2022-05-19 03:06:26] [INFO ] Redundant transitions in 82 ms returned [902]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 902 rows 921 cols
[2022-05-19 03:06:26] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 03:06:26] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1062 places, 902/1042 transitions.
Deduced a syphon composed of 417 places in 0 ms
Applied a total of 0 rules in 17 ms. Remains 921 /921 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 921/1062 places, 902/1042 transitions.
Product exploration explored 100000 steps with 4906 reset in 782 ms.
Product exploration explored 100000 steps with 4882 reset in 818 ms.
Built C files in :
/tmp/ltsmin4393057744897301376
[2022-05-19 03:06:28] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4393057744897301376
Running compilation step : cd /tmp/ltsmin4393057744897301376;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1683 ms.
Running link step : cd /tmp/ltsmin4393057744897301376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4393057744897301376;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15813929798305453742.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 23 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:06:43] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 03:06:43] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:06:43] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:06:44] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:06:44] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:06:45] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1042/1042 transitions.
Built C files in :
/tmp/ltsmin15967816695245962147
[2022-05-19 03:06:45] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15967816695245962147
Running compilation step : cd /tmp/ltsmin15967816695245962147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1646 ms.
Running link step : cd /tmp/ltsmin15967816695245962147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15967816695245962147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15521915970165892976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 03:07:00] [INFO ] Flatten gal took : 25 ms
[2022-05-19 03:07:00] [INFO ] Flatten gal took : 26 ms
[2022-05-19 03:07:00] [INFO ] Time to serialize gal into /tmp/LTL3745021062010907516.gal : 5 ms
[2022-05-19 03:07:00] [INFO ] Time to serialize properties into /tmp/LTL9906865161970491629.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3745021062010907516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9906865161970491629.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3745021...266
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((p700==1)||((p1047==1)&&(p1125==1)))"))))))
Formula 0 simplified : !XXXF"((p700==1)||((p1047==1)&&(p1125==1)))"
Detected timeout of ITS tools.
[2022-05-19 03:07:15] [INFO ] Flatten gal took : 27 ms
[2022-05-19 03:07:15] [INFO ] Applying decomposition
[2022-05-19 03:07:15] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8783410897963190969.txt' '-o' '/tmp/graph8783410897963190969.bin' '-w' '/tmp/graph8783410897963190969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8783410897963190969.bin' '-l' '-1' '-v' '-w' '/tmp/graph8783410897963190969.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:07:15] [INFO ] Decomposing Gal with order
[2022-05-19 03:07:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:07:15] [INFO ] Removed a total of 460 redundant transitions.
[2022-05-19 03:07:15] [INFO ] Flatten gal took : 51 ms
[2022-05-19 03:07:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 03:07:15] [INFO ] Time to serialize gal into /tmp/LTL17305981519197182011.gal : 9 ms
[2022-05-19 03:07:15] [INFO ] Time to serialize properties into /tmp/LTL4662290166666366233.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17305981519197182011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4662290166666366233.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1730598...246
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i11.i2.u237.p700==1)||((i17.i4.u352.p1047==1)&&(i18.i3.u378.p1125==1)))"))))))
Formula 0 simplified : !XXXF"((i11.i2.u237.p700==1)||((i17.i4.u352.p1047==1)&&(i18.i3.u378.p1125==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin696316285137363594
[2022-05-19 03:07:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin696316285137363594
Running compilation step : cd /tmp/ltsmin696316285137363594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1794 ms.
Running link step : cd /tmp/ltsmin696316285137363594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin696316285137363594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-11 finished in 121355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(G(p0))&&G(p1)))))'
Support contains 3 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1072 transition count 951
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 971 transition count 951
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 202 place count 971 transition count 852
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 400 place count 872 transition count 852
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 410 place count 862 transition count 842
Iterating global reduction 2 with 10 rules applied. Total rules applied 420 place count 862 transition count 842
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 420 place count 862 transition count 841
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 422 place count 861 transition count 841
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1130 place count 507 transition count 487
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 1132 place count 505 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 504 transition count 485
Applied a total of 1133 rules in 84 ms. Remains 504 /1073 variables (removed 569) and now considering 485/1053 (removed 568) transitions.
// Phase 1: matrix 485 rows 504 cols
[2022-05-19 03:07:45] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:07:45] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 485 rows 504 cols
[2022-05-19 03:07:45] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:07:46] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2022-05-19 03:07:46] [INFO ] Redundant transitions in 42 ms returned [484]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 484 rows 504 cols
[2022-05-19 03:07:46] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:07:46] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1073 places, 484/1053 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 504/1073 places, 484/1053 transitions.
Stuttering acceptance computed with spot in 665 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s53 1) (EQ s76 1)), p1:(EQ s171 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1074 steps with 0 reset in 10 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-12 finished in 1637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||X(X(p1))))'
Support contains 4 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1063 transition count 1043
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1063 transition count 1043
Applied a total of 20 rules in 37 ms. Remains 1063 /1073 variables (removed 10) and now considering 1043/1053 (removed 10) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:07:47] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 03:07:47] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:07:47] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 03:07:48] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:07:48] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 03:07:48] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1073 places, 1043/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1073 places, 1043/1053 transitions.
Stuttering acceptance computed with spot in 464 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s622 1) (AND (EQ s827 1) (EQ s845 1) (EQ s852 1))), p1:(AND (EQ s827 1) (EQ s845 1) (EQ s852 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-13 finished in 2101 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1063 transition count 1043
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1063 transition count 1043
Applied a total of 20 rules in 36 ms. Remains 1063 /1073 variables (removed 10) and now considering 1043/1053 (removed 10) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:07:49] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 03:07:49] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:07:49] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 03:07:50] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1063 cols
[2022-05-19 03:07:50] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 03:07:50] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1073 places, 1043/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 1063/1073 places, 1043/1053 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s269 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 614 ms.
Product exploration explored 100000 steps with 50000 reset in 640 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-020B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLFireability-14 finished in 3003 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(!(p0 U G(p0)))))))'
Support contains 1 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1062 transition count 1042
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1062 transition count 1042
Applied a total of 22 rules in 54 ms. Remains 1062 /1073 variables (removed 11) and now considering 1042/1053 (removed 11) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:07:52] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 03:07:52] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:07:52] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 03:07:53] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:07:53] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 03:07:54] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1073 places, 1042/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1073 places, 1042/1053 transitions.
Stuttering acceptance computed with spot in 462 ms :[p0, p0, p0, p0]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s550 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 360 ms.
Product exploration explored 100000 steps with 25000 reset in 371 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[p0, p0, p0, p0]
Finished random walk after 278 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=92 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 94 ms :[p0, p0, p0, p0]
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 17 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:07:55] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 03:07:56] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:07:56] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 03:07:56] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1062 cols
[2022-05-19 03:07:56] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 03:07:57] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1062/1062 places, 1042/1042 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0, p0]
Finished random walk after 245 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=81 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 122 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 170 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 25000 reset in 371 ms.
Product exploration explored 100000 steps with 25000 reset in 366 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 451 ms :[p0, p0, p0, p0]
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1062 transition count 1042
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 100 place count 1062 transition count 1044
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 141 place count 1062 transition count 1044
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 559 places in 1 ms
Iterating global reduction 1 with 418 rules applied. Total rules applied 559 place count 1062 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 700 place count 921 transition count 903
Deduced a syphon composed of 418 places in 1 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 841 place count 921 transition count 903
Deduced a syphon composed of 418 places in 1 ms
Applied a total of 841 rules in 133 ms. Remains 921 /1062 variables (removed 141) and now considering 903/1042 (removed 139) transitions.
[2022-05-19 03:07:59] [INFO ] Redundant transitions in 68 ms returned [902]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 902 rows 921 cols
[2022-05-19 03:07:59] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 03:08:00] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1062 places, 902/1042 transitions.
Deduced a syphon composed of 418 places in 0 ms
Applied a total of 0 rules in 15 ms. Remains 921 /921 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 921/1062 places, 902/1042 transitions.
Product exploration explored 100000 steps with 25000 reset in 1613 ms.
Product exploration explored 100000 steps with 25000 reset in 1604 ms.
Built C files in :
/tmp/ltsmin2660558421610588746
[2022-05-19 03:08:03] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2660558421610588746
Running compilation step : cd /tmp/ltsmin2660558421610588746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1926 ms.
Running link step : cd /tmp/ltsmin2660558421610588746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2660558421610588746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased884384148103669408.hoa' '--buchi-type=spotba'
LTSmin run took 274 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-020B-LTLFireability-15 finished in 13128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(p1))&&G(F(G(p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(p0) U (G(!X(p2))&&p1))))'
Found a CL insensitive property : ShieldIIPs-PT-020B-LTLFireability-06
Stuttering acceptance computed with spot in 133 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Support contains 6 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1072 transition count 951
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 971 transition count 951
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 971 transition count 850
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 870 transition count 850
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 414 place count 860 transition count 840
Iterating global reduction 2 with 10 rules applied. Total rules applied 424 place count 860 transition count 840
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 424 place count 860 transition count 839
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 426 place count 859 transition count 839
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1132 place count 506 transition count 486
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 1134 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1135 place count 503 transition count 484
Applied a total of 1135 rules in 93 ms. Remains 503 /1073 variables (removed 570) and now considering 484/1053 (removed 569) transitions.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:08:06] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:08:06] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:08:06] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:08:06] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:08:06] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:08:06] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 503/1073 places, 484/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/1073 places, 484/1053 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s147 1), p1:(AND (EQ s391 1) (EQ s400 1) (EQ s404 1)), p2:(AND (EQ s188 1) (EQ s223 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 109 reset in 524 ms.
Product exploration explored 100000 steps with 110 reset in 606 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 : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 699 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:08:09] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 03:08:09] [INFO ] [Real]Absence check using 180 positive place invariants in 22 ms returned sat
[2022-05-19 03:08:09] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:08:09] [INFO ] [Nat]Absence check using 180 positive place invariants in 23 ms returned sat
[2022-05-19 03:08:09] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:08:09] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2022-05-19 03:08:09] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2022-05-19 03:08:09] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2022-05-19 03:08:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 196 ms
[2022-05-19 03:08:10] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-19 03:08:10] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 115 place count 503 transition count 484
Applied a total of 115 rules in 13 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 230143 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230143 steps, saw 195986 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:08:13] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 03:08:13] [INFO ] [Real]Absence check using 180 positive place invariants in 22 ms returned sat
[2022-05-19 03:08:13] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:08:13] [INFO ] [Nat]Absence check using 180 positive place invariants in 21 ms returned sat
[2022-05-19 03:08:13] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:08:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-19 03:08:14] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2022-05-19 03:08:14] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2022-05-19 03:08:14] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-05-19 03:08:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 231 ms
[2022-05-19 03:08:14] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2022-05-19 03:08:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-19 03:08:14] [INFO ] After 532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-19 03:08:14] [INFO ] After 690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 10 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:08:14] [INFO ] Computed 180 place invariants in 5 ms
[2022-05-19 03:08:14] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:08:14] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 03:08:15] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2022-05-19 03:08:15] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:08:15] [INFO ] Computed 180 place invariants in 4 ms
[2022-05-19 03:08:15] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:08:15] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 03:08:15] [INFO ] [Real]Absence check using 180 positive place invariants in 25 ms returned sat
[2022-05-19 03:08:15] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:08:15] [INFO ] [Nat]Absence check using 180 positive place invariants in 22 ms returned sat
[2022-05-19 03:08:15] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:08:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-05-19 03:08:16] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2022-05-19 03:08:16] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2022-05-19 03:08:16] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2022-05-19 03:08:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 260 ms
[2022-05-19 03:08:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2022-05-19 03:08:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-19 03:08:16] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-19 03:08:16] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-19 03:08:16] [INFO ] Flatten gal took : 17 ms
[2022-05-19 03:08:16] [INFO ] Flatten gal took : 16 ms
[2022-05-19 03:08:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10486743720258508034.gal : 2 ms
[2022-05-19 03:08:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11514636725119473085.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11727130749031775185;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10486743720258508034.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11514636725119473085.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11514636725119473085.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 91
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :91 after 164
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :164 after 443
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :443 after 3310
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3310 after 21629
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :21629 after 90564
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :90564 after 5.53172e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.53172e+06 after 3.01443e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.01443e+08 after 2.96713e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.96713e+10 after 1.78045e+13
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.78045e+13 after 2.60618e+14
Detected timeout of ITS tools.
[2022-05-19 03:08:31] [INFO ] Flatten gal took : 19 ms
[2022-05-19 03:08:31] [INFO ] Applying decomposition
[2022-05-19 03:08:31] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10824700365829797616.txt' '-o' '/tmp/graph10824700365829797616.bin' '-w' '/tmp/graph10824700365829797616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10824700365829797616.bin' '-l' '-1' '-v' '-w' '/tmp/graph10824700365829797616.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:08:31] [INFO ] Decomposing Gal with order
[2022-05-19 03:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:08:31] [INFO ] Removed a total of 387 redundant transitions.
[2022-05-19 03:08:31] [INFO ] Flatten gal took : 29 ms
[2022-05-19 03:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 443 labels/synchronizations in 7 ms.
[2022-05-19 03:08:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12159797394708127061.gal : 3 ms
[2022-05-19 03:08:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5222409194968226308.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11727130749031775185;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12159797394708127061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5222409194968226308.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality5222409194968226308.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :664 after 1.87786e+11
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.87786e+11 after 6.72641e+33
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11359172303251765801
[2022-05-19 03:08:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11359172303251765801
Running compilation step : cd /tmp/ltsmin11359172303251765801;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 817 ms.
Running link step : cd /tmp/ltsmin11359172303251765801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11359172303251765801;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (AND p0 p1)), (F p1), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 17 factoid took 765 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:09:02] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 03:09:03] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:09:03] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:09:03] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:09:03] [INFO ] Computed 180 place invariants in 5 ms
[2022-05-19 03:09:03] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 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 : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 627 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:09:04] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:09:04] [INFO ] [Real]Absence check using 180 positive place invariants in 25 ms returned sat
[2022-05-19 03:09:04] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:09:05] [INFO ] [Nat]Absence check using 180 positive place invariants in 21 ms returned sat
[2022-05-19 03:09:05] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:09:05] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2022-05-19 03:09:05] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2022-05-19 03:09:05] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-19 03:09:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 190 ms
[2022-05-19 03:09:05] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-19 03:09:05] [INFO ] After 574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 115 place count 503 transition count 484
Applied a total of 115 rules in 12 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 248658 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248658 steps, saw 205711 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:09:08] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:09:08] [INFO ] [Real]Absence check using 180 positive place invariants in 23 ms returned sat
[2022-05-19 03:09:09] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:09:09] [INFO ] [Nat]Absence check using 180 positive place invariants in 20 ms returned sat
[2022-05-19 03:09:09] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:09:09] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-05-19 03:09:09] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-05-19 03:09:09] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2022-05-19 03:09:09] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2022-05-19 03:09:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 254 ms
[2022-05-19 03:09:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2022-05-19 03:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-19 03:09:09] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-19 03:09:09] [INFO ] After 674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:09:09] [INFO ] Computed 180 place invariants in 4 ms
[2022-05-19 03:09:10] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:09:10] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 03:09:10] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2022-05-19 03:09:10] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:09:10] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:09:10] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:09:10] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:09:10] [INFO ] [Real]Absence check using 180 positive place invariants in 27 ms returned sat
[2022-05-19 03:09:11] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 03:09:11] [INFO ] [Nat]Absence check using 180 positive place invariants in 23 ms returned sat
[2022-05-19 03:09:11] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 03:09:11] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-19 03:09:11] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2022-05-19 03:09:11] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-05-19 03:09:11] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2022-05-19 03:09:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 241 ms
[2022-05-19 03:09:11] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2022-05-19 03:09:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-05-19 03:09:11] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-19 03:09:11] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-19 03:09:11] [INFO ] Flatten gal took : 20 ms
[2022-05-19 03:09:11] [INFO ] Flatten gal took : 17 ms
[2022-05-19 03:09:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13825647984247111540.gal : 2 ms
[2022-05-19 03:09:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6627717132124969628.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16080629321605775388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13825647984247111540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6627717132124969628.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6627717132124969628.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 91
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :91 after 164
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :164 after 443
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :443 after 3310
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3310 after 21629
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :21629 after 90564
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :90564 after 5.53172e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.53172e+06 after 3.01443e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.01443e+08 after 2.96713e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.96713e+10 after 1.78045e+13
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.78045e+13 after 2.60618e+14
Detected timeout of ITS tools.
[2022-05-19 03:09:26] [INFO ] Flatten gal took : 20 ms
[2022-05-19 03:09:26] [INFO ] Applying decomposition
[2022-05-19 03:09:26] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5049591528058753721.txt' '-o' '/tmp/graph5049591528058753721.bin' '-w' '/tmp/graph5049591528058753721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5049591528058753721.bin' '-l' '-1' '-v' '-w' '/tmp/graph5049591528058753721.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:09:27] [INFO ] Decomposing Gal with order
[2022-05-19 03:09:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:09:27] [INFO ] Removed a total of 383 redundant transitions.
[2022-05-19 03:09:27] [INFO ] Flatten gal took : 28 ms
[2022-05-19 03:09:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 488 labels/synchronizations in 6 ms.
[2022-05-19 03:09:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9970265849816408385.gal : 3 ms
[2022-05-19 03:09:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16523641560887439545.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16080629321605775388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9970265849816408385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16523641560887439545.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality16523641560887439545.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :664 after 1.29729e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.29729e+06 after 1.04412e+28
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7379198633416627964
[2022-05-19 03:09:42] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7379198633416627964
Running compilation step : cd /tmp/ltsmin7379198633416627964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 830 ms.
Running link step : cd /tmp/ltsmin7379198633416627964;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7379198633416627964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (AND p0 p1)), (F p1), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 17 factoid took 873 ms. Reduced automaton from 4 states, 14 edges and 3 AP to 4 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Product exploration explored 100000 steps with 104 reset in 527 ms.
Product exploration explored 100000 steps with 110 reset in 609 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 152 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 13 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2022-05-19 03:09:59] [INFO ] Redundant transitions in 47 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2022-05-19 03:09:59] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:10:00] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/503 places, 483/484 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 503/503 places, 483/484 transitions.
Product exploration explored 100000 steps with 110 reset in 502 ms.
Product exploration explored 100000 steps with 105 reset in 602 ms.
Built C files in :
/tmp/ltsmin9765973596904337732
[2022-05-19 03:10:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9765973596904337732
Running compilation step : cd /tmp/ltsmin9765973596904337732;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 785 ms.
Running link step : cd /tmp/ltsmin9765973596904337732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9765973596904337732;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased847178336777841143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:10:16] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:10:16] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:10:16] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:10:17] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
// Phase 1: matrix 484 rows 503 cols
[2022-05-19 03:10:17] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:10:17] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 484/484 transitions.
Built C files in :
/tmp/ltsmin9223613741856194137
[2022-05-19 03:10:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9223613741856194137
Running compilation step : cd /tmp/ltsmin9223613741856194137;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1042 ms.
Running link step : cd /tmp/ltsmin9223613741856194137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9223613741856194137;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6231508831357214731.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 03:10:32] [INFO ] Flatten gal took : 17 ms
[2022-05-19 03:10:32] [INFO ] Flatten gal took : 15 ms
[2022-05-19 03:10:32] [INFO ] Time to serialize gal into /tmp/LTL8109626741722310560.gal : 2 ms
[2022-05-19 03:10:32] [INFO ] Time to serialize properties into /tmp/LTL10134217130233109212.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8109626741722310560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10134217130233109212.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8109626...267
Read 1 LTL properties
Checking formula 0 : !((F(!((F("(p361!=1)"))U(((G(!(X("((p457==1)&&(p535==1))"))))&&("(p931==1)"))&&("((p950==1)&&(p961==1))"))))))
Formula 0 simplified : !F!(F"(p361!=1)" U ("((p950==1)&&(p961==1))" & "(p931==1)" & G!X"((p457==1)&&(p535==1))"))
Detected timeout of ITS tools.
[2022-05-19 03:10:47] [INFO ] Flatten gal took : 16 ms
[2022-05-19 03:10:47] [INFO ] Applying decomposition
[2022-05-19 03:10:47] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7989935165176982853.txt' '-o' '/tmp/graph7989935165176982853.bin' '-w' '/tmp/graph7989935165176982853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7989935165176982853.bin' '-l' '-1' '-v' '-w' '/tmp/graph7989935165176982853.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:10:47] [INFO ] Decomposing Gal with order
[2022-05-19 03:10:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:10:47] [INFO ] Removed a total of 317 redundant transitions.
[2022-05-19 03:10:47] [INFO ] Flatten gal took : 29 ms
[2022-05-19 03:10:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 308 labels/synchronizations in 4 ms.
[2022-05-19 03:10:47] [INFO ] Time to serialize gal into /tmp/LTL15837202006351516854.gal : 3 ms
[2022-05-19 03:10:47] [INFO ] Time to serialize properties into /tmp/LTL12142211797724805890.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15837202006351516854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12142211797724805890.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1583720...247
Read 1 LTL properties
Checking formula 0 : !((F(!((F("(i5.i2.u53.p361!=1)"))U(((G(!(X("((i7.u68.p457==1)&&(i8.i1.u80.p535==1))"))))&&("(i15.i2.u140.p931==1)"))&&("((i15.i2.u143....194
Formula 0 simplified : !F!(F"(i5.i2.u53.p361!=1)" U ("((i15.i2.u143.p950==1)&&(i15.i0.u144.p961==1))" & "(i15.i2.u140.p931==1)" & G!X"((i7.u68.p457==1)&&(i...176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4187575365860802994
[2022-05-19 03:11:02] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4187575365860802994
Running compilation step : cd /tmp/ltsmin4187575365860802994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 768 ms.
Running link step : cd /tmp/ltsmin4187575365860802994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4187575365860802994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(<>((LTLAPp0==true)) U ([](!X((LTLAPp2==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-06 finished in 191981 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a CL insensitive property : ShieldIIPs-PT-020B-LTLFireability-11
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1073/1073 places, 1053/1053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1072 transition count 951
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 971 transition count 951
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 971 transition count 850
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 870 transition count 850
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 415 place count 859 transition count 839
Iterating global reduction 2 with 11 rules applied. Total rules applied 426 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 426 place count 859 transition count 838
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 858 transition count 838
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1134 place count 505 transition count 485
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 1136 place count 503 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1137 place count 502 transition count 483
Applied a total of 1137 rules in 70 ms. Remains 502 /1073 variables (removed 571) and now considering 483/1053 (removed 570) transitions.
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 03:11:18] [INFO ] Computed 180 place invariants in 3 ms
[2022-05-19 03:11:18] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 03:11:18] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:11:18] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 03:11:18] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:11:18] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 502/1073 places, 483/1053 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/1073 places, 483/1053 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s290 1) (AND (EQ s437 1) (EQ s472 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7140 reset in 400 ms.
Product exploration explored 100000 steps with 7134 reset in 485 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 03:11:20] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:11:20] [INFO ] [Real]Absence check using 180 positive place invariants in 53 ms returned sat
[2022-05-19 03:11:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:11:21] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2022-05-19 03:11:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:11:21] [INFO ] [Nat]Absence check using 180 positive place invariants in 56 ms returned sat
[2022-05-19 03:11:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:11:22] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2022-05-19 03:11:22] [INFO ] Computed and/alt/rep : 480/1198/480 causal constraints (skipped 1 transitions) in 31 ms.
[2022-05-19 03:11:28] [INFO ] Added : 429 causal constraints over 86 iterations in 6245 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 6 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 03:11:28] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:11:28] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 03:11:28] [INFO ] Computed 180 place invariants in 0 ms
[2022-05-19 03:11:28] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 03:11:28] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:11:29] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/502 places, 483/483 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 483 rows 502 cols
[2022-05-19 03:11:29] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 03:11:29] [INFO ] [Real]Absence check using 180 positive place invariants in 58 ms returned sat
[2022-05-19 03:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:11:30] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2022-05-19 03:11:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:11:30] [INFO ] [Nat]Absence check using 180 positive place invariants in 54 ms returned sat
[2022-05-19 03:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:11:31] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2022-05-19 03:11:31] [INFO ] Computed and/alt/rep : 480/1198/480 causal constraints (skipped 1 transitions) in 24 ms.
[2022-05-19 03:11:37] [INFO ] Added : 429 causal constraints over 86 iterations in 6070 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7071 reset in 430 ms.
Product exploration explored 100000 steps with 7140 reset in 469 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 13 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2022-05-19 03:11:38] [INFO ] Redundant transitions in 47 ms returned [482]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 482 rows 502 cols
[2022-05-19 03:11:38] [INFO ] Computed 180 place invariants in 1 ms
[2022-05-19 03:11:38] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/502 places, 482/483 transitions.
Applied a total of 0 rules in 6 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 502/502 places, 482/483 transitions.
Product exploration explored 100000 steps with 7106 reset in 957 ms.
Product exploration explored 100000 steps with 7114 reset in 1046 ms.
Built C files in :
/tmp/ltsmin9737034840720419517
[2022-05-19 03:11:40] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9737034840720419517
Running compilation step : cd /tmp/ltsmin9737034840720419517;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 831 ms.
Running link step : cd /tmp/ltsmin9737034840720419517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9737034840720419517;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased849011075490031643.hoa' '--buchi-type=spotba'
LTSmin run took 2661 ms.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-11 finished in 26595 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-11 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-19 03:11:44] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4106519264349566150
[2022-05-19 03:11:44] [INFO ] Computing symmetric may disable matrix : 1053 transitions.
[2022-05-19 03:11:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 03:11:44] [INFO ] Applying decomposition
[2022-05-19 03:11:44] [INFO ] Computing symmetric may enable matrix : 1053 transitions.
[2022-05-19 03:11:44] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 03:11:44] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11686982597727798326.txt' '-o' '/tmp/graph11686982597727798326.bin' '-w' '/tmp/graph11686982597727798326.weights'
[2022-05-19 03:11:44] [INFO ] Computing Do-Not-Accords matrix : 1053 transitions.
[2022-05-19 03:11:44] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11686982597727798326.bin' '-l' '-1' '-v' '-w' '/tmp/graph11686982597727798326.weights' '-q' '0' '-e' '0.001'
[2022-05-19 03:11:44] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4106519264349566150
Running compilation step : cd /tmp/ltsmin4106519264349566150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 03:11:44] [INFO ] Decomposing Gal with order
[2022-05-19 03:11:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:11:44] [INFO ] Removed a total of 460 redundant transitions.
[2022-05-19 03:11:44] [INFO ] Flatten gal took : 49 ms
[2022-05-19 03:11:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-19 03:11:44] [INFO ] Time to serialize gal into /tmp/LTLFireability15681130001212351137.gal : 6 ms
[2022-05-19 03:11:44] [INFO ] Time to serialize properties into /tmp/LTLFireability4829324750977035482.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15681130001212351137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4829324750977035482.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 5 LTL properties
Checking formula 0 : !((G((F("((i15.i6.u317.p934==1)&&(i16.i2.u334.p985==1))"))&&(F(G("(((i0.i4.u19.p46==0)||(i0.i4.u25.p65==0))||(i0.i4.u28.p76==0))")))))...156
Formula 0 simplified : !G(F"((i15.i6.u317.p934==1)&&(i16.i2.u334.p985==1))" & FG"(((i0.i4.u19.p46==0)||(i0.i4.u25.p65==0))||(i0.i4.u28.p76==0))")
Compilation finished in 3052 ms.
Running link step : cd /tmp/ltsmin4106519264349566150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin4106519264349566150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin4106519264349566150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4106519264349566150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp2==true)||[]((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin4106519264349566150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp2==true)||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4106519264349566150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!((LTLAPp4==true) U X((LTLAPp5==true)))&&[](<>([]((LTLAPp6==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 03:37:18] [INFO ] Applying decomposition
[2022-05-19 03:37:19] [INFO ] Flatten gal took : 318 ms
[2022-05-19 03:37:19] [INFO ] Decomposing Gal with order
[2022-05-19 03:37:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 03:37:20] [INFO ] Removed a total of 320 redundant transitions.
[2022-05-19 03:37:20] [INFO ] Flatten gal took : 526 ms
[2022-05-19 03:37:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 285 ms.
[2022-05-19 03:37:21] [INFO ] Time to serialize gal into /tmp/LTLFireability4976154092985297059.gal : 99 ms
[2022-05-19 03:37:21] [INFO ] Time to serialize properties into /tmp/LTLFireability9809440528328579475.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4976154092985297059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9809440528328579475.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 5 LTL properties
Checking formula 0 : !((G((F("((i0.i0.i0.i0.i1.i0.i0.i0.u289.p934==1)&&(i0.i0.i0.i1.i0.i0.i0.i0.i0.u304.p985==1))"))&&(F(G("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i...370
Formula 0 simplified : !G(F"((i0.i0.i0.i0.i1.i0.i0.i0.u289.p934==1)&&(i0.i0.i0.i1.i0.i0.i0.i0.i0.u304.p985==1))" & FG"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...359
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin4106519264349566150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!((LTLAPp4==true) U X((LTLAPp5==true)))&&[](<>([]((LTLAPp6==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4106519264349566150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(<>((LTLAPp7==true)) U ([](!X((LTLAPp9==true)))&&(LTLAPp8==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-020B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-020B, 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 r222-tall-165286024700108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;