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.r051-ebro-158902546400622.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 itstools
Input is DLCround-PT-13b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546400622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 3.4K Mar 30 21:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 21:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 11:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 11:34 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 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 01:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 01:33 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 2.1M 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-13b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589631571701

[2020-05-16 12:19:34] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-16 12:19:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 12:19:35] [INFO ] Load time of PNML (sax parser for PT used): 646 ms
[2020-05-16 12:19:35] [INFO ] Transformed 5343 places.
[2020-05-16 12:19:35] [INFO ] Transformed 8727 transitions.
[2020-05-16 12:19:35] [INFO ] Found NUPN structural information;
[2020-05-16 12:19:36] [INFO ] Parsed PT model containing 5343 places and 8727 transitions in 1023 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 501 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-13b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 254 ms. (steps per millisecond=39 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 1, 0, 1]
FORMULA DLCround-PT-13b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[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]
// Phase 1: matrix 8727 rows 5343 cols
[2020-05-16 12:19:37] [INFO ] Computed 312 place invariants in 245 ms
[2020-05-16 12:19:40] [INFO ] [Real]Absence check using 312 positive place invariants in 2408 ms returned sat
[2020-05-16 12:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 12:19:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 12:19:42] [INFO ] [Real]Absence check using state equation in 1392 ms returned (error "Failed to check-sat")
[2020-05-16 12:19:45] [INFO ] [Real]Absence check using 312 positive place invariants in 2225 ms returned sat
[2020-05-16 12:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 12:19:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 12:19:47] [INFO ] [Real]Absence check using state equation in 1757 ms returned (error "Failed to check-sat")
[2020-05-16 12:19:50] [INFO ] [Real]Absence check using 312 positive place invariants in 2407 ms returned sat
[2020-05-16 12:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 12:19:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-16 12:19:52] [INFO ] [Real]Absence check using state equation in 1644 ms returned (error "Failed to check-sat")
Support contains 22 out of 5343 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4829 edges and 5343 vertex of which 743 / 5343 are part of one of the 63 SCC in 72 ms
Free SCC test removed 680 places
Drop transitions removed 766 transitions
Reduce isomorphic transitions removed 766 transitions.
Performed 1949 Post agglomeration using F-continuation condition.Transition count delta: 1949
Iterating post reduction 0 with 2715 rules applied. Total rules applied 2716 place count 4663 transition count 6012
Reduce places removed 1949 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 2042 rules applied. Total rules applied 4758 place count 2714 transition count 5919
Reduce places removed 39 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 47 rules applied. Total rules applied 4805 place count 2675 transition count 5911
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 4809 place count 2671 transition count 5911
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 4809 place count 2671 transition count 5895
Deduced a syphon composed of 16 places in 101 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 4841 place count 2655 transition count 5895
Symmetric choice reduction at 4 with 732 rule applications. Total rules 5573 place count 2655 transition count 5895
Deduced a syphon composed of 732 places in 200 ms
Reduce places removed 732 places and 732 transitions.
Iterating global reduction 4 with 1464 rules applied. Total rules applied 7037 place count 1923 transition count 5163
Performed 329 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 329 Pre rules applied. Total rules applied 7037 place count 1923 transition count 4834
Deduced a syphon composed of 329 places in 125 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 4 with 658 rules applied. Total rules applied 7695 place count 1594 transition count 4834
Symmetric choice reduction at 4 with 91 rule applications. Total rules 7786 place count 1594 transition count 4834
Deduced a syphon composed of 91 places in 118 ms
Reduce places removed 91 places and 1526 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 7968 place count 1503 transition count 3308
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 7995 place count 1503 transition count 3281
Performed 399 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 5 with 798 rules applied. Total rules applied 8793 place count 1104 transition count 2869
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 8803 place count 1104 transition count 2859
Symmetric choice reduction at 6 with 4 rule applications. Total rules 8807 place count 1104 transition count 2859
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 68 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 8815 place count 1100 transition count 2791
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -244
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 8871 place count 1072 transition count 3035
Drop transitions removed 29 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 33 rules applied. Total rules applied 8904 place count 1072 transition count 3002
Free-agglomeration rule applied 598 times with reduction of 274 identical transitions.
Iterating global reduction 7 with 598 rules applied. Total rules applied 9502 place count 1072 transition count 2130
Reduce places removed 598 places and 0 transitions.
Drop transitions removed 659 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 679 transitions.
Discarding 48 places :
Also discarding 102 output transitions
Drop transitions removed 102 transitions
Graph (complete) has 1747 edges and 474 vertex of which 426 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.12 ms
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1279 rules applied. Total rules applied 10781 place count 426 transition count 1348
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 65 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 8 with 90 rules applied. Total rules applied 10871 place count 425 transition count 1259
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 9 with 2 rules applied. Total rules applied 10873 place count 424 transition count 1258
Free-agglomeration rule (complex) applied 35 times.
Iterating global reduction 9 with 35 rules applied. Total rules applied 10908 place count 424 transition count 1801
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 581 transitions
Reduce isomorphic transitions removed 581 transitions.
Iterating post reduction 9 with 616 rules applied. Total rules applied 11524 place count 389 transition count 1220
Symmetric choice reduction at 10 with 8 rule applications. Total rules 11532 place count 389 transition count 1220
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 11548 place count 381 transition count 1212
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 10 with 102 rules applied. Total rules applied 11650 place count 381 transition count 1110
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 14 rules applied. Total rules applied 11664 place count 374 transition count 1103
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 33 places :
Also discarding 0 output transitions
Graph (complete) has 1247 edges and 374 vertex of which 341 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.3 ms
Iterating post reduction 11 with 120 rules applied. Total rules applied 11784 place count 341 transition count 984
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 12 with 2 rules applied. Total rules applied 11786 place count 340 transition count 983
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 11789 place count 340 transition count 983
Drop transitions removed 119 transitions
Redundant transition composition rules discarded 119 transitions
Iterating global reduction 12 with 119 rules applied. Total rules applied 11908 place count 340 transition count 864
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 19 rules applied. Total rules applied 11927 place count 322 transition count 863
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 11928 place count 321 transition count 863
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 11930 place count 321 transition count 861
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Discarding 14 places :
Also discarding 0 output transitions
Graph (complete) has 1078 edges and 319 vertex of which 305 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Iterating post reduction 14 with 37 rules applied. Total rules applied 11967 place count 305 transition count 827
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 11969 place count 305 transition count 895
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 15 with 36 rules applied. Total rules applied 12005 place count 303 transition count 861
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 16 with 33 rules applied. Total rules applied 12038 place count 303 transition count 828
Applied a total of 12038 rules in 4006 ms. Remains 303 /5343 variables (removed 5040) and now considering 828/8727 (removed 7899) transitions.
Finished structural reductions, in 1 iterations. Remains : 303/5343 places, 828/8727 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 10482 ms. (steps per millisecond=95 ) properties seen :[1, 1, 0]
FORMULA DLCround-PT-13b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4279 ms. (steps per millisecond=233 ) properties seen :[0]
[2020-05-16 12:20:11] [INFO ] Flow matrix only has 228 transitions (discarded 600 similar events)
// Phase 1: matrix 228 rows 303 cols
[2020-05-16 12:20:11] [INFO ] Computed 214 place invariants in 3 ms
[2020-05-16 12:20:11] [INFO ] [Real]Absence check using 214 positive place invariants in 148 ms returned sat
[2020-05-16 12:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 12:20:11] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2020-05-16 12:20:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 12:20:12] [INFO ] [Nat]Absence check using 214 positive place invariants in 125 ms returned sat
[2020-05-16 12:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 12:20:12] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2020-05-16 12:20:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-05-16 12:20:12] [INFO ] [Nat]Added 71 Read/Feed constraints in 49 ms returned sat
[2020-05-16 12:20:13] [INFO ] Computed and/alt/rep : 824/8962/224 causal constraints in 112 ms.
[2020-05-16 12:20:15] [INFO ] Added : 202 causal constraints over 41 iterations in 2914 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
Finished Parikh walk after 114 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=28 )
FORMULA DLCround-PT-13b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589631616212

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-13b"
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"

# 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 itstools"
echo " Input is DLCround-PT-13b, 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 r051-ebro-158902546400622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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