Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428500299.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is LamportFastMutEx-COL-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 39K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620928931056

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:02:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 18:02:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:02:12] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-13 18:02:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 597 ms
[2021-05-13 18:02:13] [INFO ] sort/places :
pid * pid->P-wait,P-done,
pid * bool->P-b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2021-05-13 18:02:13] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 22 ms.
[2021-05-13 18:02:13] [INFO ] Computed order based on color domains.
[2021-05-13 18:02:13] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions in 10 ms.
[2021-05-13 18:02:13] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 68 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0]
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2021-05-13 18:02:13] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2021-05-13 18:02:13] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-13 18:02:13] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2021-05-13 18:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:13] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-13 18:02:13] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-13 18:02:13] [INFO ] [Real]Added 33 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:02:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:02:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2021-05-13 18:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:13] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-13 18:02:13] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2021-05-13 18:02:13] [INFO ] Deduced a trap composed of 22 places in 45 ms
[2021-05-13 18:02:13] [INFO ] Deduced a trap composed of 22 places in 39 ms
[2021-05-13 18:02:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2021-05-13 18:02:13] [INFO ] Computed and/alt/rep : 111/423/93 causal constraints in 7 ms.
[2021-05-13 18:02:14] [INFO ] Added : 90 causal constraints over 19 iterations in 163 ms. Result :sat
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 23 places in 32 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 26 places in 26 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 19 places in 26 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 18 places in 26 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 22 places in 26 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 20 places in 31 ms
[2021-05-13 18:02:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 234 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-13 18:02:14] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned unsat
[2021-05-13 18:02:14] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-13 18:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:14] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-13 18:02:14] [INFO ] [Real]Added 33 Read/Feed constraints in 14 ms returned sat
[2021-05-13 18:02:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:02:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-13 18:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:14] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-13 18:02:14] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 15 places in 23 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 11 places in 22 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 15 places in 19 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 15 places in 24 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 17 places in 18 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 14 places in 16 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 12 places in 18 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 12 places in 15 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-13 18:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 208 ms
[2021-05-13 18:02:14] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-13 18:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:14] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-13 18:02:14] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:02:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:02:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-13 18:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:14] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-13 18:02:14] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 15 places in 24 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 11 places in 23 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 15 places in 20 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 15 places in 20 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 17 places in 17 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 14 places in 15 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 12 places in 15 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 12 places in 13 ms
[2021-05-13 18:02:14] [INFO ] Deduced a trap composed of 5 places in 12 ms
[2021-05-13 18:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 190 ms
[2021-05-13 18:02:14] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned unsat
[2021-05-13 18:02:15] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-13 18:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:15] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-13 18:02:15] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:02:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:02:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-13 18:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:15] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-13 18:02:15] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2021-05-13 18:02:15] [INFO ] Deduced a trap composed of 9 places in 23 ms
[2021-05-13 18:02:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-13 18:02:15] [INFO ] Computed and/alt/rep : 111/423/93 causal constraints in 6 ms.
[2021-05-13 18:02:15] [INFO ] Added : 76 causal constraints over 17 iterations in 125 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-13 18:02:15] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-13 18:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:15] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-13 18:02:15] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2021-05-13 18:02:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:02:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2021-05-13 18:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:02:15] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-13 18:02:15] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2021-05-13 18:02:15] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2021-05-13 18:02:15] [INFO ] Deduced a trap composed of 18 places in 24 ms
[2021-05-13 18:02:15] [INFO ] Deduced a trap composed of 11 places in 28 ms
[2021-05-13 18:02:15] [INFO ] Deduced a trap composed of 9 places in 27 ms
[2021-05-13 18:02:15] [INFO ] Deduced a trap composed of 11 places in 21 ms
[2021-05-13 18:02:15] [INFO ] Deduced a trap composed of 11 places in 24 ms
[2021-05-13 18:02:15] [INFO ] Deduced a trap composed of 8 places in 26 ms
[2021-05-13 18:02:15] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2021-05-13 18:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 236 ms
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 16800 steps, including 626 resets, run finished after 62 ms. (steps per millisecond=270 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 22400 steps, including 595 resets, run finished after 65 ms. (steps per millisecond=344 ) properties seen :[0, 0] could not realise parikh vector
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 71/71 places, 114/114 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 68 transition count 111
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 68 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 65 transition count 108
Applied a total of 12 rules in 22 ms. Remains 65 /71 variables (removed 6) and now considering 108/114 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/71 places, 108/114 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 715 ms. (steps per millisecond=1398 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 722 ms. (steps per millisecond=1385 ) properties seen :[0, 0]
Probably explored full state space saw : 15512 states, properties seen :[0, 0]
Probabilistic random walk after 61100 steps, saw 15512 distinct states, run finished after 162 ms. (steps per millisecond=377 ) properties seen :[0, 0]
Explored full state space saw : 15512 states, properties seen :[0, 0]
Exhaustive walk after 61100 steps, saw 15512 distinct states, run finished after 92 ms. (steps per millisecond=664 ) properties seen :[0, 0]
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.

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

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-3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is LamportFastMutEx-COL-3, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428500299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-3.tgz
mv LamportFastMutEx-COL-3 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;