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.r223-tall-171649611000237.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is LamportFastMutEx-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611000237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 07:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716525542137

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 04:39:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 04:39:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:39:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 04:39:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 04:39:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 567 ms
[2024-05-24 04:39:03] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-24 04:39:03] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2024-05-24 04:39:03] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 04:39:04] [INFO ] Computed 2 invariants in 9 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 0, 0, 1, 0, 0, 6, 0, 0, 0, 0, 0, 0] Max Struct:[6, 1, 36, 6, 6, 6, 1, 36, 6, 6, 6, 6, 6, 6, 6, 6]
FORMULA LamportFastMutEx-COL-6-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-24 04:39:04] [INFO ] Invariant cache hit.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-24 04:39:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 04:39:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 04:39:04] [INFO ] Added : 4 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 10 ms.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 04:39:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:39:04] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:39:04] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:39:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 04:39:04] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 04:39:04] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:39:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 04:39:04] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 04:39:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:39:04] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 04:39:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:39:04] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:39:04] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 10 ms.
[2024-05-24 04:39:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:39:04] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 04:39:04] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:39:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:39:04] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 04:39:04] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:39:04] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:39:05] [INFO ] Added : 5 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:39:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 04:39:05] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:39:05] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:39:05] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:39:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 04:39:05] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 04:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:39:05] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:39:05] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:39:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:39:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:39:05] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 36, 6, 6, 6, 36, 6, 6, 6, 6, 6, 6, 6]
Domain [pid(7), pid(7)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 04:39:05] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 45 ms.
[2024-05-24 04:39:05] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 36, 6, 6, 6, 36, 6, 6, 6, 6, 6, 6, 6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 36, 6, 6, 6, 36, 6, 6, 6, 6, 6, 6, 6]
[2024-05-24 04:39:05] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 04:39:05] [INFO ] Computed 50 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 36, 6, 6, 6, 36, 6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 10000 steps (2 resets) in 60 ms. (163 steps per ms)
FORMULA LamportFastMutEx-COL-6-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (18 resets) in 169 ms. (529 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 30, 20, 4, 3, 5, 3, 5, 5] Max Struct:[6, 36, 36, 6, 6, 6, 6, 6, 6]
[2024-05-24 04:39:05] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 04:39:05] [INFO ] Invariant cache hit.
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:05] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-24 04:39:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 04:39:05] [INFO ] [Real]Added 72 Read/Feed constraints in 14 ms returned sat
[2024-05-24 04:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-05-24 04:39:06] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-24 04:39:06] [INFO ] [Nat]Added 72 Read/Feed constraints in 13 ms returned sat
[2024-05-24 04:39:06] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 22 ms.
[2024-05-24 04:39:06] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 12 ms to minimize.
[2024-05-24 04:39:06] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-24 04:39:06] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-24 04:39:06] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-24 04:39:07] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:07] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:39:07] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-24 04:39:07] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 4 ms to minimize.
[2024-05-24 04:39:07] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 827 ms
[2024-05-24 04:39:07] [INFO ] Added : 109 causal constraints over 23 iterations in 1327 ms. Result :sat
Minimization took 147 ms.
[2024-05-24 04:39:07] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2024-05-24 04:39:07] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-24 04:39:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-05-24 04:39:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-24 04:39:07] [INFO ] [Nat]Added 72 Read/Feed constraints in 42 ms returned sat
[2024-05-24 04:39:07] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:39:07] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 977 ms
[2024-05-24 04:39:08] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 04:39:08] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-24 04:39:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:09] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-24 04:39:09] [INFO ] [Nat]Added 72 Read/Feed constraints in 33 ms returned sat
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:39:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 314 ms
[2024-05-24 04:39:09] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 22 ms.
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:39:10] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:39:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 04:39:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 397 ms
[2024-05-24 04:39:10] [INFO ] Added : 90 causal constraints over 19 iterations in 789 ms. Result :sat
Minimization took 203 ms.
[2024-05-24 04:39:10] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:10] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-24 04:39:10] [INFO ] [Real]Added 72 Read/Feed constraints in 6 ms returned sat
[2024-05-24 04:39:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-05-24 04:39:10] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-24 04:39:10] [INFO ] [Nat]Added 72 Read/Feed constraints in 9 ms returned sat
[2024-05-24 04:39:10] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 20 ms.
[2024-05-24 04:39:10] [INFO ] Added : 74 causal constraints over 16 iterations in 327 ms. Result :sat
Minimization took 110 ms.
[2024-05-24 04:39:11] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 04:39:11] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-24 04:39:11] [INFO ] [Real]Added 72 Read/Feed constraints in 6 ms returned sat
[2024-05-24 04:39:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 04:39:11] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-24 04:39:11] [INFO ] [Nat]Added 72 Read/Feed constraints in 8 ms returned sat
[2024-05-24 04:39:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:39:11] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:11] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-24 04:39:11] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:11] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 4 ms to minimize.
[2024-05-24 04:39:11] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 471 ms
[2024-05-24 04:39:11] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 30 ms.
[2024-05-24 04:39:12] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:39:12] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:39:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2024-05-24 04:39:12] [INFO ] Added : 42 causal constraints over 10 iterations in 399 ms. Result :sat
Minimization took 103 ms.
[2024-05-24 04:39:12] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-05-24 04:39:12] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-24 04:39:12] [INFO ] [Real]Added 72 Read/Feed constraints in 9 ms returned sat
[2024-05-24 04:39:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 04:39:12] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-24 04:39:12] [INFO ] [Nat]Added 72 Read/Feed constraints in 19 ms returned sat
[2024-05-24 04:39:12] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:39:12] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:39:12] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:39:12] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:39:12] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:39:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:39:12] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 885 ms
[2024-05-24 04:39:13] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 04:39:13] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-24 04:39:13] [INFO ] [Real]Added 72 Read/Feed constraints in 7 ms returned sat
[2024-05-24 04:39:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 04:39:13] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-24 04:39:13] [INFO ] [Nat]Added 72 Read/Feed constraints in 17 ms returned sat
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 10 ms to minimize.
[2024-05-24 04:39:13] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:39:14] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:39:14] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:39:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 454 ms
[2024-05-24 04:39:14] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 17 ms.
[2024-05-24 04:39:14] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:39:14] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:14] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:39:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:39:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 275 ms
[2024-05-24 04:39:14] [INFO ] Added : 123 causal constraints over 26 iterations in 791 ms. Result :sat
Minimization took 117 ms.
[2024-05-24 04:39:15] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 04:39:15] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-24 04:39:15] [INFO ] [Real]Added 72 Read/Feed constraints in 7 ms returned sat
[2024-05-24 04:39:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:15] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-24 04:39:15] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 758 ms
[2024-05-24 04:39:16] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:16] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-24 04:39:16] [INFO ] [Real]Added 72 Read/Feed constraints in 8 ms returned sat
[2024-05-24 04:39:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:16] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-24 04:39:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 19 ms returned sat
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:39:17] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:17] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 6 ms to minimize.
[2024-05-24 04:39:17] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:39:17] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-24 04:39:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1053 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1, 30, 20, 4, 3, 5, 3, 5, 5] Max Struct:[6, 30, 36, 6, 6, 5, 6, 5, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-02 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 24, 5, 4, 3] Max Struct:[6, 36, 6, 6, 6]
Support contains 60 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 22 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 176/176 places, 354/354 transitions.
[2024-05-24 04:39:17] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 04:39:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 24, 5, 4, 3] Max Struct:[6, 36, 6, 6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2456 ms. (407 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 3931 ms. (1271 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 30, 5, 5, 5] Max Struct:[6, 36, 6, 6, 6]
[2024-05-24 04:39:24] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 04:39:24] [INFO ] Invariant cache hit.
[2024-05-24 04:39:24] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:24] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-24 04:39:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 04:39:24] [INFO ] [Real]Added 72 Read/Feed constraints in 5 ms returned sat
[2024-05-24 04:39:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:24] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-24 04:39:24] [INFO ] [Nat]Added 72 Read/Feed constraints in 12 ms returned sat
[2024-05-24 04:39:24] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 21 ms.
[2024-05-24 04:39:25] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:39:25] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:39:25] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:25] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:25] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:39:25] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:39:25] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-24 04:39:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 04:39:25] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 720 ms
[2024-05-24 04:39:25] [INFO ] Added : 109 causal constraints over 23 iterations in 1159 ms. Result :sat
Minimization took 140 ms.
[2024-05-24 04:39:25] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-05-24 04:39:26] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-24 04:39:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-05-24 04:39:26] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-24 04:39:26] [INFO ] [Nat]Added 72 Read/Feed constraints in 54 ms returned sat
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:39:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1191 ms
[2024-05-24 04:39:27] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 04:39:27] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-24 04:39:27] [INFO ] [Real]Added 72 Read/Feed constraints in 5 ms returned sat
[2024-05-24 04:39:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:27] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-24 04:39:27] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2024-05-24 04:39:27] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 18 ms.
[2024-05-24 04:39:27] [INFO ] Added : 76 causal constraints over 16 iterations in 308 ms. Result :sat
Minimization took 81 ms.
[2024-05-24 04:39:28] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 04:39:28] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-24 04:39:28] [INFO ] [Real]Added 72 Read/Feed constraints in 7 ms returned sat
[2024-05-24 04:39:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:28] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-24 04:39:28] [INFO ] [Nat]Added 72 Read/Feed constraints in 12 ms returned sat
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 848 ms
[2024-05-24 04:39:29] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:29] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-24 04:39:29] [INFO ] [Real]Added 72 Read/Feed constraints in 13 ms returned sat
[2024-05-24 04:39:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 04:39:29] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-24 04:39:29] [INFO ] [Nat]Added 72 Read/Feed constraints in 18 ms returned sat
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 856 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1, 30, 5, 5, 5] Max Struct:[6, 30, 6, 5, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-07 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 170 transition count 342
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 164 transition count 342
Applied a total of 24 rules in 57 ms. Remains 164 /176 variables (removed 12) and now considering 342/354 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 164/176 places, 342/354 transitions.
[2024-05-24 04:39:30] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2024-05-24 04:39:30] [INFO ] Computed 50 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1865 ms. (535 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 616 ms. (1620 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-24 04:39:32] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 04:39:32] [INFO ] Invariant cache hit.
[2024-05-24 04:39:32] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-24 04:39:33] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-24 04:39:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 04:39:33] [INFO ] [Real]Added 72 Read/Feed constraints in 6 ms returned sat
[2024-05-24 04:39:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2024-05-24 04:39:33] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-24 04:39:33] [INFO ] [Nat]Added 72 Read/Feed constraints in 10 ms returned sat
[2024-05-24 04:39:33] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-24 04:39:33] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 25 ms.
[2024-05-24 04:39:33] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:33] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-05-24 04:39:33] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2024-05-24 04:39:33] [INFO ] Added : 78 causal constraints over 17 iterations in 616 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 25 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-05-24 04:39:34] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 04:39:34] [INFO ] Invariant cache hit.
[2024-05-24 04:39:34] [INFO ] Implicit Places using invariants in 149 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 152 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 170 ms. Remains : 158/164 places, 342/342 transitions.
[2024-05-24 04:39:34] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2024-05-24 04:39:34] [INFO ] Computed 44 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1741 ms. (574 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 598 ms. (1669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-24 04:39:36] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 04:39:36] [INFO ] Invariant cache hit.
[2024-05-24 04:39:36] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 04:39:36] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-24 04:39:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 04:39:36] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-24 04:39:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:39:36] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 04:39:36] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-24 04:39:36] [INFO ] [Nat]Added 36 Read/Feed constraints in 12 ms returned sat
[2024-05-24 04:39:36] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:39:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-24 04:39:36] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 16 ms.
[2024-05-24 04:39:37] [INFO ] Added : 64 causal constraints over 13 iterations in 232 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-05-24 04:39:37] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 04:39:37] [INFO ] Invariant cache hit.
[2024-05-24 04:39:37] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-24 04:39:37] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 04:39:37] [INFO ] Invariant cache hit.
[2024-05-24 04:39:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 04:39:37] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-24 04:39:37] [INFO ] Redundant transitions in 19 ms returned []
Running 336 sub problems to find dead transitions.
[2024-05-24 04:39:37] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 04:39:37] [INFO ] Invariant cache hit.
[2024-05-24 04:39:37] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 20/64 constraints. Problems are: Problem set: 4 solved, 332 unsolved
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/84 constraints. Problems are: Problem set: 14 solved, 322 unsolved
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:43] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:43] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:43] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:43] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:39:43] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:43] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:43] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/104 constraints. Problems are: Problem set: 17 solved, 319 unsolved
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:39:44] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-24 04:39:45] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/124 constraints. Problems are: Problem set: 30 solved, 306 unsolved
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 3 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD90 is UNSAT
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD288 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/144 constraints. Problems are: Problem set: 34 solved, 302 unsolved
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-24 04:39:48] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 5 ms to minimize.
[2024-05-24 04:39:49] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-24 04:39:49] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:39:49] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:39:49] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
Problem TDEAD290 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/164 constraints. Problems are: Problem set: 35 solved, 301 unsolved
[2024-05-24 04:39:50] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-24 04:39:50] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2024-05-24 04:39:50] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:39:50] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:50] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:50] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/184 constraints. Problems are: Problem set: 35 solved, 301 unsolved
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/204 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2024-05-24 04:39:54] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:39:54] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-24 04:39:54] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:39:54] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:39:54] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:54] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:54] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:39:55] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:39:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:55] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:39:55] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:39:55] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:39:55] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-24 04:39:55] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:39:55] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:39:56] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:39:56] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:39:56] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:56] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:56] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 20/224 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2024-05-24 04:39:57] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:57] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:57] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:57] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:39:58] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:39:59] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:39:59] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:39:59] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:39:59] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:39:59] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:39:59] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/244 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2024-05-24 04:40:00] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:00] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:40:00] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:00] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:00] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:40:00] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:00] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:01] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:40:01] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:01] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:01] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:01] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:40:01] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:01] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:01] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:02] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 5 ms to minimize.
[2024-05-24 04:40:02] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:02] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:02] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:02] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/264 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2024-05-24 04:40:02] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:03] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:04] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:04] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:04] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:04] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:04] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:04] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:04] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:04] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 20/284 constraints. Problems are: Problem set: 36 solved, 300 unsolved
[2024-05-24 04:40:06] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-24 04:40:06] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:40:06] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:40:06] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:40:06] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:40:08] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:08] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 36 solved, 300 unsolved
Search for dead transitions found 36 dead transitions in 30230ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/158 places, 306/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-05-24 04:40:08] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30686 ms. Remains : 158/158 places, 306/342 transitions.
[2024-05-24 04:40:08] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
// Phase 1: matrix 228 rows 158 cols
[2024-05-24 04:40:08] [INFO ] Computed 44 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1699 ms. (588 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 589 ms. (1694 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-24 04:40:10] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:40:10] [INFO ] Invariant cache hit.
[2024-05-24 04:40:10] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 04:40:10] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-24 04:40:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 04:40:10] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-24 04:40:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:40:10] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2024-05-24 04:40:10] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-24 04:40:10] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2024-05-24 04:40:10] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:10] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-24 04:40:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-24 04:40:10] [INFO ] Computed and/alt/rep : 192/978/192 causal constraints (skipped 30 transitions) in 13 ms.
[2024-05-24 04:40:10] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-24 04:40:11] [INFO ] Added : 63 causal constraints over 13 iterations in 308 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-05-24 04:40:11] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:40:11] [INFO ] Invariant cache hit.
[2024-05-24 04:40:11] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-24 04:40:11] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:40:11] [INFO ] Invariant cache hit.
[2024-05-24 04:40:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 04:40:11] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-24 04:40:11] [INFO ] Redundant transitions in 3 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-24 04:40:11] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:40:11] [INFO ] Invariant cache hit.
[2024-05-24 04:40:11] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 6/158 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:14] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:15] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:40:15] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:15] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:15] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:15] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:15] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:15] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:15] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:15] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:20] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-24 04:40:20] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:40:20] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:21] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:22] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:40:23] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:40:23] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:23] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:40:23] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:23] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2024-05-24 04:40:23] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:40:23] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:23] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:23] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 3 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:40:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:25] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2024-05-24 04:40:25] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:25] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:25] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:40:25] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:26] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:27] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:27] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:28] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:40:28] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:40:28] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:40:28] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:40:28] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:40:29] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2024-05-24 04:40:29] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:40:29] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:29] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:29] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:29] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:29] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2024-05-24 04:40:29] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:29] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 04:40:31] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:31] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:31] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2024-05-24 04:40:31] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:31] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:40:31] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:31] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:40:31] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:33] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:33] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:33] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:33] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:33] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:33] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:40:35] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:35] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:40:35] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 0 ms to minimize.
[2024-05-24 04:40:35] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:36] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:37] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:37] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-24 04:40:37] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:37] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2024-05-24 04:40:37] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:37] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:40:37] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:39] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:39] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:39] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:39] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:40:39] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:41] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2024-05-24 04:40:41] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2024-05-24 04:40:41] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:40:41] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2024-05-24 04:40:41] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:41] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:41] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
SMT process timed out in 30182ms, After SMT, problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 30186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30570 ms. Remains : 158/158 places, 306/306 transitions.
RANDOM walk for 40000 steps (8 resets) in 823 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 758058 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 2
Probabilistic random walk after 758058 steps, saw 266615 distinct states, run finished after 3004 ms. (steps per millisecond=252 ) properties seen :0
[2024-05-24 04:40:45] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:40:45] [INFO ] Invariant cache hit.
[2024-05-24 04:40:45] [INFO ] State equation strengthened by 30 read => feed constraints.
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) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 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) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:40:45] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:40:45] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:40:45] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:40:45] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 15/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:47] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:40:48] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/386 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3492 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 41/41 constraints]
After SMT, in 3666ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 220 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 158/158 places, 306/306 transitions.
RANDOM walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 801149 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 2
Probabilistic random walk after 801149 steps, saw 278792 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-05-24 04:40:52] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:40:52] [INFO ] Invariant cache hit.
[2024-05-24 04:40:52] [INFO ] State equation strengthened by 30 read => feed constraints.
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) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 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) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:40:52] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:40:52] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:52] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:52] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:52] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:52] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 15/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:40:53] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/386 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3235 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 41/41 constraints]
After SMT, in 3399ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 218 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-05-24 04:40:55] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:40:55] [INFO ] Invariant cache hit.
[2024-05-24 04:40:55] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-24 04:40:55] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:40:55] [INFO ] Invariant cache hit.
[2024-05-24 04:40:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 04:40:56] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-24 04:40:56] [INFO ] Redundant transitions in 3 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-24 04:40:56] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:40:56] [INFO ] Invariant cache hit.
[2024-05-24 04:40:56] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 6/158 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:40:58] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-24 04:40:59] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:40:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:40:59] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:00] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:41:01] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:41:03] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:05] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:05] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:41:05] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:41:05] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:06] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:07] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:07] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:07] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:41:07] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:07] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:41:07] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:07] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:07] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:08] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:09] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:41:09] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-05-24 04:41:09] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:41:09] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:09] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:09] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:10] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:41:10] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-24 04:41:10] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-24 04:41:10] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:41:10] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:10] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:10] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:10] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:10] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 3 ms to minimize.
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:12] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:12] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:13] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:41:13] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:41:13] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-24 04:41:13] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:13] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:13] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:14] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:15] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-24 04:41:15] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:41:16] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:17] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:17] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:17] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:17] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:17] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:17] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:17] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-24 04:41:18] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:18] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:18] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:41:18] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:18] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:18] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:18] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:19] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:19] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:19] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:41:19] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2024-05-24 04:41:19] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:19] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:41:19] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:19] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:20] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:21] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:21] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:41:22] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:41:23] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:23] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:41:23] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:41:23] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:41:23] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:23] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:23] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:23] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:23] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:41:24] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:24] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:24] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:24] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:24] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:25] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 30189ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30552 ms. Remains : 158/158 places, 306/306 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 158 transition count 228
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 78 place count 158 transition count 192
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 180 place count 92 transition count 192
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 192 place count 86 transition count 186
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 204 place count 80 transition count 216
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 80 transition count 210
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 216 place count 74 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 74 transition count 210
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 74 transition count 210
Applied a total of 228 rules in 44 ms. Remains 74 /158 variables (removed 84) and now considering 210/306 (removed 96) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 210 rows 74 cols
[2024-05-24 04:41:26] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 04:41:26] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 04:41:26] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:41:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 1 ms returned sat
[2024-05-24 04:41:26] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:41:26] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:41:26] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 247 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[6]
Starting property specific reduction for LamportFastMutEx-COL-6-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-24 04:41:26] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
// Phase 1: matrix 228 rows 158 cols
[2024-05-24 04:41:26] [INFO ] Computed 44 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-24 04:41:26] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:41:26] [INFO ] Invariant cache hit.
[2024-05-24 04:41:26] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 04:41:26] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-24 04:41:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 04:41:26] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-24 04:41:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:41:26] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2024-05-24 04:41:26] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-24 04:41:26] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:41:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2024-05-24 04:41:27] [INFO ] Computed and/alt/rep : 192/978/192 causal constraints (skipped 30 transitions) in 14 ms.
[2024-05-24 04:41:27] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:41:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-24 04:41:27] [INFO ] Added : 63 causal constraints over 13 iterations in 323 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 14 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 158/158 places, 306/306 transitions.
[2024-05-24 04:41:27] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:41:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1853 ms. (539 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 634 ms. (1574 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-24 04:41:30] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:41:30] [INFO ] Invariant cache hit.
[2024-05-24 04:41:30] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 04:41:30] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-24 04:41:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 04:41:30] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-24 04:41:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:41:30] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 04:41:30] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-24 04:41:30] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2024-05-24 04:41:30] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:30] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:41:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2024-05-24 04:41:30] [INFO ] Computed and/alt/rep : 192/978/192 causal constraints (skipped 30 transitions) in 15 ms.
[2024-05-24 04:41:30] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:41:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-05-24 04:41:30] [INFO ] Added : 63 causal constraints over 13 iterations in 329 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-05-24 04:41:30] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:41:30] [INFO ] Invariant cache hit.
[2024-05-24 04:41:31] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-24 04:41:31] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:41:31] [INFO ] Invariant cache hit.
[2024-05-24 04:41:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 04:41:31] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-24 04:41:31] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-24 04:41:31] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:41:31] [INFO ] Invariant cache hit.
[2024-05-24 04:41:31] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 6/158 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:41:34] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-24 04:41:34] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:34] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-24 04:41:34] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2024-05-24 04:41:36] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:37] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:40] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2024-05-24 04:41:40] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:41:40] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 04:41:42] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:42] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:42] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:42] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:42] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:42] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:42] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:42] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:42] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:43] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:41:44] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:41:44] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-24 04:41:44] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:44] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:41:44] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:45] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:46] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:46] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:46] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:46] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:46] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:46] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:46] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:46] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:47] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:47] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:41:47] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:48] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-24 04:41:48] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:48] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:48] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2024-05-24 04:41:48] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:48] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:48] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:49] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 04:41:50] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-24 04:41:50] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2024-05-24 04:41:50] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:52] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:52] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:52] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:52] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:52] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:52] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:41:52] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:53] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:41:53] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:41:53] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:53] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:53] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:53] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:55] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:56] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:41:56] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:41:57] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:41:59] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:59] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:41:59] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:41:59] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2024-05-24 04:41:59] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:01] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:01] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:01] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
SMT process timed out in 30206ms, After SMT, problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 30209ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30571 ms. Remains : 158/158 places, 306/306 transitions.
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 765223 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 2
Probabilistic random walk after 765223 steps, saw 268531 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
[2024-05-24 04:42:04] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:42:04] [INFO ] Invariant cache hit.
[2024-05-24 04:42:04] [INFO ] State equation strengthened by 30 read => feed constraints.
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) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 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) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:42:04] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 15/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:07] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:42:08] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/386 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3410 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 41/41 constraints]
After SMT, in 3561ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 224 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 11 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 158/158 places, 306/306 transitions.
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 800336 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 2
Probabilistic random walk after 800336 steps, saw 278603 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-05-24 04:42:11] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:42:11] [INFO ] Invariant cache hit.
[2024-05-24 04:42:11] [INFO ] State equation strengthened by 30 read => feed constraints.
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) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 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) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:42:11] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:11] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:11] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 15/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:12] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:42:13] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/386 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3189 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 41/41 constraints]
After SMT, in 3343ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 219 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-05-24 04:42:14] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:42:14] [INFO ] Invariant cache hit.
[2024-05-24 04:42:15] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-24 04:42:15] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:42:15] [INFO ] Invariant cache hit.
[2024-05-24 04:42:15] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 04:42:15] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-24 04:42:15] [INFO ] Redundant transitions in 1 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-24 04:42:15] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2024-05-24 04:42:15] [INFO ] Invariant cache hit.
[2024-05-24 04:42:15] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 6/158 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-24 04:42:18] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:18] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:42:18] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:20] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:21] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:22] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:22] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:22] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:22] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:22] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:22] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:22] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:42:22] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:24] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:24] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:26] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:26] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-24 04:42:26] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:26] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:26] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:26] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:26] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:26] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:28] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-24 04:42:28] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:28] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:28] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:42:28] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:42:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:42:28] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:29] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:42:29] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:29] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:29] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:29] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-24 04:42:29] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:42:29] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:30] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:37] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-24 04:42:37] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:37] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:37] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:39] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:40] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:42:40] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:41] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:41] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:41] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:41] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:42:41] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:41] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:41] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:42:42] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:43] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:43] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:43] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:43] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:42:43] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:42:43] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:42:45] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:45] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:42:45] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/386 variables, and 284 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 0/158 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 240/240 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 144/152 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 6/158 variables, 36/188 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 96/284 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:47] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:48] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:49] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:49] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:49] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:49] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:49] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:49] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-24 04:42:49] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-05-24 04:42:49] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2024-05-24 04:42:49] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:50] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:50] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:50] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:42:51] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-24 04:42:52] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:42:52] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:52] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:52] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:52] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2024-05-24 04:42:52] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:52] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:52] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:53] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2024-05-24 04:42:53] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:53] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:53] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:42:53] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2024-05-24 04:42:53] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:53] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:42:53] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:54] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:42:54] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:54] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:54] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:54] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:54] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:54] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-05-24 04:42:54] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:42:55] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-24 04:42:55] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:55] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:56] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:56] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:56] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:56] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:57] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:57] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:57] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:57] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:42:57] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:57] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:42:57] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:57] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:42:58] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-24 04:42:58] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:42:58] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:42:58] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:58] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:42:58] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:42:58] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:42:58] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:42:59] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:42:59] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:42:59] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:59] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:42:59] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:43:01] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:43:01] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:43:01] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:43:01] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:43:01] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:43:01] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:01] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:43:01] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:43:04] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:43:06] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:43:06] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:43:06] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:43:06] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:43:06] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:43:06] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:43:06] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:43:08] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:43:08] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:08] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:43:08] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:43:08] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:43:08] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:43:08] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2024-05-24 04:43:08] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:43:09] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:43:09] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:43:09] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:43:09] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:43:09] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:43:09] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:43:09] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:43:10] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:43:10] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:43:10] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:43:10] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:43:10] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:43:10] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:43:11] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:43:11] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:43:11] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/386 variables, and 472 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 0/158 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/300 constraints, Known Traps: 428/428 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60528 ms. Remains : 158/158 places, 306/306 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 158 transition count 228
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 78 place count 158 transition count 192
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 180 place count 92 transition count 192
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 192 place count 86 transition count 186
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 204 place count 80 transition count 216
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 80 transition count 210
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 216 place count 74 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 74 transition count 210
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 74 transition count 210
Applied a total of 228 rules in 25 ms. Remains 74 /158 variables (removed 84) and now considering 210/306 (removed 96) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 210 rows 74 cols
[2024-05-24 04:43:15] [INFO ] Computed 14 invariants in 3 ms
[2024-05-24 04:43:15] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 04:43:15] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:43:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 04:43:15] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:43:15] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:43:15] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 248 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[6]
Ending property specific reduction for LamportFastMutEx-COL-6-UpperBounds-00 in 109111 ms.
[2024-05-24 04:43:15] [INFO ] Flatten gal took : 54 ms
[2024-05-24 04:43:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-24 04:43:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 306 transitions and 1464 arcs took 4 ms.
Total runtime 252639 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-COL-6

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 158
TRANSITIONS: 306
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 6058
MODEL NAME: /home/mcc/execution/414/model
158 places, 306 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA LamportFastMutEx-COL-6-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716526006127

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is LamportFastMutEx-COL-6, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649611000237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;