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-162038177000199.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-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 131K 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-10-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620937399301

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:23:20] [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 20:23:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:23:21] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2021-05-13 20:23:21] [INFO ] Transformed 518 places.
[2021-05-13 20:23:21] [INFO ] Transformed 471 transitions.
[2021-05-13 20:23:21] [INFO ] Found NUPN structural information;
[2021-05-13 20:23:21] [INFO ] Parsed PT model containing 518 places and 471 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 80 resets, run finished after 62 ms. (steps per millisecond=161 ) properties seen :[0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1]
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 471 rows 518 cols
[2021-05-13 20:23:21] [INFO ] Computed 85 place invariants in 20 ms
[2021-05-13 20:23:21] [INFO ] [Real]Absence check using 48 positive place invariants in 45 ms returned sat
[2021-05-13 20:23:21] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2021-05-13 20:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:23:22] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2021-05-13 20:23:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:23:22] [INFO ] [Nat]Absence check using 48 positive place invariants in 32 ms returned unsat
[2021-05-13 20:23:22] [INFO ] [Real]Absence check using 48 positive place invariants in 28 ms returned sat
[2021-05-13 20:23:22] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2021-05-13 20:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:23:23] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2021-05-13 20:23:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:23:23] [INFO ] [Nat]Absence check using 48 positive place invariants in 49 ms returned sat
[2021-05-13 20:23:23] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 21 ms returned sat
[2021-05-13 20:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:23:23] [INFO ] [Nat]Absence check using state equation in 309 ms returned unsat
[2021-05-13 20:23:23] [INFO ] [Real]Absence check using 48 positive place invariants in 28 ms returned sat
[2021-05-13 20:23:23] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 20 ms returned sat
[2021-05-13 20:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:23:24] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2021-05-13 20:23:24] [INFO ] Deduced a trap composed of 15 places in 298 ms
[2021-05-13 20:23:24] [INFO ] Deduced a trap composed of 129 places in 176 ms
[2021-05-13 20:23:25] [INFO ] Deduced a trap composed of 13 places in 254 ms
[2021-05-13 20:23:25] [INFO ] Deduced a trap composed of 24 places in 182 ms
[2021-05-13 20:23:25] [INFO ] Deduced a trap composed of 26 places in 205 ms
[2021-05-13 20:23:25] [INFO ] Deduced a trap composed of 28 places in 248 ms
[2021-05-13 20:23:26] [INFO ] Deduced a trap composed of 123 places in 213 ms
[2021-05-13 20:23:26] [INFO ] Deduced a trap composed of 130 places in 222 ms
[2021-05-13 20:23:26] [INFO ] Deduced a trap composed of 20 places in 147 ms
[2021-05-13 20:23:26] [INFO ] Deduced a trap composed of 130 places in 157 ms
[2021-05-13 20:23:26] [INFO ] Deduced a trap composed of 31 places in 192 ms
[2021-05-13 20:23:27] [INFO ] Deduced a trap composed of 124 places in 188 ms
[2021-05-13 20:23:27] [INFO ] Deduced a trap composed of 131 places in 186 ms
[2021-05-13 20:23:27] [INFO ] Deduced a trap composed of 120 places in 191 ms
[2021-05-13 20:23:27] [INFO ] Deduced a trap composed of 34 places in 217 ms
[2021-05-13 20:23:27] [INFO ] Deduced a trap composed of 44 places in 202 ms
[2021-05-13 20:23:28] [INFO ] Deduced a trap composed of 118 places in 174 ms
[2021-05-13 20:23:28] [INFO ] Deduced a trap composed of 135 places in 128 ms
[2021-05-13 20:23:28] [INFO ] Deduced a trap composed of 46 places in 211 ms
[2021-05-13 20:23:28] [INFO ] Deduced a trap composed of 44 places in 186 ms
[2021-05-13 20:23:28] [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 s73 s82 s83 s86 s87 s88 s92 s132 s135 s136 s137 s247 s248 s249 s262 s263 s264 s267 s268 s269 s273 s278 s293 s303 s313 s318 s396 s397 s404 s405 s410 s411 s414 s436 s437) 0)") while checking expression at index 2
[2021-05-13 20:23:28] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned unsat
[2021-05-13 20:23:28] [INFO ] [Real]Absence check using 48 positive place invariants in 36 ms returned sat
[2021-05-13 20:23:28] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 23 ms returned sat
[2021-05-13 20:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:23:29] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2021-05-13 20:23:29] [INFO ] Deduced a trap composed of 10 places in 150 ms
[2021-05-13 20:23:29] [INFO ] Deduced a trap composed of 129 places in 226 ms
[2021-05-13 20:23:30] [INFO ] Deduced a trap composed of 107 places in 216 ms
[2021-05-13 20:23:30] [INFO ] Deduced a trap composed of 129 places in 228 ms
[2021-05-13 20:23:30] [INFO ] Deduced a trap composed of 106 places in 217 ms
[2021-05-13 20:23:30] [INFO ] Deduced a trap composed of 33 places in 208 ms
[2021-05-13 20:23:31] [INFO ] Deduced a trap composed of 22 places in 187 ms
[2021-05-13 20:23:31] [INFO ] Deduced a trap composed of 116 places in 214 ms
[2021-05-13 20:23:31] [INFO ] Deduced a trap composed of 122 places in 202 ms
[2021-05-13 20:23:31] [INFO ] Deduced a trap composed of 121 places in 195 ms
[2021-05-13 20:23:31] [INFO ] Deduced a trap composed of 117 places in 163 ms
[2021-05-13 20:23:32] [INFO ] Deduced a trap composed of 30 places in 209 ms
[2021-05-13 20:23:32] [INFO ] Deduced a trap composed of 23 places in 179 ms
[2021-05-13 20:23:32] [INFO ] Deduced a trap composed of 107 places in 186 ms
[2021-05-13 20:23:32] [INFO ] Deduced a trap composed of 109 places in 216 ms
[2021-05-13 20:23:32] [INFO ] Deduced a trap composed of 110 places in 192 ms
[2021-05-13 20:23:33] [INFO ] Deduced a trap composed of 111 places in 141 ms
[2021-05-13 20:23:33] [INFO ] Deduced a trap composed of 114 places in 179 ms
[2021-05-13 20:23:33] [INFO ] Deduced a trap composed of 106 places in 242 ms
[2021-05-13 20:23:33] [INFO ] Deduced a trap composed of 121 places in 201 ms
[2021-05-13 20:23:34] [INFO ] Deduced a trap composed of 24 places in 230 ms
[2021-05-13 20:23:34] [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 s36 s277 s278 s279) 0)") while checking expression at index 4
[2021-05-13 20:23:34] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2021-05-13 20:23:34] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 38 ms returned sat
[2021-05-13 20:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:23:34] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2021-05-13 20:23:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:23:35] [INFO ] [Nat]Absence check using 48 positive place invariants in 56 ms returned sat
[2021-05-13 20:23:35] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned unsat
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 288 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 510 transition count 351
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 232 place count 399 transition count 351
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 232 place count 399 transition count 277
Deduced a syphon composed of 74 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 390 place count 315 transition count 277
Symmetric choice reduction at 2 with 64 rule applications. Total rules 454 place count 315 transition count 277
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 582 place count 251 transition count 213
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 582 place count 251 transition count 205
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 600 place count 241 transition count 205
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 763 place count 158 transition count 125
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 765 place count 157 transition count 128
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 767 place count 157 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 769 place count 155 transition count 126
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 770 place count 155 transition count 126
Applied a total of 770 rules in 133 ms. Remains 155 /518 variables (removed 363) and now considering 126/471 (removed 345) transitions.
Finished structural reductions, in 1 iterations. Remains : 155/518 places, 126/471 transitions.
Finished random walk after 88 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=44 )
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-10"
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-10, 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-162038177000199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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