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.r125-tall-174876435800087.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 LamportFastMutEx-PT-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435800087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 206K 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 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 420K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K 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 265K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748775992166

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 11:06:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 11:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:06:33] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-06-01 11:06:33] [INFO ] Transformed 264 places.
[2025-06-01 11:06:33] [INFO ] Transformed 536 transitions.
[2025-06-01 11:06:33] [INFO ] Found NUPN structural information;
[2025-06-01 11:06:33] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7]
[2025-06-01 11:06:33] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
FORMULA LamportFastMutEx-PT-7-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-PT-7-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1]
[2025-06-01 11:06:33] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2025-06-01 11:06:33] [INFO ] Computed 65 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 56 ms. (175 steps per ms)
FORMULA LamportFastMutEx-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (12 resets) in 100 ms. (594 steps per ms)
FORMULA LamportFastMutEx-PT-7-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 4, 6, 6] Max Struct:[7, 7, 7, 7, 7]
[2025-06-01 11:06:33] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-01 11:06:33] [INFO ] Invariant cache hit.
[2025-06-01 11:06:34] [INFO ] [Real]Absence check using 65 positive place invariants in 29 ms returned sat
[2025-06-01 11:06:34] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-06-01 11:06:34] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-01 11:06:34] [INFO ] [Real]Added 91 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:06:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 21 ms returned sat
[2025-06-01 11:06:34] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-01 11:06:34] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 12 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 4 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 841 ms
[2025-06-01 11:06:35] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 26 ms.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 302 ms
[2025-06-01 11:06:36] [INFO ] Added : 99 causal constraints over 21 iterations in 918 ms. Result :sat
Minimization took 199 ms.
[2025-06-01 11:06:36] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2025-06-01 11:06:36] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 11:06:36] [INFO ] [Real]Added 91 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:06:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2025-06-01 11:06:36] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-01 11:06:36] [INFO ] [Nat]Added 91 Read/Feed constraints in 13 ms returned sat
[2025-06-01 11:06:36] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 27 ms.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 14 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 639 ms
[2025-06-01 11:06:37] [INFO ] Added : 101 causal constraints over 21 iterations in 1240 ms. Result :sat
Minimization took 172 ms.
[2025-06-01 11:06:38] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2025-06-01 11:06:38] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-01 11:06:38] [INFO ] [Real]Added 91 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:06:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2025-06-01 11:06:38] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-01 11:06:38] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 723 ms
[2025-06-01 11:06:39] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 20 ms.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2025-06-01 11:06:39] [INFO ] Added : 74 causal constraints over 15 iterations in 573 ms. Result :sat
Minimization took 202 ms.
[2025-06-01 11:06:40] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:40] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-01 11:06:40] [INFO ] [Real]Added 91 Read/Feed constraints in 14 ms returned sat
[2025-06-01 11:06:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2025-06-01 11:06:40] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 11:06:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 4 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:06:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1011 ms
[2025-06-01 11:06:41] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2025-06-01 11:06:41] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-01 11:06:41] [INFO ] [Real]Added 91 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:06:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:41] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-06-01 11:06:41] [INFO ] [Nat]Added 91 Read/Feed constraints in 14 ms returned sat
[2025-06-01 11:06:41] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 22 ms.
[2025-06-01 11:06:41] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 4, 6, 6] Max Struct:[7, 7, 7, 6, 7]
FORMULA LamportFastMutEx-PT-7-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 6, 5] Max Struct:[7, 7, 7]
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 36 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 219/219 places, 462/462 transitions.
[2025-06-01 11:06:42] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-01 11:06:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 6, 5] Max Struct:[7, 7, 7]
RANDOM walk for 1000000 steps (2 resets) in 2319 ms. (431 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 2448 ms. (1224 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 6] Max Struct:[7, 7, 7]
[2025-06-01 11:06:47] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-01 11:06:47] [INFO ] Invariant cache hit.
[2025-06-01 11:06:47] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2025-06-01 11:06:47] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-01 11:06:47] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-01 11:06:47] [INFO ] [Real]Added 91 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:06:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2025-06-01 11:06:47] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-01 11:06:47] [INFO ] [Nat]Added 91 Read/Feed constraints in 17 ms returned sat
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2025-06-01 11:06:47] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 3 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:06:48] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 22 trap constraints in 1604 ms
[2025-06-01 11:06:49] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2025-06-01 11:06:49] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-01 11:06:49] [INFO ] [Real]Added 91 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:06:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:49] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-01 11:06:49] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2025-06-01 11:06:49] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 23 ms.
[2025-06-01 11:06:49] [INFO ] Added : 98 causal constraints over 20 iterations in 544 ms. Result :sat
Minimization took 103 ms.
[2025-06-01 11:06:50] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2025-06-01 11:06:50] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-01 11:06:50] [INFO ] [Real]Added 91 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:06:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:50] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:50] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-01 11:06:50] [INFO ] [Nat]Added 91 Read/Feed constraints in 12 ms returned sat
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 915 ms
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 6] Max Struct:[6, 7, 6]
FORMULA LamportFastMutEx-PT-7-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 7 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 212 transition count 448
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 28 place count 205 transition count 448
Applied a total of 28 rules in 85 ms. Remains 205 /219 variables (removed 14) and now considering 448/462 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 205/219 places, 448/462 transitions.
[2025-06-01 11:06:51] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2025-06-01 11:06:51] [INFO ] Computed 65 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 2141 ms. (466 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 632 ms. (1579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2025-06-01 11:06:54] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-01 11:06:54] [INFO ] Invariant cache hit.
[2025-06-01 11:06:54] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2025-06-01 11:06:54] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-01 11:06:54] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-01 11:06:54] [INFO ] [Real]Added 91 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:06:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:54] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:54] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 11:06:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2025-06-01 11:06:54] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 23 ms.
[2025-06-01 11:06:55] [INFO ] Added : 58 causal constraints over 12 iterations in 292 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 7 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2025-06-01 11:06:55] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-01 11:06:55] [INFO ] Invariant cache hit.
[2025-06-01 11:06:55] [INFO ] Implicit Places using invariants in 231 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 233 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 258 ms. Remains : 198/205 places, 448/448 transitions.
[2025-06-01 11:06:55] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2025-06-01 11:06:55] [INFO ] Computed 58 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 2083 ms. (479 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 618 ms. (1615 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2025-06-01 11:06:58] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-01 11:06:58] [INFO ] Invariant cache hit.
[2025-06-01 11:06:58] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2025-06-01 11:06:58] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 11:06:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 11:06:58] [INFO ] [Real]Added 42 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:06:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:58] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2025-06-01 11:06:58] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-01 11:06:58] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2025-06-01 11:06:58] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 22 ms.
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:06:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2025-06-01 11:06:59] [INFO ] Added : 171 causal constraints over 35 iterations in 1059 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 19 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2025-06-01 11:06:59] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-01 11:06:59] [INFO ] Invariant cache hit.
[2025-06-01 11:07:00] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-01 11:07:00] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-01 11:07:00] [INFO ] Invariant cache hit.
[2025-06-01 11:07:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 11:07:00] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2025-06-01 11:07:00] [INFO ] Redundant transitions in 35 ms returned []
Running 441 sub problems to find dead transitions.
[2025-06-01 11:07:00] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-01 11:07:00] [INFO ] Invariant cache hit.
[2025-06-01 11:07:00] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 58/256 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2025-06-01 11:07:02] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 20/276 constraints. Problems are: Problem set: 7 solved, 434 unsolved
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/296 constraints. Problems are: Problem set: 16 solved, 425 unsolved
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 20/316 constraints. Problems are: Problem set: 26 solved, 415 unsolved
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/336 constraints. Problems are: Problem set: 30 solved, 411 unsolved
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/356 constraints. Problems are: Problem set: 32 solved, 409 unsolved
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/376 constraints. Problems are: Problem set: 34 solved, 407 unsolved
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD382 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 20/396 constraints. Problems are: Problem set: 38 solved, 403 unsolved
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:17] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:18] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:19] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:19] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:19] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:19] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD175 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/416 constraints. Problems are: Problem set: 40 solved, 401 unsolved
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 3 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 20/436 constraints. Problems are: Problem set: 42 solved, 399 unsolved
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:07:25] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:07:25] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:07:25] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 20/456 constraints. Problems are: Problem set: 42 solved, 399 unsolved
[2025-06-01 11:07:25] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:25] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 20/476 constraints. Problems are: Problem set: 42 solved, 399 unsolved
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
SMT process timed out in 30302ms, After SMT, problems are : Problem set: 42 solved, 399 unsolved
Search for dead transitions found 42 dead transitions in 30320ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/198 places, 406/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-01 11:07:30] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30896 ms. Remains : 198/198 places, 406/448 transitions.
[2025-06-01 11:07:30] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
// Phase 1: matrix 294 rows 198 cols
[2025-06-01 11:07:30] [INFO ] Computed 58 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 1959 ms. (510 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 605 ms. (1650 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2025-06-01 11:07:33] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:07:33] [INFO ] Invariant cache hit.
[2025-06-01 11:07:33] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2025-06-01 11:07:33] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-01 11:07:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 11:07:33] [INFO ] [Real]Added 35 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:07:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:07:33] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2025-06-01 11:07:33] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-01 11:07:33] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:07:33] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 18 ms.
[2025-06-01 11:07:34] [INFO ] Added : 96 causal constraints over 20 iterations in 415 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-01 11:07:34] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:07:34] [INFO ] Invariant cache hit.
[2025-06-01 11:07:34] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-01 11:07:34] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:07:34] [INFO ] Invariant cache hit.
[2025-06-01 11:07:34] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 11:07:34] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2025-06-01 11:07:34] [INFO ] Redundant transitions in 3 ms returned []
Running 399 sub problems to find dead transitions.
[2025-06-01 11:07:34] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:07:34] [INFO ] Invariant cache hit.
[2025-06-01 11:07:34] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 7/198 variables, 49/249 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:46] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:47] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:48] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:07:48] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:48] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:48] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:48] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:49] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:51] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 3 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:52] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:07:53] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:54] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:58] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 7 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:05] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 20/496 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/492 variables, and 496 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30032 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/198 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 240/240 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 173/373 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 7/198 variables, 49/422 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 7/429 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 67/496 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:08:08] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 20/536 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 20/576 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:18] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:19] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:19] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:19] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 20/596 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 20/616 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:22] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:08:22] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:22] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:22] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:22] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:08:23] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:24] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:08:24] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:08:24] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 20/656 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 20/676 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:31] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:08:32] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 20/696 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:32] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:33] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:33] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:08:33] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:08:33] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:33] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:33] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:08:33] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/492 variables, and 715 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30016 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/198 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/399 constraints, Known Traps: 459/459 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60790 ms. Remains : 198/198 places, 406/406 transitions.
RANDOM walk for 40000 steps (8 resets) in 773 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
[2025-06-01 11:08:35] [INFO ] Flatten gal took : 170 ms
[2025-06-01 11:08:35] [INFO ] Flatten gal took : 53 ms
[2025-06-01 11:08:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2348334879212519918.gal : 17 ms
[2025-06-01 11:08:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16715261693286891277.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2348334879212519918.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16715261693286891277.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16715261693286891277.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 50
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 56
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :56 after 65
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :65 after 78
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :78 after 216
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :216 after 1132
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1132 after 3248
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3248 after 18441
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18441 after 66653
Interrupted probabilistic random walk after 487401 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 2
Probabilistic random walk after 487401 steps, saw 226114 distinct states, run finished after 3004 ms. (steps per millisecond=162 ) properties seen :0
[2025-06-01 11:08:38] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:08:38] [INFO ] Invariant cache hit.
[2025-06-01 11:08:38] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/168 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/462 variables, 168/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 35/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/492 variables, 30/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 30/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/492 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 489 constraints, problems are : Problem set: 0 solved, 2 unsolved in 321 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/168 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/462 variables, 168/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 35/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/492 variables, 30/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 30/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:39] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 492 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1045 ms.
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 198/198 places, 406/406 transitions.
RANDOM walk for 40000 steps (8 resets) in 477 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :66653 after 366929
Interrupted probabilistic random walk after 505408 steps, run timeout after 3026 ms. (steps per millisecond=167 ) properties seen :0 out of 2
Probabilistic random walk after 505408 steps, saw 233430 distinct states, run finished after 3026 ms. (steps per millisecond=167 ) properties seen :0
[2025-06-01 11:08:43] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:08:43] [INFO ] Invariant cache hit.
[2025-06-01 11:08:43] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/168 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/462 variables, 168/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 35/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/492 variables, 30/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 30/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/492 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 489 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1687 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/168 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/462 variables, 168/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 35/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/492 variables, 30/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 30/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:45] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 492 constraints, problems are : Problem set: 0 solved, 2 unsolved in 514 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2216ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 984 ms.
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-01 11:08:46] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:08:46] [INFO ] Invariant cache hit.
[2025-06-01 11:08:47] [INFO ] Implicit Places using invariants in 594 ms returned []
[2025-06-01 11:08:47] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:08:47] [INFO ] Invariant cache hit.
[2025-06-01 11:08:47] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 11:08:47] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2025-06-01 11:08:47] [INFO ] Redundant transitions in 9 ms returned []
Running 399 sub problems to find dead transitions.
[2025-06-01 11:08:47] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:08:47] [INFO ] Invariant cache hit.
[2025-06-01 11:08:47] [INFO ] State equation strengthened by 35 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :366929 after 670068
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 7/198 variables, 49/249 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 5 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:08:53] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:08:55] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:03] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:09:03] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:03] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:03] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:03] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:09:03] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 10 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :670068 after 3.25256e+06
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:09:12] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:12] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:12] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:12] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:09:12] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:12] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:09:12] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:09:12] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:09:12] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:09:16] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/492 variables, and 476 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30027 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/198 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 220/220 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 155/355 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 7/198 variables, 49/404 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 65/476 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:21] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:22] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/496 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:23] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:09:23] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:23] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:23] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:23] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:24] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:25] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:09:25] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:09:25] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:09:25] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:09:25] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:25] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:09:25] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:25] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-06-01 11:09:26] [INFO ] Flatten gal took : 59 ms
[2025-06-01 11:09:26] [INFO ] Applying decomposition
[2025-06-01 11:09:26] [INFO ] Flatten gal took : 53 ms
[2025-06-01 11:09:26] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 1 ms to minimize.
[2025-06-01 11:09:26] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4285572859205994336.txt' '-o' '/tmp/graph4285572859205994336.bin' '-w' '/tmp/graph4285572859205994336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4285572859205994336.bin' '-l' '-1' '-v' '-w' '/tmp/graph4285572859205994336.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:09:26] [INFO ] Decomposing Gal with order
[2025-06-01 11:09:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:09:26] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 20 ms to minimize.
[2025-06-01 11:09:26] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2025-06-01 11:09:26] [INFO ] Removed a total of 577 redundant transitions.
[2025-06-01 11:09:26] [INFO ] Flatten gal took : 176 ms
[2025-06-01 11:09:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 33 ms.
[2025-06-01 11:09:26] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:09:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9977355011496939097.gal : 6 ms
[2025-06-01 11:09:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5330071325279364775.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9977355011496939097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5330071325279364775.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5330071325279364775.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 44
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :44 after 64
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :64 after 82
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :82 after 262
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :262 after 772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :772 after 1972
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1972 after 4238
[2025-06-01 11:09:27] [INFO ] Deduced a trap composed of 30 places in 798 ms of which 1 ms to minimize.
[2025-06-01 11:09:27] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 20 ms to minimize.
[2025-06-01 11:09:27] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:09:27] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:09:28] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4238 after 86013
[2025-06-01 11:09:28] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:09:28] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:09:28] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:09:28] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:09:28] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:09:28] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2025-06-01 11:09:28] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :86013 after 397480
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/536 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:29] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:09:29] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:29] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:29] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 8 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:30] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:09:31] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
[2025-06-01 11:09:31] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
SDD size :397480 after 1.62164e+06
[2025-06-01 11:09:31] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:31] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:09:31] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:31] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:32] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:32] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:32] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:09:32] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:32] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:09:32] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:09:32] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:09:32] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:32] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.62164e+06 after 1.39832e+07
[2025-06-01 11:09:33] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 20/576 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:34] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:09:34] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:34] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:09:34] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:34] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
[2025-06-01 11:09:34] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:09:35] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:09:35] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:09:35] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:09:35] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:35] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:09:35] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:35] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:09:35] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:09:36] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:09:36] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:36] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:36] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:09:36] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2025-06-01 11:09:36] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 20/596 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:37] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:09:37] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:09:37] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:09:37] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:09:37] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:09:38] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:39] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:39] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:39] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:09:39] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.39832e+07 after 7.71878e+07
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 20/616 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:09:46] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:09:46] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:09:47] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:09:47] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:09:47] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:09:47] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/492 variables, and 622 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30011 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/198 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/399 constraints, Known Traps: 366/366 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61253 ms. Remains : 198/198 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 198 transition count 294
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 112 place count 198 transition count 245
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 252 place count 107 transition count 245
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 280 place count 93 transition count 231
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 294 place count 86 transition count 273
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 86 transition count 273
Applied a total of 301 rules in 54 ms. Remains 86 /198 variables (removed 112) and now considering 273/406 (removed 133) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 273 rows 86 cols
[2025-06-01 11:09:48] [INFO ] Computed 16 invariants in 2 ms
[2025-06-01 11:09:48] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-01 11:09:48] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-01 11:09:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 11:09:48] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-01 11:09:48] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-01 11:09:48] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-01 11:09:48] [INFO ] Flatten gal took : 16 ms
[2025-06-01 11:09:48] [INFO ] Flatten gal took : 14 ms
[2025-06-01 11:09:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14591263193491436367.gal : 3 ms
[2025-06-01 11:09:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1632715460903532112.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14591263193491436367.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1632715460903532112.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1632715460903532112.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 113
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :113 after 186
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :186 after 1737
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1737 after 2550
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2550 after 29862
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :29862 after 115925
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :115925 after 1.15942e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.15942e+06 after 4.9509e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.9509e+06 after 3.35036e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3.35036e+07 after 7.80709e+07
Detected timeout of ITS tools.
[2025-06-01 11:10:03] [INFO ] Flatten gal took : 13 ms
[2025-06-01 11:10:03] [INFO ] Applying decomposition
[2025-06-01 11:10:03] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14367301854178085845.txt' '-o' '/tmp/graph14367301854178085845.bin' '-w' '/tmp/graph14367301854178085845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14367301854178085845.bin' '-l' '-1' '-v' '-w' '/tmp/graph14367301854178085845.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:10:03] [INFO ] Decomposing Gal with order
[2025-06-01 11:10:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:10:03] [INFO ] Removed a total of 373 redundant transitions.
[2025-06-01 11:10:03] [INFO ] Flatten gal took : 52 ms
[2025-06-01 11:10:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 6 ms.
[2025-06-01 11:10:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6675850328579427572.gal : 18 ms
[2025-06-01 11:10:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17927585516051480173.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6675850328579427572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17927585516051480173.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17927585516051480173.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 37
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :37 after 215
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :215 after 931
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :931 after 5385
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5385 after 14647
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :14647 after 81133
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :81133 after 4.38387e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,1.12348e+09,0.713748,22096,2,2957,15,85743,8,0,569,91354,0
Total reachable state count : 1123478698

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.718093,22096,2,87,15,85743,8,0,613,91354,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.723129,22096,2,87,15,85743,8,0,656,91354,0
Over-approximation ignoring read arcs solved 0 properties in 16635 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[6] Max Struct:[7]
Starting property specific reduction for LamportFastMutEx-PT-7-UpperBounds-01
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2025-06-01 11:10:04] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
// Phase 1: matrix 294 rows 198 cols
[2025-06-01 11:10:04] [INFO ] Computed 58 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2025-06-01 11:10:04] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:04] [INFO ] Invariant cache hit.
[2025-06-01 11:10:04] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2025-06-01 11:10:04] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-01 11:10:04] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 11:10:04] [INFO ] [Real]Added 35 Read/Feed constraints in 4 ms returned sat
[2025-06-01 11:10:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:10:04] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2025-06-01 11:10:04] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 11:10:04] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:10:04] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 22 ms.
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:10:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2025-06-01 11:10:05] [INFO ] Added : 100 causal constraints over 20 iterations in 676 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[7]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 198/198 places, 406/406 transitions.
[2025-06-01 11:10:06] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 1973 ms. (506 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 617 ms. (1618 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[7]
[2025-06-01 11:10:08] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:08] [INFO ] Invariant cache hit.
[2025-06-01 11:10:08] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2025-06-01 11:10:08] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-01 11:10:08] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 11:10:08] [INFO ] [Real]Added 35 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:10:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:10:08] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2025-06-01 11:10:08] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-01 11:10:08] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:10:08] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 19 ms.
[2025-06-01 11:10:09] [INFO ] Added : 117 causal constraints over 24 iterations in 527 ms. Result :sat
Minimization took 147 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-01 11:10:09] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:09] [INFO ] Invariant cache hit.
[2025-06-01 11:10:09] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-01 11:10:09] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:09] [INFO ] Invariant cache hit.
[2025-06-01 11:10:09] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 11:10:10] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2025-06-01 11:10:10] [INFO ] Redundant transitions in 3 ms returned []
Running 399 sub problems to find dead transitions.
[2025-06-01 11:10:10] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:10] [INFO ] Invariant cache hit.
[2025-06-01 11:10:10] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 7/198 variables, 49/249 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:10:21] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:22] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:25] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:25] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:10:25] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:10:25] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:25] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:25] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:10:25] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:10:25] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:10:26] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:10:27] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:30] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:31] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:31] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:34] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:10:35] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2025-06-01 11:10:35] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:10:35] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:35] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:35] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2025-06-01 11:10:35] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:35] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:35] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:37] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:10:37] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:39] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:39] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:10:39] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:39] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:39] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:10:39] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:39] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:39] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:39] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:40] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:10:40] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:10:40] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:10:40] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:40] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:40] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
SMT process timed out in 30221ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 30229ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30733 ms. Remains : 198/198 places, 406/406 transitions.
[2025-06-01 11:10:40] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 1975 ms. (506 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 613 ms. (1628 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2025-06-01 11:10:43] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:43] [INFO ] Invariant cache hit.
[2025-06-01 11:10:43] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2025-06-01 11:10:43] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-01 11:10:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 11:10:43] [INFO ] [Real]Added 35 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:10:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:10:43] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2025-06-01 11:10:43] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-01 11:10:43] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:10:43] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 17 ms.
[2025-06-01 11:10:43] [INFO ] Added : 96 causal constraints over 20 iterations in 445 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[7]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-01 11:10:44] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:44] [INFO ] Invariant cache hit.
[2025-06-01 11:10:44] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-01 11:10:44] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:44] [INFO ] Invariant cache hit.
[2025-06-01 11:10:44] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-01 11:10:44] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2025-06-01 11:10:44] [INFO ] Redundant transitions in 3 ms returned []
Running 399 sub problems to find dead transitions.
[2025-06-01 11:10:44] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:10:44] [INFO ] Invariant cache hit.
[2025-06-01 11:10:44] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 7/198 variables, 49/249 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:58] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:58] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:10:58] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:10:58] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:10:59] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:10:59] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:11:00] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:11:01] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2025-06-01 11:11:13] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:11:13] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:11:14] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:11:14] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:11:14] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:11:14] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:11:14] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:11:14] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:11:14] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:11:14] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 30181ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30692 ms. Remains : 198/198 places, 406/406 transitions.
[2025-06-01 11:11:14] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-01 11:11:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[7]
FORMULA LamportFastMutEx-PT-7-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1768 ms. (565 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 11:11:16] [INFO ] Flatten gal took : 22 ms
[2025-06-01 11:11:16] [INFO ] Flatten gal took : 17 ms
[2025-06-01 11:11:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13144207629668949629.gal : 4 ms
[2025-06-01 11:11:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality955482954561829481.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13144207629668949629.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality955482954561829481.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for LamportFastMutEx-PT-7-UpperBounds-01 in 71922 ms.
[2025-06-01 11:11:16] [INFO ] Flatten gal took : 16 ms
Total runtime 283249 ms.

BK_STOP 1748776276664

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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