About the Execution of ITS-Tools for SmartHome-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15728.960 | 17788.00 | 31456.00 | 65.80 | FTFTTTFTTFFTFFTT | normal |
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.r227-oct2-159033546100046.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 itstools
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 r227-oct2-159033546100046
=====================================================================
--------------------
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 1590483674584
[2020-05-26 09:01:16] [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-26 09:01:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:01:17] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2020-05-26 09:01:17] [INFO ] Transformed 219 places.
[2020-05-26 09:01:17] [INFO ] Transformed 254 transitions.
[2020-05-26 09:01:17] [INFO ] Found NUPN structural information;
[2020-05-26 09:01:17] [INFO ] Parsed PT model containing 219 places and 254 transitions in 91 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 22 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 66 resets, run finished after 55 ms. (steps per millisecond=181 ) 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 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 1, 0, 0, 0]
FORMULA SmartHome-PT-06-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 236 rows 202 cols
[2020-05-26 09:01:17] [INFO ] Computed 9 place invariants in 13 ms
[2020-05-26 09:01:17] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2020-05-26 09:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:17] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-05-26 09:01:17] [INFO ] Deduced a trap composed of 52 places in 186 ms
[2020-05-26 09:01:17] [INFO ] Deduced a trap composed of 36 places in 97 ms
[2020-05-26 09:01:18] [INFO ] Deduced a trap composed of 27 places in 288 ms
[2020-05-26 09:01:18] [INFO ] Deduced a trap composed of 44 places in 64 ms
[2020-05-26 09:01:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 777 ms
[2020-05-26 09:01:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 276 ms returned sat
[2020-05-26 09:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:18] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2020-05-26 09:01:18] [INFO ] Deduced a trap composed of 47 places in 108 ms
[2020-05-26 09:01:19] [INFO ] Deduced a trap composed of 36 places in 43 ms
[2020-05-26 09:01:19] [INFO ] Deduced a trap composed of 33 places in 58 ms
[2020-05-26 09:01:19] [INFO ] Deduced a trap composed of 27 places in 93 ms
[2020-05-26 09:01:19] [INFO ] Deduced a trap composed of 44 places in 38 ms
[2020-05-26 09:01:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 408 ms
[2020-05-26 09:01:19] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 24 ms.
[2020-05-26 09:01:20] [INFO ] Added : 235 causal constraints over 47 iterations in 1271 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-26 09:01:20] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:20] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-05-26 09:01:23] [INFO ] Deduced a trap composed of 56 places in 2870 ms
[2020-05-26 09:01:23] [INFO ] Deduced a trap composed of 27 places in 60 ms
[2020-05-26 09:01:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3014 ms
[2020-05-26 09:01:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 161 ms returned sat
[2020-05-26 09:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:24] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2020-05-26 09:01:24] [INFO ] Deduced a trap composed of 37 places in 123 ms
[2020-05-26 09:01:24] [INFO ] Deduced a trap composed of 61 places in 92 ms
[2020-05-26 09:01:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2020-05-26 09:01:24] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 30 ms.
[2020-05-26 09:01:26] [INFO ] Added : 231 causal constraints over 47 iterations in 1588 ms. Result :sat
[2020-05-26 09:01:26] [INFO ] Deduced a trap composed of 27 places in 25 ms
[2020-05-26 09:01:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-26 09:01:26] [INFO ] [Real]Absence check using 9 positive place invariants in 27 ms returned sat
[2020-05-26 09:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:26] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-05-26 09:01:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 29 ms returned unsat
[2020-05-26 09:01:26] [INFO ] [Real]Absence check using 9 positive place invariants in 67 ms returned sat
[2020-05-26 09:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:27] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2020-05-26 09:01:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 126 ms returned sat
[2020-05-26 09:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:28] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2020-05-26 09:01:28] [INFO ] Deduced a trap composed of 27 places in 123 ms
[2020-05-26 09:01:29] [INFO ] Deduced a trap composed of 47 places in 1296 ms
[2020-05-26 09:01:29] [INFO ] Deduced a trap composed of 33 places in 46 ms
[2020-05-26 09:01:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1547 ms
[2020-05-26 09:01:29] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 9 ms.
[2020-05-26 09:01:31] [INFO ] Added : 235 causal constraints over 47 iterations in 1419 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-26 09:01:31] [INFO ] [Real]Absence check using 9 positive place invariants in 80 ms returned sat
[2020-05-26 09:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:31] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2020-05-26 09:01:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 51 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 64 ms. (steps per millisecond=534 ) properties seen :[1, 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 29200 steps, including 384 resets, run finished after 54 ms. (steps per millisecond=540 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 29400 steps, including 318 resets, run finished after 48 ms. (steps per millisecond=612 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 236/236 transitions.
Graph (trivial) has 197 edges and 202 vertex of which 77 / 202 are part of one of the 5 SCC in 44 ms
Free SCC test removed 72 places
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 130 transition count 93
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 58 rules applied. Total rules applied 202 place count 81 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 206 place count 77 transition count 84
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 206 place count 77 transition count 80
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 214 place count 73 transition count 80
Symmetric choice reduction at 3 with 27 rule applications. Total rules 241 place count 73 transition count 80
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 295 place count 46 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 299 place count 46 transition count 49
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 299 place count 46 transition count 44
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 309 place count 41 transition count 44
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 104 edges and 41 vertex of which 39 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Iterating post reduction 4 with 1 rules applied. Total rules applied 310 place count 39 transition count 43
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 315 place count 39 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 315 place count 39 transition count 37
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 317 place count 38 transition count 37
Symmetric choice reduction at 6 with 1 rule applications. Total rules 318 place count 38 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 320 place count 37 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 336 place count 29 transition count 28
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 340 place count 29 transition count 24
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 345 place count 29 transition count 19
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 350 place count 24 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 351 place count 23 transition count 18
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 12 edges and 18 vertex of which 10 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 8 with 6 rules applied. Total rules applied 357 place count 9 transition count 18
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 367 place count 9 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 367 place count 9 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 374 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 374 place count 5 transition count 4
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 376 place count 4 transition count 4
Applied a total of 376 rules in 143 ms. Remains 4 /202 variables (removed 198) and now considering 4/236 (removed 232) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/202 places, 4/236 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA SmartHome-PT-06-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1590483692372
--------------------
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="SmartHome-PT-06"
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 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 r227-oct2-159033546100046"
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 '
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 ;