Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100125.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BusinessProcesses-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 9.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 30 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 59K May 10 09:33 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 BusinessProcesses-PT-02-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655082907157

Running Version 0
[2022-06-13 01:15:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:15:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:15:08] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2022-06-13 01:15:08] [INFO ] Transformed 262 places.
[2022-06-13 01:15:09] [INFO ] Transformed 219 transitions.
[2022-06-13 01:15:09] [INFO ] Found NUPN structural information;
[2022-06-13 01:15:09] [INFO ] Parsed PT model containing 262 places and 219 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 137 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :6
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 204 rows 245 cols
[2022-06-13 01:15:09] [INFO ] Computed 43 place invariants in 18 ms
[2022-06-13 01:15:09] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2022-06-13 01:15:09] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:09] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-13 01:15:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:09] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2022-06-13 01:15:09] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:10] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-13 01:15:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2022-06-13 01:15:10] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2022-06-13 01:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:10] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 3 ms to minimize.
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:15:10] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2022-06-13 01:15:11] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:15:11] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:15:11] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2022-06-13 01:15:11] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:15:11] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:15:11] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-13 01:15:11] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1213 ms
[2022-06-13 01:15:11] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 15 ms.
[2022-06-13 01:15:11] [INFO ] Added : 83 causal constraints over 17 iterations in 364 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-13 01:15:11] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2022-06-13 01:15:11] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:11] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-06-13 01:15:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:12] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2022-06-13 01:15:12] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:12] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-06-13 01:15:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:12] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2022-06-13 01:15:12] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 10 ms returned sat
[2022-06-13 01:15:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:12] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2022-06-13 01:15:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:12] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2022-06-13 01:15:12] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2022-06-13 01:15:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:13] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-13 01:15:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2022-06-13 01:15:13] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:13] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2022-06-13 01:15:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 56 places in 32 ms of which 0 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 1 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 5 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:15:14] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 77 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 0 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:15:15] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 2579 ms
[2022-06-13 01:15:15] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 12 ms.
[2022-06-13 01:15:16] [INFO ] Added : 124 causal constraints over 25 iterations in 602 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1351 steps, including 17 resets, run visited all 2 properties in 5 ms. (steps per millisecond=270 )
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655082917505

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BusinessProcesses-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BusinessProcesses-PT-02, 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 r028-tall-165251936100125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 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 ;