Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349000021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 12 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 05:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.1M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716565877147

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 15:51:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 15:51:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:51:18] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2024-05-24 15:51:18] [INFO ] Transformed 4260 places.
[2024-05-24 15:51:18] [INFO ] Transformed 6027 transitions.
[2024-05-24 15:51:18] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 15:51:18] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2024-05-24 15:51:19] [INFO ] Computed 497 invariants in 386 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:[19, 51, 51, 51, 17, 1, 17, 17, 17, 17, 17, 51, 1, 17, 17, 17]
RANDOM walk for 10000 steps (238 resets) in 126 ms. (78 steps per ms)
BEST_FIRST walk for 160012 steps (976 resets) in 516 ms. (309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1] Max Struct:[19, 51, 51, 51, 17, 1, 17, 17, 17, 17, 17, 51, 1, 17, 17, 17]
[2024-05-24 15:51:19] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
[2024-05-24 15:51:19] [INFO ] Invariant cache hit.
[2024-05-24 15:51:20] [INFO ] [Real]Absence check using 46 positive place invariants in 66 ms returned sat
[2024-05-24 15:51:20] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 104 ms returned unsat
[2024-05-24 15:51:21] [INFO ] [Real]Absence check using 46 positive place invariants in 61 ms returned sat
[2024-05-24 15:51:21] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 114 ms returned unsat
[2024-05-24 15:51:21] [INFO ] [Real]Absence check using 46 positive place invariants in 59 ms returned sat
[2024-05-24 15:51:21] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 110 ms returned unsat
[2024-05-24 15:51:22] [INFO ] [Real]Absence check using 46 positive place invariants in 58 ms returned sat
[2024-05-24 15:51:22] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 119 ms returned unsat
[2024-05-24 15:51:23] [INFO ] [Real]Absence check using 46 positive place invariants in 58 ms returned sat
[2024-05-24 15:51:23] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 120 ms returned unsat
[2024-05-24 15:51:23] [INFO ] [Real]Absence check using 46 positive place invariants in 52 ms returned sat
[2024-05-24 15:51:23] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 141 ms returned sat
[2024-05-24 15:51:26] [INFO ] [Real]Absence check using state equation in 2958 ms returned sat
[2024-05-24 15:51:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:51:27] [INFO ] [Nat]Absence check using 46 positive place invariants in 55 ms returned sat
[2024-05-24 15:51:27] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 139 ms returned sat
[2024-05-24 15:51:30] [INFO ] [Nat]Absence check using state equation in 2899 ms returned sat
[2024-05-24 15:51:30] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2024-05-24 15:51:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 15:51:31] [INFO ] [Nat]Added 1634 Read/Feed constraints in 1088 ms returned unknown
[2024-05-24 15:51:32] [INFO ] [Real]Absence check using 46 positive place invariants in 57 ms returned sat
[2024-05-24 15:51:32] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 115 ms returned unsat
[2024-05-24 15:51:32] [INFO ] [Real]Absence check using 46 positive place invariants in 55 ms returned sat
[2024-05-24 15:51:32] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 97 ms returned unsat
[2024-05-24 15:51:33] [INFO ] [Real]Absence check using 46 positive place invariants in 56 ms returned sat
[2024-05-24 15:51:33] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 105 ms returned unsat
[2024-05-24 15:51:33] [INFO ] [Real]Absence check using 46 positive place invariants in 53 ms returned sat
[2024-05-24 15:51:33] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 105 ms returned unsat
[2024-05-24 15:51:34] [INFO ] [Real]Absence check using 46 positive place invariants in 53 ms returned sat
[2024-05-24 15:51:34] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 156 ms returned sat
[2024-05-24 15:51:37] [INFO ] [Real]Absence check using state equation in 3059 ms returned sat
[2024-05-24 15:51:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:51:38] [INFO ] [Nat]Absence check using 46 positive place invariants in 54 ms returned sat
[2024-05-24 15:51:38] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 141 ms returned sat
[2024-05-24 15:51:41] [INFO ] [Nat]Absence check using state equation in 3080 ms returned sat
[2024-05-24 15:51:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 15:51:42] [INFO ] [Nat]Added 1634 Read/Feed constraints in 1305 ms returned unknown
[2024-05-24 15:51:43] [INFO ] [Real]Absence check using 46 positive place invariants in 58 ms returned sat
[2024-05-24 15:51:43] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 118 ms returned unsat
[2024-05-24 15:51:43] [INFO ] [Real]Absence check using 46 positive place invariants in 54 ms returned sat
[2024-05-24 15:51:44] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 147 ms returned sat
[2024-05-24 15:51:46] [INFO ] [Real]Absence check using state equation in 2882 ms returned sat
[2024-05-24 15:51:47] [INFO ] [Real]Added 1634 Read/Feed constraints in 230 ms returned unsat
[2024-05-24 15:51:47] [INFO ] [Real]Absence check using 46 positive place invariants in 56 ms returned sat
[2024-05-24 15:51:47] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 103 ms returned unsat
[2024-05-24 15:51:48] [INFO ] [Real]Absence check using 46 positive place invariants in 61 ms returned sat
[2024-05-24 15:51:48] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 146 ms returned unsat
[2024-05-24 15:51:48] [INFO ] [Real]Absence check using 46 positive place invariants in 56 ms returned sat
[2024-05-24 15:51:48] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 104 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 17]
Support contains 2 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.17 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1087 transitions
Trivial Post-agglo rules discarded 1087 transitions
Performed 1087 trivial Post agglomeration. Transition count delta: 1087
Iterating post reduction 0 with 1087 rules applied. Total rules applied 1088 place count 4232 transition count 4940
Reduce places removed 1087 places and 0 transitions.
Iterating post reduction 1 with 1087 rules applied. Total rules applied 2175 place count 3145 transition count 4940
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 136 Pre rules applied. Total rules applied 2175 place count 3145 transition count 4804
Deduced a syphon composed of 136 places in 8 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 2447 place count 3009 transition count 4804
Discarding 951 places :
Symmetric choice reduction at 2 with 951 rule applications. Total rules 3398 place count 2058 transition count 3853
Iterating global reduction 2 with 951 rules applied. Total rules applied 4349 place count 2058 transition count 3853
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4349 place count 2058 transition count 3846
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4363 place count 2051 transition count 3846
Discarding 237 places :
Symmetric choice reduction at 2 with 237 rule applications. Total rules 4600 place count 1814 transition count 2898
Iterating global reduction 2 with 237 rules applied. Total rules applied 4837 place count 1814 transition count 2898
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 4871 place count 1797 transition count 2881
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 2 with 161 rules applied. Total rules applied 5032 place count 1797 transition count 3431
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 2 with 161 rules applied. Total rules applied 5193 place count 1636 transition count 3431
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 5210 place count 1636 transition count 3431
Applied a total of 5210 rules in 1377 ms. Remains 1636 /4260 variables (removed 2624) and now considering 3431/6027 (removed 2596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1393 ms. Remains : 1636/4260 places, 3431/6027 transitions.
[2024-05-24 15:51:50] [INFO ] Flow matrix only has 3033 transitions (discarded 398 similar events)
// Phase 1: matrix 3033 rows 1636 cols
[2024-05-24 15:51:50] [INFO ] Computed 469 invariants in 102 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (39557 resets) in 13182 ms. (75 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (6883 resets) in 3022 ms. (330 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 15:52:06] [INFO ] Flow matrix only has 3033 transitions (discarded 398 similar events)
[2024-05-24 15:52:06] [INFO ] Invariant cache hit.
[2024-05-24 15:52:06] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-24 15:52:07] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 69 ms returned sat
[2024-05-24 15:52:07] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2024-05-24 15:52:07] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2024-05-24 15:52:08] [INFO ] [Real]Added 1634 Read/Feed constraints in 269 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[0]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 25 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 50091 ms.
ITS solved all properties within timeout

BK_STOP 1716565928365

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C04, 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 r245-tall-171654349000021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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