fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987900400590
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DLCround-PT-11b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.590 3600000.00 69705.00 150.60 FFFFTFTTFFTFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900400590.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DLCround-PT-11b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900400590
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.9K Mar 30 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 00:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 00:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 24 05:37 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 DLCround-PT-11b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591256027714

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 07:33:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 07:33:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 07:33:51] [INFO ] Load time of PNML (sax parser for PT used): 596 ms
[2020-06-04 07:33:51] [INFO ] Transformed 4375 places.
[2020-06-04 07:33:51] [INFO ] Transformed 6991 transitions.
[2020-06-04 07:33:51] [INFO ] Found NUPN structural information;
[2020-06-04 07:33:51] [INFO ] Parsed PT model containing 4375 places and 6991 transitions in 884 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 515 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-11b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 251 ms. (steps per millisecond=39 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 1, 1, 1]
FORMULA DLCround-PT-11b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 6991 rows 4375 cols
[2020-06-04 07:33:53] [INFO ] Computed 244 place invariants in 272 ms
[2020-06-04 07:33:55] [INFO ] [Real]Absence check using 244 positive place invariants in 1526 ms returned sat
[2020-06-04 07:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:33:58] [INFO ] [Real]Absence check using state equation in 2450 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 07:34:00] [INFO ] [Real]Absence check using 244 positive place invariants in 1416 ms returned sat
[2020-06-04 07:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:34:03] [INFO ] [Real]Absence check using state equation in 2744 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 07:34:05] [INFO ] [Real]Absence check using 244 positive place invariants in 1355 ms returned sat
[2020-06-04 07:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:34:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 07:34:08] [INFO ] [Real]Absence check using state equation in 2778 ms returned (error "Failed to check-sat")
[2020-06-04 07:34:10] [INFO ] [Real]Absence check using 244 positive place invariants in 1390 ms returned sat
[2020-06-04 07:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:34:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 07:34:13] [INFO ] [Real]Absence check using state equation in 2743 ms returned (error "Failed to check-sat")
Support contains 20 out of 4375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4375/4375 places, 6991/6991 transitions.
Graph (trivial) has 3985 edges and 4375 vertex of which 669 / 4375 are part of one of the 53 SCC in 80 ms
Free SCC test removed 616 places
Drop transitions removed 691 transitions
Reduce isomorphic transitions removed 691 transitions.
Performed 1592 Post agglomeration using F-continuation condition.Transition count delta: 1592
Iterating post reduction 0 with 2283 rules applied. Total rules applied 2284 place count 3759 transition count 4708
Reduce places removed 1592 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 1676 rules applied. Total rules applied 3960 place count 2167 transition count 4624
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 44 rules applied. Total rules applied 4004 place count 2131 transition count 4616
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 4008 place count 2127 transition count 4616
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 4008 place count 2127 transition count 4603
Deduced a syphon composed of 13 places in 162 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 4034 place count 2114 transition count 4603
Symmetric choice reduction at 4 with 585 rule applications. Total rules 4619 place count 2114 transition count 4603
Deduced a syphon composed of 585 places in 91 ms
Reduce places removed 585 places and 585 transitions.
Iterating global reduction 4 with 1170 rules applied. Total rules applied 5789 place count 1529 transition count 4018
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 259 Pre rules applied. Total rules applied 5789 place count 1529 transition count 3759
Deduced a syphon composed of 259 places in 142 ms
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 4 with 518 rules applied. Total rules applied 6307 place count 1270 transition count 3759
Symmetric choice reduction at 4 with 84 rule applications. Total rules 6391 place count 1270 transition count 3759
Deduced a syphon composed of 84 places in 68 ms
Reduce places removed 84 places and 1236 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 6559 place count 1186 transition count 2523
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 6585 place count 1186 transition count 2497
Performed 314 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 314 places in 3 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 5 with 628 rules applied. Total rules applied 7213 place count 872 transition count 2172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 7222 place count 872 transition count 2163
Symmetric choice reduction at 6 with 3 rule applications. Total rules 7225 place count 872 transition count 2163
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 45 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 7231 place count 869 transition count 2118
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: -688
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 7351 place count 809 transition count 2806
Drop transitions removed 47 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 7402 place count 809 transition count 2755
Free-agglomeration rule applied 463 times with reduction of 200 identical transitions.
Iterating global reduction 7 with 463 rules applied. Total rules applied 7865 place count 809 transition count 2092
Reduce places removed 463 places and 0 transitions.
Drop transitions removed 1007 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 1021 transitions.
Discarding 27 places :
Also discarding 57 output transitions
Drop transitions removed 57 transitions
Graph (complete) has 915 edges and 346 vertex of which 319 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.10 ms
Iterating post reduction 7 with 1485 rules applied. Total rules applied 9350 place count 319 transition count 1014
Drop transitions removed 36 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 8 with 44 rules applied. Total rules applied 9394 place count 319 transition count 970
Symmetric choice reduction at 9 with 13 rule applications. Total rules 9407 place count 319 transition count 970
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 192 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 9433 place count 306 transition count 778
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 9444 place count 306 transition count 767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 9446 place count 305 transition count 766
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 9448 place count 304 transition count 777
Drop transitions removed 12 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 9461 place count 304 transition count 764
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 9463 place count 304 transition count 762
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Discarding 9 places :
Also discarding 0 output transitions
Graph (complete) has 776 edges and 302 vertex of which 293 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Iterating post reduction 11 with 33 rules applied. Total rules applied 9496 place count 293 transition count 732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 9497 place count 293 transition count 745
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 16 rules applied. Total rules applied 9513 place count 292 transition count 730
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 9514 place count 292 transition count 730
Drop transitions removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 13 with 107 rules applied. Total rules applied 9621 place count 292 transition count 623
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 9627 place count 286 transition count 623
Symmetric choice reduction at 14 with 4 rule applications. Total rules 9631 place count 286 transition count 623
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 63 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 9639 place count 282 transition count 560
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 9643 place count 282 transition count 556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 9645 place count 281 transition count 555
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 9649 place count 281 transition count 551
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 56 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 59 transitions.
Discarding 22 places :
Also discarding 0 output transitions
Graph (complete) has 629 edges and 277 vertex of which 255 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Iterating post reduction 15 with 64 rules applied. Total rules applied 9713 place count 255 transition count 492
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 9716 place count 255 transition count 489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 9717 place count 254 transition count 488
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 26 edges and 245 vertex of which 2 / 245 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 16 with 24 rules applied. Total rules applied 9741 place count 244 transition count 474
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 11 rules applied. Total rules applied 9752 place count 242 transition count 465
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 9756 place count 240 transition count 463
Drop transitions removed 8 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 18 with 17 rules applied. Total rules applied 9773 place count 240 transition count 446
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 19 with 23 rules applied. Total rules applied 9796 place count 240 transition count 423
Reduce places removed 7 places and 0 transitions.
Discarding 4 places :
Also discarding 0 output transitions
Graph (complete) has 510 edges and 233 vertex of which 229 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Iterating post reduction 19 with 8 rules applied. Total rules applied 9804 place count 229 transition count 423
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 10 rules applied. Total rules applied 9814 place count 229 transition count 413
Applied a total of 9814 rules in 3148 ms. Remains 229 /4375 variables (removed 4146) and now considering 413/6991 (removed 6578) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/4375 places, 413/6991 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7659 ms. (steps per millisecond=130 ) properties seen :[0, 1, 1, 0]
FORMULA DLCround-PT-11b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3958 ms. (steps per millisecond=252 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 4616 ms. (steps per millisecond=216 ) properties seen :[0, 1]
FORMULA DLCround-PT-11b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-04 07:34:32] [INFO ] Flow matrix only has 124 transitions (discarded 289 similar events)
// Phase 1: matrix 124 rows 229 cols
[2020-06-04 07:34:32] [INFO ] Computed 169 place invariants in 3 ms
[2020-06-04 07:34:32] [INFO ] [Real]Absence check using 169 positive place invariants in 112 ms returned sat
[2020-06-04 07:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:34:33] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2020-06-04 07:34:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:34:33] [INFO ] [Nat]Absence check using 169 positive place invariants in 33 ms returned unsat
FORMULA DLCround-PT-11b-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

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="DLCround-PT-11b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is DLCround-PT-11b, 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 r180-ebro-158987900400590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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