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.r576-smll-171734920200166.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 itstools
Input is MedleyA-PT-21, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920200166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 70K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-21-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717394236123

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-03 05:57:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 05:57:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 05:57:18] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-06-03 05:57:18] [INFO ] Transformed 306 places.
[2024-06-03 05:57:18] [INFO ] Transformed 298 transitions.
[2024-06-03 05:57:18] [INFO ] Found NUPN structural information;
[2024-06-03 05:57:18] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2162 ms. (18 steps per ms) remains 4/11 properties
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 05:57:19] [INFO ] Flatten gal took : 139 ms
BEST_FIRST walk for 40002 steps (8 resets) in 660 ms. (60 steps per ms) remains 3/4 properties
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-03 05:57:20] [INFO ] Flatten gal took : 151 ms
[2024-06-03 05:57:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10488267274977312295.gal : 69 ms
[2024-06-03 05:57:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5030189273280623457.prop : 14 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/ReachabilityCardinality10488267274977312295.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5030189273280623457.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5030189273280623457.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 1471 ms. (27 steps per ms) remains 2/3 properties
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :14 after 88
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :88 after 836
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :836 after 10622
BEST_FIRST walk for 40002 steps (8 resets) in 383 ms. (104 steps per ms) remains 2/2 properties
// Phase 1: matrix 298 rows 306 cols
[2024-06-03 05:57:20] [INFO ] Computed 20 invariants in 29 ms
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :10622 after 515134
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 278/295 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 278/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 11/306 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 11/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 298/604 variables, 306/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/604 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 632 constraints, problems are : Problem set: 0 solved, 2 unsolved in 994 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 278/295 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 278/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 05:57:22] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 18 ms to minimize.
[2024-06-03 05:57:22] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-06-03 05:57:22] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 4 ms to minimize.
[2024-06-03 05:57:22] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-06-03 05:57:22] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-03 05:57:22] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-03 05:57:23] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2024-06-03 05:57:23] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-06-03 05:57:23] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2024-06-03 05:57:23] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 9 ms to minimize.
[2024-06-03 05:57:23] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 11/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 05:57:23] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-06-03 05:57:23] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 7 ms to minimize.
[2024-06-03 05:57:23] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-06-03 05:57:23] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/306 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 11/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 05:57:24] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-03 05:57:24] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 298/604 variables, 306/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/604 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/604 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 05:57:24] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/604 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 05:57:24] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/604 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/604 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/604 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 653 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3318 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 4455ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 197 ms.
Support contains 16 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 298/298 transitions.
Graph (trivial) has 207 edges and 306 vertex of which 6 / 306 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 301 transition count 212
Reduce places removed 80 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 86 rules applied. Total rules applied 167 place count 221 transition count 206
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 173 place count 215 transition count 206
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 173 place count 215 transition count 176
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 233 place count 185 transition count 176
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 263 place count 155 transition count 146
Iterating global reduction 3 with 30 rules applied. Total rules applied 293 place count 155 transition count 146
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 293 place count 155 transition count 140
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 305 place count 149 transition count 140
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 371 place count 116 transition count 107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 387 place count 108 transition count 154
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 398 place count 108 transition count 143
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 411 place count 97 transition count 141
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 414 place count 97 transition count 141
Applied a total of 414 rules in 156 ms. Remains 97 /306 variables (removed 209) and now considering 141/298 (removed 157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 97/306 places, 141/298 transitions.
RANDOM walk for 31155 steps (901 resets) in 617 ms. (50 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 7221 ms.

BK_STOP 1717394245746

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="MedleyA-PT-21"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-21, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920200166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-21.tgz
mv MedleyA-PT-21 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;