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.r207-tall-177969919700065.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 Parking-PT-208, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r207-tall-177969919700065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.2K Mar 8 08:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 8 08:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 8 08:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 8 08:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 8 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Mar 8 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 8 08:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 8 08:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 49K Mar 3 18:30 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 Parking-PT-208-UpperBounds-00
FORMULA_NAME Parking-PT-208-UpperBounds-01
FORMULA_NAME Parking-PT-208-UpperBounds-02
FORMULA_NAME Parking-PT-208-UpperBounds-03
FORMULA_NAME Parking-PT-208-UpperBounds-04
FORMULA_NAME Parking-PT-208-UpperBounds-05
FORMULA_NAME Parking-PT-208-UpperBounds-06
FORMULA_NAME Parking-PT-208-UpperBounds-07
FORMULA_NAME Parking-PT-208-UpperBounds-08
FORMULA_NAME Parking-PT-208-UpperBounds-09
FORMULA_NAME Parking-PT-208-UpperBounds-10
FORMULA_NAME Parking-PT-208-UpperBounds-11
FORMULA_NAME Parking-PT-208-UpperBounds-12
FORMULA_NAME Parking-PT-208-UpperBounds-13
FORMULA_NAME Parking-PT-208-UpperBounds-14
FORMULA_NAME Parking-PT-208-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779719606995

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 14:33:28] [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-05-25 14:33:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:33:28] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2026-05-25 14:33:28] [INFO ] Transformed 137 places.
[2026-05-25 14:33:28] [INFO ] Transformed 201 transitions.
[2026-05-25 14:33:28] [INFO ] Found NUPN structural information;
[2026-05-25 14:33:28] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 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 117 rows 137 cols
[2026-05-25 14:33:28] [INFO ] Computed 34 invariants in 12 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 (291 resets) in 50 ms. (196 steps per ms)
FORMULA Parking-PT-208-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (124 resets) in 68 ms. (724 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-25 14:33:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:28] [INFO ] [Real]Absence check using 32 positive place invariants in 12 ms returned sat
[2026-05-25 14:33:28] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 14:33:28] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-25 14:33:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-25 14:33:28] [INFO ] [Real]Added 26 Read/Feed constraints in 11 ms returned sat
[2026-05-25 14:33:28] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 14:33:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2026-05-25 14:33:29] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 14:33:29] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2026-05-25 14:33:29] [INFO ] [Nat]Added 26 Read/Feed constraints in 10 ms returned sat
[2026-05-25 14:33:29] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 14:33:29] [INFO ] Added : 95 causal constraints over 19 iterations in 249 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:29] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2026-05-25 14:33:29] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 14:33:29] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-25 14:33:29] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2026-05-25 14:33:29] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 14:33:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2026-05-25 14:33:29] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 14:33:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2026-05-25 14:33:29] [INFO ] [Nat]Added 26 Read/Feed constraints in 11 ms returned sat
[2026-05-25 14:33:29] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:33:29] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:33:29] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 3 ms to minimize.
[2026-05-25 14:33:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2026-05-25 14:33:29] [INFO ] Added : 58 causal constraints over 13 iterations in 303 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:30] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Real]Added 26 Read/Feed constraints in 8 ms returned sat
[2026-05-25 14:33:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:30] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2026-05-25 14:33:30] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 14:33:30] [INFO ] Added : 64 causal constraints over 13 iterations in 169 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:30] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Real]Added 26 Read/Feed constraints in 13 ms returned sat
[2026-05-25 14:33:30] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 14:33:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:33:30] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2026-05-25 14:33:30] [INFO ] [Nat]Added 26 Read/Feed constraints in 10 ms returned sat
[2026-05-25 14:33:30] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 14:33:30] [INFO ] Added : 89 causal constraints over 19 iterations in 230 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA Parking-PT-208-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 117/117 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 137 transition count 113
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 133 transition count 113
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 133 transition count 109
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 129 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 127 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 127 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 121 transition count 101
Free-agglomeration rule applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 121 transition count 81
Reduce places removed 20 places and 0 transitions.
Graph (complete) has 216 edges and 101 vertex of which 52 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 38 output transitions
Drop transitions (Output transitions of discarded places.) removed 38 transitions
Iterating post reduction 2 with 21 rules applied. Total rules applied 73 place count 52 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 52 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 51 transition count 40
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 4 with 25 rules applied. Total rules applied 101 place count 40 transition count 26
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 20 rules applied. Total rules applied 121 place count 26 transition count 20
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 126 place count 22 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 127 place count 21 transition count 19
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 127 place count 21 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 137 place count 16 transition count 14
Applied a total of 137 rules in 59 ms. Remains 16 /137 variables (removed 121) and now considering 14/117 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 16/137 places, 14/117 transitions.
// Phase 1: matrix 14 rows 16 cols
[2026-05-25 14:33:31] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 629 ms. (1587 steps per ms)
FORMULA Parking-PT-208-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-208-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 324 ms. (3076 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 )
[2026-05-25 14:33:32] [INFO ] Flatten gal took : 18 ms
[2026-05-25 14:33:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 14:33:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14111593021900240202.gal : 4 ms
[2026-05-25 14:33:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2699428463389875758.prop : 0 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/ReachabilityCardinality14111593021900240202.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2699428463389875758.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 4155 ms.

BK_STOP 1779719612446

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="Parking-PT-208"
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 Parking-PT-208, 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 r207-tall-177969919700065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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