Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r504-tall-171649612300229.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is LamportFastMutEx-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612300229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.6K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 13 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 41K May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1717225284143

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:01:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:01:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:01:25] [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.
[2024-06-01 07:01:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 07:01:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 556 ms
[2024-06-01 07:01:25] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-06-01 07:01:25] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-06-01 07:01:25] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-06-01 07:01:25] [INFO ] Computed 2 invariants in 9 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[5, 1, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 1, 0] Max Struct:[5, 1, 5, 5, 25, 5, 5, 5, 5, 5, 5, 25, 5, 5, 1, 5]
FORMULA LamportFastMutEx-COL-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 07:01:26] [INFO ] Invariant cache hit.
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 07:01:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:01:26] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 07:01:26] [INFO ] Added : 9 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 07:01:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:26] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:26] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 07:01:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 07:01:26] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:26] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:26] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:26] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 07:01:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 07:01:26] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:26] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:26] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 07:01:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:26] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 07:01:26] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:27] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 07:01:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:27] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:27] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 07:01:27] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 07:01:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:27] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 07:01:27] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 07:01:27] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 07:01:27] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 07:01:27] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 07:01:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 07:01:27] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 07:01:27] [INFO ] Added : 4 causal constraints over 1 iterations in 9 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:[5, 5, 25, 5, 5, 5, 5, 5, 25, 5, 5, 5]
Domain [pid(6), pid(6)] 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.
[2024-06-01 07:01:27] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 25 ms.
[2024-06-01 07:01:27] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 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:[5, 5, 25, 5, 5, 5, 5, 5, 25, 5, 5, 5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 25, 5, 5, 5, 5, 5, 25, 5, 5, 5]
[2024-06-01 07:01:27] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2024-06-01 07:01:27] [INFO ] Computed 37 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 25, 5, 5, 5, 5, 5, 25, 5, 5, 5]
RANDOM walk for 10000 steps (2 resets) in 72 ms. (136 steps per ms)
FORMULA LamportFastMutEx-COL-5-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 132 ms. (676 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 20, 4, 2, 4, 4, 20, 4] Max Struct:[5, 5, 25, 5, 5, 5, 5, 25, 5]
[2024-06-01 07:01:27] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-06-01 07:01:27] [INFO ] Invariant cache hit.
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-01 07:01:27] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 07:01:27] [INFO ] [Real]Added 55 Read/Feed constraints in 13 ms returned sat
[2024-06-01 07:01:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Nat]Added 55 Read/Feed constraints in 14 ms returned sat
[2024-06-01 07:01:27] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 21 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 691 ms
[2024-06-01 07:01:28] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:28] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 07:01:28] [INFO ] [Real]Added 55 Read/Feed constraints in 19 ms returned sat
[2024-06-01 07:01:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:28] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-06-01 07:01:28] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 07:01:28] [INFO ] [Nat]Added 55 Read/Feed constraints in 13 ms returned sat
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 548 ms
[2024-06-01 07:01:29] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-06-01 07:01:29] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 07:01:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:29] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 07:01:29] [INFO ] [Nat]Added 55 Read/Feed constraints in 41 ms returned sat
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1297 ms
[2024-06-01 07:01:30] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 07:01:30] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 07:01:30] [INFO ] [Real]Added 55 Read/Feed constraints in 9 ms returned sat
[2024-06-01 07:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:30] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 593 ms
[2024-06-01 07:01:31] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Real]Added 55 Read/Feed constraints in 4 ms returned sat
[2024-06-01 07:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:31] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Nat]Added 55 Read/Feed constraints in 7 ms returned sat
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 320 ms
[2024-06-01 07:01:32] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 15 ms.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-06-01 07:01:32] [INFO ] Added : 42 causal constraints over 11 iterations in 292 ms. Result :sat
Minimization took 87 ms.
[2024-06-01 07:01:32] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:32] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 07:01:32] [INFO ] [Real]Added 55 Read/Feed constraints in 5 ms returned sat
[2024-06-01 07:01:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:32] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2024-06-01 07:01:32] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 07:01:32] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-06-01 07:01:32] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 20 ms.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 6 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-06-01 07:01:33] [INFO ] Added : 94 causal constraints over 19 iterations in 392 ms. Result :sat
Minimization took 62 ms.
[2024-06-01 07:01:33] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:33] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 07:01:33] [INFO ] [Real]Added 55 Read/Feed constraints in 6 ms returned sat
[2024-06-01 07:01:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:33] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 07:01:33] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 686 ms
[2024-06-01 07:01:34] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 07:01:34] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 07:01:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:34] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-01 07:01:34] [INFO ] [Nat]Added 55 Read/Feed constraints in 32 ms returned sat
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 683 ms
[2024-06-01 07:01:35] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:35] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 07:01:35] [INFO ] [Real]Added 55 Read/Feed constraints in 6 ms returned sat
[2024-06-01 07:01:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 07:01:35] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 07:01:35] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 5 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 371 ms
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 20, 4, 2, 4, 4, 20, 4] Max Struct:[4, 4, 20, 4, 5, 5, 4, 20, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4] Max Struct:[5, 5]
Support contains 10 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 137 transition count 255
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 73 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 132/137 places, 255/260 transitions.
[2024-06-01 07:01:35] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2024-06-01 07:01:36] [INFO ] Computed 37 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4] Max Struct:[5, 5]
RANDOM walk for 1000000 steps (2 resets) in 1797 ms. (556 steps per ms)
FORMULA LamportFastMutEx-COL-5-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 502 ms. (1988 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[5]
[2024-06-01 07:01:38] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
[2024-06-01 07:01:38] [INFO ] Invariant cache hit.
[2024-06-01 07:01:38] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 07:01:38] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-01 07:01:38] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 07:01:38] [INFO ] [Real]Added 55 Read/Feed constraints in 5 ms returned sat
[2024-06-01 07:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:38] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 07:01:38] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-01 07:01:38] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 578 ms
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 13878 ms.
ITS solved all properties within timeout

BK_STOP 1717225299188

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-5, 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 r504-tall-171649612300229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;