Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533000611.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ShieldPPPs-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533000611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 18K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749184807984

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 04:40:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 04:40:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 04:40:09] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2025-06-06 04:40:09] [INFO ] Transformed 71 places.
[2025-06-06 04:40:09] [INFO ] Transformed 66 transitions.
[2025-06-06 04:40:09] [INFO ] Found NUPN structural information;
[2025-06-06 04:40:09] [INFO ] Parsed PT model containing 71 places and 66 transitions and 180 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 68 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 68 transition count 63
Applied a total of 6 rules in 23 ms. Remains 68 /71 variables (removed 3) and now considering 63/66 (removed 3) transitions.
// Phase 1: matrix 63 rows 68 cols
[2025-06-06 04:40:09] [INFO ] Computed 12 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:09] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-06 04:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:09] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2025-06-06 04:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 63/131 variables, 68/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:11] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:11] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:11] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:12] [INFO ] Deduced a trap along path composed of 5 places in 50 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 99 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3256 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/131 variables, 68/98 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 62/160 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:13] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:13] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:13] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:13] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:14] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:16] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:16] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:16] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/131 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/131 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 169 constraints, problems are : Problem set: 0 solved, 62 unsolved in 8132 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11413ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 11428ms
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 63/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11750 ms. Remains : 68/71 places, 63/66 transitions.
Support contains 28 out of 68 places after structural reductions.
[2025-06-06 04:40:21] [INFO ] Flatten gal took : 20 ms
[2025-06-06 04:40:21] [INFO ] Flatten gal took : 8 ms
[2025-06-06 04:40:21] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 264 steps (0 resets) in 40 ms. (6 steps per ms) remains 0/20 properties
FORMULA ShieldPPPs-PT-001B-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(F(p1))))))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 63 transition count 58
Applied a total of 10 rules in 5 ms. Remains 63 /68 variables (removed 5) and now considering 58/63 (removed 5) transitions.
// Phase 1: matrix 58 rows 63 cols
[2025-06-06 04:40:21] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:21] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 04:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:21] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 04:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:22] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:22] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:22] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:22] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1505 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:23] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/140 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:23] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:23] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:24] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:24] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:24] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 148 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3745 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5270ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5272ms
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 58/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5373 ms. Remains : 63/68 places, 58/63 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-01
Product exploration explored 100000 steps with 6564 reset in 249 ms.
Product exploration explored 100000 steps with 6556 reset in 117 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 105 steps (0 resets) in 8 ms. (11 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
[2025-06-06 04:40:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:40:28] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-06-06 04:40:28] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-06 04:40:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:40:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-06 04:40:28] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-06 04:40:28] [INFO ] Computed and/alt/rep : 57/101/57 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-06 04:40:28] [INFO ] Added : 57 causal constraints over 12 iterations in 99 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2025-06-06 04:40:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 04:40:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:29] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 04:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:29] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:29] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:30] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/140 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:31] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:31] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:31] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:31] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:31] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:31] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 148 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3719 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5179ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5180ms
Finished structural reductions in LTL mode , in 1 iterations and 5278 ms. Remains : 63/63 places, 58/58 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 103 steps (0 resets) in 8 ms. (11 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
[2025-06-06 04:40:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:40:35] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-06-06 04:40:35] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-06 04:40:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:40:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-06 04:40:35] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-06 04:40:35] [INFO ] Computed and/alt/rep : 57/101/57 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-06 04:40:35] [INFO ] Added : 57 causal constraints over 12 iterations in 100 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6551 reset in 77 ms.
Product exploration explored 100000 steps with 6486 reset in 78 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 58/58 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 8 place count 63 transition count 59
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 63 transition count 59
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 30 place count 63 transition count 59
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 54 transition count 50
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 54 transition count 50
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 48 rules in 18 ms. Remains 54 /63 variables (removed 9) and now considering 50/58 (removed 8) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:40:36] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
// Phase 1: matrix 50 rows 54 cols
[2025-06-06 04:40:36] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:36] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:36] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 3 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 9/21 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/21 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 50/104 variables, 54/75 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/75 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/75 constraints. Problems are: Problem set: 22 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 75 constraints, problems are : Problem set: 22 solved, 27 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 22/54 variables, 12/12 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 9/21 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/21 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 50/104 variables, 54/75 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 27/102 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/102 constraints. Problems are: Problem set: 22 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/102 constraints. Problems are: Problem set: 22 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 102 constraints, problems are : Problem set: 22 solved, 27 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 27/49 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1620ms problems are : Problem set: 22 solved, 27 unsolved
Search for dead transitions found 22 dead transitions in 1620ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 54/63 places, 28/58 transitions.
Graph (complete) has 87 edges and 54 vertex of which 33 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 33 /54 variables (removed 21) and now considering 28/28 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/63 places, 28/58 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1655 ms. Remains : 33/63 places, 28/58 transitions.
Built C files in :
/tmp/ltsmin9569098922531122321
[2025-06-06 04:40:37] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9569098922531122321
Running compilation step : cd /tmp/ltsmin9569098922531122321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 234 ms.
Running link step : cd /tmp/ltsmin9569098922531122321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9569098922531122321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14125304395565578378.hoa' '--buchi-type=spotba'
LTSmin run took 1554 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-01 finished in 17961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(X(p0)) U p1))&&p2)))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 65 transition count 60
Applied a total of 6 rules in 6 ms. Remains 65 /68 variables (removed 3) and now considering 60/63 (removed 3) transitions.
// Phase 1: matrix 60 rows 65 cols
[2025-06-06 04:40:39] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 04:40:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:39] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-06 04:40:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:40] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:40] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:40] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:40] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:40] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/125 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/125 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:41] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 88 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2762 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:42] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:42] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:42] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:42] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:43] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:44] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:45] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:45] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:45] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 168 constraints, problems are : Problem set: 0 solved, 59 unsolved in 6317 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9085ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 9086ms
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 60/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9182 ms. Remains : 65/68 places, 60/63 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p0), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Product exploration explored 100000 steps with 33333 reset in 52 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-02 finished in 9532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 63 transition count 58
Applied a total of 10 rules in 6 ms. Remains 63 /68 variables (removed 5) and now considering 58/63 (removed 5) transitions.
// Phase 1: matrix 58 rows 63 cols
[2025-06-06 04:40:49] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 04:40:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:49] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 04:40:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:49] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:49] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:49] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/140 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:51] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:51] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:51] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:51] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:51] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:51] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:51] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 148 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3849 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5334ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5334ms
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 58/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5431 ms. Remains : 63/68 places, 58/63 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-03
Product exploration explored 100000 steps with 25000 reset in 51 ms.
Product exploration explored 100000 steps with 25000 reset in 52 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 42 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2025-06-06 04:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 04:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:55] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 04:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:56] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:56] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:56] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:56] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:57] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/140 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:57] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:57] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:57] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:58] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:58] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:40:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 148 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3727 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5250ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5251ms
Finished structural reductions in LTL mode , in 1 iterations and 5357 ms. Remains : 63/63 places, 58/58 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 43 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 50 ms.
Product exploration explored 100000 steps with 25000 reset in 47 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 58/58 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 63 transition count 59
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 63 transition count 59
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 30 place count 63 transition count 59
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 56 transition count 52
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 56 transition count 52
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 44 rules in 10 ms. Remains 56 /63 variables (removed 7) and now considering 52/58 (removed 6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:41:01] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
// Phase 1: matrix 52 rows 56 cols
[2025-06-06 04:41:01] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 9/21 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/21 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 52/108 variables, 56/77 constraints. Problems are: Problem set: 24 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:02] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 1/78 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/78 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/78 constraints. Problems are: Problem set: 24 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 78 constraints, problems are : Problem set: 24 solved, 27 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 24/56 variables, 12/12 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 10/22 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/22 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 52/108 variables, 56/78 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 27/105 constraints. Problems are: Problem set: 24 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:03] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/106 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/106 constraints. Problems are: Problem set: 24 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/106 constraints. Problems are: Problem set: 24 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 106 constraints, problems are : Problem set: 24 solved, 27 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 27/51 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2415ms problems are : Problem set: 24 solved, 27 unsolved
Search for dead transitions found 24 dead transitions in 2416ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 56/63 places, 28/58 transitions.
Graph (complete) has 85 edges and 56 vertex of which 33 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 33 /56 variables (removed 23) and now considering 28/28 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/63 places, 28/58 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2436 ms. Remains : 33/63 places, 28/58 transitions.
Built C files in :
/tmp/ltsmin12785282984967514406
[2025-06-06 04:41:04] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12785282984967514406
Running compilation step : cd /tmp/ltsmin12785282984967514406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 116 ms.
Running link step : cd /tmp/ltsmin12785282984967514406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12785282984967514406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10258301252231490842.hoa' '--buchi-type=spotba'
LTSmin run took 859 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-03 finished in 16263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 67 transition count 53
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 58 transition count 53
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 58 transition count 48
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 53 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 49 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 49 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 49 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 47 transition count 42
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 70 place count 32 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 31 transition count 26
Applied a total of 71 rules in 12 ms. Remains 31 /68 variables (removed 37) and now considering 26/63 (removed 37) transitions.
// Phase 1: matrix 26 rows 31 cols
[2025-06-06 04:41:05] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:05] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-06 04:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:05] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:41:05] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-06 04:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:05] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 26/57 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 0/57 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 44 constraints, problems are : Problem set: 0 solved, 24 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 26/57 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:05] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 69 constraints, problems are : Problem set: 0 solved, 24 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 898ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 906ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/68 places, 26/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1011 ms. Remains : 31/68 places, 26/63 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-05
Product exploration explored 100000 steps with 2413 reset in 148 ms.
Product exploration explored 100000 steps with 2385 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 156 steps (1 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 26/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2025-06-06 04:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 04:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:41:07] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-06 04:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 26/57 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 0/57 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 44 constraints, problems are : Problem set: 0 solved, 24 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 26/57 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:07] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 69 constraints, problems are : Problem set: 0 solved, 24 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 929ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 929ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1060 ms. Remains : 31/31 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 169 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2353 reset in 108 ms.
Product exploration explored 100000 steps with 2355 reset in 127 ms.
Built C files in :
/tmp/ltsmin12333032628418781584
[2025-06-06 04:41:08] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2025-06-06 04:41:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:41:08] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2025-06-06 04:41:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:41:08] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2025-06-06 04:41:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:41:08] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12333032628418781584
Running compilation step : cd /tmp/ltsmin12333032628418781584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 97 ms.
Running link step : cd /tmp/ltsmin12333032628418781584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12333032628418781584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10020638221498679570.hoa' '--buchi-type=spotba'
LTSmin run took 1199 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-05 finished in 4909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(p1))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 65 transition count 60
Applied a total of 6 rules in 5 ms. Remains 65 /68 variables (removed 3) and now considering 60/63 (removed 3) transitions.
// Phase 1: matrix 60 rows 65 cols
[2025-06-06 04:41:10] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 04:41:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:10] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-06 04:41:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:10] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:10] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:10] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:10] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:10] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:10] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:11] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/125 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:12] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/125 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:12] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 88 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2649 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:14] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:14] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:14] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:14] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:14] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:15] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:16] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:16] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:16] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 168 constraints, problems are : Problem set: 0 solved, 59 unsolved in 6187 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8845ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 8846ms
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 60/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8935 ms. Remains : 65/68 places, 60/63 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-07
Product exploration explored 100000 steps with 8994 reset in 90 ms.
Product exploration explored 100000 steps with 8982 reset in 101 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 179 steps (0 resets) in 5 ms. (29 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-06 04:41:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:41:20] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-06 04:41:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-06 04:41:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:41:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-06-06 04:41:20] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-06 04:41:20] [INFO ] Computed and/alt/rep : 59/103/59 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-06 04:41:20] [INFO ] Added : 59 causal constraints over 12 iterations in 96 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 60/60 transitions.
Applied a total of 0 rules in 0 ms. Remains 65 /65 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2025-06-06 04:41:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:20] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 04:41:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:20] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-06 04:41:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:20] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:21] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:21] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:21] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:21] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:21] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:21] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:21] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/125 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:22] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/125 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:22] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 88 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2777 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:23] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:23] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:23] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:23] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:23] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:23] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:24] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:25] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:26] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:26] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 168 constraints, problems are : Problem set: 0 solved, 59 unsolved in 6234 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9041ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 9042ms
Finished structural reductions in LTL mode , in 1 iterations and 9145 ms. Remains : 65/65 places, 60/60 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 180 steps (0 resets) in 5 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-06 04:41:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:41:30] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-06 04:41:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-06 04:41:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:41:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-06 04:41:30] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-06 04:41:30] [INFO ] Computed and/alt/rep : 59/103/59 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-06 04:41:30] [INFO ] Added : 59 causal constraints over 12 iterations in 92 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8986 reset in 152 ms.
Product exploration explored 100000 steps with 9020 reset in 102 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 60/60 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 60
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 8 place count 65 transition count 61
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 65 transition count 61
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 27 place count 65 transition count 61
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 57 transition count 53
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 57 transition count 53
Deduced a syphon composed of 19 places in 1 ms
Applied a total of 43 rules in 15 ms. Remains 57 /65 variables (removed 8) and now considering 53/60 (removed 7) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:41:31] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
// Phase 1: matrix 53 rows 57 cols
[2025-06-06 04:41:31] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:32] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:32] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 15/27 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/27 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 53/110 variables, 57/84 constraints. Problems are: Problem set: 20 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:32] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:32] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 2/86 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/86 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/86 constraints. Problems are: Problem set: 20 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 86 constraints, problems are : Problem set: 20 solved, 32 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 20/57 variables, 12/12 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 17/29 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/29 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 53/110 variables, 57/86 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 32/118 constraints. Problems are: Problem set: 20 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:32] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/119 constraints. Problems are: Problem set: 20 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:33] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:33] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 2/121 constraints. Problems are: Problem set: 20 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:33] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 1/122 constraints. Problems are: Problem set: 20 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:34] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 1/123 constraints. Problems are: Problem set: 20 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:34] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 1/124 constraints. Problems are: Problem set: 20 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:35] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 1/125 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/125 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 0/110 variables, 0/125 constraints. Problems are: Problem set: 20 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 125 constraints, problems are : Problem set: 20 solved, 32 unsolved in 4321 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 32/52 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 5657ms problems are : Problem set: 20 solved, 32 unsolved
Search for dead transitions found 20 dead transitions in 5659ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 57/65 places, 33/60 transitions.
Graph (complete) has 90 edges and 57 vertex of which 38 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 38 /57 variables (removed 19) and now considering 33/33 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/65 places, 33/60 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5684 ms. Remains : 38/65 places, 33/60 transitions.
Built C files in :
/tmp/ltsmin4279679310028161803
[2025-06-06 04:41:37] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4279679310028161803
Running compilation step : cd /tmp/ltsmin4279679310028161803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin4279679310028161803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4279679310028161803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1793067944823302760.hoa' '--buchi-type=spotba'
LTSmin run took 170 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-07 finished in 27067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(X(X(!p0))) U ((!p0&&X(X(X(!p0))))||X(X(X(G(!p0)))))) U (G((X(X(X(!p0))) U ((!p0&&X(X(X(!p0))))||X(X(X(G(!p0)))))))||((X(X(X(!p0))) U ((!p0&&X(X(X(!p0))))||X(X(X(G(!p0))))))&&p1)))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 59
Applied a total of 8 rules in 3 ms. Remains 64 /68 variables (removed 4) and now considering 59/63 (removed 4) transitions.
// Phase 1: matrix 59 rows 64 cols
[2025-06-06 04:41:37] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 04:41:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2025-06-06 04:41:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:37] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:37] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:37] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:37] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:38] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:39] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:39] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:39] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:40] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:40] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:40] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:40] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:40] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:40] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:40] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:41] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:42] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:43] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/123 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/123 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:44] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 3 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/123 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:45] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/123 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/123 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 19 (OVERLAPS) 0/123 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 160 constraints, problems are : Problem set: 0 solved, 58 unsolved in 9532 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11549ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 11550ms
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 59/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11646 ms. Remains : 64/68 places, 59/63 transitions.
Stuttering acceptance computed with spot in 890 ms :[p0, p0, false, p0, p0, false, false, false, p0, p0, false, p0, p0, false, false, false, false, false, false, false, false]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-09
Product exploration explored 100000 steps with 19913 reset in 62 ms.
Product exploration explored 100000 steps with 19899 reset in 61 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 21 states, 50 edges and 2 AP (stutter sensitive) to 21 states, 50 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 888 ms :[p0, p0, false, p0, p0, false, false, false, p0, p0, false, p0, p0, false, false, false, false, false, false, false, false]
RANDOM walk for 581 steps (1 resets) in 12 ms. (44 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 480 ms. Reduced automaton from 21 states, 50 edges and 2 AP (stutter sensitive) to 21 states, 50 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1018 ms :[p0, p0, false, p0, p0, false, false, false, p0, p0, false, p0, p0, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 891 ms :[p0, p0, false, p0, p0, false, false, false, p0, p0, false, p0, p0, false, false, false, false, false, false, false, false]
[2025-06-06 04:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:41:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-06-06 04:41:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-06 04:41:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:41:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned unsat
Proved EG p0
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 5 factoid took 508 ms. Reduced automaton from 21 states, 50 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-09 finished in 16975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(!p0) U p1))||G(p2)))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 60
Applied a total of 6 rules in 7 ms. Remains 65 /68 variables (removed 3) and now considering 60/63 (removed 3) transitions.
// Phase 1: matrix 60 rows 65 cols
[2025-06-06 04:41:54] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 04:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-06 04:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:54] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:54] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:54] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:54] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:54] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:54] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:54] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:55] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:55] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/125 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:55] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:55] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 89 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2114 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/148 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:57] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:57] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:57] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:57] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:57] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:57] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:57] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:57] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:58] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:58] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 158 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7167ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 7168ms
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 60/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7257 ms. Remains : 65/68 places, 60/63 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND (NOT p2) p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 20 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-11 finished in 7638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&G(F(p2))))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 60
Applied a total of 6 rules in 5 ms. Remains 65 /68 variables (removed 3) and now considering 60/63 (removed 3) transitions.
// Phase 1: matrix 60 rows 65 cols
[2025-06-06 04:42:01] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:02] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 04:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:02] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-06 04:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 60/125 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:03] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:03] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 89 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 60/125 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 59/149 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:04] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:04] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:04] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:04] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:05] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:05] [INFO ] Deduced a trap along path composed of 14 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:05] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:07] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/125 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 159 constraints, problems are : Problem set: 0 solved, 59 unsolved in 8072 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 9990ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 9991ms
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 60/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10085 ms. Remains : 65/68 places, 60/63 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-13
Stuttering criterion allowed to conclude after 21707 steps with 1291 reset in 23 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-13 finished in 10422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 67 transition count 53
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 58 transition count 53
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 58 transition count 48
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 53 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 49 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 49 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 49 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 47 transition count 42
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 66 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 33 transition count 28
Applied a total of 67 rules in 13 ms. Remains 33 /68 variables (removed 35) and now considering 28/63 (removed 35) transitions.
// Phase 1: matrix 28 rows 33 cols
[2025-06-06 04:42:12] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 04:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:42:12] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-06 04:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:12] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:12] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 49 constraints, problems are : Problem set: 0 solved, 27 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 28/61 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 27/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:13] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:13] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:13] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:13] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/61 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 80 constraints, problems are : Problem set: 0 solved, 27 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1562ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1562ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/68 places, 28/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1646 ms. Remains : 33/68 places, 28/63 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-15
Product exploration explored 100000 steps with 882 reset in 141 ms.
Product exploration explored 100000 steps with 883 reset in 141 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/33 stabilizing places and 2/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-06 04:42:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 04:42:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:42:14] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-06 04:42:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:14] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:15] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 49 constraints, problems are : Problem set: 0 solved, 27 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 28/61 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 27/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:15] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:15] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:15] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:15] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/61 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 80 constraints, problems are : Problem set: 0 solved, 27 unsolved in 988 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1589ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1589ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1668 ms. Remains : 33/33 places, 28/28 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/33 stabilizing places and 2/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 867 reset in 94 ms.
Product exploration explored 100000 steps with 906 reset in 105 ms.
Built C files in :
/tmp/ltsmin16608090791991646908
[2025-06-06 04:42:17] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2025-06-06 04:42:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:42:17] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2025-06-06 04:42:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:42:17] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2025-06-06 04:42:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:42:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16608090791991646908
Running compilation step : cd /tmp/ltsmin16608090791991646908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 111 ms.
Running link step : cd /tmp/ltsmin16608090791991646908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16608090791991646908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8723316708051882809.hoa' '--buchi-type=spotba'
LTSmin run took 261 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-15 finished in 5051 ms.
All properties solved by simple procedures.
Total runtime 128322 ms.

BK_STOP 1749184937504

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-001B"
export BK_EXAMINATION="LTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-001B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533000611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-001B.tgz
mv ShieldPPPs-PT-001B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;