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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K 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 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:44 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 41K 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-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 1679482834830

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-5
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:00:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 11:00:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:00:36] [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 11:00:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 11:00:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 433 ms
[2023-03-22 11:00:36] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2023-03-22 11:00:36] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2023-03-22 11:00:36] [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 11:00:36] [INFO ] Computed 2 place invariants in 3 ms
FORMULA LamportFastMutEx-COL-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 11:00:36] [INFO ] Invariant cache hit.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-22 11:00:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 11:00:37] [INFO ] Added : 11 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:00:37] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:00:37] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 11:00:37] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:00:37] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:00:37] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:00:37] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 11:00:37] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 11:00:37] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 11:00:37] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:00:37] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:37] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-22 11:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:00:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:00:37] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 11:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 11:00:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:38] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 11:00:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 11:00:38] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:00:38] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 5, 5, 5, 25, 5, 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.
[2023-03-22 11:00:38] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 19 ms.
[2023-03-22 11:00:38] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :60
FORMULA LamportFastMutEx-COL-5-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :46
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :25
FORMULA LamportFastMutEx-COL-5-UpperBounds-03 5 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 10) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :43
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :34
FORMULA LamportFastMutEx-COL-5-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :40
[2023-03-22 11:00:38] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2023-03-22 11:00:38] [INFO ] Computed 37 place invariants in 17 ms
[2023-03-22 11:00:38] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:38] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-22 11:00:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:38] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2023-03-22 11:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:38] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 11:00:38] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 11:00:38] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 6 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2023-03-22 11:00:38] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 635 ms
[2023-03-22 11:00:39] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:39] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-22 11:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2023-03-22 11:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:39] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 11:00:39] [INFO ] [Nat]Added 55 Read/Feed constraints in 16 ms returned sat
[2023-03-22 11:00:39] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 13 ms.
[2023-03-22 11:00:39] [INFO ] Added : 24 causal constraints over 5 iterations in 87 ms. Result :sat
Minimization took 34 ms.
[2023-03-22 11:00:39] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:39] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-22 11:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:39] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 11:00:39] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-22 11:00:39] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 472 ms
[2023-03-22 11:00:40] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:40] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-22 11:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:40] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 11:00:40] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 497 ms
[2023-03-22 11:00:40] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:40] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-22 11:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 13 ms returned sat
[2023-03-22 11:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:40] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-22 11:00:40] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2023-03-22 11:00:40] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 474 ms
[2023-03-22 11:00:41] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:41] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-22 11:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:41] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 11:00:41] [INFO ] [Nat]Added 55 Read/Feed constraints in 7 ms returned sat
[2023-03-22 11:00:41] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 19 ms.
[2023-03-22 11:00:41] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2023-03-22 11:00:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2023-03-22 11:00:41] [INFO ] Added : 86 causal constraints over 19 iterations in 428 ms. Result :sat
Minimization took 84 ms.
[2023-03-22 11:00:41] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:42] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-22 11:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2023-03-22 11:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:42] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 11:00:42] [INFO ] [Nat]Added 55 Read/Feed constraints in 17 ms returned sat
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 481 ms
[2023-03-22 11:00:42] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:42] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-22 11:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-22 11:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:42] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 11:00:42] [INFO ] [Nat]Added 55 Read/Feed constraints in 6 ms returned sat
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-22 11:00:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2023-03-22 11:00:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2023-03-22 11:00:43] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2023-03-22 11:00:43] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2023-03-22 11:00:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 391 ms
[2023-03-22 11:00:43] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 14 ms.
[2023-03-22 11:00:43] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-22 11:00:43] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2023-03-22 11:00:43] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2023-03-22 11:00:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 204 ms
[2023-03-22 11:00:43] [INFO ] Added : 74 causal constraints over 16 iterations in 458 ms. Result :sat
Minimization took 81 ms.
[2023-03-22 11:00:43] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:43] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-22 11:00:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:43] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 11:00:43] [INFO ] [Nat]Added 55 Read/Feed constraints in 13 ms returned sat
[2023-03-22 11:00:43] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2023-03-22 11:00:43] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
[2023-03-22 11:00:43] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2023-03-22 11:00:44] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-22 11:00:44] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2023-03-22 11:00:44] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-22 11:00:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-22 11:00:44] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-22 11:00:44] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2023-03-22 11:00:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2023-03-22 11:00:44] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2023-03-22 11:00:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 482 ms
Current structural bounds on expressions (after SMT) : [4, 5, 4, 4, 4, 5, 20, 5, 4] Max seen :[4, 4, 4, 4, 4, 1, 20, 3, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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 32 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 33 ms. Remains : 132/137 places, 255/260 transitions.
Normalized transition count is 195 out of 255 initially.
// Phase 1: matrix 195 rows 132 cols
[2023-03-22 11:00:44] [INFO ] Computed 37 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1663 ms. (steps per millisecond=601 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 2) seen :5
[2023-03-22 11:00:47] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2023-03-22 11:00:47] [INFO ] Computed 37 place invariants in 4 ms
[2023-03-22 11:00:47] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:47] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-22 11:00:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:47] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:47] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 11:00:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 11:00:47] [INFO ] [Nat]Added 55 Read/Feed constraints in 6 ms returned sat
[2023-03-22 11:00:47] [INFO ] Computed and/alt/rep : 165/730/165 causal constraints (skipped 25 transitions) in 13 ms.
[2023-03-22 11:00:47] [INFO ] Added : 90 causal constraints over 18 iterations in 290 ms. Result :sat
Minimization took 108 ms.
[2023-03-22 11:00:47] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:47] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-22 11:00:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:47] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-22 11:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:47] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 11:00:47] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2023-03-22 11:00:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 543 ms
Current structural bounds on expressions (after SMT) : [5, 4] Max seen :[1, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 255/255 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 127 transition count 250
Applied a total of 10 rules in 16 ms. Remains 127 /132 variables (removed 5) and now considering 250/255 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 127/132 places, 250/255 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 11:00:48] [INFO ] Computed 37 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1526 ms. (steps per millisecond=655 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 1) seen :1
[2023-03-22 11:00:50] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 11:00:50] [INFO ] Computed 37 place invariants in 4 ms
[2023-03-22 11:00:50] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:50] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-22 11:00:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-22 11:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:50] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 11:00:50] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 11:00:50] [INFO ] [Nat]Added 55 Read/Feed constraints in 6 ms returned sat
[2023-03-22 11:00:50] [INFO ] Computed and/alt/rep : 160/770/160 causal constraints (skipped 25 transitions) in 12 ms.
[2023-03-22 11:00:50] [INFO ] Added : 24 causal constraints over 6 iterations in 102 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 11:00:51] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 11:00:51] [INFO ] Invariant cache hit.
[2023-03-22 11:00:51] [INFO ] Implicit Places using invariants in 103 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 105 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 122 ms. Remains : 122/127 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 11:00:51] [INFO ] Computed 32 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1448 ms. (steps per millisecond=690 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=1904 ) properties (out of 1) seen :1
[2023-03-22 11:00:53] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 11:00:53] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-22 11:00:53] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 11:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:53] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-22 11:00:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:53] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-22 11:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:53] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-22 11:00:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 11:00:53] [INFO ] [Nat]Added 30 Read/Feed constraints in 7 ms returned sat
[2023-03-22 11:00:53] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 12 ms.
[2023-03-22 11:00:53] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2023-03-22 11:00:53] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2023-03-22 11:00:53] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2023-03-22 11:00:53] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2023-03-22 11:00:53] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2023-03-22 11:00:53] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2023-03-22 11:00:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 399 ms
[2023-03-22 11:00:53] [INFO ] Added : 65 causal constraints over 13 iterations in 578 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 11:00:54] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 11:00:54] [INFO ] Invariant cache hit.
[2023-03-22 11:00:54] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-22 11:00:54] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 11:00:54] [INFO ] Invariant cache hit.
[2023-03-22 11:00:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 11:00:54] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-22 11:00:54] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 11:00:54] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 11:00:54] [INFO ] Invariant cache hit.
[2023-03-22 11:00:54] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 122/122 places, 250/250 transitions.
Starting property specific reduction for LamportFastMutEx-COL-5-UpperBounds-07
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 11:00:54] [INFO ] Computed 32 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 11:00:54] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 11:00:54] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-22 11:00:54] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-22 11:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:54] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-22 11:00:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-22 11:00:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:54] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-22 11:00:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 11:00:54] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 11:00:54] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 12 ms.
[2023-03-22 11:00:54] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2023-03-22 11:00:54] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2023-03-22 11:00:54] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2023-03-22 11:00:54] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2023-03-22 11:00:55] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-03-22 11:00:55] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-22 11:00:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 384 ms
[2023-03-22 11:00:55] [INFO ] Added : 65 causal constraints over 13 iterations in 563 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 19 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 122/122 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 11:00:55] [INFO ] Computed 32 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1444 ms. (steps per millisecond=692 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties (out of 1) seen :1
[2023-03-22 11:00:57] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 11:00:57] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-22 11:00:57] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-22 11:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:57] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-22 11:00:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:00:57] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-22 11:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:00:57] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 11:00:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 11:00:57] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 11:00:57] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 11 ms.
[2023-03-22 11:00:57] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2023-03-22 11:00:57] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2023-03-22 11:00:57] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2023-03-22 11:00:57] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2023-03-22 11:00:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2023-03-22 11:00:57] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2023-03-22 11:00:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 371 ms
[2023-03-22 11:00:57] [INFO ] Added : 65 causal constraints over 13 iterations in 546 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 11:00:58] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 11:00:58] [INFO ] Invariant cache hit.
[2023-03-22 11:00:58] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-22 11:00:58] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 11:00:58] [INFO ] Invariant cache hit.
[2023-03-22 11:00:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 11:00:58] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-22 11:00:58] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 11:00:58] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 11:00:58] [INFO ] Invariant cache hit.
[2023-03-22 11:00:58] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 122/122 places, 250/250 transitions.
Ending property specific reduction for LamportFastMutEx-COL-5-UpperBounds-07 in 4025 ms.
[2023-03-22 11:00:58] [INFO ] Flatten gal took : 56 ms
[2023-03-22 11:00:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 11:00:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 250 transitions and 1160 arcs took 2 ms.
Total runtime 22362 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_5_unf
(NrP: 122 NrTr: 250 NrArc: 1160)

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

net check time: 0m 0.000sec

init dd package: 0m 2.681sec


RS generation: 9m16.206sec


-> reachability set: #nodes 479359 (4.8e+05) #states 435,092,592 (8)



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

checking: place_bound(p112,p113,p114,p115,p116)
normalized: place_bound(p112,p113,p114,p115,p116)

-> the formula is 1

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

MC time: 0m 0.000sec

totally nodes used: 35406453 (3.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 276880720 1780924819 2057805539
used/not used/entry size/cache size: 67108864 0 16 1024MB
basic ops cache: hits/miss/sum: 110410 535045 645455
used/not used/entry size/cache size: 901265 15875951 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: 67457 479847 547304
used/not used/entry size/cache size: 466492 7922116 32 256MB
max state cache: hits/miss/sum: 67457 479847 547304
used/not used/entry size/cache size: 466492 7922116 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 42359577
1 16674066
2 5990118
3 1666167
4 351132
5 58835
6 7950
7 925
8 75
9 18
>= 10 1

Total processing time: 9m23.796sec


BK_STOP 1679483423295

--------------------
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.000sec

18756 88337 137122 227958 317004 470504
iterations count:664243 (2656), effective:13396 (53)

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-5"
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-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 r234-tall-167856420200365"
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 ;