Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177100235.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BusinessProcesses-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177100235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 189K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620940060760

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:07:42] [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]
[2021-05-13 21:07:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:07:42] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-13 21:07:42] [INFO ] Transformed 772 places.
[2021-05-13 21:07:42] [INFO ] Transformed 685 transitions.
[2021-05-13 21:07:42] [INFO ] Found NUPN structural information;
[2021-05-13 21:07:42] [INFO ] Parsed PT model containing 772 places and 685 transitions in 122 ms.
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 54 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[1, 1, 1, 1, 0, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 670 rows 757 cols
[2021-05-13 21:07:42] [INFO ] Computed 125 place invariants in 33 ms
[2021-05-13 21:07:43] [INFO ] [Real]Absence check using 78 positive place invariants in 63 ms returned sat
[2021-05-13 21:07:43] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 28 ms returned sat
[2021-05-13 21:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:07:44] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2021-05-13 21:07:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:07:44] [INFO ] [Nat]Absence check using 78 positive place invariants in 85 ms returned sat
[2021-05-13 21:07:44] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 35 ms returned sat
[2021-05-13 21:07:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:07:45] [INFO ] [Nat]Absence check using state equation in 1450 ms returned sat
[2021-05-13 21:07:46] [INFO ] Deduced a trap composed of 17 places in 433 ms
[2021-05-13 21:07:46] [INFO ] Deduced a trap composed of 14 places in 370 ms
[2021-05-13 21:07:47] [INFO ] Deduced a trap composed of 15 places in 328 ms
[2021-05-13 21:07:47] [INFO ] Deduced a trap composed of 16 places in 375 ms
[2021-05-13 21:07:48] [INFO ] Deduced a trap composed of 8 places in 367 ms
[2021-05-13 21:07:48] [INFO ] Deduced a trap composed of 23 places in 346 ms
[2021-05-13 21:07:48] [INFO ] Deduced a trap composed of 13 places in 389 ms
[2021-05-13 21:07:49] [INFO ] Deduced a trap composed of 29 places in 328 ms
[2021-05-13 21:07:49] [INFO ] Deduced a trap composed of 41 places in 334 ms
[2021-05-13 21:07:49] [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 s73 s78 s79 s82 s83 s84 s300 s303 s345 s350 s355 s385 s390 s395 s405 s501 s502 s503 s527 s531 s532 s533 s536 s537 s538 s542 s565 s566 s694 s695 s698 s699 s710 s711 s714 s715 s718 s719) 0)") while checking expression at index 0
[2021-05-13 21:07:49] [INFO ] [Real]Absence check using 78 positive place invariants in 71 ms returned sat
[2021-05-13 21:07:49] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 38 ms returned sat
[2021-05-13 21:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:07:51] [INFO ] [Real]Absence check using state equation in 1162 ms returned sat
[2021-05-13 21:07:51] [INFO ] Deduced a trap composed of 19 places in 329 ms
[2021-05-13 21:07:51] [INFO ] Deduced a trap composed of 16 places in 293 ms
[2021-05-13 21:07:52] [INFO ] Deduced a trap composed of 11 places in 304 ms
[2021-05-13 21:07:52] [INFO ] Deduced a trap composed of 15 places in 312 ms
[2021-05-13 21:07:52] [INFO ] Deduced a trap composed of 36 places in 324 ms
[2021-05-13 21:07:53] [INFO ] Deduced a trap composed of 8 places in 328 ms
[2021-05-13 21:07:53] [INFO ] Deduced a trap composed of 46 places in 337 ms
[2021-05-13 21:07:53] [INFO ] Deduced a trap composed of 21 places in 219 ms
[2021-05-13 21:07:54] [INFO ] Deduced a trap composed of 31 places in 215 ms
[2021-05-13 21:07:54] [INFO ] Deduced a trap composed of 42 places in 214 ms
[2021-05-13 21:07:54] [INFO ] Deduced a trap composed of 40 places in 298 ms
[2021-05-13 21:07:54] [INFO ] Deduced a trap composed of 15 places in 322 ms
[2021-05-13 21:07: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 s37 s40 s41 s42 s43 s300 s303 s345 s390 s405 s718 s719) 0)") while checking expression at index 1
[2021-05-13 21:07:55] [INFO ] [Real]Absence check using 78 positive place invariants in 70 ms returned sat
[2021-05-13 21:07:55] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 38 ms returned sat
[2021-05-13 21:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:07:56] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2021-05-13 21:07:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:07:56] [INFO ] [Nat]Absence check using 78 positive place invariants in 112 ms returned sat
[2021-05-13 21:07:56] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 38 ms returned sat
[2021-05-13 21:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:07:57] [INFO ] [Nat]Absence check using state equation in 1170 ms returned unsat
[2021-05-13 21:07:57] [INFO ] [Real]Absence check using 78 positive place invariants in 56 ms returned sat
[2021-05-13 21:07:58] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 33 ms returned sat
[2021-05-13 21:07:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:07:59] [INFO ] [Real]Absence check using state equation in 1542 ms returned sat
[2021-05-13 21:07:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:07:59] [INFO ] [Nat]Absence check using 78 positive place invariants in 84 ms returned sat
[2021-05-13 21:07:59] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 46 ms returned sat
[2021-05-13 21:07:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:08:01] [INFO ] [Nat]Absence check using state equation in 1837 ms returned sat
[2021-05-13 21:08:02] [INFO ] Deduced a trap composed of 16 places in 345 ms
[2021-05-13 21:08:02] [INFO ] Deduced a trap composed of 23 places in 344 ms
[2021-05-13 21:08:02] [INFO ] Deduced a trap composed of 8 places in 353 ms
[2021-05-13 21:08:03] [INFO ] Deduced a trap composed of 11 places in 377 ms
[2021-05-13 21:08:03] [INFO ] Deduced a trap composed of 20 places in 319 ms
[2021-05-13 21:08:04] [INFO ] Deduced a trap composed of 24 places in 338 ms
[2021-05-13 21:08:04] [INFO ] Deduced a trap composed of 28 places in 353 ms
[2021-05-13 21:08:04] [INFO ] Deduced a trap composed of 31 places in 329 ms
[2021-05-13 21:08:04] [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 s235 s236 s239 s248 s251 s252 s253 s254 s255 s256 s496 s497 s498 s502 s527 s698 s699) 0)") while checking expression at index 3
[2021-05-13 21:08:04] [INFO ] [Real]Absence check using 78 positive place invariants in 73 ms returned sat
[2021-05-13 21:08:05] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 44 ms returned sat
[2021-05-13 21:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:08:06] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2021-05-13 21:08:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:08:06] [INFO ] [Nat]Absence check using 78 positive place invariants in 114 ms returned sat
[2021-05-13 21:08:06] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 45 ms returned sat
[2021-05-13 21:08:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:08:07] [INFO ] [Nat]Absence check using state equation in 1400 ms returned sat
[2021-05-13 21:08:08] [INFO ] Deduced a trap composed of 12 places in 360 ms
[2021-05-13 21:08:08] [INFO ] Deduced a trap composed of 14 places in 273 ms
[2021-05-13 21:08:09] [INFO ] Deduced a trap composed of 15 places in 364 ms
[2021-05-13 21:08:09] [INFO ] Deduced a trap composed of 18 places in 353 ms
[2021-05-13 21:08:09] [INFO ] Deduced a trap composed of 22 places in 367 ms
[2021-05-13 21:08:10] [INFO ] Deduced a trap composed of 8 places in 348 ms
[2021-05-13 21:08:10] [INFO ] Deduced a trap composed of 43 places in 325 ms
[2021-05-13 21:08:10] [INFO ] Deduced a trap composed of 29 places in 372 ms
[2021-05-13 21:08:11] [INFO ] Deduced a trap composed of 53 places in 319 ms
[2021-05-13 21:08:11] [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 s61 s62 s68 s69 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s359 s360 s361 s364 s365 s366 s370 s375 s380 s398 s400 s401 s402 s569 s570 s573 s574) 0)") while checking expression at index 4
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 13 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 421 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Discarding 7 places :
Also discarding 0 output transitions
Graph (complete) has 1512 edges and 751 vertex of which 744 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.17 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Iterating post reduction 0 with 177 rules applied. Total rules applied 179 place count 744 transition count 493
Reduce places removed 169 places and 0 transitions.
Iterating post reduction 1 with 169 rules applied. Total rules applied 348 place count 575 transition count 493
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 348 place count 575 transition count 380
Deduced a syphon composed of 113 places in 2 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 598 place count 438 transition count 380
Symmetric choice reduction at 2 with 92 rule applications. Total rules 690 place count 438 transition count 380
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 874 place count 346 transition count 288
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 874 place count 346 transition count 280
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 891 place count 337 transition count 280
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 1133 place count 215 transition count 160
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 1135 place count 214 transition count 163
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1137 place count 214 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1139 place count 212 transition count 161
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1140 place count 212 transition count 161
Applied a total of 1140 rules in 161 ms. Remains 212 /757 variables (removed 545) and now considering 161/670 (removed 509) transitions.
Finished structural reductions, in 1 iterations. Remains : 212/757 places, 161/670 transitions.
Incomplete random walk after 1000000 steps, including 40573 resets, run finished after 2955 ms. (steps per millisecond=338 ) properties seen :[1, 1, 1, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 6427 steps, including 56 resets, run visited all 1 properties in 10 ms. (steps per millisecond=642 )
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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="BusinessProcesses-PT-19"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is BusinessProcesses-PT-19, 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 r037-tajo-162038177100235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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