Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r052-oct2-162038307500206.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudDeployment-PT-6a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-oct2-162038307500206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 317K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1620843198526

Running Version 0
[2021-05-12 18:13:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2021-05-12 18:13:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 18:13:20] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-12 18:13:20] [INFO ] Transformed 221 places.
[2021-05-12 18:13:20] [INFO ] Transformed 908 transitions.
[2021-05-12 18:13:20] [INFO ] Found NUPN structural information;
[2021-05-12 18:13:20] [INFO ] Parsed PT model containing 221 places and 908 transitions in 124 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.18626KB memory used
Starting structural reductions, iteration 0 : 221/221 places, 794/794 transitions.
Graph (trivial) has 241 edges and 221 vertex of which 60 / 221 are part of one of the 18 SCC in 3 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Graph (complete) has 2101 edges and 179 vertex of which 166 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.6 ms
Discarding 13 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 12 place count 156 transition count 616
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 156 transition count 616
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 153 transition count 613
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 153 transition count 613
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 151 transition count 611
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 151 transition count 611
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 150 transition count 610
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 150 transition count 610
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 70 place count 132 transition count 676
Drop transitions removed 177 transitions
Redundant transition composition rules discarded 177 transitions
Iterating global reduction 0 with 177 rules applied. Total rules applied 247 place count 132 transition count 499
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 248 place count 131 transition count 498
Applied a total of 248 rules in 129 ms. Remains 131 /221 variables (removed 90) and now considering 498/794 (removed 296) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/221 places, 498/794 transitions.
Random walk for 1250000 steps, including 20666 resets, run took 2427 ms (no deadlock found). (steps per millisecond=515 )
Random directed walk for 1250000 steps, including 5376 resets, run took 2623 ms (no deadlock found). (steps per millisecond=476 )
[2021-05-12 18:13:25] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
// Phase 1: matrix 199 rows 131 cols
[2021-05-12 18:13:25] [INFO ] Computed 23 place invariants in 9 ms
[2021-05-12 18:13:25] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 141 ms returned sat
[2021-05-12 18:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:13:26] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2021-05-12 18:13:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:13:26] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 7 ms returned sat
[2021-05-12 18:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:13:26] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2021-05-12 18:13:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-12 18:13:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2021-05-12 18:13:26] [INFO ] Computed and/alt/rep : 146/270/146 causal constraints (skipped 15 transitions) in 31 ms.
[2021-05-12 18:13:27] [INFO ] Added : 88 causal constraints over 18 iterations in 648 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Parikh directed walk for 11800 steps, including 176 resets, run took 31 ms. (steps per millisecond=380 )
Random directed walk for 500002 steps, including 2148 resets, run took 974 ms (no deadlock found). (steps per millisecond=513 )
Random walk for 500000 steps, including 8264 resets, run took 856 ms (no deadlock found). (steps per millisecond=584 )
Random directed walk for 500006 steps, including 2149 resets, run took 1090 ms (no deadlock found). (steps per millisecond=458 )
Random walk for 500000 steps, including 8256 resets, run took 846 ms (no deadlock found). (steps per millisecond=591 )
Starting structural reductions, iteration 0 : 131/131 places, 498/498 transitions.
Applied a total of 0 rules in 29 ms. Remains 131 /131 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2021-05-12 18:13:31] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
// Phase 1: matrix 199 rows 131 cols
[2021-05-12 18:13:31] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-12 18:13:31] [INFO ] Implicit Places using invariants in 244 ms returned []
[2021-05-12 18:13:31] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
// Phase 1: matrix 199 rows 131 cols
[2021-05-12 18:13:31] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-12 18:13:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-12 18:13:31] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2021-05-12 18:13:33] [INFO ] Redundant transitions in 1688 ms returned []
[2021-05-12 18:13:33] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
// Phase 1: matrix 199 rows 131 cols
[2021-05-12 18:13:33] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-12 18:13:33] [INFO ] Dead Transitions using invariants and state equation in 289 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 498/498 transitions.
Random walk for 1250000 steps, including 20630 resets, run took 2150 ms (no deadlock found). (steps per millisecond=581 )
Random directed walk for 1250001 steps, including 5388 resets, run took 2295 ms (no deadlock found). (steps per millisecond=544 )
[2021-05-12 18:13:38] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
// Phase 1: matrix 199 rows 131 cols
[2021-05-12 18:13:38] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-12 18:13:38] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 4 ms returned sat
[2021-05-12 18:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:13:38] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-12 18:13:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:13:38] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 4 ms returned sat
[2021-05-12 18:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:13:38] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-12 18:13:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-12 18:13:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2021-05-12 18:13:38] [INFO ] Computed and/alt/rep : 146/270/146 causal constraints (skipped 15 transitions) in 45 ms.
[2021-05-12 18:13:39] [INFO ] Added : 88 causal constraints over 18 iterations in 420 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Parikh directed walk for 11800 steps, including 181 resets, run took 29 ms. (steps per millisecond=406 )
Random directed walk for 500008 steps, including 2162 resets, run took 930 ms (no deadlock found). (steps per millisecond=537 )
Random walk for 500000 steps, including 8294 resets, run took 857 ms (no deadlock found). (steps per millisecond=583 )
Random directed walk for 500028 steps, including 2151 resets, run took 992 ms (no deadlock found). (steps per millisecond=504 )
Random walk for 500000 steps, including 8230 resets, run took 838 ms (no deadlock found). (steps per millisecond=596 )
[2021-05-12 18:13:43] [INFO ] Flatten gal took : 126 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7659261702509681654
[2021-05-12 18:13:43] [INFO ] Applying decomposition
[2021-05-12 18:13:43] [INFO ] Computing symmetric may disable matrix : 794 transitions.
[2021-05-12 18:13:43] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 18:13:43] [INFO ] Flatten gal took : 87 ms
[2021-05-12 18:13:43] [INFO ] Computing symmetric may enable matrix : 794 transitions.
[2021-05-12 18:13:43] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10039643147429748917.txt, -o, /tmp/graph10039643147429748917.bin, -w, /tmp/graph10039643147429748917.weights], workingDir=null]
[2021-05-12 18:13:43] [INFO ] Computing Do-Not-Accords matrix : 794 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10039643147429748917.bin, -l, -1, -v, -w, /tmp/graph10039643147429748917.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 18:13:43] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 18:13:43] [INFO ] Built C files in 467ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7659261702509681654
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7659261702509681654]
[2021-05-12 18:13:43] [INFO ] Decomposing Gal with order
[2021-05-12 18:13:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 18:13:44] [INFO ] Removed a total of 892 redundant transitions.
[2021-05-12 18:13:44] [INFO ] Flatten gal took : 332 ms
[2021-05-12 18:13:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 47 ms.
[2021-05-12 18:13:44] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock17781686974736890710.gal : 46 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock17781686974736890710.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock17781686974736890710.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.3047e+09,0.162361,11416,338,125,12993,1005,786,19877,304,3171,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,2,0.196122,11416,79,70,12993,1005,2231,19877,1432,3171,7052

System contains 2 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ i12={[ u55={[ ]
} u54={[ ]
} ]
} i11={[ u53={[ ]
} u52={[ ]
} ]
} i10={[ u51={[ ]
} u50={[ ]
} ]
} i6={[ i1={[ u43={[ ]
} u42={[ ]
} u36={[ ]
} u41={[ ]
} ]
} i0={[ u40={[ ]
} u39={[ ]
} u37={[ ]
} u38={[ ]
} ]
} ]
} i9={[ u49={[ ]
} u48={[ ]
} ]
} i8={[ u47={[ ]
} u46={[ ]
} ]
} u62={[ ]
} i5={[ i1={[ u63={[ ]
} u35={[ ]
} u34={[ ]
} u33={[ ]
} ]
} i0={[ u32={[ ]
} u31={[ ]
} u29={[ ]
} u30={[ ]
} ]
} ]
} i4={[ u59={[ ]
} u57={[ ]
} u28={[ ]
} u27={[ ]
} u26={[ ]
} ]
} i2={[ i1={[ u61={[ ]
} u60={[ ]
} u58={[ ]
} u56={[ ]
} u20={[ ]
} u19={[ ]
} ]
} i0={[ u18={[ ]
} u17={[ ]
} u16={[ ]
} u14={[ ]
} u15={[ ]
} ]
} ]
} i1={[ i1={[ u13={[ ]
} u12={[ ]
} u11={[ ]
} ]
} i0={[ u10={[ ]
} u9={[ ]
} u7={[ ]
} u8={[ ]
} ]
} ]
} i0={[ i1={[ u6={[ ]
} u5={[ ]
} u0={[ ]
} ]
} i0={[ u4={[ ]
} u3={[ ]
} u1={[ ]
} u2={[ ]
} ]
} ]
} i7={[ u45={[ ]
} u44={[ ]
} ]
} i3={[ u25={[ ]
} u24={[ ]
} u23={[ ]
} u21={[ ]
} u22={[ ]
} ]
} ]
[ i12={[ u55={[ ]
} u54={[ ]
} ]
} i11={[ u53={[ ]
} u52={[ ]
} ]
} i10={[ u51={[ ]
} u50={[ ]
} ]
} i6={[ i1={[ u43={[ p168=1 ]
} u42={[ ]
} u36={[ ]
} u41={[ ]
} ]
} i0={[ u40={[ ]
} u39={[ ]
} u37={[ ]
} u38={[ ]
} ]
} ]
} i9={[ u49={[ ]
} u48={[ ]
} ]
} i8={[ u47={[ ]
} u46={[ ]
} ]
} u62={[ p87=1 p113=1 p85=1 p1=1 p59=1 p115=1 p57=1 p141=1 p31=1 p169=1 p29=1 p3=1 p143=1 ]
} i5={[ i1={[ u63={[ p140=1 ]
} u35={[ ]
} u34={[ ]
} u33={[ ]
} ]
} i0={[ u32={[ ]
} u31={[ ]
} u29={[ ]
} u30={[ ]
} ]
} ]
} i4={[ u59={[ ]
} u57={[ ]
} u28={[ p112=1 ]
} u27={[ ]
} u26={[ ]
} ]
} i2={[ i1={[ u61={[ ]
} u60={[ ]
} u58={[ ]
} u56={[ ]
} u20={[ p84=1 ]
} u19={[ ]
} ]
} i0={[ u18={[ ]
} u17={[ ]
} u16={[ ]
} u14={[ ]
} u15={[ ]
} ]
} ]
} i1={[ i1={[ u13={[ p56=1 ]
} u12={[ ]
} u11={[ ]
} ]
} i0={[ u10={[ ]
} u9={[ ]
} u7={[ ]
} u8={[ ]
} ]
} ]
} i0={[ i1={[ u6={[ p28=1 ]
} u5={[ ]
} u0={[ ]
} ]
} i0={[ u4={[ ]
} u3={[ ]
} u1={[ ]
} u2={[ ]
} ]
} ]
} i7={[ u45={[ ]
} u44={[ ]
} ]
} i3={[ u25={[ ]
} u24={[ ]
} u23={[ ]
} u21={[ ]
} u22={[ ]
} ]
} ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620843224968

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CloudDeployment-PT-6a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-4028"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-6a, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r052-oct2-162038307500206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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