Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420200357.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is LamportFastMutEx-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420200357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.8K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 13:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Feb 25 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 40K Mar 5 18:22 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-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679482426888

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 10:53:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 10:53:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:53:48] [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.
[2023-03-22 10:53:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 10:53:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 444 ms
[2023-03-22 10:53:49] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 10:53:49] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2023-03-22 10:53:49] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 10:53:49] [INFO ] Computed 2 place invariants in 7 ms
FORMULA LamportFastMutEx-COL-4-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 10:53:49] [INFO ] Invariant cache hit.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:53:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 10:53:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 10:53:49] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 10:53:49] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:53:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:53:49] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:53:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:53:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 10:53:49] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:53:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 10:53:49] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:53:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:53:49] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 10:53:49] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:53:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 10:53:49] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 10:53:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:53:50] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 10:53:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:53:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 10:53:50] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 10:53:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 10:53:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:53:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:53:50] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 10:53:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:53:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:53:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:53:50] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [4, 16, 4, 4, 16, 4, 4, 4, 4, 4, 4, 4]
Domain [pid(5), pid(5)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 10:53:50] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 24 ms.
[2023-03-22 10:53:50] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :52
FORMULA LamportFastMutEx-COL-4-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :32
FORMULA LamportFastMutEx-COL-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :33
[2023-03-22 10:53:50] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2023-03-22 10:53:50] [INFO ] Computed 26 place invariants in 8 ms
[2023-03-22 10:53:50] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:50] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-22 10:53:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:50] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2023-03-22 10:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:50] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 10:53:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 10:53:50] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2023-03-22 10:53:50] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 5 ms to minimize.
[2023-03-22 10:53:50] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2023-03-22 10:53:50] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2023-03-22 10:53:50] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 863 ms
[2023-03-22 10:53:51] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:53:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 10:53:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:51] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 10:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:51] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-22 10:53:51] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:53:51] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 494 ms
[2023-03-22 10:53:52] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2023-03-22 10:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-22 10:53:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:52] [INFO ] [Nat]Absence check using 26 positive place invariants in 17 ms returned sat
[2023-03-22 10:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:52] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-22 10:53:52] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 335 ms
[2023-03-22 10:53:52] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 12 ms.
[2023-03-22 10:53:52] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-22 10:53:52] [INFO ] Added : 69 causal constraints over 15 iterations in 262 ms. Result :sat
Minimization took 55 ms.
[2023-03-22 10:53:52] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:53] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-22 10:53:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:53] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:53:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:53] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 10:53:53] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-22 10:53:53] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-22 10:53:53] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-22 10:53:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-22 10:53:53] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 20 ms.
[2023-03-22 10:53:53] [INFO ] Added : 54 causal constraints over 11 iterations in 144 ms. Result :sat
Minimization took 57 ms.
[2023-03-22 10:53:53] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-22 10:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:53] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-22 10:53:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:53] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 10:53:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:53] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 10:53:53] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2023-03-22 10:53:53] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-22 10:53:53] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-22 10:53:53] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-22 10:53:53] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 4 ms to minimize.
[2023-03-22 10:53:53] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:53:53] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-22 10:53:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 448 ms
[2023-03-22 10:53:54] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-22 10:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:54] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 10:53:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:54] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:54] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-22 10:53:54] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 551 ms
[2023-03-22 10:53:54] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 10:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:54] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 10:53:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:54] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 10:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:54] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-22 10:53:54] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-22 10:53:54] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 10 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 701 ms
[2023-03-22 10:53:55] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:55] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 10:53:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:55] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:55] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 10:53:55] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:53:55] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-22 10:53:56] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:53:56] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2023-03-22 10:53:56] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-22 10:53:56] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2023-03-22 10:53:56] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2023-03-22 10:53:56] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-22 10:53:56] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-22 10:53:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 610 ms
Current structural bounds on expressions (after SMT) : [12, 3, 16, 4, 3, 3, 3, 3] Max seen :[12, 3, 11, 1, 3, 3, 3, 3]
FORMULA LamportFastMutEx-COL-4-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-01 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 20 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 176
Applied a total of 8 rules in 24 ms. Remains 98 /102 variables (removed 4) and now considering 176/180 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 98/102 places, 176/180 transitions.
Normalized transition count is 140 out of 176 initially.
// Phase 1: matrix 140 rows 98 cols
[2023-03-22 10:53:56] [INFO ] Computed 26 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1632 ms. (steps per millisecond=612 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=1745 ) properties (out of 2) seen :13
[2023-03-22 10:53:59] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
// Phase 1: matrix 140 rows 98 cols
[2023-03-22 10:53:59] [INFO ] Computed 26 place invariants in 8 ms
[2023-03-22 10:53:59] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 10:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 10:53:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:59] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:59] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-22 10:53:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 10:53:59] [INFO ] [Nat]Added 40 Read/Feed constraints in 19 ms returned sat
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 379 ms
[2023-03-22 10:53:59] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 10:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 10:53:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:53:59] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 10:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:53:59] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-22 10:53:59] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:54:00] [INFO ] Computed and/alt/rep : 124/508/124 causal constraints (skipped 12 transitions) in 11 ms.
[2023-03-22 10:54:00] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-22 10:54:00] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2023-03-22 10:54:00] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 10:54:00] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2023-03-22 10:54:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 219 ms
[2023-03-22 10:54:00] [INFO ] Added : 33 causal constraints over 8 iterations in 324 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [12, 4] Max seen :[12, 1]
FORMULA LamportFastMutEx-COL-4-UpperBounds-06 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 176/176 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 94 transition count 172
Applied a total of 8 rules in 10 ms. Remains 94 /98 variables (removed 4) and now considering 172/176 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 94/98 places, 172/176 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 94 cols
[2023-03-22 10:54:00] [INFO ] Computed 26 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1371 ms. (steps per millisecond=729 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 1) seen :1
[2023-03-22 10:54:02] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2023-03-22 10:54:02] [INFO ] Computed 26 place invariants in 8 ms
[2023-03-22 10:54:02] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 10:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:54:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 10:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:54:02] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 10:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:54:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-22 10:54:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 10:54:02] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2023-03-22 10:54:02] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 9 ms.
[2023-03-22 10:54:02] [INFO ] Added : 37 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-22 10:54:02] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:54:02] [INFO ] Invariant cache hit.
[2023-03-22 10:54:02] [INFO ] Implicit Places using invariants in 77 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 80 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 91 ms. Remains : 90/94 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:54:02] [INFO ] Computed 22 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1305 ms. (steps per millisecond=766 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=1992 ) properties (out of 1) seen :1
[2023-03-22 10:54:04] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:54:04] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 10:54:04] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 10:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:54:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 10:54:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:54:04] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-22 10:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:54:04] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 10:54:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:54:04] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2023-03-22 10:54:04] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2023-03-22 10:54:04] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2023-03-22 10:54:04] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2023-03-22 10:54:04] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 2 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 589 ms
[2023-03-22 10:54:05] [INFO ] Added : 51 causal constraints over 11 iterations in 704 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-22 10:54:05] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:54:05] [INFO ] Invariant cache hit.
[2023-03-22 10:54:05] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-22 10:54:05] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:54:05] [INFO ] Invariant cache hit.
[2023-03-22 10:54:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:54:05] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-22 10:54:05] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 10:54:05] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:54:05] [INFO ] Invariant cache hit.
[2023-03-22 10:54:05] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 90/90 places, 172/172 transitions.
Starting property specific reduction for LamportFastMutEx-COL-4-UpperBounds-07
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:54:05] [INFO ] Computed 22 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2023-03-22 10:54:05] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:54:05] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-22 10:54:05] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-22 10:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:54:05] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-22 10:54:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:54:05] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-22 10:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:54:05] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-22 10:54:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:54:05] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2023-03-22 10:54:05] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 9 ms.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 560 ms
[2023-03-22 10:54:06] [INFO ] Added : 51 causal constraints over 11 iterations in 680 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:54:06] [INFO ] Computed 22 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1308 ms. (steps per millisecond=764 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=1996 ) properties (out of 1) seen :1
[2023-03-22 10:54:08] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 10:54:08] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-22 10:54:08] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 10:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:54:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 10:54:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:54:08] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 10:54:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:54:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-22 10:54:08] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:54:08] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2023-03-22 10:54:08] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2023-03-22 10:54:08] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-22 10:54:08] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-22 10:54:08] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 545 ms
[2023-03-22 10:54:09] [INFO ] Added : 51 causal constraints over 11 iterations in 659 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-22 10:54:09] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:54:09] [INFO ] Invariant cache hit.
[2023-03-22 10:54:09] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-22 10:54:09] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:54:09] [INFO ] Invariant cache hit.
[2023-03-22 10:54:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 10:54:09] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-22 10:54:09] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 10:54:09] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 10:54:09] [INFO ] Invariant cache hit.
[2023-03-22 10:54:09] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 90/90 places, 172/172 transitions.
Ending property specific reduction for LamportFastMutEx-COL-4-UpperBounds-07 in 3956 ms.
[2023-03-22 10:54:09] [INFO ] Flatten gal took : 45 ms
[2023-03-22 10:54:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 18 ms.
[2023-03-22 10:54:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 172 transitions and 772 arcs took 3 ms.
Total runtime 21375 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: LamportFastMutEx_COL_4_unf
(NrP: 90 NrTr: 172 NrArc: 772)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 2.745sec


RS generation: 0m 7.008sec


-> reachability set: #nodes 26169 (2.6e+04) #states 1,498,496 (6)



starting MCC model checker
--------------------------

checking: place_bound(p82,p83,p84,p85)
normalized: place_bound(p82,p83,p84,p85)

-> the formula is 1

FORMULA LamportFastMutEx-COL-4-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 635225 (6.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6665205 31106841 37772046
used/not used/entry size/cache size: 25118467 41990397 16 1024MB
basic ops cache: hits/miss/sum: 13099 57105 70204
used/not used/entry size/cache size: 95985 16681231 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 5206 26170 31376
used/not used/entry size/cache size: 26142 8362466 32 256MB
max state cache: hits/miss/sum: 5206 26170 31376
used/not used/entry size/cache size: 26142 8362466 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66558098
1 479290
2 60056
3 9988
4 1310
5 113
6 9
7 0
8 0
9 0
>= 10 0

Total processing time: 0m11.696sec


BK_STOP 1679482462535

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.006sec

25030
iterations count:119675 (695), effective:2825 (16)

initing FirstDep: 0m 0.000sec

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is LamportFastMutEx-COL-4, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420200357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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