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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15739.430 25520.00 39872.00 168.10 FFFTFTFTFTFTFFFF 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-158897699200590.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-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200590
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:46 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.3K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 177K 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-18-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589257649581

[2020-05-12 04:27:32] [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 04:27:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:27:32] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2020-05-12 04:27:32] [INFO ] Transformed 717 places.
[2020-05-12 04:27:32] [INFO ] Transformed 642 transitions.
[2020-05-12 04:27:32] [INFO ] Found NUPN structural information;
[2020-05-12 04:27:32] [INFO ] Parsed PT model containing 717 places and 642 transitions in 185 ms.
Deduced a syphon composed of 15 places in 10 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 51 resets, run finished after 109 ms. (steps per millisecond=91 ) properties seen :[1, 1, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0]
// Phase 1: matrix 627 rows 702 cols
[2020-05-12 04:27:33] [INFO ] Computed 114 place invariants in 86 ms
[2020-05-12 04:27:33] [INFO ] [Real]Absence check using 73 positive place invariants in 79 ms returned sat
[2020-05-12 04:27:33] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 93 ms returned sat
[2020-05-12 04:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:27:34] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2020-05-12 04:27:35] [INFO ] Deduced a trap composed of 24 places in 1242 ms
[2020-05-12 04:27:36] [INFO ] Deduced a trap composed of 8 places in 252 ms
[2020-05-12 04:27:36] [INFO ] Deduced a trap composed of 14 places in 249 ms
[2020-05-12 04:27:37] [INFO ] Deduced a trap composed of 25 places in 1049 ms
[2020-05-12 04:27:42] [INFO ] Deduced a trap composed of 28 places in 4886 ms
[2020-05-12 04:27:42] [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 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s120 s411 s412 s413) 0)") while checking expression at index 0
[2020-05-12 04:27:42] [INFO ] [Real]Absence check using 73 positive place invariants in 50 ms returned sat
[2020-05-12 04:27:42] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-05-12 04:27:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:27:43] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2020-05-12 04:27:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:27:43] [INFO ] [Nat]Absence check using 73 positive place invariants in 61 ms returned sat
[2020-05-12 04:27:43] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 04:27:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:27:44] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2020-05-12 04:27:44] [INFO ] Deduced a trap composed of 16 places in 130 ms
[2020-05-12 04:27:45] [INFO ] Deduced a trap composed of 22 places in 115 ms
[2020-05-12 04:27:45] [INFO ] Deduced a trap composed of 33 places in 116 ms
[2020-05-12 04:27:45] [INFO ] Deduced a trap composed of 16 places in 124 ms
[2020-05-12 04:27:45] [INFO ] Deduced a trap composed of 20 places in 128 ms
[2020-05-12 04:27:45] [INFO ] Deduced a trap composed of 28 places in 112 ms
[2020-05-12 04:27:45] [INFO ] Deduced a trap composed of 21 places in 110 ms
[2020-05-12 04:27:46] [INFO ] Deduced a trap composed of 27 places in 198 ms
[2020-05-12 04:27:46] [INFO ] Deduced a trap composed of 51 places in 105 ms
[2020-05-12 04:27:46] [INFO ] Deduced a trap composed of 44 places in 96 ms
[2020-05-12 04:27:46] [INFO ] Deduced a trap composed of 51 places in 105 ms
[2020-05-12 04:27:46] [INFO ] Deduced a trap composed of 44 places in 105 ms
[2020-05-12 04:27:46] [INFO ] Deduced a trap composed of 73 places in 106 ms
[2020-05-12 04:27:46] [INFO ] Deduced a trap composed of 75 places in 105 ms
[2020-05-12 04:27:46] [INFO ] Deduced a trap composed of 28 places in 68 ms
[2020-05-12 04:27:46] [INFO ] Deduced a trap composed of 29 places in 58 ms
[2020-05-12 04:27:47] [INFO ] Deduced a trap composed of 43 places in 48 ms
[2020-05-12 04:27:47] [INFO ] Deduced a trap composed of 46 places in 50 ms
[2020-05-12 04:27:47] [INFO ] Deduced a trap composed of 34 places in 43 ms
[2020-05-12 04:27:47] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2476 ms
[2020-05-12 04:27:47] [INFO ] Computed and/alt/rep : 626/2907/626 causal constraints in 40 ms.
[2020-05-12 04:27:48] [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 (=> (> t236 0) (and (> t235 0) (< o235 o236)))") while checking expression at index 1
[2020-05-12 04:27:48] [INFO ] [Real]Absence check using 73 positive place invariants in 47 ms returned sat
[2020-05-12 04:27:48] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 24 ms returned sat
[2020-05-12 04:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:27:49] [INFO ] [Real]Absence check using state equation in 914 ms returned sat
[2020-05-12 04:27:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:27:49] [INFO ] [Nat]Absence check using 73 positive place invariants in 56 ms returned sat
[2020-05-12 04:27:49] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-05-12 04:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:27:50] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2020-05-12 04:27:51] [INFO ] Deduced a trap composed of 15 places in 235 ms
[2020-05-12 04:27:51] [INFO ] Deduced a trap composed of 13 places in 244 ms
[2020-05-12 04:27:51] [INFO ] Deduced a trap composed of 22 places in 237 ms
[2020-05-12 04:27:51] [INFO ] Deduced a trap composed of 19 places in 207 ms
[2020-05-12 04:27:52] [INFO ] Deduced a trap composed of 141 places in 209 ms
[2020-05-12 04:27:52] [INFO ] Deduced a trap composed of 19 places in 203 ms
[2020-05-12 04:27:52] [INFO ] Deduced a trap composed of 30 places in 208 ms
[2020-05-12 04:27:52] [INFO ] Deduced a trap composed of 146 places in 207 ms
[2020-05-12 04:27:53] [INFO ] Deduced a trap composed of 23 places in 199 ms
[2020-05-12 04:27:53] [INFO ] Deduced a trap composed of 22 places in 210 ms
[2020-05-12 04:27:53] [INFO ] Deduced a trap composed of 16 places in 209 ms
[2020-05-12 04:27:53] [INFO ] Deduced a trap composed of 36 places in 195 ms
[2020-05-12 04:27:53] [INFO ] Deduced a trap composed of 26 places in 199 ms
[2020-05-12 04:27:54] [INFO ] Deduced a trap composed of 128 places in 192 ms
[2020-05-12 04:27:54] [INFO ] Deduced a trap composed of 149 places in 209 ms
[2020-05-12 04:27:54] [INFO ] Deduced a trap composed of 48 places in 191 ms
[2020-05-12 04:27:54] [INFO ] Deduced a trap composed of 135 places in 190 ms
[2020-05-12 04:27:54] [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 s40 s41 s53 s54 s177 s178 s179 s189 s190 s191 s200 s201 s204 s205 s213 s214 s218 s219 s220 s224 s225 s226 s246 s247 s250 s251 s257 s258 s259 s320 s325 s335 s348 s361 s362 s363 s371 s372 s373 s381 s383 s411 s412 s413 s416 s417 s418 s427 s432 s436 s437 s438 s441 s442 s443 s447 s462 s466 s467 s468 s477 s482 s487 s492 s497 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s525 s526 s527 s528 s531 s532 s547 s548 s553 s554 s555 s556 s557 s558 s559 s560 s561 s562 s563 s564 s565 s566 s567 s568 s569 s570 s571 s572 s604 s605 s608 s609 s612 s622 s623 s642 s643 s644 s645 s648 s649 s659 s660 s665 s666 s669 s670 s673) 0)") while checking expression at index 2
Support contains 7 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 402 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 9 ms
Free SCC test removed 7 places
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Iterating post reduction 0 with 167 rules applied. Total rules applied 169 place count 686 transition count 459
Reduce places removed 157 places and 0 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 326 place count 529 transition count 459
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 326 place count 529 transition count 354
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 559 place count 401 transition count 354
Symmetric choice reduction at 2 with 92 rule applications. Total rules 651 place count 401 transition count 354
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 92 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 835 place count 309 transition count 262
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 835 place count 309 transition count 253
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 856 place count 297 transition count 253
Symmetric choice reduction at 2 with 1 rule applications. Total rules 857 place count 297 transition count 253
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 859 place count 296 transition count 252
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 1075 place count 188 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 1077 place count 187 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1078 place count 187 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 186 transition count 146
Applied a total of 1079 rules in 121 ms. Remains 186 /702 variables (removed 516) and now considering 146/627 (removed 481) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/702 places, 146/627 transitions.
Finished random walk after 169 steps, including 8 resets, run visited all 3 properties in 3 ms. (steps per millisecond=56 )
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589257675101

--------------------
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-18"
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-18, 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-158897699200590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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