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.r276-smll-165307353300405.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 itstools
Input is ViralEpidemic-PT-S16D2C4A02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353300405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 8.2K Apr 29 12:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 12:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 12:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 9 09:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 09:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 09:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 11 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.2M May 10 09:34 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 ViralEpidemic-PT-S16D2C4A02-UpperBounds-00
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-01
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-02
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-03
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-04
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-05
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-06
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-07
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-08
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-09
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-10
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-11
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-12
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-13
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-14
FORMULA_NAME ViralEpidemic-PT-S16D2C4A02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653250263440

Running Version 202205111006
[2022-05-22 20:11:05] [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]
[2022-05-22 20:11:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 20:11:06] [INFO ] Load time of PNML (sax parser for PT used): 838 ms
[2022-05-22 20:11:06] [INFO ] Transformed 4915 places.
[2022-05-22 20:11:06] [INFO ] Transformed 9009 transitions.
[2022-05-22 20:11:06] [INFO ] Parsed PT model containing 4915 places and 9009 transitions in 1163 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
// Phase 1: matrix 9009 rows 4915 cols
[2022-05-22 20:11:07] [INFO ] Computed 1 place invariants in 543 ms
Incomplete random walk after 10000 steps, including 12 resets, run finished after 759 ms. (steps per millisecond=13 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 16) seen :6
// Phase 1: matrix 9009 rows 4915 cols
[2022-05-22 20:11:10] [INFO ] Computed 1 place invariants in 320 ms
[2022-05-22 20:11:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 159 ms returned sat
[2022-05-22 20:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:15] [INFO ] [Real]Absence check using state equation in 3708 ms returned unknown
[2022-05-22 20:11:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 101 ms returned sat
[2022-05-22 20:11:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:20] [INFO ] [Real]Absence check using state equation in 3864 ms returned unsat
[2022-05-22 20:11:21] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 101 ms returned sat
[2022-05-22 20:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:25] [INFO ] [Real]Absence check using state equation in 3903 ms returned unsat
[2022-05-22 20:11:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 101 ms returned sat
[2022-05-22 20:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:30] [INFO ] [Real]Absence check using state equation in 3933 ms returned unknown
[2022-05-22 20:11:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 102 ms returned sat
[2022-05-22 20:11:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:33] [INFO ] [Real]Absence check using state equation in 2223 ms returned unsat
[2022-05-22 20:11:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 102 ms returned sat
[2022-05-22 20:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:38] [INFO ] [Real]Absence check using state equation in 4074 ms returned unknown
[2022-05-22 20:11:39] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 100 ms returned sat
[2022-05-22 20:11:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:41] [INFO ] [Real]Absence check using state equation in 2786 ms returned unsat
[2022-05-22 20:11:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 117 ms returned sat
[2022-05-22 20:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:44] [INFO ] [Real]Absence check using state equation in 1685 ms returned unsat
[2022-05-22 20:11:45] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 100 ms returned sat
[2022-05-22 20:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:47] [INFO ] [Real]Absence check using state equation in 2145 ms returned unsat
[2022-05-22 20:11:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 101 ms returned sat
[2022-05-22 20:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:50] [INFO ] [Real]Absence check using state equation in 1951 ms returned unsat
[2022-05-22 20:11:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 149 ms returned sat
[2022-05-22 20:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:54] [INFO ] [Real]Absence check using state equation in 2839 ms returned unsat
[2022-05-22 20:11:55] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 100 ms returned sat
[2022-05-22 20:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:11:58] [INFO ] [Real]Absence check using state equation in 3039 ms returned unsat
[2022-05-22 20:11:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 100 ms returned sat
[2022-05-22 20:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:12:01] [INFO ] [Real]Absence check using state equation in 2132 ms returned unsat
[2022-05-22 20:12:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 104 ms returned sat
[2022-05-22 20:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:12:03] [INFO ] [Real]Absence check using state equation in 1961 ms returned unsat
[2022-05-22 20:12:05] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 101 ms returned sat
[2022-05-22 20:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:12:08] [INFO ] [Real]Absence check using state equation in 3924 ms returned unknown
[2022-05-22 20:12:09] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 105 ms returned sat
[2022-05-22 20:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:12:13] [INFO ] [Real]Absence check using state equation in 3654 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 1, 4, -1, 1, -1, 1, 1, 1, 2, 1, 1, 1, 1, -1, 1] Max seen :[1, 1, 4, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 4915 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4915/4915 places, 9009/9009 transitions.
Graph (complete) has 4368 edges and 4915 vertex of which 19 are kept as prefixes of interest. Removing 4896 places using SCC suffix rule.24 ms
Discarding 4896 places :
Also discarding 8862 output transitions
Drop transitions removed 8862 transitions
Drop transitions removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 19 transition count 15
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 137 place count 15 transition count 11
Iterating global reduction 1 with 4 rules applied. Total rules applied 141 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 145 place count 13 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 12 transition count 8
Applied a total of 146 rules in 112 ms. Remains 12 /4915 variables (removed 4903) and now considering 8/9009 (removed 9001) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/4915 places, 8/9009 transitions.
// Phase 1: matrix 8 rows 12 cols
[2022-05-22 20:12:13] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 111111 resets, run finished after 1544 ms. (steps per millisecond=647 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 30763 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 30768 resets, run finished after 275 ms. (steps per millisecond=3636 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 30776 resets, run finished after 358 ms. (steps per millisecond=2793 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 30768 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 4) seen :4
// Phase 1: matrix 8 rows 12 cols
[2022-05-22 20:12:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-22 20:12:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-22 20:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:12:16] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2022-05-22 20:12:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-22 20:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:12:16] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2022-05-22 20:12:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-22 20:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:12:16] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2022-05-22 20:12:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-22 20:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 20:12:16] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[1, 1, 1, 1]
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S16D2C4A02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 70989 ms.

BK_STOP 1653250336602

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ViralEpidemic-PT-S16D2C4A02"
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 ViralEpidemic-PT-S16D2C4A02, 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 r276-smll-165307353300405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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