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.r064-tall-162038397500619.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 itstools
Input is DNAwalker-PT-12ringLLLarge, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397500619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 22 17:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 14 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 135K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620545179109

Running Version 0
[2021-05-09 07:26:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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]
[2021-05-09 07:26:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:26:20] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-09 07:26:20] [INFO ] Transformed 33 places.
[2021-05-09 07:26:20] [INFO ] Transformed 312 transitions.
[2021-05-09 07:26:20] [INFO ] Parsed PT model containing 33 places and 312 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 311 out of 312 initially.
// Phase 1: matrix 311 rows 33 cols
[2021-05-09 07:26:20] [INFO ] Computed 0 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 767 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :25
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :27
[2021-05-09 07:26:21] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2021-05-09 07:26:21] [INFO ] Computed 0 place invariants in 9 ms
[2021-05-09 07:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:21] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-09 07:26:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:21] [INFO ] [Nat]Absence check using state equation in 380 ms returned unsat
[2021-05-09 07:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:21] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-09 07:26:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:21] [INFO ] [Nat]Absence check using state equation in 179 ms returned unsat
[2021-05-09 07:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:21] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-09 07:26:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:24] [INFO ] [Nat]Absence check using state equation in 3042 ms returned unknown
[2021-05-09 07:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 07:26:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:26] [INFO ] [Nat]Absence check using state equation in 980 ms returned unsat
[2021-05-09 07:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:26] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-09 07:26:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:27] [INFO ] [Nat]Absence check using state equation in 935 ms returned unsat
[2021-05-09 07:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:27] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-09 07:26:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:27] [INFO ] [Nat]Absence check using state equation in 360 ms returned unsat
[2021-05-09 07:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:27] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2021-05-09 07:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:27] [INFO ] [Real]Absence check using state equation in 63 ms returned unsat
[2021-05-09 07:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:27] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2021-05-09 07:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:27] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 07:26:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:30] [INFO ] [Nat]Absence check using state equation in 2191 ms returned unsat
[2021-05-09 07:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:30] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-09 07:26:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:33] [INFO ] [Nat]Absence check using state equation in 3166 ms returned unknown
[2021-05-09 07:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:33] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-09 07:26:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:34] [INFO ] [Nat]Absence check using state equation in 1340 ms returned unsat
[2021-05-09 07:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:34] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-09 07:26:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:35] [INFO ] [Nat]Absence check using state equation in 886 ms returned unsat
[2021-05-09 07:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:35] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2021-05-09 07:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:35] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-09 07:26:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:36] [INFO ] [Nat]Absence check using state equation in 890 ms returned unsat
[2021-05-09 07:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:36] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, -1, 2, 2, 2, 1, 1, 1, 2, -1, 2, 2, 1, 2, 1] Max seen :[2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 1, 2, 1]
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 312/312 transitions.
Graph (complete) has 304 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 32 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 31 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 30 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 29 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 28 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 27 transition count 285
Applied a total of 27 rules in 95 ms. Remains 27 /33 variables (removed 6) and now considering 285/312 (removed 27) transitions.
// Phase 1: matrix 285 rows 27 cols
[2021-05-09 07:26:36] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 07:26:36] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/33 places, 285/312 transitions.
// Phase 1: matrix 285 rows 27 cols
[2021-05-09 07:26:36] [INFO ] Computed 0 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 77502 resets, run finished after 4009 ms. (steps per millisecond=249 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7505 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7549 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 2) seen :4
// Phase 1: matrix 285 rows 27 cols
[2021-05-09 07:26:42] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-09 07:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:42] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-09 07:26:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:43] [INFO ] [Nat]Absence check using state equation in 488 ms returned unsat
[2021-05-09 07:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:43] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-09 07:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:43] [INFO ] [Nat]Absence check using state equation in 493 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2] Max seen :[2, 2]
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620545204438

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="DNAwalker-PT-12ringLLLarge"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DNAwalker-PT-12ringLLLarge, 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 r064-tall-162038397500619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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