Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r351-smll-178021502100028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is ErlangenMainframeV2-PT-bP02C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.2K May 27 09:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 27 09:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 09:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 09:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 27 10:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 27 09:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 27 09:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 67K May 26 18:17 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

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

=== Now, execution of the tool begins

BK_START 1780320715312

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP02C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 13:31:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-01 13:31:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 13:31:58] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2026-06-01 13:31:58] [INFO ] Transformed 199 places.
[2026-06-01 13:31:58] [INFO ] Transformed 259 transitions.
[2026-06-01 13:31:58] [INFO ] Found NUPN structural information;
[2026-06-01 13:31:58] [INFO ] Parsed PT model containing 199 places and 259 transitions and 872 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 259 rows 199 cols
[2026-06-01 13:31:58] [INFO ] Computed 12 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 101 ms. (98 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20000 steps (4 resets) in 97 ms. (204 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-06-01 13:31:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:31:59] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2026-06-01 13:31:59] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 25 ms returned sat
[2026-06-01 13:31:59] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2026-06-01 13:31:59] [INFO ] Computed and/alt/rep : 226/602/226 causal constraints (skipped 32 transitions) in 76 ms.
[2026-06-01 13:31:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:31:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 17 ms returned sat
[2026-06-01 13:31:59] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 2 ms returned sat
[2026-06-01 13:32:00] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2026-06-01 13:32:00] [INFO ] Computed and/alt/rep : 226/602/226 causal constraints (skipped 32 transitions) in 48 ms.
[2026-06-01 13:32:01] [INFO ] Added : 176 causal constraints over 36 iterations in 1411 ms. Result :sat
Minimization took 134 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:01] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2026-06-01 13:32:01] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:02] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:02] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 25 ms to minimize.
[2026-06-01 13:32:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2026-06-01 13:32:02] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:02] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:02] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 21 ms to minimize.
[2026-06-01 13:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2026-06-01 13:32:02] [INFO ] Computed and/alt/rep : 226/602/226 causal constraints (skipped 32 transitions) in 43 ms.
[2026-06-01 13:32:04] [INFO ] Added : 174 causal constraints over 35 iterations in 1342 ms. Result :sat
Minimization took 230 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 199 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p18) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 256/256 transitions.
Graph (trivial) has 187 edges and 199 vertex of which 12 / 199 are part of one of the 5 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 191 transition count 158
Reduce places removed 85 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 97 rules applied. Total rules applied 183 place count 106 transition count 145
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 186 place count 103 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 186 place count 103 transition count 141
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 195 place count 98 transition count 141
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 218 place count 75 transition count 118
Iterating global reduction 3 with 23 rules applied. Total rules applied 241 place count 75 transition count 118
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 241 place count 75 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 251 place count 70 transition count 113
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 260 place count 61 transition count 82
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 270 place count 60 transition count 82
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 273 place count 57 transition count 68
Iterating global reduction 3 with 3 rules applied. Total rules applied 276 place count 57 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 277 place count 56 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 278 place count 56 transition count 66
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 316 place count 37 transition count 47
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 330 place count 30 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 340 place count 30 transition count 51
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 342 place count 28 transition count 46
Iterating global reduction 4 with 2 rules applied. Total rules applied 344 place count 28 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 348 place count 28 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 350 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 361 place count 27 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 363 place count 26 transition count 39
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 368 place count 26 transition count 34
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 378 place count 21 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 380 place count 21 transition count 27
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 381 place count 21 transition count 33
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 384 place count 20 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 390 place count 20 transition count 25
Applied a total of 390 rules in 110 ms. Remains 20 /199 variables (removed 179) and now considering 25/256 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 20/199 places, 25/256 transitions.
[2026-06-01 13:32:05] [INFO ] Flow matrix only has 24 transitions (discarded 1 similar events)
// Phase 1: matrix 24 rows 20 cols
[2026-06-01 13:32:05] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47008 resets) in 1524 ms. (655 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP02C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (11665 resets) in 472 ms. (2114 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-06-01 13:32:07] [INFO ] Flatten gal took : 33 ms
[2026-06-01 13:32:07] [INFO ] Flatten gal took : 9 ms
[2026-06-01 13:32:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3782703209926264183.gal : 8 ms
[2026-06-01 13:32:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17345025684736067409.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3782703209926264183.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17345025684736067409.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9686 ms.

BK_STOP 1780320727523

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ErlangenMainframeV2-PT-bP02C02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is ErlangenMainframeV2-PT-bP02C02, 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 r351-smll-178021502100028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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