Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r158-smll-171636266300156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is EisenbergMcGuire-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 255K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716512003643

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 00:53:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 00:53:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:53:26] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2024-05-24 00:53:26] [INFO ] Transformed 196 places.
[2024-05-24 00:53:26] [INFO ] Transformed 448 transitions.
[2024-05-24 00:53:26] [INFO ] Found NUPN structural information;
[2024-05-24 00:53:26] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 465 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 190 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 190 transition count 424
Applied a total of 12 rules in 110 ms. Remains 190 /196 variables (removed 6) and now considering 424/448 (removed 24) transitions.
[2024-05-24 00:53:27] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
// Phase 1: matrix 260 rows 190 cols
[2024-05-24 00:53:27] [INFO ] Computed 13 invariants in 37 ms
[2024-05-24 00:53:27] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-24 00:53:27] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-05-24 00:53:27] [INFO ] Invariant cache hit.
[2024-05-24 00:53:28] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-24 00:53:28] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-24 00:53:28] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-05-24 00:53:28] [INFO ] Invariant cache hit.
[2024-05-24 00:53:28] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-24 00:53:33] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 29 ms to minimize.
[2024-05-24 00:53:33] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 4 ms to minimize.
[2024-05-24 00:53:33] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 4 ms to minimize.
[2024-05-24 00:53:33] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 4 ms to minimize.
[2024-05-24 00:53:33] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:53:34] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 4 ms to minimize.
[2024-05-24 00:53:34] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 4 ms to minimize.
[2024-05-24 00:53:34] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:53:35] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:53:35] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-05-24 00:53:35] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-05-24 00:53:35] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:53:35] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-05-24 00:53:35] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 4 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 4 ms to minimize.
[2024-05-24 00:53:37] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-24 00:53:37] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:53:38] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 3 ms to minimize.
[2024-05-24 00:53:38] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-24 00:53:38] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:53:39] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-05-24 00:53:39] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
[2024-05-24 00:53:39] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 4 ms to minimize.
[2024-05-24 00:53:40] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 4 ms to minimize.
[2024-05-24 00:53:41] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:53:42] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-05-24 00:53:42] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 3 ms to minimize.
[2024-05-24 00:53:43] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:53:43] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 3 ms to minimize.
[2024-05-24 00:53:43] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 4 ms to minimize.
[2024-05-24 00:53:44] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 5 ms to minimize.
[2024-05-24 00:53:44] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-24 00:53:48] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 4 ms to minimize.
[2024-05-24 00:53:48] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 4 ms to minimize.
[2024-05-24 00:53:49] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2024-05-24 00:53:49] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 5 ms to minimize.
[2024-05-24 00:53:49] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 3 ms to minimize.
[2024-05-24 00:53:51] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-24 00:53:53] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 2 ms to minimize.
[2024-05-24 00:53:55] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-24 00:53:55] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 4 ms to minimize.
[2024-05-24 00:53:55] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 4 ms to minimize.
[2024-05-24 00:53:55] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 3 ms to minimize.
[2024-05-24 00:53:56] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:53:56] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:53:56] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:53:56] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 4 ms to minimize.
[2024-05-24 00:53:56] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 4 ms to minimize.
[2024-05-24 00:53:57] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 3 ms to minimize.
[2024-05-24 00:53:57] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 4 ms to minimize.
[2024-05-24 00:53:57] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 3 ms to minimize.
[2024-05-24 00:53:57] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 4 ms to minimize.
[2024-05-24 00:53:57] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:53:58] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 3 ms to minimize.
[2024-05-24 00:53:58] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 3 ms to minimize.
[2024-05-24 00:53:58] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:53:58] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 3 ms to minimize.
[2024-05-24 00:53:59] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/450 variables, and 75 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/190 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-24 00:54:00] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:54:01] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:54:01] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:54:02] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 3 ms to minimize.
[2024-05-24 00:54:02] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 4 ms to minimize.
[2024-05-24 00:54:04] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-24 00:54:05] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:54:06] [INFO ] Deduced a trap composed of 59 places in 197 ms of which 3 ms to minimize.
[2024-05-24 00:54:07] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:54:08] [INFO ] Deduced a trap composed of 68 places in 172 ms of which 3 ms to minimize.
[2024-05-24 00:54:08] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:54:08] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:54:09] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:54:09] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:54:09] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-24 00:54:12] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:54:12] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:54:12] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:54:12] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:54:13] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:54:13] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 4 ms to minimize.
[2024-05-24 00:54:13] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 3 ms to minimize.
[2024-05-24 00:54:13] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 2 ms to minimize.
[2024-05-24 00:54:13] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:54:14] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:54:15] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 3 ms to minimize.
[2024-05-24 00:54:16] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 4 ms to minimize.
[2024-05-24 00:54:16] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:54:16] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 260/450 variables, 190/294 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 94/388 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 420/808 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-24 00:54:27] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:54:27] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:54:27] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 811 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 190/190 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 94/94 constraints]
After SMT, in 60553ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60597ms
Starting structural reductions in LTL mode, iteration 1 : 190/196 places, 424/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62036 ms. Remains : 190/196 places, 424/448 transitions.
Support contains 46 out of 190 places after structural reductions.
[2024-05-24 00:54:29] [INFO ] Flatten gal took : 96 ms
[2024-05-24 00:54:29] [INFO ] Flatten gal took : 58 ms
[2024-05-24 00:54:29] [INFO ] Input system was already deterministic with 424 transitions.
RANDOM walk for 40000 steps (8 resets) in 2765 ms. (14 steps per ms) remains 18/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
[2024-05-24 00:54:30] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-05-24 00:54:30] [INFO ] Invariant cache hit.
[2024-05-24 00:54:30] [INFO ] State equation strengthened by 94 read => feed constraints.
Problem AtomicPropp6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 2 (OVERLAPS) 157/188 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 3/12 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/190 variables, 1/13 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-24 00:54:31] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:54:31] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:54:31] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:54:31] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:54:31] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 5/18 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 260/450 variables, 190/208 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 94/302 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-24 00:54:32] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:54:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 2/304 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/304 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/450 variables, 0/304 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 304 constraints, problems are : Problem set: 5 solved, 12 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 190/190 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 5 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 163/187 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 2/11 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 2/13 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-24 00:54:32] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2024-05-24 00:54:33] [INFO ] Deduced a trap composed of 69 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 2/15 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/190 variables, 2/17 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 5/22 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-24 00:54:33] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:54:33] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:54:33] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:54:33] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:54:34] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 5/27 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/27 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 260/450 variables, 190/217 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 94/311 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 12/323 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-24 00:54:35] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 1/324 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-24 00:54:35] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:54:35] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/326 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-24 00:54:35] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:54:35] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:54:36] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:54:36] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 4/330 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/330 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-24 00:54:36] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/450 variables, 1/331 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/331 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 0/450 variables, 0/331 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 331 constraints, problems are : Problem set: 5 solved, 12 unsolved in 4774 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 190/190 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 12/17 constraints, Known Traps: 22/22 constraints]
After SMT, in 6660ms problems are : Problem set: 5 solved, 12 unsolved
Parikh walk visited 3 properties in 11040 ms.
Support contains 21 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 187 transition count 421
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 6 place count 187 transition count 372
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 104 place count 138 transition count 372
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 133 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 133 transition count 352
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 136 place count 122 transition count 341
Applied a total of 136 rules in 95 ms. Remains 122 /190 variables (removed 68) and now considering 341/424 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 122/190 places, 341/424 transitions.
RANDOM walk for 40000 steps (8 resets) in 462 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 578775 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :7 out of 9
Probabilistic random walk after 578775 steps, saw 117482 distinct states, run finished after 3006 ms. (steps per millisecond=192 ) properties seen :7
[2024-05-24 00:54:52] [INFO ] Flow matrix only has 177 transitions (discarded 164 similar events)
// Phase 1: matrix 177 rows 122 cols
[2024-05-24 00:54:52] [INFO ] Computed 13 invariants in 4 ms
[2024-05-24 00:54:52] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 99/162 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 22/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/190 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/232 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/234 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/237 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/237 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 62/299 variables, 47/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/299 variables, 50/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/299 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/299 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 122/122 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 00:54:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 99/162 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 22/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/190 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 7/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/232 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/234 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 00:54:52] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:54:52] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:54:52] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:54:53] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/237 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/237 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 00:54:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 00:54:53] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-24 00:54:53] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 00:54:53] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/299 variables, 47/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/299 variables, 50/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/299 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/299 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1063 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 122/122 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 1304ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 198 ms.
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 341/341 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 122 transition count 337
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 118 transition count 337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 333
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 116 transition count 332
Applied a total of 12 rules in 42 ms. Remains 116 /122 variables (removed 6) and now considering 332/341 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 116/122 places, 332/341 transitions.
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 579761 steps, run visited all 2 properties in 2721 ms. (steps per millisecond=213 )
Probabilistic random walk after 579761 steps, saw 117258 distinct states, run finished after 2726 ms. (steps per millisecond=212 ) properties seen :2
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 9 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 00:54:56] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 00:54:56] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 00:54:57] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-24 00:54:57] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:54:57] [INFO ] Invariant cache hit.
[2024-05-24 00:54:57] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:54:57] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:54:57] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:54:57] [INFO ] Invariant cache hit.
[2024-05-24 00:54:57] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:55:00] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:55:00] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:55:00] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:55:01] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:55:01] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:55:01] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2024-05-24 00:55:01] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:55:01] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:55:01] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 3 ms to minimize.
[2024-05-24 00:55:02] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:55:02] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:55:02] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:55:02] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:55:02] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:55:02] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:55:02] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-05-24 00:55:03] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:55:03] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:55:03] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:55:03] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:55:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:55:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-24 00:55:04] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:55:04] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:55:04] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:55:04] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:55:05] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2024-05-24 00:55:05] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 2 ms to minimize.
[2024-05-24 00:55:05] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 4 ms to minimize.
[2024-05-24 00:55:05] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-05-24 00:55:05] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:55:05] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:55:05] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:55:06] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:55:06] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-24 00:55:08] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 5 ms to minimize.
[2024-05-24 00:55:08] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:55:09] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 4 ms to minimize.
[2024-05-24 00:55:09] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:55:12] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 2 ms to minimize.
[2024-05-24 00:55:13] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:55:14] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:55:14] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 3 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 4 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:55:16] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:55:16] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:55:16] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
[2024-05-24 00:55:16] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:55:17] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:55:18] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:55:18] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:55:18] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:55:19] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:55:26] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 3 ms to minimize.
[2024-05-24 00:55:27] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:55:27] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:55:29] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 3 ms to minimize.
[2024-05-24 00:55:29] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:55:29] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:55:30] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:55:30] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:55:30] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:55:30] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:55:30] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:55:30] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:55:31] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-05-24 00:55:32] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:55:32] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:55:33] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:55:33] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-05-24 00:55:33] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 3 ms to minimize.
[2024-05-24 00:55:34] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:55:34] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:55:35] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:55:45] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-24 00:55:46] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:55:48] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 3 ms to minimize.
[2024-05-24 00:55:49] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
[2024-05-24 00:55:50] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-24 00:55:50] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:55:52] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-24 00:55:52] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:55:53] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:55:53] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:55:53] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2024-05-24 00:55:54] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:55:54] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61147 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-00
Product exploration explored 100000 steps with 474 reset in 661 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-00 finished in 62216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((p1&&(p2 U p3)))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 8 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 00:55:59] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:55:59] [INFO ] Invariant cache hit.
[2024-05-24 00:55:59] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-24 00:55:59] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:55:59] [INFO ] Invariant cache hit.
[2024-05-24 00:55:59] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:55:59] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:55:59] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:55:59] [INFO ] Invariant cache hit.
[2024-05-24 00:55:59] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:02] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:56:02] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:56:03] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-05-24 00:56:03] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:56:03] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:56:03] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:56:04] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 2 ms to minimize.
[2024-05-24 00:56:04] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:56:04] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:56:04] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:56:04] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:56:04] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:56:04] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:56:05] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:56:05] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 3 ms to minimize.
[2024-05-24 00:56:05] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:56:05] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:56:05] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:56:05] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:56:06] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:06] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-24 00:56:07] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:56:07] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:56:07] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 3 ms to minimize.
[2024-05-24 00:56:07] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 3 ms to minimize.
[2024-05-24 00:56:07] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
[2024-05-24 00:56:07] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:56:08] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 4 ms to minimize.
[2024-05-24 00:56:08] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:56:08] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:56:08] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:56:08] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:56:08] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-24 00:56:09] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:56:09] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:56:09] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:56:11] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:56:11] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:56:11] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 3 ms to minimize.
[2024-05-24 00:56:11] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:14] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2024-05-24 00:56:14] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:56:15] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:56:16] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:56:16] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:56:16] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 3 ms to minimize.
[2024-05-24 00:56:16] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:56:16] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:56:17] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 3 ms to minimize.
[2024-05-24 00:56:17] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:56:17] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:56:17] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:56:17] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:56:18] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:56:18] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 3 ms to minimize.
[2024-05-24 00:56:18] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:19] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:25] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:56:26] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:56:26] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:30] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
SMT process timed out in 30226ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30235ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31064 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-01
Product exploration explored 100000 steps with 1148 reset in 380 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-01 finished in 31723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 16 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 00:56:30] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:56:30] [INFO ] Invariant cache hit.
[2024-05-24 00:56:31] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-24 00:56:31] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:56:31] [INFO ] Invariant cache hit.
[2024-05-24 00:56:31] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:56:31] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:56:31] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:56:31] [INFO ] Invariant cache hit.
[2024-05-24 00:56:31] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:35] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:56:35] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:56:35] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-24 00:56:35] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:56:35] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:56:35] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:56:36] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:56:36] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:56:36] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:56:36] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 2 ms to minimize.
[2024-05-24 00:56:36] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:56:36] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:56:36] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:56:36] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:56:36] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 3 ms to minimize.
[2024-05-24 00:56:37] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 2 ms to minimize.
[2024-05-24 00:56:37] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:56:37] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:56:37] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:56:37] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:38] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:56:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 00:56:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 00:56:38] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:56:39] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:56:39] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:56:39] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:56:39] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:56:39] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:56:39] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:56:39] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:56:39] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:56:40] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:56:40] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:56:40] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:56:40] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-24 00:56:42] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:56:42] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:56:42] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:56:43] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:45] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:56:45] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-05-24 00:56:46] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:56:46] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:56:46] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:56:46] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:56:47] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:56:47] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-05-24 00:56:47] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:56:47] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:56:47] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:56:48] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:56:48] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:56:48] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 3 ms to minimize.
[2024-05-24 00:56:49] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:56:49] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:50] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:55] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 3 ms to minimize.
[2024-05-24 00:56:55] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:56:55] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:56:59] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:56:59] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:57:00] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:57:00] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:57:00] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 3 ms to minimize.
[2024-05-24 00:57:01] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:57:01] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:57:01] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:57:01] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 82 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 236/420 variables, 184/266 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 76/342 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 396/738 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:57:11] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 3 ms to minimize.
[2024-05-24 00:57:11] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:57:12] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:57:12] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:57:12] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:57:14] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:57:14] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:57:15] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-24 00:57:15] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
[2024-05-24 00:57:15] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 3 ms to minimize.
[2024-05-24 00:57:15] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:57:15] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:57:16] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-05-24 00:57:16] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:57:17] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:57:17] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:57:18] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:57:19] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:57:20] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 3 ms to minimize.
[2024-05-24 00:57:20] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 20/758 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:57:24] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:57:24] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:57:29] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:57:29] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:57:30] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 763 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 94/94 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61117 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 203 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 948305 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 1
Probabilistic random walk after 948305 steps, saw 205850 distinct states, run finished after 3003 ms. (steps per millisecond=315 ) properties seen :0
[2024-05-24 00:57:35] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:57:35] [INFO ] Invariant cache hit.
[2024-05-24 00:57:35] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 90/420 variables, 78/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 48/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 00:57:36] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:57:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 00:57:36] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:57:36] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/330 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 90/420 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 48/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 749ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 180 transition count 344
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 116 transition count 332
Applied a total of 136 rules in 46 ms. Remains 116 /184 variables (removed 68) and now considering 332/400 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 116/184 places, 332/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1773 ms. (steps per millisecond=326 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1775 ms. (steps per millisecond=326 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-24 00:57:38] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:57:38] [INFO ] Invariant cache hit.
[2024-05-24 00:57:39] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-24 00:57:39] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:57:39] [INFO ] Invariant cache hit.
[2024-05-24 00:57:39] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:57:39] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:57:39] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:57:39] [INFO ] Invariant cache hit.
[2024-05-24 00:57:39] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:57:42] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-24 00:57:42] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 4 ms to minimize.
[2024-05-24 00:57:42] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:57:43] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 3 ms to minimize.
[2024-05-24 00:57:43] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:57:43] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:57:43] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:57:43] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:57:43] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 3 ms to minimize.
[2024-05-24 00:57:43] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 2 ms to minimize.
[2024-05-24 00:57:44] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-05-24 00:57:44] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 3 ms to minimize.
[2024-05-24 00:57:44] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:57:44] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:57:44] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:57:44] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:57:44] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-24 00:57:45] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:57:45] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-05-24 00:57:45] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:57:45] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:57:46] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-05-24 00:57:46] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:57:46] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 4 ms to minimize.
[2024-05-24 00:57:46] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 3 ms to minimize.
[2024-05-24 00:57:46] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:57:46] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:57:47] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 4 ms to minimize.
[2024-05-24 00:57:47] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:57:47] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 3 ms to minimize.
[2024-05-24 00:57:47] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:57:47] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 4 ms to minimize.
[2024-05-24 00:57:47] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:57:48] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:57:48] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:57:48] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:57:50] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:57:50] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:57:51] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:57:51] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:57:53] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:57:53] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:57:54] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 3 ms to minimize.
[2024-05-24 00:57:54] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:57:54] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:57:55] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:57:55] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 3 ms to minimize.
[2024-05-24 00:57:55] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:57:55] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:57:56] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:57:56] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-24 00:57:56] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-24 00:57:56] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:57:57] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:57:57] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 3 ms to minimize.
[2024-05-24 00:57:57] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:57:58] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:58:03] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:58:04] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:58:04] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:58:06] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-24 00:58:07] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:58:08] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:58:08] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-05-24 00:58:08] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:58:08] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:58:08] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:58:09] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:58:09] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 82 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 236/420 variables, 184/266 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 76/342 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 396/738 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:58:19] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:58:19] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:58:19] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:58:19] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:58:19] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
[2024-05-24 00:58:21] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-05-24 00:58:21] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 3 ms to minimize.
[2024-05-24 00:58:21] [INFO ] Deduced a trap composed of 83 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:58:22] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:58:22] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:58:22] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:58:22] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 3 ms to minimize.
[2024-05-24 00:58:22] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 3 ms to minimize.
[2024-05-24 00:58:23] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:58:24] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 3 ms to minimize.
[2024-05-24 00:58:24] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:58:24] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:58:26] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:58:26] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:58:26] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 20/758 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:58:30] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:58:30] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:58:34] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2024-05-24 00:58:34] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:58:35] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 3 ms to minimize.
[2024-05-24 00:58:37] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 3 ms to minimize.
[2024-05-24 00:58:37] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 7/765 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 765 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 96/96 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in LTL mode , in 1 iterations and 61046 ms. Remains : 184/184 places, 400/400 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 938405 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 1
Probabilistic random walk after 938405 steps, saw 203884 distinct states, run finished after 3007 ms. (steps per millisecond=312 ) properties seen :0
[2024-05-24 00:58:43] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:58:43] [INFO ] Invariant cache hit.
[2024-05-24 00:58:43] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 90/420 variables, 78/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 48/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 00:58:43] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:58:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 00:58:43] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:58:44] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/330 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 90/420 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 48/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 180 transition count 344
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 116 transition count 332
Applied a total of 136 rules in 35 ms. Remains 116 /184 variables (removed 68) and now considering 332/400 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 116/184 places, 332/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1738 ms. (steps per millisecond=333 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1739 ms. (steps per millisecond=333 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 217 ms.
Product exploration explored 100000 steps with 0 reset in 253 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 400
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 4 place count 184 transition count 464
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 52 place count 184 transition count 464
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 184 transition count 464
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 180 transition count 460
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 180 transition count 460
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 76 rules in 71 ms. Remains 180 /184 variables (removed 4) and now considering 460/400 (removed -60) transitions.
[2024-05-24 00:58:47] [INFO ] Redundant transitions in 48 ms returned []
Running 456 sub problems to find dead transitions.
[2024-05-24 00:58:47] [INFO ] Flow matrix only has 264 transitions (discarded 196 similar events)
// Phase 1: matrix 264 rows 180 cols
[2024-05-24 00:58:47] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 00:58:47] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-24 00:58:51] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:58:51] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:58:51] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-24 00:58:51] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-24 00:58:51] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-24 00:58:51] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-24 00:58:52] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-24 00:58:52] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-24 00:58:52] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-24 00:58:52] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-24 00:58:52] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:58:52] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:58:52] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:58:52] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:58:52] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-24 00:58:53] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:58:53] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:58:53] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:58:53] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:58:53] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/33 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:58:54] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:58:54] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 3 ms to minimize.
[2024-05-24 00:58:54] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:58:54] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:58:55] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:58:55] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 3 ms to minimize.
[2024-05-24 00:58:55] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:58:55] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:58:56] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 3 ms to minimize.
[2024-05-24 00:58:57] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2024-05-24 00:58:57] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:58:57] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 12/45 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:01] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-05-24 00:59:02] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:59:02] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 3/48 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:04] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:59:05] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 2/50 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:08] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:59:08] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 2/52 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:13] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/53 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:16] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/54 constraints. Problems are: Problem set: 128 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/444 variables, and 54 constraints, problems are : Problem set: 128 solved, 328 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 128 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 41/42 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/42 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 64/180 variables, 8/50 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/54 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:21] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:59:22] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 2 ms to minimize.
[2024-05-24 00:59:22] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-05-24 00:59:22] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:59:22] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 5/59 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:25] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-05-24 00:59:26] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:59:27] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 3/62 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:28] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 2 ms to minimize.
[2024-05-24 00:59:29] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:59:30] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 3 ms to minimize.
[2024-05-24 00:59:30] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:59:30] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:59:30] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 2 ms to minimize.
[2024-05-24 00:59:30] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:59:31] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-05-24 00:59:31] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 9/71 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:33] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:59:33] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:59:33] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:59:34] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:59:34] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 5/76 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:36] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-05-24 00:59:36] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 2 ms to minimize.
[2024-05-24 00:59:36] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-05-24 00:59:37] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-05-24 00:59:37] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 4 ms to minimize.
[2024-05-24 00:59:37] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:59:37] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:59:37] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:59:38] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-24 00:59:38] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:59:39] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:59:39] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 2 ms to minimize.
[2024-05-24 00:59:39] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 2 ms to minimize.
[2024-05-24 00:59:40] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 14/90 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:42] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:59:42] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
[2024-05-24 00:59:42] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:59:43] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:59:43] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 2 ms to minimize.
[2024-05-24 00:59:43] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 2 ms to minimize.
[2024-05-24 00:59:44] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 7/97 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-24 00:59:47] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:59:47] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:59:47] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:59:47] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 180/444 variables, and 101 constraints, problems are : Problem set: 128 solved, 328 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 0/456 constraints, Known Traps: 88/88 constraints]
After SMT, in 60221ms problems are : Problem set: 128 solved, 328 unsolved
Search for dead transitions found 128 dead transitions in 60232ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 180/184 places, 332/400 transitions.
Graph (complete) has 856 edges and 180 vertex of which 116 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.4 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 28 ms. Remains 116 /180 variables (removed 64) and now considering 332/332 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/184 places, 332/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60391 ms. Remains : 116/184 places, 332/400 transitions.
Built C files in :
/tmp/ltsmin4538665512252815087
[2024-05-24 00:59:48] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4538665512252815087
Running compilation step : cd /tmp/ltsmin4538665512252815087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1974 ms.
Running link step : cd /tmp/ltsmin4538665512252815087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin4538665512252815087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15912599669024079335.hoa' '--buchi-type=spotba'
LTSmin run took 12744 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-02 finished in 212045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 8 place count 186 transition count 370
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 108 place count 136 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 131 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 131 transition count 350
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 119 transition count 338
Applied a total of 142 rules in 28 ms. Remains 119 /190 variables (removed 71) and now considering 338/424 (removed 86) transitions.
[2024-05-24 01:00:02] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
// Phase 1: matrix 174 rows 119 cols
[2024-05-24 01:00:02] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 01:00:03] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-24 01:00:03] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
[2024-05-24 01:00:03] [INFO ] Invariant cache hit.
[2024-05-24 01:00:03] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 01:00:03] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-24 01:00:03] [INFO ] Redundant transitions in 8 ms returned []
Running 334 sub problems to find dead transitions.
[2024-05-24 01:00:03] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
[2024-05-24 01:00:03] [INFO ] Invariant cache hit.
[2024-05-24 01:00:03] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:05] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:00:05] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 29 places in 283 ms of which 2 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:00:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 01:00:08] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-24 01:00:08] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-24 01:00:08] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:09] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:00:09] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:00:10] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:00:10] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:13] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-24 01:00:13] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-24 01:00:14] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-24 01:00:14] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:00:14] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-24 01:00:14] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-05-24 01:00:14] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:16] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:00:16] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-24 01:00:16] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:00:16] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:00:17] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:19] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:00:19] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-24 01:00:20] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:23] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:00:24] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:26] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:00:26] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:00:26] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:00:26] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:00:26] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:00:26] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 3 ms to minimize.
[2024-05-24 01:00:26] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:29] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2024-05-24 01:00:29] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:00:29] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:00:29] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:00:31] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:00:31] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/293 variables, and 80 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/79 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:36] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:39] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 174/293 variables, 119/201 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 79/280 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 334/614 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:47] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:00:49] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-24 01:00:49] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:00:50] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 3 ms to minimize.
[2024-05-24 01:00:50] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 5/619 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-24 01:00:59] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 620 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 75/75 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in SI_LTL mode, iteration 1 : 119/190 places, 338/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60886 ms. Remains : 119/190 places, 338/424 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 228 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-06 finished in 61313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(!p1 U (X(!p2)||G(!p1))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 14 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 01:01:04] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 01:01:04] [INFO ] Computed 13 invariants in 4 ms
[2024-05-24 01:01:04] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-24 01:01:04] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:01:04] [INFO ] Invariant cache hit.
[2024-05-24 01:01:04] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 01:01:05] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 01:01:05] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:01:05] [INFO ] Invariant cache hit.
[2024-05-24 01:01:05] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:01:08] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-24 01:01:08] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:01:08] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 3 ms to minimize.
[2024-05-24 01:01:09] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 3 ms to minimize.
[2024-05-24 01:01:09] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:01:09] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 4 ms to minimize.
[2024-05-24 01:01:09] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-05-24 01:01:09] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-24 01:01:10] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:01:10] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 2 ms to minimize.
[2024-05-24 01:01:10] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-05-24 01:01:10] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:01:10] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-24 01:01:10] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 3 ms to minimize.
[2024-05-24 01:01:11] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:01:11] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-05-24 01:01:11] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:01:11] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-24 01:01:11] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:01:11] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:01:12] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 01:01:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-05-24 01:01:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-05-24 01:01:12] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:01:13] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:01:13] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:01:13] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:01:13] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:01:13] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 3 ms to minimize.
[2024-05-24 01:01:14] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:01:14] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:01:14] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:01:14] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:01:14] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 4 ms to minimize.
[2024-05-24 01:01:14] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 01:01:15] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-24 01:01:17] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:01:17] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-24 01:01:17] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:01:17] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:01:20] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 3 ms to minimize.
[2024-05-24 01:01:21] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:01:21] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-24 01:01:22] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-05-24 01:01:22] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 4 ms to minimize.
[2024-05-24 01:01:22] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:01:22] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 4 ms to minimize.
[2024-05-24 01:01:23] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:01:23] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:01:23] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 2 ms to minimize.
[2024-05-24 01:01:24] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
[2024-05-24 01:01:24] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:01:24] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:01:25] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
[2024-05-24 01:01:25] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:01:26] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:01:27] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:01:34] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 3 ms to minimize.
[2024-05-24 01:01:34] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-05-24 01:01:34] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:01:36] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:01:36] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 3 ms to minimize.
[2024-05-24 01:01:36] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:01:37] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:01:37] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:01:37] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-24 01:01:37] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 3 ms to minimize.
[2024-05-24 01:01:37] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:01:37] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:01:38] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:01:39] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-24 01:01:39] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:01:40] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:01:40] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2024-05-24 01:01:40] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:01:40] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-05-24 01:01:40] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:01:41] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:01:51] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:01:51] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2024-05-24 01:01:54] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:01:55] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-24 01:01:55] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-24 01:01:56] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 3 ms to minimize.
[2024-05-24 01:01:56] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:01:57] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-24 01:01:58] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 3 ms to minimize.
[2024-05-24 01:01:58] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-24 01:01:58] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:01:59] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:01:59] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61213 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, p2, (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), (AND p2 p1)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-07
Product exploration explored 100000 steps with 19027 reset in 188 ms.
Product exploration explored 100000 steps with 19148 reset in 198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 7 factoid took 274 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
RANDOM walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2024-05-24 01:02:06] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:02:06] [INFO ] Invariant cache hit.
[2024-05-24 01:02:06] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 01:02:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/322 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 18/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/336 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 37/373 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/375 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 45/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/420 variables, 31/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 274 constraints, problems are : Problem set: 0 solved, 2 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/322 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 14/336 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 37/373 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/375 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 01:02:07] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/375 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 45/420 variables, 39/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 31/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 388 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 198 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 203 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Support contains 4 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-24 01:02:08] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:02:08] [INFO ] Invariant cache hit.
[2024-05-24 01:02:08] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-24 01:02:08] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:02:08] [INFO ] Invariant cache hit.
[2024-05-24 01:02:08] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 01:02:09] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 01:02:09] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:02:09] [INFO ] Invariant cache hit.
[2024-05-24 01:02:09] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:02:11] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-24 01:02:11] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2024-05-24 01:02:12] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:02:12] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 2 ms to minimize.
[2024-05-24 01:02:12] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:02:12] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-24 01:02:12] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:02:12] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-24 01:02:13] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:02:13] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:02:13] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:02:13] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
[2024-05-24 01:02:13] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-24 01:02:13] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:02:13] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-24 01:02:13] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:02:14] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:02:14] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 3 ms to minimize.
[2024-05-24 01:02:14] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:02:14] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:02:14] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-05-24 01:02:15] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-05-24 01:02:15] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 01:02:15] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 4 ms to minimize.
[2024-05-24 01:02:16] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:02:16] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:02:16] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:02:16] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-05-24 01:02:16] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 4 ms to minimize.
[2024-05-24 01:02:16] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:02:17] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-05-24 01:02:17] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 3 ms to minimize.
[2024-05-24 01:02:17] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:02:17] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2024-05-24 01:02:17] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 01:02:18] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-24 01:02:20] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:02:20] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-24 01:02:21] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 3 ms to minimize.
[2024-05-24 01:02:21] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:02:24] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 2 ms to minimize.
[2024-05-24 01:02:25] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:02:26] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 3 ms to minimize.
[2024-05-24 01:02:26] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:02:27] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 3 ms to minimize.
[2024-05-24 01:02:27] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:02:27] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 4 ms to minimize.
[2024-05-24 01:02:27] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-05-24 01:02:28] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:02:28] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-24 01:02:28] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-24 01:02:28] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-05-24 01:02:28] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 3 ms to minimize.
[2024-05-24 01:02:29] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:02:29] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:02:30] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:02:31] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:02:38] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:02:38] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-05-24 01:02:38] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:02:40] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:02:41] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:02:41] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:02:41] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:02:41] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 2 ms to minimize.
[2024-05-24 01:02:41] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 3 ms to minimize.
[2024-05-24 01:02:41] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-05-24 01:02:41] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-24 01:02:42] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:02:42] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-05-24 01:02:44] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:02:44] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 3 ms to minimize.
[2024-05-24 01:02:44] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 4 ms to minimize.
[2024-05-24 01:02:44] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 2 ms to minimize.
[2024-05-24 01:02:45] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 3 ms to minimize.
[2024-05-24 01:02:45] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:02:45] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:02:46] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:02:57] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-24 01:02:58] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:03:00] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2024-05-24 01:03:01] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
[2024-05-24 01:03:02] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:03:02] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-05-24 01:03:03] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:03:03] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-24 01:03:05] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-05-24 01:03:05] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:03:05] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:03:06] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:03:06] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Finished structural reductions in LTL mode , in 1 iterations and 60873 ms. Remains : 184/184 places, 400/400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 173 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 161 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
[2024-05-24 01:03:09] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:03:09] [INFO ] Invariant cache hit.
[2024-05-24 01:03:09] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 01:03:09] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/322 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 18/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/336 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 37/373 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/375 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 45/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/420 variables, 31/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 274 constraints, problems are : Problem set: 0 solved, 2 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/322 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 14/336 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 37/373 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/375 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 01:03:10] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/375 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 45/420 variables, 39/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 31/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1881 steps, including 58 resets, run visited all 2 properties in 32 ms. (steps per millisecond=58 )
Parikh walk visited 2 properties in 31 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 3 factoid took 328 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 192 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 198 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 182 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Product exploration explored 100000 steps with 18993 reset in 271 ms.
Product exploration explored 100000 steps with 18951 reset in 303 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 189 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 400
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 4 place count 184 transition count 462
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 51 place count 184 transition count 462
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 184 transition count 462
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 180 transition count 458
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 180 transition count 458
Deduced a syphon composed of 63 places in 1 ms
Applied a total of 75 rules in 48 ms. Remains 180 /184 variables (removed 4) and now considering 458/400 (removed -58) transitions.
[2024-05-24 01:03:12] [INFO ] Redundant transitions in 7 ms returned []
Running 454 sub problems to find dead transitions.
[2024-05-24 01:03:12] [INFO ] Flow matrix only has 263 transitions (discarded 195 similar events)
// Phase 1: matrix 263 rows 180 cols
[2024-05-24 01:03:12] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 01:03:12] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-24 01:03:16] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-24 01:03:17] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:03:17] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:03:17] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:03:17] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2024-05-24 01:03:17] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:03:17] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:03:18] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/33 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-24 01:03:18] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:03:18] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 01:03:19] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
[2024-05-24 01:03:19] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:03:19] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:03:19] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:03:19] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:03:20] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:03:20] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-24 01:03:20] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:03:20] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:03:20] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-24 01:03:20] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-24 01:03:20] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:03:20] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:03:21] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:03:21] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:03:21] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:03:21] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:03:21] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 20/53 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-24 01:03:25] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-24 01:03:25] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:03:25] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:03:26] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:03:26] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2024-05-24 01:03:26] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:03:26] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:03:26] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-24 01:03:27] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:03:27] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 10/63 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-24 01:03:29] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:03:29] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-05-24 01:03:29] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:03:30] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-05-24 01:03:30] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 3 ms to minimize.
[2024-05-24 01:03:30] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:03:30] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 2 ms to minimize.
[2024-05-24 01:03:31] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 8/71 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-24 01:03:33] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/72 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-24 01:03:38] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:03:38] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2024-05-24 01:03:39] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 2 ms to minimize.
[2024-05-24 01:03:39] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 4/76 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-24 01:03:42] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:03:42] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 4 ms to minimize.
[2024-05-24 01:03:42] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2024-05-24 01:03:42] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-05-24 01:03:43] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 30304ms, After SMT, problems are : Problem set: 125 solved, 329 unsolved
Search for dead transitions found 125 dead transitions in 30313ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 180/184 places, 333/400 transitions.
Graph (complete) has 857 edges and 180 vertex of which 117 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.2 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 117 /180 variables (removed 63) and now considering 333/333 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/184 places, 333/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30392 ms. Remains : 117/184 places, 333/400 transitions.
Built C files in :
/tmp/ltsmin9157511657791399539
[2024-05-24 01:03:43] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9157511657791399539
Running compilation step : cd /tmp/ltsmin9157511657791399539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1629 ms.
Running link step : cd /tmp/ltsmin9157511657791399539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9157511657791399539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11658369693165909312.hoa' '--buchi-type=spotba'
LTSmin run took 1001 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-07 finished in 161627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 186 transition count 369
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 135 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 129 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 117 transition count 333
Applied a total of 146 rules in 19 ms. Remains 117 /190 variables (removed 73) and now considering 333/424 (removed 91) transitions.
[2024-05-24 01:03:45] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2024-05-24 01:03:45] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 01:03:46] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-24 01:03:46] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 01:03:46] [INFO ] Invariant cache hit.
[2024-05-24 01:03:46] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 01:03:46] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2024-05-24 01:03:46] [INFO ] Redundant transitions in 2 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-24 01:03:46] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 01:03:46] [INFO ] Invariant cache hit.
[2024-05-24 01:03:46] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:03:48] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:03:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 01:03:48] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 01:03:48] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:03:48] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:03:48] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-24 01:03:48] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-24 01:03:49] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-24 01:03:49] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:03:49] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-24 01:03:49] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:03:49] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 3 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 01:03:51] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:03:51] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-24 01:03:52] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:03:52] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:03:52] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2024-05-24 01:03:52] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:03:52] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 3 ms to minimize.
[2024-05-24 01:03:53] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-24 01:03:53] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:03:53] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:03:53] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-05-24 01:03:53] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:03:54] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-05-24 01:03:54] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:03:54] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-24 01:03:54] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:03:54] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:03:58] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-24 01:03:58] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:04:00] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:04:00] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:04:00] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-24 01:04:00] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:04:02] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:04:02] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-24 01:04:02] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:04:02] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:04:03] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:04:03] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-24 01:04:03] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 3 ms to minimize.
[2024-05-24 01:04:04] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:04:07] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 3 ms to minimize.
[2024-05-24 01:04:07] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:04:07] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
[2024-05-24 01:04:07] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
[2024-05-24 01:04:08] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:04:08] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 3 ms to minimize.
[2024-05-24 01:04:08] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:04:08] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:04:11] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:04:11] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (OVERLAPS) 169/286 variables, 117/190 constraints. Problems are: Problem set: 0 solved, 329 unsolved
SMT process timed out in 30151ms, After SMT, problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 30155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 117/190 places, 333/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30868 ms. Remains : 117/190 places, 333/424 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 210 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-10 finished in 31154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U (p2||F(p3))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 185 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 185 transition count 404
Applied a total of 10 rules in 6 ms. Remains 185 /190 variables (removed 5) and now considering 404/424 (removed 20) transitions.
[2024-05-24 01:04:17] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-05-24 01:04:17] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 01:04:17] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-24 01:04:17] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 01:04:17] [INFO ] Invariant cache hit.
[2024-05-24 01:04:17] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 01:04:17] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-24 01:04:17] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 01:04:17] [INFO ] Invariant cache hit.
[2024-05-24 01:04:17] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:04:21] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-24 01:04:21] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-24 01:04:21] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-24 01:04:21] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:04:22] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:04:22] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:04:22] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:04:22] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:04:22] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 3 ms to minimize.
[2024-05-24 01:04:22] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 4 ms to minimize.
[2024-05-24 01:04:23] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:04:23] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 3 ms to minimize.
[2024-05-24 01:04:23] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:04:23] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
[2024-05-24 01:04:23] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:04:24] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:04:24] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 3 ms to minimize.
[2024-05-24 01:04:24] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:04:24] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:04:24] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:04:25] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 01:04:25] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-24 01:04:26] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 3 ms to minimize.
[2024-05-24 01:04:26] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-05-24 01:04:26] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-24 01:04:26] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 4 ms to minimize.
[2024-05-24 01:04:26] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 3 ms to minimize.
[2024-05-24 01:04:26] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 3 ms to minimize.
[2024-05-24 01:04:27] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:04:27] [INFO ] Deduced a trap composed of 63 places in 194 ms of which 3 ms to minimize.
[2024-05-24 01:04:27] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:04:27] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:04:27] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 4 ms to minimize.
[2024-05-24 01:04:28] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:04:28] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 3 ms to minimize.
[2024-05-24 01:04:28] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 01:04:29] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2024-05-24 01:04:29] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:04:29] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 4 ms to minimize.
[2024-05-24 01:04:29] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:04:33] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-24 01:04:33] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:04:33] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:04:33] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:04:34] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:04:37] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:04:37] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-05-24 01:04:37] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:04:37] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:04:38] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 3 ms to minimize.
[2024-05-24 01:04:41] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:04:42] [INFO ] Deduced a trap composed of 58 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:04:42] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:04:44] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:04:44] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:04:44] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 4 ms to minimize.
[2024-05-24 01:04:45] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:04:46] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:04:47] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-24 01:04:48] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 2 ms to minimize.
[2024-05-24 01:04:48] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30226ms
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 404/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31191 ms. Remains : 185/190 places, 404/424 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 123 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-11 finished in 31521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 185 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 185 transition count 404
Applied a total of 10 rules in 4 ms. Remains 185 /190 variables (removed 5) and now considering 404/424 (removed 20) transitions.
[2024-05-24 01:04:48] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-05-24 01:04:48] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 01:04:48] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-24 01:04:48] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 01:04:48] [INFO ] Invariant cache hit.
[2024-05-24 01:04:48] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 01:04:49] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-24 01:04:49] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 01:04:49] [INFO ] Invariant cache hit.
[2024-05-24 01:04:49] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:04:52] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 01:04:52] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 01:04:52] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-24 01:04:52] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 3 ms to minimize.
[2024-05-24 01:04:52] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-05-24 01:04:53] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:04:53] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:04:53] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 3 ms to minimize.
[2024-05-24 01:04:53] [INFO ] Deduced a trap composed of 68 places in 158 ms of which 2 ms to minimize.
[2024-05-24 01:04:53] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:04:53] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:04:54] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:04:54] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-05-24 01:04:54] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-05-24 01:04:54] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2024-05-24 01:04:54] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 01:04:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 01:04:55] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:04:55] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 4 ms to minimize.
[2024-05-24 01:04:55] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:04:56] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 3 ms to minimize.
[2024-05-24 01:04:56] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:04:56] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:04:56] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 01:04:57] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:04:57] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 01:04:57] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:04:59] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-24 01:04:59] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:04:59] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 3 ms to minimize.
[2024-05-24 01:05:00] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:05:00] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 3 ms to minimize.
[2024-05-24 01:05:00] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:05:00] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:05:00] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:05:01] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-05-24 01:05:01] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-24 01:05:01] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-24 01:05:01] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:05:01] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:05:04] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 3 ms to minimize.
[2024-05-24 01:05:05] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 2 ms to minimize.
[2024-05-24 01:05:06] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2024-05-24 01:05:06] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:05:07] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-24 01:05:07] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
[2024-05-24 01:05:07] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 3 ms to minimize.
[2024-05-24 01:05:08] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:05:08] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:05:09] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:05:09] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:05:09] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 3 ms to minimize.
[2024-05-24 01:05:09] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:05:10] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:05:10] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 5 ms to minimize.
[2024-05-24 01:05:11] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:05:11] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:05:11] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:05:11] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:05:13] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-24 01:05:14] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:05:15] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 2 ms to minimize.
[2024-05-24 01:05:15] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:05:16] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 3 ms to minimize.
[2024-05-24 01:05:16] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/425 variables, and 78 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/185 constraints, ReadFeed: 0/79 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:05:21] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:05:21] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-05-24 01:05:21] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 3 ms to minimize.
[2024-05-24 01:05:22] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:05:26] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:05:26] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-24 01:05:29] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:05:29] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:05:31] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:05:31] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:05:31] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:05:34] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:05:34] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:05:37] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:05:37] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:05:37] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 6 ms to minimize.
[2024-05-24 01:05:37] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 3 ms to minimize.
[2024-05-24 01:05:38] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:05:38] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 4 ms to minimize.
[2024-05-24 01:05:38] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:05:38] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:05:38] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:05:38] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:05:39] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:05:39] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2024-05-24 01:05:39] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:05:39] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 3 ms to minimize.
[2024-05-24 01:05:39] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-05-24 01:05:39] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:05:40] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:05:40] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:05:40] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:05:41] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 01:05:43] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:05:43] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 3 ms to minimize.
[2024-05-24 01:05:45] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/425 variables, and 114 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/185 constraints, ReadFeed: 0/79 constraints, PredecessorRefiner: 0/400 constraints, Known Traps: 101/101 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 404/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60904 ms. Remains : 185/190 places, 404/424 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-12 finished in 61053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 186 transition count 369
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 135 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 129 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 117 transition count 333
Applied a total of 146 rules in 37 ms. Remains 117 /190 variables (removed 73) and now considering 333/424 (removed 91) transitions.
[2024-05-24 01:05:49] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2024-05-24 01:05:49] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 01:05:49] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-24 01:05:49] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 01:05:49] [INFO ] Invariant cache hit.
[2024-05-24 01:05:50] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 01:05:50] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2024-05-24 01:05:50] [INFO ] Redundant transitions in 2 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-24 01:05:50] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 01:05:50] [INFO ] Invariant cache hit.
[2024-05-24 01:05:50] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:05:52] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:05:52] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 01:05:52] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:05:53] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-24 01:05:53] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:05:53] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:05:53] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-05-24 01:05:53] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:05:53] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 01:05:53] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:05:53] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:05:54] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:05:54] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-24 01:05:54] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-24 01:05:54] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:05:54] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-24 01:05:54] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:05:54] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 01:05:54] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:05:55] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:05:55] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
[2024-05-24 01:05:55] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-24 01:05:55] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-24 01:05:56] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:05:56] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:05:56] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:05:56] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:05:56] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-24 01:05:56] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-24 01:05:56] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:05:57] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:05:57] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:05:57] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:05:57] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:05:57] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-05-24 01:05:57] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:05:58] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-24 01:05:58] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:05:58] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:01] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:06:02] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
[2024-05-24 01:06:02] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:06:02] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:06:02] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:06:03] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:06:03] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-24 01:06:03] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:06:03] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:05] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:08] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:11] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-05-24 01:06:11] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:13] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:06:14] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:15] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:06:16] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-24 01:06:16] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-24 01:06:16] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:06:16] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 117/286 variables, and 72 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/117 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:22] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-24 01:06:22] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:25] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 2 ms to minimize.
[2024-05-24 01:06:26] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:27] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:06:27] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:06:28] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-24 01:06:29] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:30] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:06:31] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:06:31] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:06:31] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:06:31] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-24 01:06:31] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:33] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:06:34] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:37] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
[2024-05-24 01:06:38] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 01:06:40] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-24 01:06:41] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 11 (OVERLAPS) 169/286 variables, 117/209 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 76/285 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 329/614 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/286 variables, and 614 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 79/79 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in SI_LTL mode, iteration 1 : 117/190 places, 333/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60957 ms. Remains : 117/190 places, 333/424 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 213 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-13 finished in 61253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||X(X(G(p1)))||G(p2)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 5 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-24 01:06:50] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 01:06:50] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 01:06:51] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-24 01:06:51] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:06:51] [INFO ] Invariant cache hit.
[2024-05-24 01:06:51] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 01:06:51] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 01:06:51] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:06:51] [INFO ] Invariant cache hit.
[2024-05-24 01:06:51] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:06:55] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-24 01:06:55] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:06:55] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 3 ms to minimize.
[2024-05-24 01:06:55] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
[2024-05-24 01:06:56] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 3 ms to minimize.
[2024-05-24 01:06:56] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:06:56] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-05-24 01:06:56] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-24 01:06:56] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:06:56] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 2 ms to minimize.
[2024-05-24 01:06:57] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:06:57] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 3 ms to minimize.
[2024-05-24 01:06:57] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:06:57] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:06:57] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:06:57] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:06:58] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:06:58] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:06:58] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:06:58] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:06:58] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 01:06:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 01:06:59] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 01:06:59] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:07:00] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-05-24 01:07:00] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:07:00] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-24 01:07:00] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:07:00] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 4 ms to minimize.
[2024-05-24 01:07:01] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:07:01] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:07:01] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:07:01] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:07:01] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 4 ms to minimize.
[2024-05-24 01:07:01] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 01:07:02] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:07:04] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:07:04] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-05-24 01:07:05] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:07:05] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:07:08] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 3 ms to minimize.
[2024-05-24 01:07:09] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:07:10] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-05-24 01:07:10] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2024-05-24 01:07:10] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:07:11] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:07:11] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 3 ms to minimize.
[2024-05-24 01:07:11] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-05-24 01:07:11] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:07:12] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-05-24 01:07:12] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-24 01:07:12] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:07:12] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
[2024-05-24 01:07:13] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-05-24 01:07:13] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:07:13] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:07:15] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:07:22] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 4 ms to minimize.
SMT process timed out in 30339ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30352ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31317 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 626 ms :[(AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 3546 reset in 247 ms.
Product exploration explored 100000 steps with 3478 reset in 279 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 145 ms. Reduced automaton from 11 states, 28 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 773 ms. (51 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 502 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 771 ms. (51 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 927 ms. (43 steps per ms) remains 6/6 properties
[2024-05-24 01:07:25] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:07:25] [INFO ] Invariant cache hit.
[2024-05-24 01:07:25] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:07:25] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-24 01:07:25] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 183/322 variables, 139/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/336 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 37/373 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/375 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 45/420 variables, 39/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 31/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 275 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:07:26] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:07:26] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-24 01:07:26] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 183/322 variables, 139/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 40/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/336 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 37/373 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:07:27] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:07:27] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:07:27] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/373 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/375 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:07:28] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 45/420 variables, 39/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 31/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:07:28] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 3 ms to minimize.
[2024-05-24 01:07:28] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 01:07:28] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 3 ms to minimize.
[2024-05-24 01:07:29] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/420 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 292 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3374 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 4487ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2123 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 181 transition count 397
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 181 transition count 347
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 119 transition count 335
Applied a total of 130 rules in 27 ms. Remains 119 /184 variables (removed 65) and now considering 335/400 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 119/184 places, 335/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 1606 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 917 ms. (steps per millisecond=64 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 917 ms. (steps per millisecond=64 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 23 factoid took 612 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-24 01:07:34] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:07:34] [INFO ] Invariant cache hit.
[2024-05-24 01:07:35] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-24 01:07:35] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:07:35] [INFO ] Invariant cache hit.
[2024-05-24 01:07:35] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 01:07:35] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 01:07:35] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:07:35] [INFO ] Invariant cache hit.
[2024-05-24 01:07:35] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:07:39] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:07:39] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-24 01:07:39] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:07:40] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 4 ms to minimize.
[2024-05-24 01:07:40] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:07:40] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:07:40] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:07:40] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-24 01:07:40] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 4 ms to minimize.
[2024-05-24 01:07:41] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 3 ms to minimize.
[2024-05-24 01:07:41] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-05-24 01:07:41] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-05-24 01:07:41] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:07:41] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:07:41] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:07:41] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-24 01:07:42] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:07:42] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-24 01:07:42] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:07:42] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:07:42] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:07:43] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 01:07:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 01:07:43] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:07:43] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:07:44] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 3 ms to minimize.
[2024-05-24 01:07:44] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:07:44] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 3 ms to minimize.
[2024-05-24 01:07:44] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:07:44] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 3 ms to minimize.
[2024-05-24 01:07:45] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:07:45] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:07:45] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:07:45] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:07:45] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 01:07:46] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:07:48] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:07:48] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 4 ms to minimize.
[2024-05-24 01:07:49] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:07:49] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:07:52] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2024-05-24 01:07:53] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:07:54] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-24 01:07:54] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:07:54] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 4 ms to minimize.
[2024-05-24 01:07:55] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 4 ms to minimize.
[2024-05-24 01:07:55] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:07:55] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:07:55] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:07:56] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:07:56] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:07:56] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:07:56] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 3 ms to minimize.
[2024-05-24 01:07:57] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 2 ms to minimize.
[2024-05-24 01:07:58] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
[2024-05-24 01:07:58] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:07:59] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 70 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:08:07] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:08:07] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-05-24 01:08:07] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:08:07] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-24 01:08:08] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-05-24 01:08:08] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:08:08] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:08:08] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 3 ms to minimize.
[2024-05-24 01:08:09] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:08:11] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:08:12] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:08:13] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-24 01:08:14] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 236/420 variables, 184/267 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 76/343 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 396/739 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 01:08:24] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:08:24] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:08:24] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:08:24] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:08:25] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:08:25] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:08:25] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:08:25] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2024-05-24 01:08:25] [INFO ] Deduced a trap composed of 62 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:08:25] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
[2024-05-24 01:08:28] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:08:28] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:08:28] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 3 ms to minimize.
[2024-05-24 01:08:28] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:08:29] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-24 01:08:29] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-24 01:08:30] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:08:30] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-05-24 01:08:30] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:08:30] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 20/759 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 759 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 90/90 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in LTL mode , in 1 iterations and 61181 ms. Remains : 184/184 places, 400/400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 132 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 912 ms. (43 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 6/6 properties
[2024-05-24 01:08:37] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 01:08:37] [INFO ] Invariant cache hit.
[2024-05-24 01:08:37] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:08:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 183/322 variables, 139/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 40/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/336 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 37/373 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/375 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 45/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 31/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 274 constraints, problems are : Problem set: 0 solved, 6 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:08:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 183/322 variables, 139/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/336 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:08:38] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 37/373 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:08:39] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-24 01:08:39] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/375 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 01:08:39] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:08:39] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 45/420 variables, 39/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/420 variables, 31/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 286 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints]
After SMT, in 2433ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1615 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 181 transition count 397
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 181 transition count 347
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 119 transition count 335
Applied a total of 130 rules in 18 ms. Remains 119 /184 variables (removed 65) and now considering 335/400 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 119/184 places, 335/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 1171 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 651 ms. (steps per millisecond=90 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 654 ms. (steps per millisecond=89 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2 p0))), (F p0)]
Knowledge based reduction with 8 factoid took 545 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1829 reset in 236 ms.
Product exploration explored 100000 steps with 1842 reset in 264 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 400
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 3 place count 184 transition count 462
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 50 place count 184 transition count 462
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 65 place count 184 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 181 transition count 459
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 181 transition count 459
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 71 rules in 21 ms. Remains 181 /184 variables (removed 3) and now considering 459/400 (removed -59) transitions.
[2024-05-24 01:08:45] [INFO ] Redundant transitions in 2 ms returned []
Running 455 sub problems to find dead transitions.
[2024-05-24 01:08:45] [INFO ] Flow matrix only has 264 transitions (discarded 195 similar events)
// Phase 1: matrix 264 rows 181 cols
[2024-05-24 01:08:45] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 01:08:45] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-24 01:08:48] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 01:08:48] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 01:08:48] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-24 01:08:48] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-24 01:08:48] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-24 01:08:48] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-24 01:08:48] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-24 01:08:48] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 3 ms to minimize.
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-24 01:08:49] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-24 01:08:50] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-24 01:08:50] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/33 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-24 01:08:50] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:08:50] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-24 01:08:51] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:08:51] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 01:08:51] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:08:51] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-24 01:08:51] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-24 01:08:51] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
[2024-05-24 01:08:52] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-24 01:08:52] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:08:52] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:08:53] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:08:53] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:08:53] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:08:53] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-24 01:08:53] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-05-24 01:08:54] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2024-05-24 01:08:54] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:08:54] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-05-24 01:08:54] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 20/53 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-24 01:08:57] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:08:57] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:08:57] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:08:58] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 4/57 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-24 01:09:00] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:09:00] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/59 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/59 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 264/445 variables, 181/240 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 118/358 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-24 01:09:07] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 3 ms to minimize.
[2024-05-24 01:09:07] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:09:07] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2024-05-24 01:09:08] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 4/362 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/362 constraints. Problems are: Problem set: 124 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 362 constraints, problems are : Problem set: 124 solved, 331 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 124 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 50/51 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/51 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 62/181 variables, 8/59 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 4/63 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-24 01:09:21] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:09:21] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/65 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-24 01:09:24] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:09:24] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:09:24] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:09:25] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 3 ms to minimize.
[2024-05-24 01:09:25] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:09:26] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 6/71 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/71 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 8 (OVERLAPS) 264/445 variables, 181/252 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 118/370 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 331/701 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-24 01:09:34] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 3 ms to minimize.
[2024-05-24 01:09:35] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2024-05-24 01:09:35] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:09:36] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 4/705 constraints. Problems are: Problem set: 124 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 705 constraints, problems are : Problem set: 124 solved, 331 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 331/455 constraints, Known Traps: 62/62 constraints]
After SMT, in 60160ms problems are : Problem set: 124 solved, 331 unsolved
Search for dead transitions found 124 dead transitions in 60165ms
Found 124 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 124 transitions
Dead transitions reduction (with SMT) removed 124 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/184 places, 335/400 transitions.
Graph (complete) has 859 edges and 181 vertex of which 119 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.3 ms
Discarding 62 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 119 /181 variables (removed 62) and now considering 335/335 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/184 places, 335/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60209 ms. Remains : 119/184 places, 335/400 transitions.
Built C files in :
/tmp/ltsmin9305966973776850789
[2024-05-24 01:09:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9305966973776850789
Running compilation step : cd /tmp/ltsmin9305966973776850789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1529 ms.
Running link step : cd /tmp/ltsmin9305966973776850789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9305966973776850789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18345410448539610213.hoa' '--buchi-type=spotba'
LTSmin run took 3577 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-15 finished in 180143 ms.
All properties solved by simple procedures.
Total runtime 984678 ms.

BK_STOP 1716512991012

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266300156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-04.tgz
mv EisenbergMcGuire-PT-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;