Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r154-tall-174876825600394.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is Peterson-PT-6, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825600394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 180K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 726K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 403K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 69K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 222K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 86K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 285K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 378K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 632K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.9M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 877K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748845768145

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 06:29:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 06:29:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:29:29] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2025-06-02 06:29:29] [INFO ] Transformed 1330 places.
[2025-06-02 06:29:29] [INFO ] Transformed 2030 transitions.
[2025-06-02 06:29:29] [INFO ] Found NUPN structural information;
[2025-06-02 06:29:29] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 249 ms.
Built sparse matrix representations for Structural reductions in 11 ms.23733KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 112 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 123 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 50 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-02 06:29:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-02 06:29:30] [INFO ] Computed 27 invariants in 32 ms
[2025-06-02 06:29:30] [INFO ] Implicit Places using invariants in 550 ms returned []
[2025-06-02 06:29:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-02 06:29:30] [INFO ] Invariant cache hit.
[2025-06-02 06:29:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 06:29:31] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2025-06-02 06:29:31] [INFO ] Redundant transitions in 84 ms returned []
Running 2023 sub problems to find dead transitions.
[2025-06-02 06:29:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-02 06:29:31] [INFO ] Invariant cache hit.
[2025-06-02 06:29:31] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30829ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30883ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 32625 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2433 ms (no deadlock found). (steps per millisecond=513 )
Random directed walk for 1250004 steps, including 0 resets, run took 3081 ms (no deadlock found). (steps per millisecond=405 )
[2025-06-02 06:30:08] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-02 06:30:08] [INFO ] Invariant cache hit.
[2025-06-02 06:30:08] [INFO ] [Real]Absence check using 20 positive place invariants in 56 ms returned sat
[2025-06-02 06:30:08] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 44 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 2 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 92 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2025-06-02 06:30:08] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2025-06-02 06:30:08] [INFO ] Computed 27 invariants in 4 ms
[2025-06-02 06:30:09] [INFO ] Implicit Places using invariants in 300 ms returned [387, 388, 390, 398, 399, 400, 401]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 306 ms to find 7 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 399/1330 places, 1106/2030 transitions.
Applied a total of 0 rules in 10 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 408 ms. Remains : 399/1330 places, 1106/2030 transitions.
Discarding 7 transitions out of 1106. Remains 1099
RANDOM walk for 40000 steps (8 resets) in 4416 ms. (9 steps per ms) remains 440/1099 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 440/440 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 440/440 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 440/440 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 440/440 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 440/440 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 440/440 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 440/440 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 439/440 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 439/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 438/439 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 438/438 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 438/438 properties
[2025-06-02 06:30:10] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2025-06-02 06:30:10] [INFO ] Computed 20 invariants in 7 ms
[2025-06-02 06:30:10] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 309/309 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 9/318 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 90/399 variables, 11/329 constraints. Problems are: Problem set: 0 solved, 438 unsolved
SMT process timed out in 5142ms, After SMT, problems are : Problem set: 0 solved, 438 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 309 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 18 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 4000000 steps (8 resets) in 94995 ms. (42 steps per ms) remains 407/438 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 407/407 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 407/407 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 405/407 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 402/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 401/402 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 401/401 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 399/401 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 395/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 394/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 390/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 389/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 387/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 386/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 385/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 384/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 384/384 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 384/384 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 384/384 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 384/384 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 384/384 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 382/384 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 382/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 381/382 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 381/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 379/381 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 378/379 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 378/378 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 372/378 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 372/372 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 372/372 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 372/372 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 372/372 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 372/372 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 372/372 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 372/372 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 372/372 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 371/372 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 371/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 368/371 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 367/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 367/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 365/367 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 365/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/365 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 364/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 364/364 properties
[2025-06-02 06:30:47] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:30:47] [INFO ] Invariant cache hit.
[2025-06-02 06:30:47] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 130/398 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 130/417 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:30:53] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 21 ms to minimize.
[2025-06-02 06:30:53] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 3 ms to minimize.
[2025-06-02 06:30:53] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2025-06-02 06:30:53] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:30:54] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:30:54] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2025-06-02 06:30:54] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:30:54] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 3 ms to minimize.
[2025-06-02 06:30:54] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:30:54] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:30:55] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:30:55] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:30:55] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2025-06-02 06:30:55] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:30:55] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:30:55] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:30:55] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:30:55] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:30:56] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:30:56] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:30:56] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:30:56] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:30:56] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:30:56] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:30:57] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:30:57] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:30:57] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:30:57] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:30:57] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:30:57] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:30:57] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:30:58] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2025-06-02 06:30:58] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:30:58] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2025-06-02 06:30:58] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 11 ms to minimize.
[2025-06-02 06:30:58] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:30:58] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:30:59] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:30:59] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:30:59] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:01] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:31:01] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:31:02] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:31:02] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2025-06-02 06:31:02] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:31:02] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:31:02] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:31:02] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:31:02] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:31:03] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:31:03] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:31:03] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:31:03] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 5 ms to minimize.
[2025-06-02 06:31:03] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:31:03] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:31:03] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:31:04] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 8 ms to minimize.
[2025-06-02 06:31:04] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:31:04] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:31:04] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:05] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:31:05] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:31:05] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:31:05] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2025-06-02 06:31:05] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:31:05] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:31:05] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:31:06] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:31:06] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:31:06] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:31:06] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:31:06] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:31:06] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:31:06] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:31:06] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:31:07] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:31:07] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:31:07] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:31:07] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:31:07] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:08] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 3 ms to minimize.
[2025-06-02 06:31:08] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:31:08] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:31:08] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:31:08] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:31:08] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:31:08] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 3 ms to minimize.
[2025-06-02 06:31:09] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:31:09] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:31:09] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:31:09] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:31:09] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:31:09] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:31:09] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:31:10] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:31:10] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:31:10] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:31:10] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:31:10] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:31:10] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:13] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:31:13] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:31:13] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:31:13] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:31:13] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:31:14] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:31:14] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:31:14] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:31:14] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:31:14] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:31:14] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:31:14] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:31:15] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:31:15] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:31:15] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:31:15] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:31:15] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:31:15] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:31:15] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:31:15] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:16] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:31:16] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:31:16] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:31:16] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 1 ms to minimize.
[2025-06-02 06:31:16] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:31:16] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:31:17] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:31:17] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:31:17] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:31:17] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:31:17] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:31:17] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:31:17] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:31:17] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:31:18] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:31:18] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 3 ms to minimize.
[2025-06-02 06:31:18] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2025-06-02 06:31:18] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:31:18] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:31:18] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:19] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:31:19] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:31:20] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 3 ms to minimize.
[2025-06-02 06:31:20] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:31:20] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:31:20] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2025-06-02 06:31:20] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:31:20] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:31:20] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:31:20] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:31:21] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:31:21] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:31:21] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:31:21] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2025-06-02 06:31:21] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:31:21] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:31:21] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:31:21] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:31:22] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:31:22] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:28] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:31:28] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:31:28] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:31:28] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:31:29] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:31:29] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:31:29] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:31:29] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:31:29] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:31:29] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2025-06-02 06:31:29] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2025-06-02 06:31:29] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:31:30] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:31:30] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:31:30] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:31:30] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:31:30] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:31:30] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:31:30] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:31:31] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1295 variables, and 597 constraints, problems are : Problem set: 0 solved, 364 unsolved in 45024 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 130/398 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 130/417 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 180/597 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:36] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:31:36] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:31:36] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:31:36] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:31:37] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:31:37] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:31:37] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:31:37] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:31:37] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:31:37] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:31:37] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:31:38] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:31:38] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:31:38] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:31:38] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:31:38] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:31:38] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:31:38] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:31:38] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:31:39] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/617 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:42] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:31:43] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:31:43] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2025-06-02 06:31:43] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:31:43] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:31:44] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2025-06-02 06:31:44] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2025-06-02 06:31:44] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:31:44] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2025-06-02 06:31:44] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:31:44] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:31:44] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2025-06-02 06:31:44] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2025-06-02 06:31:44] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:31:45] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2025-06-02 06:31:45] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:31:45] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:31:45] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:31:45] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:31:45] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/637 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:31:51] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:31:51] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2025-06-02 06:31:51] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:31:52] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:31:52] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:31:52] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:31:52] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:31:52] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:31:52] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:31:52] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:31:52] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:31:52] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:31:53] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:31:53] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:31:53] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 1 ms to minimize.
[2025-06-02 06:31:53] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:31:53] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:31:54] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:31:54] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:31:54] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/657 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:32:00] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:32:00] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:32:00] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:32:00] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:32:00] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:32:01] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:32:01] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:32:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:32:01] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:32:01] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:32:02] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:32:02] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:32:02] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:32:02] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:32:02] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:32:02] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:32:03] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:32:03] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:32:03] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:32:03] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/677 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-06-02 06:32:10] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:32:11] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 3 ms to minimize.
[2025-06-02 06:32:11] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:32:11] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 3 ms to minimize.
[2025-06-02 06:32:11] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:32:11] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:32:11] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:32:12] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:32:12] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:32:12] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:32:13] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 1 ms to minimize.
[2025-06-02 06:32:13] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:32:13] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:32:13] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2025-06-02 06:32:13] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:32:13] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:32:14] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
[2025-06-02 06:32:14] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:32:14] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:32:14] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/697 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/1295 variables, and 697 constraints, problems are : Problem set: 0 solved, 364 unsolved in 45011 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/364 constraints, Known Traps: 280/280 constraints]
After SMT, in 90122ms problems are : Problem set: 0 solved, 364 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 268 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 20 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 4000000 steps (8 resets) in 96468 ms. (41 steps per ms) remains 363/364 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 363/363 properties
Probabilistic random walk after 10000000 steps, saw 1257049 distinct states, run finished after 74607 ms. (steps per millisecond=134 ) properties seen :0
[2025-06-02 06:34:05] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:34:05] [INFO ] Invariant cache hit.
[2025-06-02 06:34:05] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 130/398 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 130/417 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:10] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:34:11] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
[2025-06-02 06:34:11] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:34:11] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2025-06-02 06:34:11] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:34:11] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:34:11] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:34:11] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:34:12] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:34:12] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:34:12] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:34:12] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 3 ms to minimize.
[2025-06-02 06:34:12] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:34:12] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:34:12] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:34:13] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:34:13] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:34:13] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:34:13] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:34:13] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:13] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:34:13] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:14] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:34:14] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:34:14] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:34:14] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:34:14] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:34:14] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2025-06-02 06:34:14] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:34:14] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:34:15] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:34:15] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:34:15] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:34:15] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2025-06-02 06:34:15] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:15] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:34:15] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:34:16] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:34:16] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:34:16] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:18] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:34:18] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:34:18] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:34:18] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:34:19] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:34:19] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:34:19] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2025-06-02 06:34:19] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:34:19] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:34:19] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:34:19] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:20] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:34:20] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:34:20] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:34:20] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:34:20] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:34:20] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2025-06-02 06:34:20] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:34:21] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:34:21] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:21] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:34:21] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:34:22] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:34:22] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
[2025-06-02 06:34:22] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:34:22] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:34:22] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:34:22] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:34:22] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:34:22] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:34:23] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:34:23] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:34:23] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:34:23] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:34:23] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:34:23] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:34:23] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:23] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:34:24] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:34:24] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:24] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:34:24] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 3 ms to minimize.
[2025-06-02 06:34:24] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 6 ms to minimize.
[2025-06-02 06:34:25] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:25] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:34:25] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2025-06-02 06:34:25] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:34:25] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:34:25] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:34:25] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:34:25] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:34:26] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:34:26] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:34:26] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:34:26] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:34:26] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:34:26] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:34:26] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:34:26] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 3 ms to minimize.
[2025-06-02 06:34:27] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:29] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:34:29] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:34:30] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:34:30] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:34:30] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:34:30] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:34:30] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:34:30] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:34:30] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:34:31] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2025-06-02 06:34:31] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:34:31] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:34:31] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:34:31] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:34:31] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:34:31] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:34:31] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:34:31] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:34:32] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:32] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:33] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:34:33] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:34:33] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:34:33] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:34:33] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:34:33] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:34:33] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:34:34] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:34:34] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:34:34] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:34:34] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:34:34] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2025-06-02 06:34:34] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:34:34] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:34:35] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:34:35] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2025-06-02 06:34:35] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:34:35] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2025-06-02 06:34:35] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:34:35] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:36] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:34:37] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:34:37] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:37] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:34:37] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:34:37] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:34:37] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:34:37] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:34:38] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:34:38] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:34:38] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:34:38] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:34:38] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:34:38] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:34:38] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:34:39] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:34:39] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:34:39] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:34:39] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:34:39] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:44] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:44] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:34:44] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:34:44] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:34:45] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:34:45] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:34:45] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:34:45] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:34:45] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:34:45] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:34:45] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:46] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:34:46] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:34:46] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:34:46] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:34:46] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:34:46] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:34:46] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:34:47] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:34:47] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:50] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:34:50] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:34:50] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:34:50] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:34:50] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:34:50] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:34:51] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:34:51] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:34:51] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:34:51] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:34:51] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:34:51] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:34:51] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:34:52] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:34:52] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:34:52] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2025-06-02 06:34:52] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:34:52] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:34:52] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2025-06-02 06:34:52] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 20/617 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:34:56] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:34:57] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:34:57] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:34:57] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:34:57] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:34:57] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:34:57] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:34:58] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2025-06-02 06:34:58] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:34:58] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:34:58] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:34:58] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:34:58] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:34:59] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 4 ms to minimize.
[2025-06-02 06:34:59] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:34:59] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:34:59] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:34:59] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:34:59] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:34:59] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 20/637 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:35:10] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:35:10] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:35:10] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:35:10] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2025-06-02 06:35:10] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2025-06-02 06:35:10] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:35:10] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:35:11] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:35:11] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:35:11] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:35:11] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 1 ms to minimize.
[2025-06-02 06:35:11] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 3 ms to minimize.
[2025-06-02 06:35:11] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 3 ms to minimize.
[2025-06-02 06:35:12] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:35:12] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:35:12] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:35:12] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:35:12] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:35:12] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:35:12] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/398 variables, 20/657 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:35:19] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:35:19] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:35:19] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:35:19] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:35:20] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:35:20] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1295 variables, and 663 constraints, problems are : Problem set: 0 solved, 363 unsolved in 75031 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 246/246 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 130/398 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 130/417 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 246/663 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:35:30] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:35:30] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:35:31] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:35:31] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:35:31] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:35:32] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:35:32] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:35:32] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:35:32] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:35:32] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:35:32] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:35:32] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:35:32] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:35:32] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:35:33] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:35:33] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:35:33] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:35:33] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:35:33] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:35:33] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/683 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:35:43] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:35:43] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:35:43] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:35:43] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:35:43] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:35:43] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:35:43] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:35:44] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2025-06-02 06:35:44] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:35:44] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2025-06-02 06:35:44] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:35:44] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:35:45] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:35:45] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:35:45] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:35:46] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2025-06-02 06:35:46] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:35:46] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:35:46] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:35:47] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/703 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:36:00] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:36:00] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:36:01] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:36:01] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:36:02] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:36:02] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:36:02] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:36:02] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:36:02] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:36:02] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:36:02] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:36:03] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:36:03] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:36:03] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2025-06-02 06:36:03] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:36:03] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:36:03] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:36:03] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:36:03] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:36:03] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/723 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2025-06-02 06:36:19] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2025-06-02 06:36:20] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:36:20] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:36:20] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:36:20] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2025-06-02 06:36:21] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2025-06-02 06:36:21] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:36:21] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:36:21] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:36:21] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:36:21] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:36:22] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:36:22] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2025-06-02 06:36:22] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:36:23] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:36:23] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2025-06-02 06:36:23] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:36:23] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:36:23] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:36:24] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/1295 variables, and 743 constraints, problems are : Problem set: 0 solved, 363 unsolved in 75015 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/363 constraints, Known Traps: 326/326 constraints]
After SMT, in 150140ms problems are : Problem set: 0 solved, 363 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 268 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 27 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 4000000 steps (8 resets) in 68366 ms. (58 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 363/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 362/363 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 362/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 361/362 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 361/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 358/361 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 358/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 357/358 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 357/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 356/357 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 356/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 354/356 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 354/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 354/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 354/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 354/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 354/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 354/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 354/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 354/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 354/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 353/354 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 353/353 properties
Probabilistic random walk after 10000000 steps, saw 1257049 distinct states, run finished after 75640 ms. (steps per millisecond=132 ) properties seen :0
[2025-06-02 06:38:19] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:38:19] [INFO ] Invariant cache hit.
[2025-06-02 06:38:19] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 137/398 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 137/417 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:38:25] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:38:25] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2025-06-02 06:38:25] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:38:25] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:38:25] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:38:25] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:38:26] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2025-06-02 06:38:26] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:38:26] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:38:26] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:38:26] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:38:26] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:38:26] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:38:27] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:38:27] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:38:27] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:38:27] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:38:27] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:38:27] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:38:27] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:38:28] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:38:28] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:38:28] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:38:28] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:38:28] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:38:28] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:38:29] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:38:29] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:38:29] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:38:29] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:38:29] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:38:29] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:38:30] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:38:30] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:38:30] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:38:30] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:38:30] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:38:30] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:38:30] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:38:31] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:38:33] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:38:33] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:38:33] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:38:33] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:38:33] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:38:34] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 1 ms to minimize.
[2025-06-02 06:38:34] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:38:34] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:38:34] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:38:34] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:38:34] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:38:34] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:38:35] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:38:35] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:38:35] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:38:35] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:38:35] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:38:35] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:38:35] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:38:36] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:38:36] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:38:36] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:38:36] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:38:36] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:38:37] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:38:37] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:38:37] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:38:37] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:38:37] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:38:37] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:38:37] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:38:37] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:38:38] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:38:38] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:38:38] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
[2025-06-02 06:38:38] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:38:38] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
[2025-06-02 06:38:38] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:38:38] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:38:38] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:38:39] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2025-06-02 06:38:39] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:38:39] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:38:39] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:38:40] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:38:40] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:38:40] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:38:40] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:38:40] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:38:40] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:38:40] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:38:40] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:38:41] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:38:41] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:38:41] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:38:41] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:38:41] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:38:41] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:38:41] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:38:41] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:38:44] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:38:44] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:38:44] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:38:45] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:38:45] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:38:45] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:38:45] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:38:45] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 3 ms to minimize.
[2025-06-02 06:38:45] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:38:46] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
[2025-06-02 06:38:46] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:38:46] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:38:46] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:38:46] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:38:46] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:38:46] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:38:47] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2025-06-02 06:38:47] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:38:47] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 2 ms to minimize.
[2025-06-02 06:38:47] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:38:48] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:38:48] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:38:48] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:38:48] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:38:48] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:38:49] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:38:49] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:38:49] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:38:49] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:38:49] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:38:49] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:38:49] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:38:49] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:38:49] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:38:50] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:38:50] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:38:50] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:38:50] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:38:50] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:38:50] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:38:52] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:38:52] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:38:52] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:38:52] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:38:52] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:38:53] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2025-06-02 06:38:53] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:38:53] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:38:53] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:38:53] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:38:53] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:38:53] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:38:53] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:38:54] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:38:54] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:38:54] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:38:54] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:38:54] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:38:54] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2025-06-02 06:38:54] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:39:01] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:39:01] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:39:01] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:39:01] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:39:01] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:39:01] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:39:01] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:39:02] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2025-06-02 06:39:02] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:39:02] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:39:02] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:39:02] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 1 ms to minimize.
[2025-06-02 06:39:02] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:39:03] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:39:03] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:39:03] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2025-06-02 06:39:03] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:39:03] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:39:03] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:39:03] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:39:06] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:39:06] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2025-06-02 06:39:07] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:39:07] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 1 ms to minimize.
[2025-06-02 06:39:07] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:39:07] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:39:07] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
[2025-06-02 06:39:07] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:39:08] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:39:08] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:39:08] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:39:08] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:39:08] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:39:08] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:39:08] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:39:09] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:39:09] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:39:09] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:39:09] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2025-06-02 06:39:09] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 20/617 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:39:14] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:39:14] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:39:14] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:39:14] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:39:15] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2025-06-02 06:39:15] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:39:15] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:39:16] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:39:17] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:39:17] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:39:17] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 20/637 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:39:28] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:39:29] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:39:29] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:39:30] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:39:30] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:39:30] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:39:30] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:39:30] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:39:31] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:39:31] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:39:31] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:39:31] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:39:31] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:39:31] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:39:31] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:39:31] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 2 ms to minimize.
[2025-06-02 06:39:32] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:39:32] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:39:33] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:39:33] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/398 variables, 20/657 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:39:41] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:39:41] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:39:41] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2025-06-02 06:39:41] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:39:41] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:39:41] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:39:42] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:39:42] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2025-06-02 06:39:42] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:39:42] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:39:43] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:39:43] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:39:43] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:39:44] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:39:44] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:39:44] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:39:44] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:39:45] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:39:45] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:39:45] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/398 variables, 20/677 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1295 variables, and 677 constraints, problems are : Problem set: 0 solved, 353 unsolved in 90020 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 260/260 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 137/398 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 137/417 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 260/677 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:40:08] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:40:08] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:40:08] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:40:09] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:40:09] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:40:10] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:40:10] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:40:10] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:40:10] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:40:11] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:40:11] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:40:11] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:40:11] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:40:11] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:40:12] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2025-06-02 06:40:12] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2025-06-02 06:40:12] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2025-06-02 06:40:12] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2025-06-02 06:40:12] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2025-06-02 06:40:12] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/697 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:40:31] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:40:31] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:40:31] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 6 ms to minimize.
[2025-06-02 06:40:31] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:40:32] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:40:33] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:40:33] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:40:33] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:40:33] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:40:33] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:40:33] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2025-06-02 06:40:34] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:40:34] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:40:34] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:40:34] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:40:34] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:40:35] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:40:35] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:40:35] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:40:35] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/717 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:40:55] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:40:55] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:40:56] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:40:56] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2025-06-02 06:40:57] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:40:57] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:40:57] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:40:57] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:40:58] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:40:58] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:40:58] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:40:58] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:40:58] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:40:59] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
[2025-06-02 06:40:59] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:40:59] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:40:59] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:40:59] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:41:00] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:41:00] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/737 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/1295 variables, and 737 constraints, problems are : Problem set: 0 solved, 353 unsolved in 90019 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/353 constraints, Known Traps: 320/320 constraints]
After SMT, in 180118ms problems are : Problem set: 0 solved, 353 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 261 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 26 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 4000000 steps (8 resets) in 68262 ms. (58 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 353/353 properties
Interrupted probabilistic random walk after 8019656 steps, run timeout after 63001 ms. (steps per millisecond=127 ) properties seen :0 out of 353
Probabilistic random walk after 8019656 steps, saw 1008491 distinct states, run finished after 63006 ms. (steps per millisecond=127 ) properties seen :0
[2025-06-02 06:42:44] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:42:44] [INFO ] Invariant cache hit.
[2025-06-02 06:42:44] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 137/398 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 137/417 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:42:49] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:42:49] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:42:49] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:42:50] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:42:50] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:42:50] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:42:50] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:42:50] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:42:50] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:42:50] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:42:51] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:42:51] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:42:51] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:42:51] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:42:51] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:42:51] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:42:51] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:42:52] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:42:52] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:42:52] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:42:52] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:42:52] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:42:52] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:42:53] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 3 ms to minimize.
[2025-06-02 06:42:53] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:42:53] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:42:53] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:42:53] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:42:53] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:42:53] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:42:54] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:42:54] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:42:54] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:42:54] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:42:54] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:42:54] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:42:54] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:42:55] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:42:55] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:42:55] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:42:57] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:42:57] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:42:57] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:42:58] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2025-06-02 06:42:58] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:42:58] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:42:58] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:42:58] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 2 ms to minimize.
[2025-06-02 06:42:58] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:42:58] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:42:59] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:42:59] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:42:59] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:42:59] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:42:59] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:42:59] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:42:59] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:42:59] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:43:00] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:43:00] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:43:00] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:43:00] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 4 ms to minimize.
[2025-06-02 06:43:00] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:43:01] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:43:01] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:43:01] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2025-06-02 06:43:01] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:43:01] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:43:01] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:43:01] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:43:01] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:43:02] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:43:02] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:43:02] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:43:02] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:43:02] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:43:02] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:43:02] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:43:02] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:43:03] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:43:03] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2025-06-02 06:43:03] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:43:03] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:43:03] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:43:04] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:43:04] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:43:04] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:43:04] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:43:04] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:43:04] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:43:04] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:43:04] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:43:05] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:43:05] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:43:05] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:43:05] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:43:05] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:43:05] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:43:05] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2025-06-02 06:43:05] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:43:08] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:43:08] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:43:08] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:43:08] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:43:09] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:43:09] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:43:09] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:43:09] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2025-06-02 06:43:09] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:43:09] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:43:10] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:43:10] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:43:10] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:43:10] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:43:10] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:43:10] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:43:10] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:43:10] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2025-06-02 06:43:11] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2025-06-02 06:43:11] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:43:11] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:43:12] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:43:12] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2025-06-02 06:43:12] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:43:12] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:43:12] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:43:12] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:43:12] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:43:12] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:43:13] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:43:13] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:43:13] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:43:13] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:43:13] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:43:13] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:43:13] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2025-06-02 06:43:13] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:43:14] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:43:14] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:43:14] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:43:15] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:43:16] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 1 ms to minimize.
[2025-06-02 06:43:16] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:43:16] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:43:16] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2025-06-02 06:43:16] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:43:16] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:43:16] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:43:17] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2025-06-02 06:43:18] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:43:18] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:43:24] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:43:24] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:43:24] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:43:24] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:43:24] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:43:25] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:43:25] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:43:25] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2025-06-02 06:43:25] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:43:25] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:43:25] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:43:25] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:43:26] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:43:26] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:43:26] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:43:26] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:43:26] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:43:26] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:43:26] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:43:27] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:43:29] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:43:29] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:43:30] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:43:30] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:43:30] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:43:30] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:43:30] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:43:30] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:43:30] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2025-06-02 06:43:31] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:43:31] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:43:31] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:43:31] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:43:31] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:43:31] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:43:31] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:43:32] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:43:32] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:43:32] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:43:32] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 20/617 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:43:37] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:43:37] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:43:37] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:43:37] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:43:37] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:43:38] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:43:38] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:43:38] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:43:38] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:43:38] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:43:39] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:43:39] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:43:39] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2025-06-02 06:43:39] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2025-06-02 06:43:39] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:43:39] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2025-06-02 06:43:39] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:43:39] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:43:39] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:43:40] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 20/637 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:43:51] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:43:52] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:43:52] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:43:52] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:43:52] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:43:53] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:43:53] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:43:53] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:43:53] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:43:53] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:43:53] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:43:53] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:43:53] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2025-06-02 06:43:53] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:43:54] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:43:54] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:43:54] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:43:55] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2025-06-02 06:43:55] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:43:55] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/398 variables, 20/657 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:44:03] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2025-06-02 06:44:03] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:44:03] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:44:03] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:44:03] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:44:03] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:44:04] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:44:04] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:44:05] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:44:05] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:44:05] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:44:05] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:44:06] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:44:06] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2025-06-02 06:44:07] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
[2025-06-02 06:44:07] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:44:07] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:44:07] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:44:07] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:44:07] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/398 variables, 20/677 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:44:20] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2025-06-02 06:44:20] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:44:20] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:44:20] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:44:20] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:44:21] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:44:21] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:44:21] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2025-06-02 06:44:22] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:44:22] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:44:22] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:44:23] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:44:24] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:44:24] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:44:24] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:44:24] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 3 ms to minimize.
[2025-06-02 06:44:24] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:44:24] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:44:25] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:44:25] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/398 variables, 20/697 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1295 variables, and 697 constraints, problems are : Problem set: 0 solved, 353 unsolved in 105028 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 280/280 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 137/398 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 137/417 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 280/697 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:44:45] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:44:45] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:44:45] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:44:45] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:44:46] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:44:46] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:44:46] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:44:46] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:44:46] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:44:47] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:44:48] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:44:48] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:44:48] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:44:48] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
[2025-06-02 06:44:49] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:44:49] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2025-06-02 06:44:49] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:44:49] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:44:49] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:44:50] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/717 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:45:07] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:45:08] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2025-06-02 06:45:08] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:45:09] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:45:09] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:45:09] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:45:10] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:45:10] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:45:10] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:45:11] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2025-06-02 06:45:11] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:45:11] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:45:11] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:45:12] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:45:12] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:45:13] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:45:13] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:45:13] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 3 ms to minimize.
[2025-06-02 06:45:13] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:45:13] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/737 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:45:29] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:45:30] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:45:30] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:45:31] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:45:32] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:45:33] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2025-06-02 06:45:33] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:45:33] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:45:34] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:45:35] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:45:36] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:45:36] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:45:37] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/757 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:45:55] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:45:55] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:45:56] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:45:56] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:45:57] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:45:57] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:45:58] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:46:00] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:46:00] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:46:01] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:46:01] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:46:02] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2025-06-02 06:46:03] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
[2025-06-02 06:46:03] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:46:03] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:46:03] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:46:03] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:46:04] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2025-06-02 06:46:05] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:46:05] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/777 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/1295 variables, and 777 constraints, problems are : Problem set: 0 solved, 353 unsolved in 105010 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/353 constraints, Known Traps: 360/360 constraints]
After SMT, in 210103ms problems are : Problem set: 0 solved, 353 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 261 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 15 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 13 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2025-06-02 06:46:14] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:46:14] [INFO ] Invariant cache hit.
[2025-06-02 06:46:14] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 06:46:14] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:46:14] [INFO ] Invariant cache hit.
[2025-06-02 06:46:14] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 06:46:15] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2025-06-02 06:46:15] [INFO ] Redundant transitions in 50 ms returned []
Running 1099 sub problems to find dead transitions.
[2025-06-02 06:46:15] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:46:15] [INFO ] Invariant cache hit.
[2025-06-02 06:46:15] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:46:22] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:46:22] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:46:22] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:46:22] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:46:22] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 1 ms to minimize.
[2025-06-02 06:46:22] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:46:22] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:46:23] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:46:23] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:46:23] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:46:23] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 1 ms to minimize.
[2025-06-02 06:46:23] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:46:23] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:46:23] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:46:24] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:46:24] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:46:24] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:46:24] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:46:24] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:46:24] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:46:25] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:46:25] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:46:25] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:46:25] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:46:25] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:46:25] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:46:25] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:46:26] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:46:26] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 3 ms to minimize.
[2025-06-02 06:46:26] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:46:26] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:46:26] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:46:26] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:46:26] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:46:27] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:46:27] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:46:27] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:46:27] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:46:27] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:46:27] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:46:34] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:46:34] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:46:34] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:46:34] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:46:35] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:46:36] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:46:37] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:46:37] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:46:37] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:46:37] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:46:38] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 3 ms to minimize.
[2025-06-02 06:46:38] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:46:38] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:46:38] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:46:39] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:46:40] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:46:40] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:46:40] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:46:40] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:46:40] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:46:40] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:46:42] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:46:42] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:46:42] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:46:42] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:46:43] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:46:43] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:46:44] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:46:45] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:46:45] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:46:45] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:46:45] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:46:45] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30402ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31256 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 400000 steps (8 resets) in 7572 ms. (52 steps per ms) remains 154/261 properties
Running SMT prover for 154 properties.
[2025-06-02 06:46:48] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:46:48] [INFO ] Invariant cache hit.
[2025-06-02 06:46:48] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2025-06-02 06:46:48] [INFO ] After 360ms SMT Verify possible using state equation in real domain returned unsat :0 sat :154
[2025-06-02 06:46:48] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 06:46:49] [INFO ] After 582ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :154
TRAPS : Iteration 0
[2025-06-02 06:46:56] [INFO ] After 8098ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:154
[2025-06-02 06:46:56] [INFO ] After 8614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:154
[2025-06-02 06:46:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2025-06-02 06:46:57] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :154
[2025-06-02 06:46:57] [INFO ] After 714ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :154
TRAPS : Iteration 0
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 3 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 2 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 2 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2025-06-02 06:46:58] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 3 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 2 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 2 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
[2025-06-02 06:46:59] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:47:00] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:47:00] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:47:00] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:47:00] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 3 ms to minimize.
[2025-06-02 06:47:00] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2025-06-02 06:47:00] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 3 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:47:01] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:47:02] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:47:03] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 6473 ms
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:47:04] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:47:05] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:47:06] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:47:07] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:47:08] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2025-06-02 06:47:08] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:47:08] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:47:08] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:47:08] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:47:08] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:47:09] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:47:09] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:47:09] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:47:09] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:47:09] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:47:09] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5336 ms
[2025-06-02 06:47:10] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:47:10] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:47:10] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:47:10] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:47:10] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:47:10] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:47:10] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:47:10] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:47:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1094 ms
[2025-06-02 06:47:11] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:47:11] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 1 ms to minimize.
[2025-06-02 06:47:11] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:47:11] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:47:11] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:47:11] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:47:11] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:47:12] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:47:12] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:47:12] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:47:12] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:47:12] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:47:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1928 ms
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:47:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 615 ms
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:47:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:47:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 1 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:47:16] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1260 ms
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:47:17] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:47:18] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1996 ms
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:47:19] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2025-06-02 06:47:20] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:47:21] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:47:22] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:47:23] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:47:23] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:47:23] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:47:23] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:47:23] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:47:23] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:47:23] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:47:24] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:47:24] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:47:24] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:47:24] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4739 ms
[2025-06-02 06:47:24] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:47:25] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:47:26] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:47:27] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3089 ms
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:47:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:47:28] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 799 ms
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:47:29] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:47:30] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:47:31] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3085 ms
[2025-06-02 06:47:32] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:47:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-06-02 06:47:33] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 9 ms to minimize.
[2025-06-02 06:47:33] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:47:33] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:47:33] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:47:33] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:47:34] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:47:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1038 ms
[2025-06-02 06:47:34] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-02 06:47:34] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:47:35] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2025-06-02 06:47:35] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:47:35] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:47:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 684 ms
[2025-06-02 06:47:35] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:47:35] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:47:35] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:47:36] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:47:36] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:47:36] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:47:37] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:47:37] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:47:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1795 ms
[2025-06-02 06:47:37] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:47:37] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:47:37] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:47:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 483 ms
[2025-06-02 06:47:38] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:47:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2025-06-02 06:47:40] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-06-02 06:47:40] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2025-06-02 06:47:40] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:47:40] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:47:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2025-06-02 06:47:41] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:47:42] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:47:42] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:47:42] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:47:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 695 ms
[2025-06-02 06:47:42] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:47:42] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:47:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2025-06-02 06:47:43] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:47:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2025-06-02 06:47:43] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:47:43] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:47:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2025-06-02 06:47:43] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:47:43] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:47:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2025-06-02 06:47:44] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:47:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2025-06-02 06:47:44] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 3 ms to minimize.
[2025-06-02 06:47:44] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:47:44] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:47:45] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:47:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 748 ms
[2025-06-02 06:47:45] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2025-06-02 06:47:45] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:47:45] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:47:45] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:47:46] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:47:46] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:47:46] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 1 ms to minimize.
[2025-06-02 06:47:46] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:47:46] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:47:46] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:47:47] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:47:47] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2025-06-02 06:47:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2042 ms
[2025-06-02 06:47:47] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2025-06-02 06:47:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2025-06-02 06:47:47] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 532 ms
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:47:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:47:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:47:50] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 3 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:47:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1326 ms
[2025-06-02 06:47:52] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:47:52] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2025-06-02 06:47:52] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:47:52] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:47:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 605 ms
[2025-06-02 06:47:52] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:47:52] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:47:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2025-06-02 06:47:53] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:47:53] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:47:53] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:47:54] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2025-06-02 06:47:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 677 ms
[2025-06-02 06:47:54] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:47:54] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:47:54] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:47:55] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:47:55] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:47:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 689 ms
[2025-06-02 06:47:56] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:47:56] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:47:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2025-06-02 06:47:56] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:47:56] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:47:56] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:47:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 531 ms
[2025-06-02 06:47:57] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:47:57] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:47:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2025-06-02 06:47:57] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:47:57] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:47:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:47:58] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:47:59] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:47:59] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:47:59] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:47:59] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:47:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1249 ms
[2025-06-02 06:48:00] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2025-06-02 06:48:01] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:48:01] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:48:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2025-06-02 06:48:01] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2025-06-02 06:48:02] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2025-06-02 06:48:02] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2025-06-02 06:48:03] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 616 ms
[2025-06-02 06:48:04] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-06-02 06:48:04] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:48:04] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:48:04] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:48:05] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:48:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 657 ms
[2025-06-02 06:48:05] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:48:05] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:48:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2025-06-02 06:48:05] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:48:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2025-06-02 06:48:06] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:48:06] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:48:06] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:48:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 406 ms
TRAPS : Iteration 1
[2025-06-02 06:48:07] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:48:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2025-06-02 06:48:08] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:48:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2025-06-02 06:48:08] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:48:09] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:48:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2025-06-02 06:48:09] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:48:09] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:48:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2025-06-02 06:48:10] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:48:10] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:48:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2025-06-02 06:48:10] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2025-06-02 06:48:12] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2025-06-02 06:48:14] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-06-02 06:48:16] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2025-06-02 06:48:16] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2025-06-02 06:48:17] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-02 06:48:19] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:48:19] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:48:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2025-06-02 06:48:19] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-06-02 06:48:21] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 613 ms
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2025-06-02 06:48:22] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-06-02 06:48:23] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2025-06-02 06:48:24] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:48:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2025-06-02 06:48:26] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:48:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
TRAPS : Iteration 2
[2025-06-02 06:48:30] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2025-06-02 06:48:31] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2025-06-02 06:48:32] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:48:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-06-02 06:48:34] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2025-06-02 06:48:35] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 1 ms to minimize.
[2025-06-02 06:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 499 ms
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:48:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2025-06-02 06:48:41] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 1 ms to minimize.
[2025-06-02 06:48:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2025-06-02 06:48:42] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2025-06-02 06:48:43] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:48:43] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:48:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
TRAPS : Iteration 3
[2025-06-02 06:48:53] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:48:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-06-02 06:48:54] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2025-06-02 06:48:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2025-06-02 06:48:55] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:48:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2025-06-02 06:48:57] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:48:57] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:48:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2025-06-02 06:49:02] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2025-06-02 06:49:03] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2025-06-02 06:49:03] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2025-06-02 06:49:08] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
TRAPS : Iteration 4
[2025-06-02 06:49:12] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:49:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2025-06-02 06:49:14] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:49:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-06-02 06:49:15] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2025-06-02 06:49:16] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:49:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2025-06-02 06:49:23] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2025-06-02 06:49:23] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:49:23] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2025-06-02 06:49:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 630 ms
[2025-06-02 06:49:24] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
TRAPS : Iteration 5
[2025-06-02 06:49:32] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:49:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2025-06-02 06:49:36] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-06-02 06:49:40] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:49:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2025-06-02 06:49:41] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:49:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2025-06-02 06:49:42] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:49:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2025-06-02 06:49:42] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:49:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-06-02 06:49:43] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:49:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
TRAPS : Iteration 6
[2025-06-02 06:49:51] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:49:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2025-06-02 06:49:53] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2025-06-02 06:49:55] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-06-02 06:49:55] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-06-02 06:50:04] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:50:04] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:50:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2025-06-02 06:50:04] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:50:04] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:50:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
TRAPS : Iteration 7
[2025-06-02 06:50:12] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
TRAPS : Iteration 8
[2025-06-02 06:50:16] [INFO ] After 199546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :153
[2025-06-02 06:50:16] [INFO ] After 200025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :153
RANDOM walk for 4000000 steps (8 resets) in 75300 ms. (53 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 353/353 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 353/353 properties
Interrupted probabilistic random walk after 7538632 steps, run timeout after 72001 ms. (steps per millisecond=104 ) properties seen :0 out of 353
Probabilistic random walk after 7538632 steps, saw 951169 distinct states, run finished after 72002 ms. (steps per millisecond=104 ) properties seen :0
[2025-06-02 06:51:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:51:52] [INFO ] Invariant cache hit.
[2025-06-02 06:51:52] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 137/398 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 137/417 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:51:58] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 2 ms to minimize.
[2025-06-02 06:51:58] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 4 ms to minimize.
[2025-06-02 06:51:58] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2025-06-02 06:51:58] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 3 ms to minimize.
[2025-06-02 06:51:58] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:51:58] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:51:58] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:51:59] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:51:59] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:51:59] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:51:59] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:51:59] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:51:59] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:51:59] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:52:00] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:52:00] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2025-06-02 06:52:00] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:52:00] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:52:00] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:52:00] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:01] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:52:01] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:52:01] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:52:01] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:52:01] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:52:01] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:52:01] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:52:02] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:52:02] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:52:02] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:52:02] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:52:02] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:52:02] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:52:02] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:52:03] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:52:03] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:52:03] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:52:03] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:52:03] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:52:03] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:06] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:52:06] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:52:06] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:52:06] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:52:06] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:52:06] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:52:06] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:52:06] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:52:07] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:52:07] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:52:07] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:52:07] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:52:07] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:52:07] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:52:07] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:52:08] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:52:08] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:52:08] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:52:08] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:52:08] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:08] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:52:09] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:52:10] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:52:11] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:52:12] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:52:13] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:52:14] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:16] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:52:16] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:52:17] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:52:17] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:52:17] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:52:17] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:52:17] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:52:17] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:52:17] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:52:18] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:52:18] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:52:18] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:52:18] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:52:18] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 4 ms to minimize.
[2025-06-02 06:52:18] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:52:18] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:52:19] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:52:19] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:52:19] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:52:19] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:20] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:52:20] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:52:20] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2025-06-02 06:52:20] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:52:20] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2025-06-02 06:52:20] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:52:21] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:52:21] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2025-06-02 06:52:21] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:52:21] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:52:21] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:52:21] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:52:21] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:52:21] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:52:21] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:52:22] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 3 ms to minimize.
[2025-06-02 06:52:22] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:52:22] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:52:22] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:52:22] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:24] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:52:24] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:52:24] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:52:24] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:52:24] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:52:24] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 2 ms to minimize.
[2025-06-02 06:52:25] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2025-06-02 06:52:25] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:52:25] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:52:25] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:52:25] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:52:25] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:52:25] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:52:25] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:52:26] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:52:26] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:52:26] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:52:26] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:52:26] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:52:26] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:32] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:52:32] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:52:33] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:52:33] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:52:33] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:52:33] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:52:33] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:52:33] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:52:33] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:52:34] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:52:35] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:52:35] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:52:35] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:52:35] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:38] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:52:38] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:52:38] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:52:38] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:52:38] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:52:39] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:52:39] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:52:39] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:52:39] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:52:39] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:52:39] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:52:40] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2025-06-02 06:52:40] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:52:40] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:52:40] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:52:40] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:52:40] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2025-06-02 06:52:40] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:52:41] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
[2025-06-02 06:52:41] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 20/617 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:52:46] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:52:46] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:52:46] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:52:46] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:52:46] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:52:47] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:52:47] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:52:47] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:52:47] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:52:47] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:52:47] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:52:48] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:52:48] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:52:48] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:52:48] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:52:48] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:52:48] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:52:48] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:52:48] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:52:49] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 20/637 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:53:00] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:53:01] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:53:01] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:53:01] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2025-06-02 06:53:01] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:53:01] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:53:02] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:53:03] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:53:03] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:53:03] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2025-06-02 06:53:04] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:53:04] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:53:04] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/398 variables, 20/657 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:53:12] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:53:13] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:53:13] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:53:13] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:53:13] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2025-06-02 06:53:14] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2025-06-02 06:53:14] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:53:14] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:53:15] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:53:15] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:53:15] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:53:16] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/398 variables, 20/677 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:53:28] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:53:28] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:53:28] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:53:29] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2025-06-02 06:53:30] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:53:30] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:53:31] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:53:31] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2025-06-02 06:53:32] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:53:32] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:53:32] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:53:32] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:53:32] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:53:33] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:53:33] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:53:33] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2025-06-02 06:53:33] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/398 variables, 20/697 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1295 variables, and 697 constraints, problems are : Problem set: 0 solved, 353 unsolved in 120021 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 280/280 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 137/398 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 137/417 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 280/697 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:54:09] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:54:10] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:54:10] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:54:10] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:54:11] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:54:11] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:54:11] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:54:12] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:54:12] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:54:12] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:54:13] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:54:13] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2025-06-02 06:54:13] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:54:13] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:54:13] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/717 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:54:31] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:54:32] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:54:32] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:54:33] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:54:33] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2025-06-02 06:54:34] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:54:34] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:54:35] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:54:36] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2025-06-02 06:54:37] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:54:38] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 20/737 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:54:53] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2025-06-02 06:54:55] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:54:55] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:54:55] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2025-06-02 06:54:57] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:54:58] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:54:58] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:54:58] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:54:59] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:55:00] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:55:00] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:55:00] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:55:01] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:55:02] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 20/757 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:55:20] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:55:20] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:55:21] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:55:22] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:55:22] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:55:22] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2025-06-02 06:55:23] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:55:25] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:55:25] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:55:26] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:55:27] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2025-06-02 06:55:27] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:55:28] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2025-06-02 06:55:28] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:55:28] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:55:28] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:55:29] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:55:29] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2025-06-02 06:55:30] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:55:30] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 20/777 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2025-06-02 06:55:52] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/1295 variables, and 778 constraints, problems are : Problem set: 0 solved, 353 unsolved in 120015 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/399 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/353 constraints, Known Traps: 361/361 constraints]
After SMT, in 240103ms problems are : Problem set: 0 solved, 353 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 261 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 14 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2025-06-02 06:55:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:55:52] [INFO ] Invariant cache hit.
[2025-06-02 06:55:52] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-02 06:55:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:55:53] [INFO ] Invariant cache hit.
[2025-06-02 06:55:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 06:55:53] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2025-06-02 06:55:53] [INFO ] Redundant transitions in 18 ms returned []
Running 1099 sub problems to find dead transitions.
[2025-06-02 06:55:53] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:55:53] [INFO ] Invariant cache hit.
[2025-06-02 06:55:53] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:56:00] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 3 ms to minimize.
[2025-06-02 06:56:00] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2025-06-02 06:56:01] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2025-06-02 06:56:01] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:56:01] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:56:01] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:56:01] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:56:01] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:56:01] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:56:01] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:56:02] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:56:02] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:56:02] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:56:02] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:56:02] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 3 ms to minimize.
[2025-06-02 06:56:02] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:56:02] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:56:03] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 3 ms to minimize.
[2025-06-02 06:56:03] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:56:03] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:56:03] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:56:03] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 3 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:56:06] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:56:06] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:06] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:56:13] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:56:14] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:56:15] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:56:15] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:56:15] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:56:15] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:56:15] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:56:15] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:56:16] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:56:16] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:56:16] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2025-06-02 06:56:16] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 3 ms to minimize.
[2025-06-02 06:56:17] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:56:17] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:56:17] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:56:17] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:56:17] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:56:19] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:56:19] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:56:19] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:56:19] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2025-06-02 06:56:19] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2025-06-02 06:56:21] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:56:21] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:56:21] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:56:21] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
[2025-06-02 06:56:22] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:56:22] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:56:23] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:56:23] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:56:23] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:56:23] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:56:23] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:56:23] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:56:24] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
SMT process timed out in 30327ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31167 ms. Remains : 399/399 places, 1106/1106 transitions.
RANDOM walk for 400000 steps (8 resets) in 4303 ms. (92 steps per ms) remains 156/261 properties
Running SMT prover for 156 properties.
[2025-06-02 06:56:25] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2025-06-02 06:56:25] [INFO ] Invariant cache hit.
[2025-06-02 06:56:25] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2025-06-02 06:56:25] [INFO ] After 325ms SMT Verify possible using state equation in real domain returned unsat :0 sat :156
[2025-06-02 06:56:25] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 06:56:26] [INFO ] After 580ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :156
TRAPS : Iteration 0
[2025-06-02 06:56:33] [INFO ] After 8079ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:156
[2025-06-02 06:56:33] [INFO ] After 8566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:156
[2025-06-02 06:56:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2025-06-02 06:56:34] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :156
[2025-06-02 06:56:35] [INFO ] After 755ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :156
TRAPS : Iteration 0
[2025-06-02 06:56:35] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:56:35] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:56:35] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:56:35] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:56:35] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2025-06-02 06:56:36] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:56:36] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:56:36] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:56:36] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:56:36] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:56:36] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:56:37] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:56:37] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:56:37] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:37] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:56:37] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:37] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:56:38] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:56:38] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:56:38] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:56:38] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:56:38] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:56:38] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:56:38] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:56:39] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4751 ms
[2025-06-02 06:56:40] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:56:40] [INFO ] Deduced a trap composed of 93 places in 188 ms of which 2 ms to minimize.
[2025-06-02 06:56:40] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2025-06-02 06:56:40] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:56:40] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2025-06-02 06:56:40] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:43] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:56:43] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:56:43] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:56:43] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 3 ms to minimize.
[2025-06-02 06:56:43] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:56:43] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:56:43] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2025-06-02 06:56:44] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2025-06-02 06:56:44] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:56:44] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:56:44] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:56:44] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 2 ms to minimize.
[2025-06-02 06:56:44] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 2 ms to minimize.
[2025-06-02 06:56:45] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2025-06-02 06:56:45] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
[2025-06-02 06:56:45] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:56:45] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:56:45] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:56:46] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2025-06-02 06:56:46] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:56:46] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:56:46] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 6441 ms
[2025-06-02 06:56:46] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:56:46] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2025-06-02 06:56:47] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 3 ms to minimize.
[2025-06-02 06:56:47] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:56:47] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:56:47] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:56:47] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:56:47] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:56:49] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 3 ms to minimize.
[2025-06-02 06:56:49] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:56:49] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:56:49] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:56:49] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:56:49] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:56:50] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:56:50] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:56:50] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:56:50] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:56:50] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:50] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:56:51] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:56:51] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:56:51] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2025-06-02 06:56:51] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4887 ms
[2025-06-02 06:56:51] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:56:51] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:56:51] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:56:52] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:56:52] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:56:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 715 ms
[2025-06-02 06:56:52] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:56:52] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:56:52] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:56:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 327 ms
[2025-06-02 06:56:52] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-02 06:56:52] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:56:52] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:56:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2025-06-02 06:56:53] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2025-06-02 06:56:53] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:56:53] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:56:53] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:56:53] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:56:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 587 ms
[2025-06-02 06:56:54] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:56:54] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:56:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2025-06-02 06:56:54] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:56:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2025-06-02 06:56:54] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:56:54] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 2 ms to minimize.
[2025-06-02 06:56:55] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2025-06-02 06:56:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 568 ms
[2025-06-02 06:56:55] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:56:55] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:56:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2025-06-02 06:56:55] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:56:55] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2025-06-02 06:56:57] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:56:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1376 ms
[2025-06-02 06:56:57] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:56:57] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:56:57] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:56:57] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2025-06-02 06:56:57] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:56:57] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:56:58] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2025-06-02 06:56:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1008 ms
[2025-06-02 06:56:58] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:56:58] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 1 ms to minimize.
[2025-06-02 06:56:58] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:56:58] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:56:58] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:56:58] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:56:59] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:56:59] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:56:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1051 ms
[2025-06-02 06:56:59] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:56:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2025-06-02 06:56:59] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2025-06-02 06:56:59] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 3 ms to minimize.
[2025-06-02 06:57:00] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2025-06-02 06:57:00] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:57:00] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:57:00] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:57:00] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:57:00] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:57:01] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:57:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1512 ms
[2025-06-02 06:57:01] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:57:01] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:57:01] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:57:01] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:57:02] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:57:02] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:57:02] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:57:02] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:57:02] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:57:02] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2205 ms
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:57:04] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:57:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 737 ms
[2025-06-02 06:57:04] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:57:04] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:57:04] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:57:04] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:57:04] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:57:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 591 ms
[2025-06-02 06:57:05] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:57:05] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:57:05] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:57:05] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:57:05] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:57:05] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:57:06] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:57:06] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:57:06] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:57:06] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:57:06] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:57:06] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2557 ms
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:57:07] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:57:08] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:57:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 451 ms
[2025-06-02 06:57:08] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:57:08] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:57:08] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:57:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 499 ms
[2025-06-02 06:57:08] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2025-06-02 06:57:09] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:57:09] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:57:09] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:57:09] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:57:09] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:57:09] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:57:10] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:57:10] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:57:10] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:57:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1619 ms
[2025-06-02 06:57:10] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:57:10] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:57:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2025-06-02 06:57:10] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:57:11] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:57:11] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:57:11] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:57:11] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:57:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 588 ms
[2025-06-02 06:57:11] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:57:11] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:57:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2025-06-02 06:57:12] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:57:12] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:57:12] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:57:12] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:57:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 972 ms
[2025-06-02 06:57:13] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:57:13] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:57:13] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:57:13] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:57:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 559 ms
[2025-06-02 06:57:13] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-06-02 06:57:14] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2025-06-02 06:57:14] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2025-06-02 06:57:14] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2025-06-02 06:57:14] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2025-06-02 06:57:15] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:57:15] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:57:15] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2025-06-02 06:57:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 620 ms
[2025-06-02 06:57:15] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2025-06-02 06:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-06-02 06:57:16] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:57:16] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:57:16] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:57:16] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:57:16] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:57:16] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:57:16] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:57:17] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:57:17] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:57:17] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:57:17] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:57:17] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:57:17] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:57:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1895 ms
[2025-06-02 06:57:18] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:57:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-06-02 06:57:18] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:57:19] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:57:19] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:57:19] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:57:19] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:57:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1296 ms
[2025-06-02 06:57:20] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:57:20] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:57:20] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:57:20] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:57:20] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1494 ms
[2025-06-02 06:57:21] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:57:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 427 ms
[2025-06-02 06:57:22] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:57:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-02 06:57:22] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2025-06-02 06:57:23] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:57:23] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2025-06-02 06:57:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 495 ms
[2025-06-02 06:57:24] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:57:24] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:57:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2025-06-02 06:57:25] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:57:25] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:57:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 463 ms
[2025-06-02 06:57:25] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:57:25] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:57:25] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:57:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
[2025-06-02 06:57:26] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:57:26] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:57:26] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:57:26] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:57:26] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2025-06-02 06:57:26] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:57:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 829 ms
[2025-06-02 06:57:27] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:57:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2025-06-02 06:57:27] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 1 ms to minimize.
[2025-06-02 06:57:27] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:57:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2025-06-02 06:57:27] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:57:27] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:57:28] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:57:28] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:57:28] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2025-06-02 06:57:28] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:57:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 925 ms
[2025-06-02 06:57:28] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:57:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2025-06-02 06:57:30] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
[2025-06-02 06:57:30] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 2 ms to minimize.
[2025-06-02 06:57:30] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:57:30] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:57:30] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:57:30] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:57:31] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:57:31] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:57:31] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:57:31] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:57:31] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:57:31] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2025-06-02 06:57:32] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:57:32] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:57:32] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:57:32] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 3 ms to minimize.
[2025-06-02 06:57:32] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:57:32] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:57:32] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:57:33] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:57:33] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3063 ms
[2025-06-02 06:57:33] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:57:33] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 1 ms to minimize.
[2025-06-02 06:57:33] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:57:33] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2025-06-02 06:57:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 589 ms
[2025-06-02 06:57:34] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:57:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-06-02 06:57:34] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2025-06-02 06:57:34] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 1 ms to minimize.
[2025-06-02 06:57:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2025-06-02 06:57:35] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:57:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-02 06:57:35] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2025-06-02 06:57:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2025-06-02 06:57:36] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2025-06-02 06:57:37] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2025-06-02 06:57:37] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2025-06-02 06:57:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2025-06-02 06:57:38] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2025-06-02 06:57:38] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2025-06-02 06:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2025-06-02 06:57:39] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:57:39] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2025-06-02 06:57:39] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:57:39] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2025-06-02 06:57:39] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2025-06-02 06:57:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 769 ms
[2025-06-02 06:57:40] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2025-06-02 06:57:40] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:57:40] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:57:40] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2025-06-02 06:57:40] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2025-06-02 06:57:41] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:57:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1086 ms
[2025-06-02 06:57:42] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:57:42] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:57:42] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
[2025-06-02 06:57:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 407 ms
TRAPS : Iteration 1
[2025-06-02 06:57:44] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:57:44] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:57:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2025-06-02 06:57:45] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 2 ms to minimize.
[2025-06-02 06:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-02 06:57:46] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:57:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2025-06-02 06:57:46] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2025-06-02 06:57:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-06-02 06:57:47] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2025-06-02 06:57:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2025-06-02 06:57:47] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:57:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2025-06-02 06:57:47] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2025-06-02 06:57:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2025-06-02 06:57:50] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:57:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2025-06-02 06:57:51] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2025-06-02 06:57:51] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:57:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2025-06-02 06:57:51] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2025-06-02 06:57:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2025-06-02 06:57:56] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:57:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-06-02 06:57:56] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:57:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2025-06-02 06:57:57] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2025-06-02 06:57:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-06-02 06:57:57] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:57:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2025-06-02 06:57:57] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:57:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2025-06-02 06:57:58] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2025-06-02 06:57:59] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2025-06-02 06:57:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2025-06-02 06:58:00] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:58:01] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:58:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2025-06-02 06:58:01] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2025-06-02 06:58:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 691 ms
[2025-06-02 06:58:02] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
TRAPS : Iteration 2
[2025-06-02 06:58:06] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2025-06-02 06:58:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2025-06-02 06:58:08] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2025-06-02 06:58:12] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:58:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2025-06-02 06:58:16] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:58:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-06-02 06:58:17] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 1 ms to minimize.
[2025-06-02 06:58:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2025-06-02 06:58:18] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2025-06-02 06:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-06-02 06:58:19] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 2 ms to minimize.
[2025-06-02 06:58:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2025-06-02 06:58:19] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:58:19] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 1 ms to minimize.
[2025-06-02 06:58:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
TRAPS : Iteration 3
[2025-06-02 06:58:27] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:58:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2025-06-02 06:58:29] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:58:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2025-06-02 06:58:30] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:58:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2025-06-02 06:58:32] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:58:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-02 06:58:33] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:58:33] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2025-06-02 06:58:34] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:58:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 376 ms
[2025-06-02 06:58:34] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:58:34] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2025-06-02 06:58:34] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 1 ms to minimize.
[2025-06-02 06:58:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 452 ms
[2025-06-02 06:58:36] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 1 ms to minimize.
[2025-06-02 06:58:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2025-06-02 06:58:37] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2025-06-02 06:58:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2025-06-02 06:58:40] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2025-06-02 06:58:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2025-06-02 06:58:41] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2025-06-02 06:58:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
TRAPS : Iteration 4
[2025-06-02 06:58:53] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2025-06-02 06:58:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-06-02 06:58:54] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2025-06-02 06:58:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-06-02 06:58:58] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:58:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2025-06-02 06:59:04] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2025-06-02 06:59:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2025-06-02 06:59:05] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:59:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2025-06-02 06:59:06] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2025-06-02 06:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2025-06-02 06:59:06] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2025-06-02 06:59:09] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2025-06-02 06:59:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
TRAPS : Iteration 5
[2025-06-02 06:59:12] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:59:12] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:59:12] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2025-06-02 06:59:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 526 ms
[2025-06-02 06:59:14] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2025-06-02 06:59:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-02 06:59:16] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2025-06-02 06:59:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2025-06-02 06:59:21] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2025-06-02 06:59:26] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2025-06-02 06:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2025-06-02 06:59:27] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:59:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2025-06-02 06:59:27] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2025-06-02 06:59:27] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:59:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 Liveness -timeout 180 -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="Peterson-PT-6"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is Peterson-PT-6, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r154-tall-174876825600394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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