Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r228-oct2-159033547000046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is SmartHome-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547000046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.1K May 14 03:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 56K May 12 20:42 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 SmartHome-PT-06-ReachabilityCardinality-00
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-01
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-02
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-03
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-04
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-05
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-06
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-07
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-08
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-09
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-10
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-11
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-12
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-13
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-14
FORMULA_NAME SmartHome-PT-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591288205316

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:30:07] [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 16:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:30:07] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2020-06-04 16:30:07] [INFO ] Transformed 219 places.
[2020-06-04 16:30:07] [INFO ] Transformed 254 transitions.
[2020-06-04 16:30:07] [INFO ] Found NUPN structural information;
[2020-06-04 16:30:07] [INFO ] Parsed PT model containing 219 places and 254 transitions in 87 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 18 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA SmartHome-PT-06-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 0]
FORMULA SmartHome-PT-06-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 236 rows 202 cols
[2020-06-04 16:30:07] [INFO ] Computed 9 place invariants in 13 ms
[2020-06-04 16:30:08] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2020-06-04 16:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:08] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2020-06-04 16:30:08] [INFO ] Deduced a trap composed of 52 places in 100 ms
[2020-06-04 16:30:08] [INFO ] Deduced a trap composed of 36 places in 43 ms
[2020-06-04 16:30:08] [INFO ] Deduced a trap composed of 27 places in 37 ms
[2020-06-04 16:30:08] [INFO ] Deduced a trap composed of 44 places in 28 ms
[2020-06-04 16:30:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 260 ms
[2020-06-04 16:30:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 281 ms returned sat
[2020-06-04 16:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:08] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2020-06-04 16:30:09] [INFO ] Deduced a trap composed of 47 places in 80 ms
[2020-06-04 16:30:09] [INFO ] Deduced a trap composed of 36 places in 36 ms
[2020-06-04 16:30:09] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2020-06-04 16:30:09] [INFO ] Deduced a trap composed of 27 places in 26 ms
[2020-06-04 16:30:09] [INFO ] Deduced a trap composed of 44 places in 20 ms
[2020-06-04 16:30:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 260 ms
[2020-06-04 16:30:09] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 15 ms.
[2020-06-04 16:30:10] [INFO ] Added : 235 causal constraints over 47 iterations in 1120 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-04 16:30:10] [INFO ] [Real]Absence check using 9 positive place invariants in 35 ms returned sat
[2020-06-04 16:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:10] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-04 16:30:10] [INFO ] Deduced a trap composed of 56 places in 212 ms
[2020-06-04 16:30:11] [INFO ] Deduced a trap composed of 27 places in 86 ms
[2020-06-04 16:30:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2020-06-04 16:30:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 152 ms returned sat
[2020-06-04 16:30:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:11] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-06-04 16:30:11] [INFO ] Deduced a trap composed of 37 places in 58 ms
[2020-06-04 16:30:12] [INFO ] Deduced a trap composed of 61 places in 838 ms
[2020-06-04 16:30:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 931 ms
[2020-06-04 16:30:12] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 38 ms.
[2020-06-04 16:30:13] [INFO ] Added : 231 causal constraints over 47 iterations in 998 ms. Result :sat
[2020-06-04 16:30:13] [INFO ] Deduced a trap composed of 27 places in 16 ms
[2020-06-04 16:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-04 16:30:13] [INFO ] [Real]Absence check using 9 positive place invariants in 77 ms returned sat
[2020-06-04 16:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:13] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2020-06-04 16:30:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 87 ms returned sat
[2020-06-04 16:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:14] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2020-06-04 16:30:14] [INFO ] Deduced a trap composed of 27 places in 41 ms
[2020-06-04 16:30:14] [INFO ] Deduced a trap composed of 47 places in 42 ms
[2020-06-04 16:30:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2020-06-04 16:30:14] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 16 ms.
[2020-06-04 16:30:15] [INFO ] Added : 235 causal constraints over 47 iterations in 911 ms. Result :sat
[2020-06-04 16:30:15] [INFO ] Deduced a trap composed of 27 places in 40 ms
[2020-06-04 16:30:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-04 16:30:15] [INFO ] [Real]Absence check using 9 positive place invariants in 47 ms returned sat
[2020-06-04 16:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:15] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-04 16:30:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned unsat
[2020-06-04 16:30:15] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2020-06-04 16:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:15] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2020-06-04 16:30:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 102 ms returned sat
[2020-06-04 16:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:16] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2020-06-04 16:30:16] [INFO ] Deduced a trap composed of 27 places in 78 ms
[2020-06-04 16:30:16] [INFO ] Deduced a trap composed of 47 places in 33 ms
[2020-06-04 16:30:16] [INFO ] Deduced a trap composed of 33 places in 18 ms
[2020-06-04 16:30:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 166 ms
[2020-06-04 16:30:16] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 12 ms.
[2020-06-04 16:30:16] [INFO ] Added : 235 causal constraints over 47 iterations in 802 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-06-04 16:30:17] [INFO ] [Real]Absence check using 9 positive place invariants in 21 ms returned sat
[2020-06-04 16:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:17] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-06-04 16:30:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned unsat
FORMULA SmartHome-PT-06-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-06-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 34200 steps, including 353 resets, run finished after 54 ms. (steps per millisecond=633 ) properties seen :[1, 0, 0, 1] could not realise parikh vector
FORMULA SmartHome-PT-06-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SmartHome-PT-06-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 29400 steps, including 318 resets, run finished after 57 ms. (steps per millisecond=515 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 29200 steps, including 389 resets, run finished after 76 ms. (steps per millisecond=384 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 29400 steps, including 316 resets, run finished after 33 ms. (steps per millisecond=890 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 236/236 transitions.
Graph (trivial) has 194 edges and 202 vertex of which 77 / 202 are part of one of the 5 SCC in 26 ms
Free SCC test removed 72 places
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 130 transition count 94
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 55 rules applied. Total rules applied 198 place count 82 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 201 place count 79 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 201 place count 79 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 209 place count 75 transition count 83
Symmetric choice reduction at 3 with 26 rule applications. Total rules 235 place count 75 transition count 83
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 26 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 287 place count 49 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 291 place count 49 transition count 53
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 291 place count 49 transition count 49
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 299 place count 45 transition count 49
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 323 place count 33 transition count 37
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 90 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Iterating post reduction 4 with 9 rules applied. Total rules applied 332 place count 32 transition count 29
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 337 place count 32 transition count 24
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 342 place count 27 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 343 place count 27 transition count 24
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 344 place count 27 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 345 place count 26 transition count 22
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 7 with 8 rules applied. Total rules applied 353 place count 22 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 357 place count 18 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 357 place count 18 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 365 place count 14 transition count 14
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 366 place count 13 transition count 14
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 10 with 2 rules applied. Total rules applied 368 place count 12 transition count 13
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 370 place count 12 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 372 place count 10 transition count 11
Applied a total of 372 rules in 71 ms. Remains 10 /202 variables (removed 192) and now considering 11/236 (removed 225) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/202 places, 11/236 transitions.
Finished random walk after 87 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=87 )
FORMULA SmartHome-PT-06-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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="SmartHome-PT-06"
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 SmartHome-PT-06, 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 r228-oct2-159033547000046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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