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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 44K 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-COL-8-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748775908160

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-01 11:05:09] [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:05:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:05:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 11:05:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 11:05:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 561 ms
[2025-06-01 11:05:10] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-01 11:05:10] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2025-06-01 11:05:10] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2025-06-01 11:05:10] [INFO ] Computed 2 invariants in 11 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[8, 0, 1, 0, 0, 0, 0, 8, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 1, 8, 8, 8, 8, 8, 8, 1, 64, 8, 8, 8, 64, 8]
FORMULA LamportFastMutEx-COL-8-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-01 11:05:10] [INFO ] Invariant cache hit.
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-06-01 11:05:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 11:05:10] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:05:10] [INFO ] Added : 4 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2025-06-01 11:05:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:05:10] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 3 ms.
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:10] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:10] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:10] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:10] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:05:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:10] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:10] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:05:10] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 11:05:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:11] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:05:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:11] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 9 ms.
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:11] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:05:11] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:05:11] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:05:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:05:11] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:05:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:05:11] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:05:11] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:05:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:05:11] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 8, 8, 64, 8]
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 11:05:11] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 31 ms.
[2025-06-01 11:05:11] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 82 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 8, 8, 64, 8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 8, 8, 64, 8]
[2025-06-01 11:05:11] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2025-06-01 11:05:11] [INFO ] Computed 82 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 64, 8, 8, 8, 64, 8]
RANDOM walk for 10000 steps (2 resets) in 74 ms. (133 steps per ms)
FORMULA LamportFastMutEx-COL-8-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 186 ms. (534 steps per ms)
FORMULA LamportFastMutEx-COL-8-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[5, 2, 7, 7, 5, 56, 1, 3, 52] Max Struct:[8, 8, 8, 8, 8, 64, 8, 8, 64]
[2025-06-01 11:05:11] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-01 11:05:11] [INFO ] Invariant cache hit.
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2025-06-01 11:05:12] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-01 11:05:12] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:05:12] [INFO ] [Real]Added 112 Read/Feed constraints in 15 ms returned sat
[2025-06-01 11:05:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:12] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-01 11:05:12] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-06-01 11:05:12] [INFO ] [Nat]Added 112 Read/Feed constraints in 15 ms returned sat
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 17 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 708 ms
[2025-06-01 11:05:12] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 33 ms.
[2025-06-01 11:05:13] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2025-06-01 11:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2025-06-01 11:05:13] [INFO ] Added : 38 causal constraints over 8 iterations in 442 ms. Result :sat
Minimization took 139 ms.
[2025-06-01 11:05:13] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-01 11:05:13] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-06-01 11:05:13] [INFO ] [Real]Added 112 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:05:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:13] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-01 11:05:13] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-01 11:05:13] [INFO ] [Nat]Added 112 Read/Feed constraints in 27 ms returned sat
[2025-06-01 11:05:13] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 33 ms.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 560 ms
[2025-06-01 11:05:15] [INFO ] Added : 93 causal constraints over 20 iterations in 1165 ms. Result :sat
Minimization took 147 ms.
[2025-06-01 11:05:15] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-01 11:05:15] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-01 11:05:15] [INFO ] [Real]Added 112 Read/Feed constraints in 15 ms returned sat
[2025-06-01 11:05:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:15] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2025-06-01 11:05:15] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-01 11:05:15] [INFO ] [Nat]Added 112 Read/Feed constraints in 36 ms returned sat
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 1626 ms
[2025-06-01 11:05:17] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-01 11:05:17] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-01 11:05:17] [INFO ] [Real]Added 112 Read/Feed constraints in 18 ms returned sat
[2025-06-01 11:05:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:17] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-01 11:05:17] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-01 11:05:17] [INFO ] [Nat]Added 112 Read/Feed constraints in 33 ms returned sat
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 7 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 2098 ms
[2025-06-01 11:05:19] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2025-06-01 11:05:19] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-01 11:05:19] [INFO ] [Real]Added 112 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:05:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:19] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-01 11:05:20] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-06-01 11:05:20] [INFO ] [Nat]Added 112 Read/Feed constraints in 27 ms returned sat
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 8 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 660 ms
[2025-06-01 11:05:20] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 34 ms.
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2025-06-01 11:05:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 426 ms
[2025-06-01 11:05:21] [INFO ] Added : 136 causal constraints over 29 iterations in 1246 ms. Result :sat
Minimization took 217 ms.
[2025-06-01 11:05:22] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-01 11:05:22] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-01 11:05:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:22] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-01 11:05:22] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-06-01 11:05:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 147 ms returned sat
[2025-06-01 11:05:22] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:05:22] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:05:22] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:05:23] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:05:24] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 1732 ms
[2025-06-01 11:05:24] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2025-06-01 11:05:24] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-01 11:05:24] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2025-06-01 11:05:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:24] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-01 11:05:24] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-01 11:05:24] [INFO ] [Nat]Added 112 Read/Feed constraints in 24 ms returned sat
[2025-06-01 11:05:24] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 45 ms.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1233 ms
[2025-06-01 11:05:26] [INFO ] Added : 107 causal constraints over 22 iterations in 1878 ms. Result :sat
Minimization took 212 ms.
[2025-06-01 11:05:26] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2025-06-01 11:05:27] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-06-01 11:05:27] [INFO ] [Real]Added 112 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:05:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:27] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-01 11:05:27] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-01 11:05:27] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 774 ms
[2025-06-01 11:05:28] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 35 ms.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2025-06-01 11:05:28] [INFO ] Added : 26 causal constraints over 6 iterations in 398 ms. Result :sat
Minimization took 126 ms.
[2025-06-01 11:05:28] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2025-06-01 11:05:28] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-06-01 11:05:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:28] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2025-06-01 11:05:28] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-06-01 11:05:28] [INFO ] [Nat]Added 112 Read/Feed constraints in 98 ms returned sat
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:05:29] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:05:30] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:05:30] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:05:30] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:05:30] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:05:30] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:05:30] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:05:31] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:05:31] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2078 ms
[2025-06-01 11:05:31] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 26 ms.
[2025-06-01 11:05:31] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:05:32] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:05:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2025-06-01 11:05:32] [INFO ] Added : 130 causal constraints over 26 iterations in 1022 ms. Result :sat
Minimization took 463 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 2, 7, 7, 5, 56, 1, 3, 52] Max Struct:[8, 8, 7, 7, 8, 64, 8, 8, 64]
FORMULA LamportFastMutEx-COL-8-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 6, 5, 56, 1, 5, 52] Max Struct:[8, 8, 8, 64, 8, 8, 64]
Support contains 168 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 29 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 266/266 places, 584/584 transitions.
[2025-06-01 11:05:34] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-01 11:05:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 6, 5, 56, 1, 5, 52] Max Struct:[8, 8, 8, 64, 8, 8, 64]
RANDOM walk for 1000000 steps (2 resets) in 4448 ms. (224 steps per ms)
FORMULA LamportFastMutEx-COL-8-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000004 steps (12 resets) in 6633 ms. (904 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 7, 56, 1, 7, 56] Max Struct:[8, 8, 64, 8, 8, 64]
[2025-06-01 11:05:45] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-01 11:05:45] [INFO ] Invariant cache hit.
[2025-06-01 11:05:45] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-01 11:05:46] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-01 11:05:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:05:46] [INFO ] [Real]Added 112 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:05:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:46] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-01 11:05:46] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-01 11:05:46] [INFO ] [Nat]Added 112 Read/Feed constraints in 20 ms returned sat
[2025-06-01 11:05:46] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:05:46] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:05:46] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:05:46] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2025-06-01 11:05:46] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:05:46] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:05:46] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2025-06-01 11:05:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1639 ms
[2025-06-01 11:05:47] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2025-06-01 11:05:48] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-01 11:05:48] [INFO ] [Real]Added 112 Read/Feed constraints in 33 ms returned sat
[2025-06-01 11:05:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:48] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-01 11:05:48] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-01 11:05:48] [INFO ] [Nat]Added 112 Read/Feed constraints in 45 ms returned sat
[2025-06-01 11:05:48] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:05:48] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2025-06-01 11:05:48] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2025-06-01 11:05:48] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:05:48] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:05:48] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:05:48] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
[2025-06-01 11:05:48] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:05:49] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:05:49] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:05:49] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:05:49] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:05:49] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:05:49] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:49] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:05:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1101 ms
[2025-06-01 11:05:49] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2025-06-01 11:05:49] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-01 11:05:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:49] [INFO ] [Nat]Absence check using 82 positive place invariants in 19 ms returned sat
[2025-06-01 11:05:49] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-01 11:05:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 150 ms returned sat
[2025-06-01 11:05:49] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:05:51] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:05:51] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:05:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 2350 ms
[2025-06-01 11:05:52] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2025-06-01 11:05:52] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-06-01 11:05:52] [INFO ] [Real]Added 112 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:05:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:52] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2025-06-01 11:05:52] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-01 11:05:52] [INFO ] [Nat]Added 112 Read/Feed constraints in 24 ms returned sat
[2025-06-01 11:05:52] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 28 ms.
[2025-06-01 11:05:53] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:05:53] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:05:53] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:05:53] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:05:53] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:05:53] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:05:53] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:05:54] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:05:54] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:05:54] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:05:54] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:05:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1213 ms
[2025-06-01 11:05:54] [INFO ] Added : 107 causal constraints over 22 iterations in 1861 ms. Result :sat
Minimization took 206 ms.
[2025-06-01 11:05:54] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2025-06-01 11:05:54] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-06-01 11:05:54] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2025-06-01 11:05:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:54] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2025-06-01 11:05:54] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-01 11:05:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 18 ms returned sat
[2025-06-01 11:05:55] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:05:55] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:05:55] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:05:55] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:05:55] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:05:55] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:05:55] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:05:55] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:05:55] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:05:56] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:05:56] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:05:56] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:05:56] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:05:56] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:05:56] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:05:56] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2025-06-01 11:05:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1643 ms
[2025-06-01 11:05:56] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2025-06-01 11:05:56] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-06-01 11:05:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:05:56] [INFO ] [Nat]Absence check using 82 positive place invariants in 19 ms returned sat
[2025-06-01 11:05:56] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-06-01 11:05:57] [INFO ] [Nat]Added 112 Read/Feed constraints in 101 ms returned sat
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2025-06-01 11:05:57] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2025-06-01 11:05:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1214 ms
Current structural bounds on expressions (after SMT) : Max Seen:[7, 7, 56, 1, 7, 56] Max Struct:[7, 7, 56, 8, 7, 56]
FORMULA LamportFastMutEx-COL-8-UpperBounds-14 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-10 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 250 transition count 568
Applied a total of 32 rules in 70 ms. Remains 250 /266 variables (removed 16) and now considering 568/584 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 250/266 places, 568/584 transitions.
[2025-06-01 11:05:58] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2025-06-01 11:05:58] [INFO ] Computed 82 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2366 ms. (422 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 718 ms. (1390 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-01 11:06:01] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-01 11:06:01] [INFO ] Invariant cache hit.
[2025-06-01 11:06:01] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2025-06-01 11:06:01] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-01 11:06:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:06:01] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2025-06-01 11:06:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:01] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2025-06-01 11:06:01] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-06-01 11:06:01] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2025-06-01 11:06:02] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2025-06-01 11:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2025-06-01 11:06:02] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 28 ms.
[2025-06-01 11:06:02] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:06:02] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:06:02] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:06:02] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:06:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:06:02] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:06:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 420 ms
[2025-06-01 11:06:03] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:06:03] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:06:03] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:06:03] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:06:03] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:06:03] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:06:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 825 ms
[2025-06-01 11:06:03] [INFO ] Added : 54 causal constraints over 15 iterations in 1682 ms. Result :sat
Minimization took 172 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 20 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2025-06-01 11:06:04] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-01 11:06:04] [INFO ] Invariant cache hit.
[2025-06-01 11:06:04] [INFO ] Implicit Places using invariants in 260 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 269 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 298 ms. Remains : 242/250 places, 568/568 transitions.
[2025-06-01 11:06:04] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2025-06-01 11:06:04] [INFO ] Computed 74 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2198 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 696 ms. (1434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-01 11:06:07] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-01 11:06:07] [INFO ] Invariant cache hit.
[2025-06-01 11:06:07] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:07] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-06-01 11:06:07] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-01 11:06:07] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:06:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:07] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2025-06-01 11:06:07] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-01 11:06:07] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:06:07] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2025-06-01 11:06:07] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:06:07] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2025-06-01 11:06:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 342 ms
[2025-06-01 11:06:07] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 25 ms.
[2025-06-01 11:06:08] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:06:08] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2025-06-01 11:06:08] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2025-06-01 11:06:09] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:06:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:06:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:06:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 463 ms
[2025-06-01 11:06:09] [INFO ] Added : 138 causal constraints over 28 iterations in 1302 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2025-06-01 11:06:09] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-01 11:06:09] [INFO ] Invariant cache hit.
[2025-06-01 11:06:09] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-01 11:06:09] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-01 11:06:09] [INFO ] Invariant cache hit.
[2025-06-01 11:06:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-01 11:06:10] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2025-06-01 11:06:10] [INFO ] Redundant transitions in 28 ms returned []
Running 560 sub problems to find dead transitions.
[2025-06-01 11:06:10] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-01 11:06:10] [INFO ] Invariant cache hit.
[2025-06-01 11:06:10] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2025-06-01 11:06:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:06:13] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:06:13] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:06:13] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:06:13] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 4 ms to minimize.
[2025-06-01 11:06:13] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:06:13] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:06:14] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:06:14] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:06:14] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:06:14] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:06:14] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2025-06-01 11:06:14] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:06:14] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:06:14] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:06:15] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:06:15] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:06:15] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2025-06-01 11:06:15] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:06:15] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 4 solved, 556 unsolved
[2025-06-01 11:06:15] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:06:15] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:06:15] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 11 ms to minimize.
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:06:16] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 9 solved, 551 unsolved
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:06:17] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2025-06-01 11:06:18] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:06:18] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:06:18] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:06:18] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 1 ms to minimize.
[2025-06-01 11:06:18] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:06:18] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:06:19] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:06:19] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:06:19] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:06:19] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2025-06-01 11:06:19] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:06:19] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:06:19] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2025-06-01 11:06:19] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:06:20] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:06:20] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 19 solved, 541 unsolved
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:06:22] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:06:23] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:06:24] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:06:25] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD484 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 23 solved, 537 unsolved
[2025-06-01 11:06:25] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:06:25] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 1 ms to minimize.
[2025-06-01 11:06:25] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:06:26] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:06:27] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:06:28] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD492 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 29 solved, 531 unsolved
[2025-06-01 11:06:28] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:06:28] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:06:28] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:06:28] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:06:28] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2025-06-01 11:06:29] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:06:29] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:06:29] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:06:29] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2025-06-01 11:06:29] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:06:29] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:06:29] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:06:30] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
Problem TDEAD142 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 33 solved, 527 unsolved
[2025-06-01 11:06:33] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:06:33] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2025-06-01 11:06:33] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 1 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:06:34] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:06:35] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD490 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 39 solved, 521 unsolved
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:06:36] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:06:37] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:06:38] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD494 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/234 constraints. Problems are: Problem set: 41 solved, 519 unsolved
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:06:39] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:06:40] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
SMT process timed out in 30457ms, After SMT, problems are : Problem set: 41 solved, 519 unsolved
Search for dead transitions found 41 dead transitions in 30474ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) removed 41 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/242 places, 527/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2025-06-01 11:06:40] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31124 ms. Remains : 242/242 places, 527/568 transitions.
[2025-06-01 11:06:40] [INFO ] Flow matrix only has 373 transitions (discarded 154 similar events)
// Phase 1: matrix 373 rows 242 cols
[2025-06-01 11:06:40] [INFO ] Computed 74 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2119 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 711 ms. (1404 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-01 11:06:43] [INFO ] Flow matrix only has 373 transitions (discarded 154 similar events)
[2025-06-01 11:06:43] [INFO ] Invariant cache hit.
[2025-06-01 11:06:43] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:43] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-06-01 11:06:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 11:06:43] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:06:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:06:43] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2025-06-01 11:06:43] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-01 11:06:43] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:06:44] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:06:44] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:06:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2025-06-01 11:06:44] [INFO ] Computed and/alt/rep : 253/1399/253 causal constraints (skipped 112 transitions) in 22 ms.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:06:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2025-06-01 11:06:45] [INFO ] Added : 148 causal constraints over 30 iterations in 1050 ms. Result :sat
Minimization took 233 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 527/527 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 527/527 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 527/527 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 527/527 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2025-06-01 11:06:45] [INFO ] Flow matrix only has 373 transitions (discarded 154 similar events)
[2025-06-01 11:06:45] [INFO ] Invariant cache hit.
[2025-06-01 11:06:45] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-01 11:06:45] [INFO ] Flow matrix only has 373 transitions (discarded 154 similar events)
[2025-06-01 11:06:45] [INFO ] Invariant cache hit.
[2025-06-01 11:06:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 11:06:46] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2025-06-01 11:06:46] [INFO ] Redundant transitions in 20 ms returned []
Running 519 sub problems to find dead transitions.
[2025-06-01 11:06:46] [INFO ] Flow matrix only has 373 transitions (discarded 154 similar events)
[2025-06-01 11:06:46] [INFO ] Invariant cache hit.
[2025-06-01 11:06:46] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:06:50] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 12 places in 67 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 ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2025-06-01 11:06:51] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:06:52] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:06:54] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:06:55] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
Problem TDEAD137 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 2 solved, 517 unsolved
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2025-06-01 11:06:56] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:06:57] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:06:58] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:06:58] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:06:58] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:06:58] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:06:58] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:06:58] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:06:58] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:06:58] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:06:58] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 2 solved, 517 unsolved
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:06:59] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:07:00] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:07:01] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 4 solved, 515 unsolved
[2025-06-01 11:07:03] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2025-06-01 11:07:04] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 4 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:07:05] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 4 solved, 515 unsolved
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:07:06] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 4 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:07:07] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 4 solved, 515 unsolved
[2025-06-01 11:07:08] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:07:09] [INFO ] Deduced a trap composed of 35 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 74 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:07:10] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:07:11] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 4 solved, 515 unsolved
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:07:13] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:07:14] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:07:15] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/234 constraints. Problems are: Problem set: 4 solved, 515 unsolved
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:07:16] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/615 variables, and 236 constraints, problems are : Problem set: 4 solved, 515 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 162/162 constraints]
Escalating to Integer solving :Problem set: 4 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 4 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 115/125 constraints. Problems are: Problem set: 4 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/125 constraints. Problems are: Problem set: 4 solved, 515 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/189 constraints. Problems are: Problem set: 4 solved, 515 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 47/236 constraints. Problems are: Problem set: 4 solved, 515 unsolved
[2025-06-01 11:07:19] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2025-06-01 11:07:20] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:07:21] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/256 constraints. Problems are: Problem set: 4 solved, 515 unsolved
[2025-06-01 11:07:22] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:07:23] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:24] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2025-06-01 11:07:25] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:07:25] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:07:25] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/276 constraints. Problems are: Problem set: 6 solved, 513 unsolved
[2025-06-01 11:07:25] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:07:26] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:07:27] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:07:28] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/296 constraints. Problems are: Problem set: 6 solved, 513 unsolved
[2025-06-01 11:07:28] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:07:28] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:07:29] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:07:29] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:07:29] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:07:29] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:07:29] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:07:29] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:07:29] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:07:29] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:07:30] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:07:31] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/316 constraints. Problems are: Problem set: 6 solved, 513 unsolved
[2025-06-01 11:07:31] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2025-06-01 11:07:31] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:07:32] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:07:32] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:07:32] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:07:32] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:07:32] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:07:32] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:07:32] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:07:32] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:07:32] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:07:33] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 6 solved, 513 unsolved
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 1 ms to minimize.
[2025-06-01 11:07:34] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:07:35] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:07:35] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:07:35] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:07:35] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:07:35] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:07:35] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:07:35] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:07:35] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:07:35] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:07:36] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:07:36] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:07:36] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:07:36] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:07:36] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:07:36] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:07:36] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 6 solved, 513 unsolved
[2025-06-01 11:07:37] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2025-06-01 11:07:37] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:07:37] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:07:37] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:07:37] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2025-06-01 11:07:38] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:07:38] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:07:38] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:07:38] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:07:38] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:07:38] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:07:38] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:07:38] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:07:38] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:07:39] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 6 solved, 513 unsolved
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:07:40] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:07:41] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:07:42] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:07:42] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:07:42] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:07:42] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2025-06-01 11:07:42] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:07:42] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 6 solved, 513 unsolved
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:07:43] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:07:44] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:07:45] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 6 solved, 513 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/615 variables, and 416 constraints, problems are : Problem set: 6 solved, 513 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 0/519 constraints, Known Traps: 342/342 constraints]
After SMT, in 60313ms problems are : Problem set: 6 solved, 513 unsolved
Search for dead transitions found 6 dead transitions in 60320ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/242 places, 521/527 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2025-06-01 11:07:46] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60950 ms. Remains : 242/242 places, 521/527 transitions.
[2025-06-01 11:07:46] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
// Phase 1: matrix 368 rows 242 cols
[2025-06-01 11:07:46] [INFO ] Computed 74 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2101 ms. (475 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 690 ms. (1447 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-01 11:07:49] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:07:49] [INFO ] Invariant cache hit.
[2025-06-01 11:07:49] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2025-06-01 11:07:49] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-01 11:07:49] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-01 11:07:49] [INFO ] [Real]Added 39 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:07:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:07:49] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2025-06-01 11:07:49] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-06-01 11:07:49] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:07:49] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:07:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-06-01 11:07:49] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 28 ms.
[2025-06-01 11:07:50] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2025-06-01 11:07:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2025-06-01 11:07:50] [INFO ] Added : 88 causal constraints over 18 iterations in 643 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2025-06-01 11:07:50] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:07:50] [INFO ] Invariant cache hit.
[2025-06-01 11:07:50] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-01 11:07:50] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:07:50] [INFO ] Invariant cache hit.
[2025-06-01 11:07:51] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-01 11:07:51] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2025-06-01 11:07:51] [INFO ] Redundant transitions in 8 ms returned []
Running 513 sub problems to find dead transitions.
[2025-06-01 11:07:51] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:07:51] [INFO ] Invariant cache hit.
[2025-06-01 11:07:51] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:07:55] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:07:56] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:07:57] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:07:59] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2025-06-01 11:08:00] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2025-06-01 11:08:01] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
[2025-06-01 11:08:02] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:08:03] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:04] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:05] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:08:05] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:08:05] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:08:05] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:08:05] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:08:05] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:08:05] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:08:05] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:08:06] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:08:06] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:08:06] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:08:06] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:08:06] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 1 ms to minimize.
[2025-06-01 11:08:06] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:08:06] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:08:06] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:08:07] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2025-06-01 11:08:07] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:08:07] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:08:09] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:08:10] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:08:11] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:08:12] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:08:13] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 2 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 2 ms to minimize.
[2025-06-01 11:08:14] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:08:15] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 1 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2025-06-01 11:08:16] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2025-06-01 11:08:17] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 12 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2025-06-01 11:08:20] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:08:21] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 30310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30907 ms. Remains : 242/242 places, 521/521 transitions.
RANDOM walk for 40000 steps (8 resets) in 812 ms. (49 steps per ms) remains 2/2 properties
[2025-06-01 11:08:22] [INFO ] Flatten gal took : 158 ms
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2025-06-01 11:08:22] [INFO ] Flatten gal took : 80 ms
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
[2025-06-01 11:08:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12817227395916806010.gal : 67 ms
[2025-06-01 11:08:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14088451307018914792.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/ReachabilityCardinality12817227395916806010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14088451307018914792.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 ...330
Loading property file /tmp/ReachabilityCardinality14088451307018914792.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 152
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :152 after 748
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :748 after 1562
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1562 after 3261
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3261 after 10946
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :10946 after 69791
Interrupted probabilistic random walk after 437688 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 2
Probabilistic random walk after 437688 steps, saw 229896 distinct states, run finished after 3004 ms. (steps per millisecond=145 ) properties seen :0
[2025-06-01 11:08:25] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:08:25] [INFO ] Invariant cache hit.
[2025-06-01 11:08:25] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/610 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 355 constraints, problems are : Problem set: 0 solved, 2 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:08:25] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2025-06-01 11:08:26] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 15/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:27] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :69791 after 173501
[2025-06-01 11:08:28] [INFO ] Deduced a trap composed of 48 places in 584 ms of which 2 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 48 places in 940 ms of which 2 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 1 ms to minimize.
[2025-06-01 11:08:29] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:08:30] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
SMT process timed out in 5273ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 521/521 transitions.
RANDOM walk for 40000 steps (8 resets) in 374 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 490895 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 2
Probabilistic random walk after 490895 steps, saw 257008 distinct states, run finished after 3002 ms. (steps per millisecond=163 ) properties seen :0
[2025-06-01 11:08:33] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:08:33] [INFO ] Invariant cache hit.
[2025-06-01 11:08:33] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/610 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 355 constraints, problems are : Problem set: 0 solved, 2 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:08:34] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 15/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:35] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:36] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:08:36] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2025-06-01 11:08:36] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2025-06-01 11:08:36] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:08:36] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 2 ms to minimize.
[2025-06-01 11:08:36] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 2 ms to minimize.
[2025-06-01 11:08:36] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:08:37] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:08:37] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2025-06-01 11:08:37] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2025-06-01 11:08:37] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 1 ms to minimize.
[2025-06-01 11:08:37] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:08:37] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 13/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:37] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:08:37] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2025-06-01 11:08:38] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-06-01 11:08:38] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
SDD size :173501 after 2.8854e+06
[2025-06-01 11:08:38] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2025-06-01 11:08:38] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:08:38] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:08:38] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:08:38] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:08:38] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:08:38] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:08:39] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:08:39] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:08:39] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:08:39] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:08:39] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:08:39] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:08:39] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2025-06-01 11:08:39] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:08:40] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/610 variables, 20/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:40] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:08:40] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:08:40] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:08:40] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:08:40] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:08:40] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:08:40] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:08:41] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:08:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/610 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:41] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2025-06-01 11:08:41] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2025-06-01 11:08:41] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:08:41] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:08:41] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 2 ms to minimize.
[2025-06-01 11:08:42] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:08:42] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2025-06-01 11:08:42] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2025-06-01 11:08:42] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/610 variables, 9/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:42] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/610 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/610 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:42] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:08:42] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:08:42] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/610 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:43] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 1 ms to minimize.
[2025-06-01 11:08:43] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:08:43] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 1 ms to minimize.
[2025-06-01 11:08:43] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/610 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:43] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2025-06-01 11:08:43] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:08:44] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/610 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:44] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/610 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/610 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:44] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/610 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:44] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/610 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:08:44] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:08:44] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:08:44] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:08:44] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/610 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/610 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/610 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 442 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11129 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 85/85 constraints]
After SMT, in 11399ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 463 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2025-06-01 11:08:45] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:08:45] [INFO ] Invariant cache hit.
[2025-06-01 11:08:45] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-01 11:08:45] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:08:45] [INFO ] Invariant cache hit.
[2025-06-01 11:08:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-01 11:08:46] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2025-06-01 11:08:46] [INFO ] Redundant transitions in 3 ms returned []
Running 513 sub problems to find dead transitions.
[2025-06-01 11:08:46] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:08:46] [INFO ] Invariant cache hit.
[2025-06-01 11:08:46] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:50] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:08:50] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:08:50] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:08:51] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:08:52] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.8854e+06 after 5.3903e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:08:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2025-06-01 11:08:55] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:08:55] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:08:55] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:08:55] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:08:55] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:08:55] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:08:56] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:08:57] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:08:58] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:08:59] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:09:00] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:09:01] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:09:03] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:09:03] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:09:04] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:09:05] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:09:06] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:09:07] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:09:08] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:09:09] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:09:09] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2025-06-01 11:09:09] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:09:09] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:09:09] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:09:09] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:09:09] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:09:10] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:09:11] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-01 11:09:12] [INFO ] Flatten gal took : 55 ms
[2025-06-01 11:09:12] [INFO ] Applying decomposition
[2025-06-01 11:09:12] [INFO ] Flatten gal took : 34 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/graph705412209878958626.txt' '-o' '/tmp/graph705412209878958626.bin' '-w' '/tmp/graph705412209878958626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph705412209878958626.bin' '-l' '-1' '-v' '-w' '/tmp/graph705412209878958626.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:09:12] [INFO ] Decomposing Gal with order
[2025-06-01 11:09:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:09:12] [INFO ] Removed a total of 633 redundant transitions.
[2025-06-01 11:09:12] [INFO ] Flatten gal took : 111 ms
[2025-06-01 11:09:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 22 ms.
[2025-06-01 11:09:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4779857700617927115.gal : 7 ms
[2025-06-01 11:09:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4234029191594289773.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/ReachabilityCardinality4779857700617927115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4234029191594289773.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/ReachabilityCardinality4234029191594289773.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 39
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :39 after 70
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :70 after 106
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :106 after 742
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :742 after 1759
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 513 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1759 after 3146
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 4 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:09:13] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3146 after 30928
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2025-06-01 11:09:14] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :30928 after 60659
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:09:15] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:09:16] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 8 ms to minimize.
[2025-06-01 11:09:16] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30390ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 30400ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31004 ms. Remains : 242/242 places, 521/521 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 242 transition count 368
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 153 place count 242 transition count 304
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 337 place count 122 transition count 304
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 353 place count 114 transition count 296
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 369 place count 106 transition count 352
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 377 place count 106 transition count 344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 385 place count 98 transition count 344
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 393 place count 98 transition count 344
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 401 place count 98 transition count 344
Applied a total of 401 rules in 106 ms. Remains 98 /242 variables (removed 144) and now considering 344/521 (removed 177) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 344 rows 98 cols
[2025-06-01 11:09:16] [INFO ] Computed 18 invariants in 2 ms
[2025-06-01 11:09:16] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2025-06-01 11:09:16] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-01 11:09:16] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2025-06-01 11:09:16] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-01 11:09:16] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-01 11:09:17] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-01 11:09:17] [INFO ] Flatten gal took : 31 ms
[2025-06-01 11:09:17] [INFO ] Flatten gal took : 16 ms
[2025-06-01 11:09:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3291710740049111155.gal : 5 ms
[2025-06-01 11:09:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2828900404033632769.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/ReachabilityCardinality3291710740049111155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2828900404033632769.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/ReachabilityCardinality2828900404033632769.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 14
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 139
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :139 after 157
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :157 after 216
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :216 after 1687
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1687 after 2373
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2373 after 7520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7520 after 19016
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :19016 after 283656
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :283656 after 1.82673e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.82673e+06 after 4.11974e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :60659 after 254048
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.11974e+06 after 1.768e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.768e+07 after 4.24177e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :254048 after 2.79135e+06
Detected timeout of ITS tools.
[2025-06-01 11:09:32] [INFO ] Flatten gal took : 15 ms
[2025-06-01 11:09:32] [INFO ] Applying decomposition
[2025-06-01 11:09:32] [INFO ] Flatten gal took : 14 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/graph7169795672754994906.txt' '-o' '/tmp/graph7169795672754994906.bin' '-w' '/tmp/graph7169795672754994906.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7169795672754994906.bin' '-l' '-1' '-v' '-w' '/tmp/graph7169795672754994906.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:09:32] [INFO ] Decomposing Gal with order
[2025-06-01 11:09:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:09:32] [INFO ] Removed a total of 403 redundant transitions.
[2025-06-01 11:09:32] [INFO ] Flatten gal took : 57 ms
[2025-06-01 11:09:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 332 labels/synchronizations in 22 ms.
[2025-06-01 11:09:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14776229650428091231.gal : 3 ms
[2025-06-01 11:09:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7904381290484451567.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/ReachabilityCardinality14776229650428091231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7904381290484451567.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/ReachabilityCardinality7904381290484451567.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 25
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :25 after 39
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 282
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :282 after 786
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :786 after 5093
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5093 after 112306
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :112306 after 2.83856e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.83856e+06 after 2.02507e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.02507e+07 after 1.64315e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.64315e+08 after 4.23298e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.23298e+08 after 2.29592e+09
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.79135e+06 after 4.84974e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30855 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:[1] Max Struct:[8]
Starting property specific reduction for LamportFastMutEx-COL-8-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2025-06-01 11:09:47] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
// Phase 1: matrix 368 rows 242 cols
[2025-06-01 11:09:47] [INFO ] Computed 74 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-01 11:09:47] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:09:47] [INFO ] Invariant cache hit.
[2025-06-01 11:09:47] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2025-06-01 11:09:47] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-01 11:09:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-01 11:09:47] [INFO ] [Real]Added 39 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:09:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:09:47] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2025-06-01 11:09:47] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-01 11:09:47] [INFO ] [Nat]Added 39 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:09:47] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2025-06-01 11:09:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-06-01 11:09:48] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 22 ms.
[2025-06-01 11:09:48] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-01 11:09:48] [INFO ] Added : 88 causal constraints over 18 iterations in 628 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 521/521 transitions.
[2025-06-01 11:09:48] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:09:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2179 ms. (458 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 694 ms. (1438 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-01 11:09:51] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:09:51] [INFO ] Invariant cache hit.
[2025-06-01 11:09:51] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2025-06-01 11:09:51] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-01 11:09:52] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-01 11:09:52] [INFO ] [Real]Added 39 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:09:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:09:52] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2025-06-01 11:09:52] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-06-01 11:09:52] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:09:52] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:09:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2025-06-01 11:09:52] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 28 ms.
[2025-06-01 11:09:52] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2025-06-01 11:09:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2025-06-01 11:09:52] [INFO ] Added : 88 causal constraints over 18 iterations in 668 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2025-06-01 11:09:53] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:09:53] [INFO ] Invariant cache hit.
[2025-06-01 11:09:53] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-01 11:09:53] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:09:53] [INFO ] Invariant cache hit.
[2025-06-01 11:09:53] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-01 11:09:53] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2025-06-01 11:09:53] [INFO ] Redundant transitions in 6 ms returned []
Running 513 sub problems to find dead transitions.
[2025-06-01 11:09:53] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:09:53] [INFO ] Invariant cache hit.
[2025-06-01 11:09:53] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:09:58] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2025-06-01 11:09:58] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:09:58] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:09:58] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:09:58] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:09:58] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2025-06-01 11:09:58] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:09:59] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:09:59] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:09:59] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:09:59] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:09:59] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:09:59] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:09:59] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:09:59] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:09:59] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:10:00] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2025-06-01 11:10:00] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2025-06-01 11:10:00] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:10:00] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:10:02] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2025-06-01 11:10:02] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2025-06-01 11:10:02] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2025-06-01 11:10:02] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:10:02] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:02] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:10:02] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:10:02] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:10:03] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:03] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:10:03] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:03] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:10:03] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:10:03] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2025-06-01 11:10:03] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2025-06-01 11:10:04] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2025-06-01 11:10:04] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2025-06-01 11:10:04] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:10:04] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:10:05] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2025-06-01 11:10:06] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2025-06-01 11:10:06] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2025-06-01 11:10:06] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2025-06-01 11:10:06] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:10:06] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2025-06-01 11:10:06] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2025-06-01 11:10:06] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:10:07] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2025-06-01 11:10:07] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:10:07] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:10:07] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:10:07] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:10:08] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:10:08] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:10:08] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2025-06-01 11:10:08] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:10:08] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:10:08] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:08] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:10:08] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:10:08] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:10:09] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:10:09] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:10:09] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:10:09] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:10:09] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:10:09] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:10:09] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2025-06-01 11:10:09] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:10:09] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:10:10] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:10:10] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:10:12] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:10:12] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:10:12] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:10:13] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:10:13] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 6 ms to minimize.
[2025-06-01 11:10:13] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:10:13] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:10:13] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:10:13] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:10:13] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:10:13] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:10:13] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:10:14] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:10:15] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:10:16] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2025-06-01 11:10:17] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:10:18] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:10:19] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2025-06-01 11:10:20] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:10:23] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:10:24] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:10:24] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 30309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30906 ms. Remains : 242/242 places, 521/521 transitions.
[2025-06-01 11:10:24] [INFO ] Flatten gal took : 38 ms
[2025-06-01 11:10:24] [INFO ] Flatten gal took : 37 ms
[2025-06-01 11:10:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3200404684530455096.gal : 8 ms
[2025-06-01 11:10:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13055466979010095955.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/ReachabilityCardinality3200404684530455096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13055466979010095955.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
RANDOM walk for 40000 steps (8 resets) in 422 ms. (94 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13055466979010095955.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 152
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :152 after 748
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :748 after 1562
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1562 after 3261
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3261 after 10946
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :10946 after 69791
Interrupted probabilistic random walk after 347771 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 2
Probabilistic random walk after 347771 steps, saw 185032 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2025-06-01 11:10:27] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:10:27] [INFO ] Invariant cache hit.
[2025-06-01 11:10:27] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/610 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 355 constraints, problems are : Problem set: 0 solved, 2 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2025-06-01 11:10:28] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 1 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:10:29] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:10:30] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2025-06-01 11:10:30] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:10:30] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:10:30] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :69791 after 173501
[2025-06-01 11:10:30] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:10:30] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:10:30] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 15/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:31] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:31] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 1 ms to minimize.
[2025-06-01 11:10:31] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 1 ms to minimize.
[2025-06-01 11:10:31] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 2 ms to minimize.
[2025-06-01 11:10:31] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 2 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:10:32] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 1 ms to minimize.
[2025-06-01 11:10:33] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
SMT process timed out in 5537ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 242/242 places, 521/521 transitions.
RANDOM walk for 40000 steps (8 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 378000 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 2
Probabilistic random walk after 378000 steps, saw 200383 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2025-06-01 11:10:36] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:10:36] [INFO ] Invariant cache hit.
[2025-06-01 11:10:36] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/610 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 355 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/576 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 39/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/610 variables, 34/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 10/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:10:36] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:10:37] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2025-06-01 11:10:37] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 2 ms to minimize.
[2025-06-01 11:10:37] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :173501 after 2.8854e+06
[2025-06-01 11:10:42] [INFO ] Deduced a trap composed of 37 places in 4551 ms of which 1 ms to minimize.
[2025-06-01 11:10:45] [INFO ] Deduced a trap composed of 39 places in 3284 ms of which 1 ms to minimize.
[2025-06-01 11:10:45] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:10:45] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:10:45] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:10:45] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:10:45] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:10:46] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:10:46] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:10:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 15/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:46] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:10:46] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:10:46] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:10:46] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:10:46] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:10:46] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:10:47] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:10:47] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:10:47] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:10:47] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:10:47] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:10:47] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:10:47] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:10:47] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:10:47] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:10:48] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2025-06-01 11:10:49] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 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.
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 15/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:10:50] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:10:51] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:10:52] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/610 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/610 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:10:53] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:10:54] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.8854e+06 after 5.3903e+06
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/610 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:10:55] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:10:56] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/610 variables, 14/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:10:57] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/610 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/610 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/610 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20734 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 109/109 constraints]
After SMT, in 20963ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 497 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 18 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 242/242 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 521/521 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2025-06-01 11:10:57] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:10:57] [INFO ] Invariant cache hit.
[2025-06-01 11:10:57] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-01 11:10:57] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:10:57] [INFO ] Invariant cache hit.
[2025-06-01 11:10:58] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-01 11:10:58] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2025-06-01 11:10:58] [INFO ] Redundant transitions in 2 ms returned []
Running 513 sub problems to find dead transitions.
[2025-06-01 11:10:58] [INFO ] Flow matrix only has 368 transitions (discarded 153 similar events)
[2025-06-01 11:10:58] [INFO ] Invariant cache hit.
[2025-06-01 11:10:58] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:02] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:11:03] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:11:04] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:11:06] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:11:07] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:11:08] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:11:09] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:11:10] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:11:11] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:11:12] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2025-06-01 11:11:12] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:11:12] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:11:12] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:11:12] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:11:12] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:11:12] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:11:12] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:11:12] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:11:13] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:11:13] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:11:13] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:13] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:11:13] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-06-01 11:11:14] [INFO ] Flatten gal took : 25 ms
[2025-06-01 11:11:14] [INFO ] Applying decomposition
[2025-06-01 11:11:14] [INFO ] Flatten gal took : 21 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/graph2679877589016893332.txt' '-o' '/tmp/graph2679877589016893332.bin' '-w' '/tmp/graph2679877589016893332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2679877589016893332.bin' '-l' '-1' '-v' '-w' '/tmp/graph2679877589016893332.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:11:14] [INFO ] Decomposing Gal with order
[2025-06-01 11:11:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:11:14] [INFO ] Removed a total of 631 redundant transitions.
[2025-06-01 11:11:14] [INFO ] Flatten gal took : 81 ms
[2025-06-01 11:11:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 13 ms.
[2025-06-01 11:11:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9328865274097978666.gal : 8 ms
[2025-06-01 11:11:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11525192965378774508.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/ReachabilityCardinality9328865274097978666.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11525192965378774508.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/ReachabilityCardinality11525192965378774508.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 39
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :39 after 70
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :70 after 105
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :105 after 562
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :562 after 1313
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1313 after 2905
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 513 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2905 after 30819
[2025-06-01 11:11:16] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:16] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:11:16] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:11:16] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:11:16] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:11:16] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:16] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2025-06-01 11:11:16] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:11:16] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :30819 after 59625
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 3 ms to minimize.
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:11:17] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:11:18] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:18] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:11:18] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:11:18] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:11:18] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:11:19] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:11:19] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:11:19] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:11:19] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:11:19] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:11:19] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:11:19] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:11:19] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:11:19] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:11:20] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
[2025-06-01 11:11:20] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
SDD size :59625 after 192102
[2025-06-01 11:11:20] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:11:20] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:11:20] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:11:20] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:20] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:20] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:11:21] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:11:21] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:11:21] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:21] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:11:21] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:21] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:11:21] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:11:22] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:11:22] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:11:22] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:11:22] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:22] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:11:22] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:11:22] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:22] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:11:22] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:11:23] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:11:23] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:11:23] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:25] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:11:26] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:11:26] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2025-06-01 11:11:26] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-06-01 11:11:26] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
SDD size :192102 after 1.22101e+06
[2025-06-01 11:11:26] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2025-06-01 11:11:26] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2025-06-01 11:11:26] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:11:26] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:11:27] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:11:27] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:11:27] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:11:27] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:11:27] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:11:27] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:11:27] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:11:27] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:11:27] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:11:28] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:11:28] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:28] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/610 variables, and 235 constraints, problems are : Problem set: 0 solved, 513 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/242 constraints, ReadFeed: 0/39 constraints, PredecessorRefiner: 513/513 constraints, Known Traps: 161/161 constraints]
Escalating to Integer solving :Problem set: 0 solved, 513 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 104/114 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/178 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 57/235 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:31] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:11:31] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:31] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:31] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2025-06-01 11:11:32] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2025-06-01 11:11:32] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2025-06-01 11:11:32] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:11:32] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:11:32] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:11:32] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2025-06-01 11:11:32] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:11:32] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:11:33] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:11:33] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2025-06-01 11:11:33] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:11:33] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:11:33] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:11:33] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2025-06-01 11:11:33] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:11:33] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:34] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:11:34] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:11:34] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:11:34] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 1 ms to minimize.
[2025-06-01 11:11:34] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:11:35] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:11:36] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:11:36] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:11:36] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:11:36] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:11:36] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:37] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:11:37] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:11:37] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:11:37] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2025-06-01 11:11:37] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2025-06-01 11:11:38] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:11:38] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
[2025-06-01 11:11:38] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:11:38] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:11:38] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:11:38] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:11:38] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:11:38] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:11:39] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2025-06-01 11:11:39] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:11:39] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2025-06-01 11:11:39] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:11:39] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2025-06-01 11:11:39] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:11:39] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:40] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:11:40] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:11:40] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2025-06-01 11:11:41] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:11:41] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:11:41] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:11:41] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:11:41] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:11:41] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:11:42] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:11:42] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:11:42] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2025-06-01 11:11:42] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:11:42] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:42] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:11:42] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:11:43] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:43] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:11:43] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2025-06-01 11:11:43] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:43] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:11:44] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2025-06-01 11:11:44] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:11:44] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:11:44] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2025-06-01 11:11:44] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2025-06-01 11:11:45] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2025-06-01 11:11:45] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
[2025-06-01 11:11:45] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
SDD size :1.22101e+06 after 3.31122e+06
[2025-06-01 11:11:45] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:11:45] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:11:46] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:11:46] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:11:46] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2025-06-01 11:11:46] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:11:46] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:11:46] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2025-06-01 11:11:46] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:11:46] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:11:46] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:47] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:11:47] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2025-06-01 11:11:47] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:11:47] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2025-06-01 11:11:47] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2025-06-01 11:11:47] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:11:47] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:11:48] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2025-06-01 11:11:48] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2025-06-01 11:11:48] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:11:48] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:11:48] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:11:48] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2025-06-01 11:11:48] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:11:48] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:11:48] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:11:49] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:11:49] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2025-06-01 11:11:49] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2025-06-01 11:11:49] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:49] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2025-06-01 11:11:50] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2025-06-01 11:11:50] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2025-06-01 11:11:50] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2025-06-01 11:11:50] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2025-06-01 11:11:50] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-06-01 11:11:50] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2025-06-01 11:11:51] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:11:51] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2025-06-01 11:11:51] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:11:51] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2025-06-01 11:11:51] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:11:51] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:11:51] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:11:51] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:11:51] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:11:52] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2025-06-01 11:11:52] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2025-06-01 11:11:52] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:11:52] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:52] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2025-06-01 11:11:53] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-06-01 11:11:53] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2025-06-01 11:11:53] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2025-06-01 11:11:53] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2025-06-01 11:11:53] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2025-06-01 11:11:53] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2025-06-01 11:11:53] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2025-06-01 11:11:54] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2025-06-01 11:11:54] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2025-06-01 11:11:54] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2025-06-01 11:11:54] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:11:54] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:11:54] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2025-06-01 11:11:54] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2025-06-01 11:11:54] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:11:55] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:11:55] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2025-06-01 11:11:55] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2025-06-01 11:11:55] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2025-06-01 11:11:56] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2025-06-01 11:11:56] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2025-06-01 11:11:56] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:11:56] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2025-06-01 11:11:56] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:11:57] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2025-06-01 11:11:57] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2025-06-01 11:11:57] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 1 ms to minimize.
[2025-06-01 11:11:57] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2025-06-01 11:11:57] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:11:57] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:11:57] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2025-06-01 11:11:57] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2025-06-01 11:11:58] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2025-06-01 11:11:58] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2025-06-01 11:11:58] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2025-06-01 11:11:58] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2025-06-01 11:11:58] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2025-06-01 11:11:58] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
SMT process timed out in 60429ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61063 ms. Remains : 242/242 places, 521/521 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 242 transition count 368
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 153 place count 242 transition count 304
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 337 place count 122 transition count 304
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 353 place count 114 transition count 296
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 369 place count 106 transition count 352
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 377 place count 106 transition count 344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 385 place count 98 transition count 344
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 393 place count 98 transition count 344
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 401 place count 98 transition count 344
Applied a total of 401 rules in 59 ms. Remains 98 /242 variables (removed 144) and now considering 344/521 (removed 177) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 344 rows 98 cols
[2025-06-01 11:11:58] [INFO ] Computed 18 invariants in 1 ms
[2025-06-01 11:11:58] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-01 11:11:59] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-01 11:11:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-01 11:11:59] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-01 11:11:59] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-01 11:11:59] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-01 11:11:59] [INFO ] Flatten gal took : 10 ms
[2025-06-01 11:11:59] [INFO ] Flatten gal took : 10 ms
[2025-06-01 11:11:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6299151661191275108.gal : 2 ms
[2025-06-01 11:11:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3143545274525446580.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/ReachabilityCardinality6299151661191275108.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3143545274525446580.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/ReachabilityCardinality3143545274525446580.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 14
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 139
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :139 after 157
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :157 after 216
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :216 after 1687
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1687 after 2373
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2373 after 7520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7520 after 19016
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :19016 after 283656
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :283656 after 1.82673e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.82673e+06 after 4.11974e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.11974e+06 after 1.768e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.768e+07 after 4.24177e+07
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.24177e+07 after 2.13264e+08
Detected timeout of ITS tools.
[2025-06-01 11:12:14] [INFO ] Flatten gal took : 15 ms
[2025-06-01 11:12:14] [INFO ] Applying decomposition
[2025-06-01 11:12:14] [INFO ] Flatten gal took : 10 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/graph8529481402431278160.txt' '-o' '/tmp/graph8529481402431278160.bin' '-w' '/tmp/graph8529481402431278160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8529481402431278160.bin' '-l' '-1' '-v' '-w' '/tmp/graph8529481402431278160.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:12:14] [INFO ] Decomposing Gal with order
[2025-06-01 11:12:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:12:14] [INFO ] Removed a total of 403 redundant transitions.
[2025-06-01 11:12:14] [INFO ] Flatten gal took : 25 ms
[2025-06-01 11:12:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 9 ms.
[2025-06-01 11:12:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11042318758130091293.gal : 1 ms
[2025-06-01 11:12:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9697897006314342315.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/ReachabilityCardinality11042318758130091293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9697897006314342315.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/ReachabilityCardinality9697897006314342315.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 37
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :37 after 123
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :123 after 379
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :379 after 745
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :745 after 2963
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2963 after 19146
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :19146 after 970876
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :970876 after 1.22529e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.22529e+07 after 3.3849e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.3849e+07 after 2.03802e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.03802e+08 after 2.25716e+09
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30741 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[8]
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-12 in 162091 ms.
[2025-06-01 11:12:29] [INFO ] Flatten gal took : 17 ms
[2025-06-01 11:12:29] [INFO ] Applying decomposition
[2025-06-01 11:12:29] [INFO ] Flatten gal took : 29 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/graph10216540986123594623.txt' '-o' '/tmp/graph10216540986123594623.bin' '-w' '/tmp/graph10216540986123594623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10216540986123594623.bin' '-l' '-1' '-v' '-w' '/tmp/graph10216540986123594623.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:12:29] [INFO ] Decomposing Gal with order
[2025-06-01 11:12:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:12:29] [INFO ] Removed a total of 842 redundant transitions.
[2025-06-01 11:12:29] [INFO ] Flatten gal took : 28 ms
[2025-06-01 11:12:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 8 ms.
[2025-06-01 11:12:29] [INFO ] Time to serialize gal into /tmp/UpperBounds1122511017283293888.gal : 3 ms
[2025-06-01 11:12:29] [INFO ] Time to serialize properties into /tmp/UpperBounds8330227317710823911.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/UpperBounds1122511017283293888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8330227317710823911.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 ...304
Loading property file /tmp/UpperBounds8330227317710823911.prop.
ITS-tools command line returned an error code 137
[2025-06-01 11:22:55] [INFO ] Applying decomposition
[2025-06-01 11:22:55] [INFO ] Flatten gal took : 30 ms
[2025-06-01 11:22:55] [INFO ] Decomposing Gal with order
[2025-06-01 11:22:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:22:55] [INFO ] Removed a total of 1349 redundant transitions.
[2025-06-01 11:22:55] [INFO ] Flatten gal took : 34 ms
[2025-06-01 11:22:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 10 ms.
[2025-06-01 11:22:55] [INFO ] Time to serialize gal into /tmp/UpperBounds10126431563192561061.gal : 30 ms
[2025-06-01 11:22:55] [INFO ] Time to serialize properties into /tmp/UpperBounds3698496968731050755.prop : 44 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/UpperBounds10126431563192561061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3698496968731050755.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 ...305
Loading property file /tmp/UpperBounds3698496968731050755.prop.
ITS-tools command line returned an error code 137
[2025-06-01 11:33:00] [INFO ] Flatten gal took : 41 ms
[2025-06-01 11:33:00] [INFO ] Input system was already deterministic with 521 transitions.
[2025-06-01 11:33:00] [INFO ] Transformed 242 places.
[2025-06-01 11:33:00] [INFO ] Transformed 521 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 11:33:00] [INFO ] Time to serialize gal into /tmp/UpperBounds11057982739728523452.gal : 8 ms
[2025-06-01 11:33:00] [INFO ] Time to serialize properties into /tmp/UpperBounds15943698479284538253.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/UpperBounds11057982739728523452.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15943698479284538253.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15943698479284538253.prop.
ITS-tools command line returned an error code 137
Total runtime 2285712 ms.

BK_STOP 1748778195214

--------------------
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-COL-8"
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-COL-8, 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-174876435800081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 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 ;