fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699200534
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.490 31890.00 53820.00 197.40 TFFFFTTFTFTFTTFF 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.r021-oct2-158897699200534.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 BusinessProcesses-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 141K 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 BusinessProcesses-PT-11-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589253166423

[2020-05-12 03:12:48] [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-12 03:12:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:12:48] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2020-05-12 03:12:48] [INFO ] Transformed 567 places.
[2020-05-12 03:12:48] [INFO ] Transformed 508 transitions.
[2020-05-12 03:12:48] [INFO ] Found NUPN structural information;
[2020-05-12 03:12:48] [INFO ] Parsed PT model containing 567 places and 508 transitions in 145 ms.
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 7 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 74 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[1, 0, 0, 1, 0, 1, 1]
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0]
// Phase 1: matrix 501 rows 560 cols
[2020-05-12 03:12:49] [INFO ] Computed 95 place invariants in 33 ms
[2020-05-12 03:12:49] [INFO ] [Real]Absence check using 53 positive place invariants in 39 ms returned sat
[2020-05-12 03:12:49] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 62 ms returned sat
[2020-05-12 03:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:12:50] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2020-05-12 03:12:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:12:50] [INFO ] [Nat]Absence check using 53 positive place invariants in 168 ms returned sat
[2020-05-12 03:12:50] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 39 ms returned sat
[2020-05-12 03:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:12:51] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2020-05-12 03:12:51] [INFO ] Deduced a trap composed of 8 places in 429 ms
[2020-05-12 03:12:52] [INFO ] Deduced a trap composed of 16 places in 465 ms
[2020-05-12 03:12:52] [INFO ] Deduced a trap composed of 19 places in 556 ms
[2020-05-12 03:12:53] [INFO ] Deduced a trap composed of 24 places in 257 ms
[2020-05-12 03:12:53] [INFO ] Deduced a trap composed of 28 places in 762 ms
[2020-05-12 03:12:54] [INFO ] Deduced a trap composed of 13 places in 796 ms
[2020-05-12 03:12:55] [INFO ] Deduced a trap composed of 12 places in 342 ms
[2020-05-12 03:12:55] [INFO ] Deduced a trap composed of 25 places in 450 ms
[2020-05-12 03:12:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s186 s189 s190 s191 s195 s196 s197 s354 s355 s356 s360 s369 s491 s492) 0)") while checking expression at index 0
[2020-05-12 03:12:55] [INFO ] [Real]Absence check using 53 positive place invariants in 135 ms returned sat
[2020-05-12 03:12:55] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 34 ms returned sat
[2020-05-12 03:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:12:56] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2020-05-12 03:12:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:12:56] [INFO ] [Nat]Absence check using 53 positive place invariants in 144 ms returned sat
[2020-05-12 03:12:56] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 18 ms returned sat
[2020-05-12 03:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:12:57] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2020-05-12 03:12:57] [INFO ] Deduced a trap composed of 11 places in 221 ms
[2020-05-12 03:12:57] [INFO ] Deduced a trap composed of 18 places in 336 ms
[2020-05-12 03:12:58] [INFO ] Deduced a trap composed of 14 places in 279 ms
[2020-05-12 03:12:58] [INFO ] Deduced a trap composed of 12 places in 89 ms
[2020-05-12 03:12:58] [INFO ] Deduced a trap composed of 18 places in 108 ms
[2020-05-12 03:12:58] [INFO ] Deduced a trap composed of 18 places in 140 ms
[2020-05-12 03:12:58] [INFO ] Deduced a trap composed of 19 places in 96 ms
[2020-05-12 03:12:58] [INFO ] Deduced a trap composed of 20 places in 130 ms
[2020-05-12 03:12:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1592 ms
[2020-05-12 03:12:58] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 38 ms.
[2020-05-12 03:13:00] [INFO ] Added : 178 causal constraints over 36 iterations in 1292 ms. Result :sat
[2020-05-12 03:13:00] [INFO ] Deduced a trap composed of 42 places in 196 ms
[2020-05-12 03:13:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-12 03:13:00] [INFO ] [Real]Absence check using 53 positive place invariants in 41 ms returned sat
[2020-05-12 03:13:00] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 22 ms returned sat
[2020-05-12 03:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:02] [INFO ] [Real]Absence check using state equation in 1536 ms returned sat
[2020-05-12 03:13:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:13:02] [INFO ] [Nat]Absence check using 53 positive place invariants in 54 ms returned sat
[2020-05-12 03:13:02] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 43 ms returned sat
[2020-05-12 03:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:05] [INFO ] [Nat]Absence check using state equation in 3031 ms returned sat
[2020-05-12 03:13:06] [INFO ] Deduced a trap composed of 12 places in 1269 ms
[2020-05-12 03:13:07] [INFO ] Deduced a trap composed of 12 places in 742 ms
[2020-05-12 03:13:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s232 s388 s389 s390 s392 s394 s395 s396 s517 s518) 0)") while checking expression at index 2
Incomplete Parikh walk after 15700 steps, including 102 resets, run finished after 45 ms. (steps per millisecond=348 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 312 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 31 ms
Free SCC test removed 6 places
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.28 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 549 transition count 371
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 252 place count 428 transition count 371
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 252 place count 428 transition count 282
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 448 place count 321 transition count 282
Symmetric choice reduction at 2 with 64 rule applications. Total rules 512 place count 321 transition count 282
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 64 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 640 place count 257 transition count 218
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 640 place count 257 transition count 215
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 646 place count 254 transition count 215
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 8 ms
Ensure Unique test removed 3 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 181 rules applied. Total rules applied 827 place count 162 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 829 place count 161 transition count 130
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 831 place count 161 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 833 place count 159 transition count 128
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 834 place count 159 transition count 128
Applied a total of 834 rules in 241 ms. Remains 159 /560 variables (removed 401) and now considering 128/501 (removed 373) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/560 places, 128/501 transitions.
Incomplete random walk after 1000000 steps, including 49465 resets, run finished after 2885 ms. (steps per millisecond=346 ) properties seen :[1, 0]
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 19088 resets, run finished after 1353 ms. (steps per millisecond=739 ) properties seen :[0]
// Phase 1: matrix 128 rows 159 cols
[2020-05-12 03:13:12] [INFO ] Computed 70 place invariants in 26 ms
[2020-05-12 03:13:12] [INFO ] [Real]Absence check using 49 positive place invariants in 266 ms returned sat
[2020-05-12 03:13:12] [INFO ] [Real]Absence check using 49 positive and 21 generalized place invariants in 25 ms returned sat
[2020-05-12 03:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:13] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2020-05-12 03:13:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:13:13] [INFO ] [Nat]Absence check using 49 positive place invariants in 182 ms returned sat
[2020-05-12 03:13:13] [INFO ] [Nat]Absence check using 49 positive and 21 generalized place invariants in 32 ms returned sat
[2020-05-12 03:13:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:13] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2020-05-12 03:13:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-05-12 03:13:13] [INFO ] [Nat]Added 13 Read/Feed constraints in 61 ms returned sat
[2020-05-12 03:13:13] [INFO ] Deduced a trap composed of 35 places in 86 ms
[2020-05-12 03:13:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2020-05-12 03:13:14] [INFO ] Computed and/alt/rep : 126/2278/126 causal constraints in 10 ms.
[2020-05-12 03:13:14] [INFO ] Added : 57 causal constraints over 13 iterations in 829 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 5700 steps, including 423 resets, run finished after 28 ms. (steps per millisecond=203 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 159/159 places, 128/128 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 157 transition count 126
Applied a total of 4 rules in 22 ms. Remains 157 /159 variables (removed 2) and now considering 126/128 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/159 places, 126/128 transitions.
Incomplete random walk after 1000000 steps, including 51212 resets, run finished after 1895 ms. (steps per millisecond=527 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 20313 resets, run finished after 1181 ms. (steps per millisecond=846 ) properties seen :[0]
Finished probabilistic random walk after 3032 steps, run visited all 1 properties in 17 ms. (steps per millisecond=178 )
Probabilistic random walk after 3032 steps, saw 1166 distinct states, run finished after 17 ms. (steps per millisecond=178 ) properties seen :[1]
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589253198313

--------------------
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="BusinessProcesses-PT-11"
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 BusinessProcesses-PT-11, 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 r021-oct2-158897699200534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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