Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r041-smll-174853822500005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is BusinessProcesses-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-smll-174853822500005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 85K May 29 14:32 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 BusinessProcesses-PT-05-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748546989828

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:29:52] [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]
[2025-05-29 19:29:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:29:52] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2025-05-29 19:29:53] [INFO ] Transformed 368 places.
[2025-05-29 19:29:53] [INFO ] Transformed 319 transitions.
[2025-05-29 19:29:53] [INFO ] Found NUPN structural information;
[2025-05-29 19:29:53] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 1 transitions.
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 318 rows 367 cols
[2025-05-29 19:29:53] [INFO ] Computed 57 invariants in 44 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 (92 resets) in 88 ms. (112 steps per ms)
FORMULA BusinessProcesses-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (17 resets) in 55 ms. (178 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 19:29:53] [INFO ] Invariant cache hit.
[2025-05-29 19:29:54] [INFO ] [Real]Absence check using 41 positive place invariants in 57 ms returned sat
[2025-05-29 19:29:54] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 12 ms returned sat
[2025-05-29 19:29:54] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-05-29 19:29:54] [INFO ] Deduced a trap composed of 21 places in 415 ms of which 26 ms to minimize.
[2025-05-29 19:29:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:29:55] [INFO ] [Nat]Absence check using 41 positive place invariants in 50 ms returned sat
[2025-05-29 19:29:55] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 10 ms returned sat
[2025-05-29 19:29:55] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-05-29 19:29:55] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 6 ms to minimize.
[2025-05-29 19:29:56] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 5 ms to minimize.
[2025-05-29 19:29:56] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 6 ms to minimize.
[2025-05-29 19:29:56] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 5 ms to minimize.
[2025-05-29 19:29:56] [INFO ] Deduced a trap composed of 84 places in 275 ms of which 5 ms to minimize.
[2025-05-29 19:29:57] [INFO ] Deduced a trap composed of 87 places in 267 ms of which 5 ms to minimize.
[2025-05-29 19:29:57] [INFO ] Deduced a trap composed of 87 places in 179 ms of which 5 ms to minimize.
[2025-05-29 19:29:57] [INFO ] Deduced a trap composed of 81 places in 260 ms of which 4 ms to minimize.
[2025-05-29 19:29:57] [INFO ] Deduced a trap composed of 89 places in 227 ms of which 5 ms to minimize.
[2025-05-29 19:29:58] [INFO ] Deduced a trap composed of 85 places in 278 ms of which 4 ms to minimize.
[2025-05-29 19:29:58] [INFO ] Deduced a trap composed of 85 places in 252 ms of which 5 ms to minimize.
[2025-05-29 19:29:58] [INFO ] Deduced a trap composed of 84 places in 270 ms of which 5 ms to minimize.
[2025-05-29 19:29:59] [INFO ] Deduced a trap composed of 83 places in 241 ms of which 6 ms to minimize.
[2025-05-29 19:29:59] [INFO ] Deduced a trap composed of 86 places in 258 ms of which 4 ms to minimize.
[2025-05-29 19:29:59] [INFO ] Deduced a trap composed of 87 places in 236 ms of which 5 ms to minimize.
[2025-05-29 19:29:59] [INFO ] Deduced a trap composed of 87 places in 195 ms of which 4 ms to minimize.
[2025-05-29 19:30:00] [INFO ] Deduced a trap composed of 85 places in 257 ms of which 4 ms to minimize.
[2025-05-29 19:30:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 367 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p281) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 317/317 transitions.
Graph (trivial) has 233 edges and 367 vertex of which 8 / 367 are part of one of the 1 SCC in 8 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 699 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 685 edges and 356 vertex of which 349 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 349 transition count 211
Reduce places removed 91 places and 3 transitions.
Graph (complete) has 577 edges and 258 vertex of which 255 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 1 with 92 rules applied. Total rules applied 185 place count 255 transition count 206
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 187 place count 253 transition count 204
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 554 edges and 251 vertex of which 244 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 191 place count 244 transition count 196
Reduce places removed 5 places and 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 196 place count 239 transition count 192
Reduce places removed 4 places and 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 200 place count 235 transition count 188
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 45 Pre rules applied. Total rules applied 200 place count 235 transition count 143
Deduced a syphon composed of 45 places in 3 ms
Ensure Unique test removed 12 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 302 place count 178 transition count 143
Discarding 49 places :
Symmetric choice reduction at 6 with 49 rule applications. Total rules 351 place count 129 transition count 94
Iterating global reduction 6 with 49 rules applied. Total rules applied 400 place count 129 transition count 94
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 400 place count 129 transition count 89
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 412 place count 122 transition count 89
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 512 place count 72 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 513 place count 71 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 514 place count 70 transition count 38
Applied a total of 514 rules in 216 ms. Remains 70 /367 variables (removed 297) and now considering 38/317 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 70/367 places, 38/317 transitions.
// Phase 1: matrix 38 rows 70 cols
[2025-05-29 19:30:00] [INFO ] Computed 35 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (64949 resets) in 2382 ms. (419 steps per ms)
FORMULA BusinessProcesses-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (52122 resets) in 1833 ms. (545 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 )
[2025-05-29 19:30:04] [INFO ] Flatten gal took : 42 ms
[2025-05-29 19:30:04] [INFO ] Flatten gal took : 14 ms
[2025-05-29 19:30:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12551586993871795589.gal : 9 ms
[2025-05-29 19:30:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15402594125303430873.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12551586993871795589.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15402594125303430873.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 12533 ms.

BK_STOP 1748547005127

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="BusinessProcesses-PT-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is BusinessProcesses-PT-05, 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 r041-smll-174853822500005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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