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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 40K 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-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748775806064

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-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-01 11:03:27] [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:03:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:03:27] [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:03:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 11:03:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 530 ms
[2025-06-01 11:03:27] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-01 11:03:27] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2025-06-01 11:03:27] [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:03:28] [INFO ] Computed 2 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[4, 0, 0, 0, 0, 1, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 16, 1, 4, 4, 4, 4, 4, 16, 4, 4, 4, 4]
FORMULA LamportFastMutEx-COL-4-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-01 11:03:28] [INFO ] Invariant cache hit.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-01 11:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 11:03:28] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:03:28] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 14 ms.
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:03:28] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:28] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 11:03:28] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:28] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:28] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:28] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:28] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:28] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:28] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:28] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:28] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:29] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:29] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:03:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:03:29] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:29] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:03:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:29] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:03:29] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 11:03:29] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:03:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:03:29] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 16, 4, 4, 4, 4, 16, 4, 4, 4, 4]
Domain [pid(5), pid(5)] 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:03:29] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 23 ms.
[2025-06-01 11:03:29] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 16, 4, 4, 4, 4, 16, 4, 4, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 16, 4, 4, 4, 4, 16, 4, 4, 4, 4]
[2025-06-01 11:03:29] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2025-06-01 11:03:29] [INFO ] Computed 26 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 16, 4, 4, 4, 4, 16, 4, 4, 4, 4]
RANDOM walk for 10000 steps (2 resets) in 51 ms. (192 steps per ms)
FORMULA LamportFastMutEx-COL-4-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (18 resets) in 117 ms. (762 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 12, 3, 1, 3, 12, 3, 3] Max Struct:[4, 4, 16, 4, 4, 4, 16, 4, 4]
[2025-06-01 11:03:29] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2025-06-01 11:03:29] [INFO ] Invariant cache hit.
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using 26 positive place invariants in 12 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 11:03:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 11:03:29] [INFO ] [Real]Added 40 Read/Feed constraints in 13 ms returned sat
[2025-06-01 11:03:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-01 11:03:29] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:03:29] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 15 ms to minimize.
[2025-06-01 11:03:29] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 428 ms
[2025-06-01 11:03:30] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2025-06-01 11:03:30] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 11:03:30] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:03:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:30] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-01 11:03:30] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 2 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:03:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 482 ms
[2025-06-01 11:03:30] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:30] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 11:03:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:31] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-01 11:03:31] [INFO ] [Nat]Added 40 Read/Feed constraints in 18 ms returned sat
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 377 ms
[2025-06-01 11:03:31] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:31] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-01 11:03:31] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:03:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:31] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 11:03:31] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:03:31] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 444 ms
[2025-06-01 11:03:32] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Real]Added 40 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-01 11:03:32] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 11 ms.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2025-06-01 11:03:32] [INFO ] Added : 59 causal constraints over 12 iterations in 201 ms. Result :sat
Minimization took 64 ms.
[2025-06-01 11:03:32] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Real]Added 40 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:03:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 280 ms
[2025-06-01 11:03:32] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 11:03:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-01 11:03:33] [INFO ] [Nat]Added 40 Read/Feed constraints in 15 ms returned sat
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 408 ms
[2025-06-01 11:03:33] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:33] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-01 11:03:33] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:03:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:33] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 11:03:33] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 3 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:03:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 235 ms
[2025-06-01 11:03:33] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 11:03:33] [INFO ] [Real]Added 40 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:33] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 11:03:34] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 649 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 12, 3, 1, 3, 12, 3, 3] Max Struct:[3, 3, 12, 3, 4, 3, 12, 3, 3]
FORMULA LamportFastMutEx-COL-4-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-11 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-04 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 176
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 98 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 94 transition count 172
Applied a total of 16 rules in 50 ms. Remains 94 /102 variables (removed 8) and now considering 172/180 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 94/102 places, 172/180 transitions.
[2025-06-01 11:03:34] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2025-06-01 11:03:34] [INFO ] Computed 26 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1377 ms. (725 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 505 ms. (1976 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2025-06-01 11:03:36] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-01 11:03:36] [INFO ] Invariant cache hit.
[2025-06-01 11:03:36] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-01 11:03:36] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-01 11:03:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 11:03:36] [INFO ] [Real]Added 40 Read/Feed constraints in 4 ms returned sat
[2025-06-01 11:03:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:36] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 11:03:36] [INFO ] [Nat]Added 40 Read/Feed constraints in 4 ms returned sat
[2025-06-01 11:03:36] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-06-01 11:03:36] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 13 ms.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:03:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 535 ms
[2025-06-01 11:03:37] [INFO ] Added : 53 causal constraints over 11 iterations in 674 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2025-06-01 11:03:37] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-01 11:03:37] [INFO ] Invariant cache hit.
[2025-06-01 11:03:37] [INFO ] Implicit Places using invariants in 113 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 115 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 9 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 133 ms. Remains : 90/94 places, 172/172 transitions.
[2025-06-01 11:03:37] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2025-06-01 11:03:37] [INFO ] Computed 22 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1273 ms. (784 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 474 ms. (2105 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2025-06-01 11:03:39] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-01 11:03:39] [INFO ] Invariant cache hit.
[2025-06-01 11:03:39] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 11:03:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 11:03:39] [INFO ] [Real]Added 24 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:03:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:03:39] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2025-06-01 11:03:39] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-01 11:03:39] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:03:39] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2025-06-01 11:03:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:03:40] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:03:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2025-06-01 11:03:40] [INFO ] Added : 47 causal constraints over 10 iterations in 223 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2025-06-01 11:03:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-01 11:03:40] [INFO ] Invariant cache hit.
[2025-06-01 11:03:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-01 11:03:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-01 11:03:40] [INFO ] Invariant cache hit.
[2025-06-01 11:03:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 11:03:40] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2025-06-01 11:03:40] [INFO ] Redundant transitions in 6 ms returned []
Running 168 sub problems to find dead transitions.
[2025-06-01 11:03:40] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2025-06-01 11:03:40] [INFO ] Invariant cache hit.
[2025-06-01 11:03:40] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 11:03:40] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2025-06-01 11:03:40] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2025-06-01 11:03:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 20 solved, 148 unsolved
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:03:41] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:03:42] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:43] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/82 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:03:44] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 11/93 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 4/97 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:03:45] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:03:46] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:03:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 6/103 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/103 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 136/226 variables, 90/193 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 24/217 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:47] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/218 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:03:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/220 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/220 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/226 variables, 0/220 constraints. Problems are: Problem set: 24 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 220 constraints, problems are : Problem set: 24 solved, 144 unsolved in 10122 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 24 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 57/63 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/79 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 27/106 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:51] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:03:51] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 2/108 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:51] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:03:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 2/110 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/110 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 136/226 variables, 90/200 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 24/224 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 144/368 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:53] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2025-06-01 11:03:53] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:03:53] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:03:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:03:54] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:03:54] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 6/374 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:55] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2025-06-01 11:03:55] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:03:55] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:03:55] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:03:55] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:03:56] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 6/380 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:57] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:03:57] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:03:57] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:03:57] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:03:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:03:58] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:03:58] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:03:58] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 8/388 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:03:59] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:03:59] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2025-06-01 11:04:00] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:04:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:04:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:04:00] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:04:00] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:00] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 9/397 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:04:02] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:03] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2025-06-01 11:04:03] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:04:03] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:04:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 5/402 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:04:05] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/403 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:04:07] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2025-06-01 11:04:08] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 2/405 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:04:09] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:04:09] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:09] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 3/408 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:04:11] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2025-06-01 11:04:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:04:12] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/226 variables, 3/411 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:04:14] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:04:14] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:04:14] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2025-06-01 11:04:14] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:04:14] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:04:15] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/226 variables, 6/417 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2025-06-01 11:04:17] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2025-06-01 11:04:17] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:04:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:04:18] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/226 variables, 4/421 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/226 variables, 0/421 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 421 constraints, problems are : Problem set: 24 solved, 144 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 144/168 constraints, Known Traps: 141/141 constraints]
After SMT, in 40250ms problems are : Problem set: 24 solved, 144 unsolved
Search for dead transitions found 24 dead transitions in 40260ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/90 places, 148/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2025-06-01 11:04:20] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40534 ms. Remains : 90/90 places, 148/172 transitions.
[2025-06-01 11:04:20] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
// Phase 1: matrix 120 rows 90 cols
[2025-06-01 11:04:20] [INFO ] Computed 22 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1242 ms. (804 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 515 ms. (1937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2025-06-01 11:04:22] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-01 11:04:22] [INFO ] Invariant cache hit.
[2025-06-01 11:04:22] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2025-06-01 11:04:22] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 11:04:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 11:04:22] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:04:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:22] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2025-06-01 11:04:22] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 11:04:22] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2025-06-01 11:04:22] [INFO ] Computed and/alt/rep : 104/420/104 causal constraints (skipped 12 transitions) in 7 ms.
[2025-06-01 11:04:22] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:04:22] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:04:22] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:04:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 173 ms
[2025-06-01 11:04:22] [INFO ] Added : 44 causal constraints over 10 iterations in 277 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 90/90 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2025-06-01 11:04:22] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-01 11:04:22] [INFO ] Invariant cache hit.
[2025-06-01 11:04:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 11:04:23] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-01 11:04:23] [INFO ] Invariant cache hit.
[2025-06-01 11:04:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 11:04:23] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2025-06-01 11:04:23] [INFO ] Redundant transitions in 6 ms returned []
Running 144 sub problems to find dead transitions.
[2025-06-01 11:04:23] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-01 11:04:23] [INFO ] Invariant cache hit.
[2025-06-01 11:04:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:23] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:23] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:23] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
[2025-06-01 11:04:23] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:23] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:04:23] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:04:24] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:04:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:26] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:04:27] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:28] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:04:28] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:04:28] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:04:28] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:04:28] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:04:28] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:04:28] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:29] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:04:29] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:04:29] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:29] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:04:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:04:29] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2025-06-01 11:04:29] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2025-06-01 11:04:29] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2025-06-01 11:04:30] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2025-06-01 11:04:30] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:04:30] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:30] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:30] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2025-06-01 11:04:30] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2025-06-01 11:04:30] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:04:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:04:31] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:31] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:31] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 120/210 variables, 90/217 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 17 (OVERLAPS) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 237 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11593 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:36] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:36] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:04:36] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 13/157 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 120/210 variables, 90/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 144/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:04:43] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:04:43] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:04:43] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:04:43] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:04:43] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:04:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 7/422 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:47] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:47] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:04:48] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:04:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:04:48] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:48] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:04:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:04:48] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/210 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:55] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/210 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:04:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:00] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:05:00] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:05:00] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:05:00] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:03] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 439 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 163/163 constraints]
After SMT, in 41664ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 41667ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41860 ms. Remains : 90/90 places, 148/148 transitions.
[2025-06-01 11:05:05] [INFO ] Flatten gal took : 72 ms
RANDOM walk for 40000 steps (8 resets) in 740 ms. (53 steps per ms) remains 2/2 properties
[2025-06-01 11:05:05] [INFO ] Flatten gal took : 23 ms
[2025-06-01 11:05:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6013191110108788146.gal : 14 ms
[2025-06-01 11:05:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6440169550401923730.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/ReachabilityCardinality6013191110108788146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6440169550401923730.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties

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/ReachabilityCardinality6440169550401923730.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 9
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 100
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :100 after 220
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :220 after 1151
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1151 after 2192
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2192 after 6102
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6102 after 38886
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :38886 after 74567
Interrupted probabilistic random walk after 1017436 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :0 out of 2
Probabilistic random walk after 1017436 steps, saw 246387 distinct states, run finished after 3004 ms. (steps per millisecond=338 ) properties seen :0
[2025-06-01 11:05:08] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-01 11:05:08] [INFO ] Invariant cache hit.
[2025-06-01 11:05:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :74567 after 266615
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:05:08] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:05:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 849ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 90/90 places, 148/148 transitions.
RANDOM walk for 40000 steps (8 resets) in 383 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :748706 after 1.01697e+06
Interrupted probabilistic random walk after 874063 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 2
Probabilistic random walk after 874063 steps, saw 216667 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
[2025-06-01 11:05:12] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-01 11:05:12] [INFO ] Invariant cache hit.
[2025-06-01 11:05:12] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:05:13] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:13] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 11:05:13] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:05:13] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 826ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/90 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2025-06-01 11:05:13] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-01 11:05:13] [INFO ] Invariant cache hit.
[2025-06-01 11:05:13] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-01 11:05:13] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-01 11:05:13] [INFO ] Invariant cache hit.
[2025-06-01 11:05:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 11:05:13] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2025-06-01 11:05:13] [INFO ] Redundant transitions in 1 ms returned []
Running 144 sub problems to find dead transitions.
[2025-06-01 11:05:13] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2025-06-01 11:05:13] [INFO ] Invariant cache hit.
[2025-06-01 11:05:13] [INFO ] State equation strengthened by 20 read => feed constraints.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.4985e+06,7.90845,194736,2,44347,20,583660,8,0,512,733397,0
Total reachable state count : 1498496

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,7.92998,194736,1,0,20,583660,8,0,519,733397,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,7.9531,194736,1,0,20,583660,8,0,525,733397,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:05:14] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:16] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:05:17] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2025-06-01 11:05:18] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:19] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2025-06-01 11:05:20] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:21] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:22] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 120/210 variables, 90/217 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 17 (OVERLAPS) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 237 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11561 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:05:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:26] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:05:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 13/157 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:28] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 120/210 variables, 90/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 144/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:31] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:05:31] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:05:31] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:33] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2025-06-01 11:05:33] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:05:33] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:05:33] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:05:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:05:34] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:05:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 7/422 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:36] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:37] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:05:38] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:05:38] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2025-06-01 11:05:38] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2025-06-01 11:05:38] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:05:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:05:38] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:41] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/210 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:45] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/210 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:48] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:50] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:05:51] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2025-06-01 11:05:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 439 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 163/163 constraints]
After SMT, in 41621ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 41626ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41800 ms. Remains : 90/90 places, 148/148 transitions.
FORMULA LamportFastMutEx-COL-4-UpperBounds-09 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 147800 ms.

BK_STOP 1748775955138

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

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