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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 42K 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-6-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748775869275

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-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-01 11:04:30] [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:04:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:04:30] [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:04:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 11:04:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2025-06-01 11:04:31] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-01 11:04:31] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2025-06-01 11:04:31] [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:04:31] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 6, 1, 0, 1, 0, 0, 0, 0, 6, 0] Max Struct:[6, 6, 6, 6, 6, 36, 6, 1, 6, 1, 36, 6, 6, 6, 6, 6]
FORMULA LamportFastMutEx-COL-6-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-01 11:04:31] [INFO ] Invariant cache hit.
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 11:04:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 11:04:31] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:04:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:04:31] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 11:04:31] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:04:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:31] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:04:31] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 11:04:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:31] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:31] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:31] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:31] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:31] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:04:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:04:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:32] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:32] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 11:04:32] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:04:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:04:32] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:04:32] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:32] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:04:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:04:32] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 11:04:32] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 11:04:32] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:04:32] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:04:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 11:04:32] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:04:32] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 36, 6, 36, 6, 6, 6, 6]
Domain [pid(7), pid(7)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 11:04:32] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 24 ms.
[2025-06-01 11:04:32] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 36, 6, 36, 6, 6, 6, 6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 36, 6, 36, 6, 6, 6, 6]
[2025-06-01 11:04:32] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2025-06-01 11:04:32] [INFO ] Computed 50 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 36, 6, 36, 6, 6, 6, 6]
RANDOM walk for 10000 steps (2 resets) in 57 ms. (172 steps per ms)
FORMULA LamportFastMutEx-COL-6-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 180 ms. (552 steps per ms)
FORMULA LamportFastMutEx-COL-6-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 3, 4, 30, 24, 3, 5, 5] Max Struct:[6, 6, 6, 6, 36, 36, 6, 6, 6]
[2025-06-01 11:04:32] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-01 11:04:32] [INFO ] Invariant cache hit.
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 11:04:32] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-06-01 11:04:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-01 11:04:32] [INFO ] [Real]Added 72 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:04:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:32] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2025-06-01 11:04:33] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-01 11:04:33] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 13 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2025-06-01 11:04:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 823 ms
[2025-06-01 11:04:33] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2025-06-01 11:04:33] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 11:04:33] [INFO ] [Real]Added 72 Read/Feed constraints in 6 ms returned sat
[2025-06-01 11:04:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:34] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-01 11:04:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 17 ms returned sat
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2025-06-01 11:04:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 655 ms
[2025-06-01 11:04:34] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:34] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-01 11:04:34] [INFO ] [Real]Added 72 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:04:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:34] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-01 11:04:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 396 ms
[2025-06-01 11:04:35] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 17 ms.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:04:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2025-06-01 11:04:35] [INFO ] Added : 42 causal constraints over 10 iterations in 360 ms. Result :sat
Minimization took 99 ms.
[2025-06-01 11:04:35] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:35] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-06-01 11:04:35] [INFO ] [Real]Added 72 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:04:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2025-06-01 11:04:36] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-01 11:04:36] [INFO ] [Nat]Added 72 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:04:36] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 17 ms.
[2025-06-01 11:04:36] [INFO ] Added : 74 causal constraints over 16 iterations in 327 ms. Result :sat
Minimization took 112 ms.
[2025-06-01 11:04:36] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 11:04:36] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-01 11:04:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2025-06-01 11:04:36] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-06-01 11:04:36] [INFO ] [Nat]Added 72 Read/Feed constraints in 41 ms returned sat
[2025-06-01 11:04:36] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2025-06-01 11:04:36] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-06-01 11:04:36] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 8 places in 39 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 0 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 908 ms
[2025-06-01 11:04:37] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2025-06-01 11:04:37] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-01 11:04:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 17 ms returned sat
[2025-06-01 11:04:37] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-06-01 11:04:37] [INFO ] [Nat]Added 72 Read/Feed constraints in 42 ms returned sat
[2025-06-01 11:04:37] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 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 17 places in 39 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 17 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 630 ms
[2025-06-01 11:04:38] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 17 ms.
[2025-06-01 11:04:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:04:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-06-01 11:04:38] [INFO ] Added : 54 causal constraints over 12 iterations in 308 ms. Result :sat
Minimization took 102 ms.
[2025-06-01 11:04:39] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:39] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-01 11:04:39] [INFO ] [Real]Added 72 Read/Feed constraints in 7 ms returned sat
[2025-06-01 11:04:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2025-06-01 11:04:39] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-06-01 11:04:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 14 ms returned sat
[2025-06-01 11:04:39] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 5 ms to minimize.
[2025-06-01 11:04:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2025-06-01 11:04:39] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:04:39] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:39] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2025-06-01 11:04:39] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:04:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2025-06-01 11:04:39] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:04:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 452 ms
[2025-06-01 11:04:39] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 22 ms.
[2025-06-01 11:04:40] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:04:40] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:04:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:04:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:04:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 282 ms
[2025-06-01 11:04:40] [INFO ] Added : 123 causal constraints over 26 iterations in 781 ms. Result :sat
Minimization took 114 ms.
[2025-06-01 11:04:40] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:40] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 11:04:40] [INFO ] [Real]Added 72 Read/Feed constraints in 8 ms returned sat
[2025-06-01 11:04:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:40] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-06-01 11:04:40] [INFO ] [Nat]Added 72 Read/Feed constraints in 18 ms returned sat
[2025-06-01 11:04:40] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:04:40] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2025-06-01 11:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 932 ms
[2025-06-01 11:04:41] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:41] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-01 11:04:41] [INFO ] [Real]Added 72 Read/Feed constraints in 9 ms returned sat
[2025-06-01 11:04:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:41] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-01 11:04:41] [INFO ] [Nat]Added 72 Read/Feed constraints in 19 ms returned sat
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 3 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 759 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 3, 4, 30, 24, 3, 5, 5] Max Struct:[5, 5, 6, 6, 30, 36, 6, 5, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-05 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 5, 24, 4] Max Struct:[6, 6, 36, 6]
Support contains 54 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 43 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 176/176 places, 354/354 transitions.
[2025-06-01 11:04:43] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-01 11:04:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 5, 24, 4] Max Struct:[6, 6, 36, 6]
RANDOM walk for 1000000 steps (2 resets) in 2322 ms. (430 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2885 ms. (1386 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 30, 5] Max Struct:[6, 6, 36, 6]
[2025-06-01 11:04:48] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2025-06-01 11:04:48] [INFO ] Invariant cache hit.
[2025-06-01 11:04:48] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:48] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-06-01 11:04:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-01 11:04:48] [INFO ] [Real]Added 72 Read/Feed constraints in 10 ms returned sat
[2025-06-01 11:04:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:48] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-01 11:04:48] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:04:48] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-06-01 11:04:48] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-01 11:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 774 ms
[2025-06-01 11:04:49] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-01 11:04:49] [INFO ] [Real]Added 72 Read/Feed constraints in 5 ms returned sat
[2025-06-01 11:04:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:49] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-01 11:04:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2025-06-01 11:04:49] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 18 ms.
[2025-06-01 11:04:50] [INFO ] Added : 76 causal constraints over 16 iterations in 316 ms. Result :sat
Minimization took 81 ms.
[2025-06-01 11:04:50] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 11:04:50] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 11:04:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2025-06-01 11:04:50] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-01 11:04:50] [INFO ] [Nat]Added 72 Read/Feed constraints in 66 ms returned sat
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:50] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-06-01 11:04:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2025-06-01 11:04:51] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1090 ms
[2025-06-01 11:04:51] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2025-06-01 11:04:51] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-06-01 11:04:51] [INFO ] [Real]Added 72 Read/Feed constraints in 15 ms returned sat
[2025-06-01 11:04:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:04:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2025-06-01 11:04:51] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-01 11:04:51] [INFO ] [Nat]Added 72 Read/Feed constraints in 18 ms returned sat
[2025-06-01 11:04:51] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2025-06-01 11:04:51] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2025-06-01 11:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 713 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 30, 5] Max Struct:[5, 6, 30, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-10 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[6]
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 170 transition count 342
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 164 transition count 342
Applied a total of 24 rules in 50 ms. Remains 164 /176 variables (removed 12) and now considering 342/354 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 164/176 places, 342/354 transitions.
[2025-06-01 11:04:52] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2025-06-01 11:04:52] [INFO ] Computed 50 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[6]
FORMULA LamportFastMutEx-COL-6-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1719 ms. (581 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 11:04:54] [INFO ] Flatten gal took : 54 ms
[2025-06-01 11:04:54] [INFO ] Flatten gal took : 28 ms
[2025-06-01 11:04:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15949272696611935379.gal : 16 ms
[2025-06-01 11:04:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7032978090043185255.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15949272696611935379.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7032978090043185255.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 24128 ms.

BK_STOP 1748775894620

--------------------
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-6"
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-6, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r125-tall-174876435800079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.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 ;