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-158897699100494.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-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 2.8K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:43 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.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:37 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 85K 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-06-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589250935505

[2020-05-12 02:35:38] [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 02:35:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:35:38] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-05-12 02:35:38] [INFO ] Transformed 376 places.
[2020-05-12 02:35:38] [INFO ] Transformed 297 transitions.
[2020-05-12 02:35:38] [INFO ] Found NUPN structural information;
[2020-05-12 02:35:38] [INFO ] Parsed PT model containing 376 places and 297 transitions in 137 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 107 resets, run finished after 81 ms. (steps per millisecond=123 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[1, 0, 0, 0]
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0]
// Phase 1: matrix 296 rows 375 cols
[2020-05-12 02:35:38] [INFO ] Computed 81 place invariants in 14 ms
[2020-05-12 02:35:39] [INFO ] [Real]Absence check using 42 positive place invariants in 332 ms returned sat
[2020-05-12 02:35:39] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 59 ms returned sat
[2020-05-12 02:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:39] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2020-05-12 02:35:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:35:39] [INFO ] [Nat]Absence check using 42 positive place invariants in 39 ms returned sat
[2020-05-12 02:35:39] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 20 ms returned sat
[2020-05-12 02:35:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:40] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 16 places in 149 ms
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 8 places in 144 ms
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 18 places in 201 ms
[2020-05-12 02:35:41] [INFO ] Deduced a trap composed of 15 places in 172 ms
[2020-05-12 02:35:43] [INFO ] Deduced a trap composed of 11 places in 1983 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 20 places in 1070 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 17 places in 108 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 75 places in 94 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 21 places in 118 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 25 places in 97 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 83 places in 114 ms
[2020-05-12 02:35:44] [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 s48 s49 s50 s54 s55 s56 s97 s98 s111 s112 s134 s135 s136 s140 s141 s142 s171 s172 s173 s181 s182 s183 s187 s196 s198 s217 s227 s252 s267 s271 s274 s275 s276 s277 s278 s279 s280 s281 s282 s285 s286 s293 s294 s297 s298 s299 s300 s301 s302 s307 s308 s311 s312 s313 s314 s317 s318 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s332 s333 s334 s335 s338 s339 s344 s345 s369) 0)") while checking expression at index 0
[2020-05-12 02:35:44] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2020-05-12 02:35:44] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 20 ms returned sat
[2020-05-12 02:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:45] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 8 places in 93 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 17 places in 152 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 15 places in 118 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 17 places in 137 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 21 places in 73 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 22 places in 54 ms
[2020-05-12 02:35:46] [INFO ] Deduced a trap composed of 11 places in 44 ms
[2020-05-12 02:35:46] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2020-05-12 02:35:46] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-05-12 02:35:46] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2020-05-12 02:35:46] [INFO ] Deduced a trap composed of 20 places in 63 ms
[2020-05-12 02:35:46] [INFO ] Deduced a trap composed of 24 places in 51 ms
[2020-05-12 02:35:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1228 ms
[2020-05-12 02:35:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:35:46] [INFO ] [Nat]Absence check using 42 positive place invariants in 32 ms returned sat
[2020-05-12 02:35:46] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 21 ms returned sat
[2020-05-12 02:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:46] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2020-05-12 02:35:47] [INFO ] Deduced a trap composed of 14 places in 153 ms
[2020-05-12 02:35:47] [INFO ] Deduced a trap composed of 17 places in 373 ms
[2020-05-12 02:35:47] [INFO ] Deduced a trap composed of 10 places in 113 ms
[2020-05-12 02:35:47] [INFO ] Deduced a trap composed of 18 places in 129 ms
[2020-05-12 02:35:47] [INFO ] Deduced a trap composed of 16 places in 96 ms
[2020-05-12 02:35:48] [INFO ] Deduced a trap composed of 24 places in 115 ms
[2020-05-12 02:35:48] [INFO ] Deduced a trap composed of 8 places in 107 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 17 places in 2654 ms
[2020-05-12 02:35:51] [INFO ] Deduced a trap composed of 12 places in 241 ms
[2020-05-12 02:35:51] [INFO ] Deduced a trap composed of 15 places in 149 ms
[2020-05-12 02:35:51] [INFO ] Deduced a trap composed of 20 places in 51 ms
[2020-05-12 02:35:51] [INFO ] Deduced a trap composed of 22 places in 81 ms
[2020-05-12 02:35:51] [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: Broken pipe (> (+ s0 s1 s2 s147 s150 s186 s187 s188 s207 s262 s267 s297 s298 s332 s333 s340 s341 s345 s346 s347 s348 s360) 0)") while checking expression at index 1
[2020-05-12 02:35:51] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned sat
[2020-05-12 02:35:51] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 17 ms returned sat
[2020-05-12 02:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:51] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2020-05-12 02:35:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:35:51] [INFO ] [Nat]Absence check using 42 positive place invariants in 26 ms returned sat
[2020-05-12 02:35:51] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2020-05-12 02:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:53] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2020-05-12 02:35:54] [INFO ] Deduced a trap composed of 11 places in 1495 ms
[2020-05-12 02:35:55] [INFO ] Deduced a trap composed of 8 places in 186 ms
[2020-05-12 02:35:55] [INFO ] Deduced a trap composed of 21 places in 574 ms
[2020-05-12 02:35:56] [INFO ] Deduced a trap composed of 20 places in 231 ms
[2020-05-12 02:35:56] [INFO ] Deduced a trap composed of 25 places in 126 ms
[2020-05-12 02:35:56] [INFO ] Deduced a trap composed of 17 places in 116 ms
[2020-05-12 02:35:57] [INFO ] Deduced a trap composed of 15 places in 652 ms
[2020-05-12 02:35:57] [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 s60 s61 s62 s151 s152 s153 s236 s237 s238 s255 s257 s258 s259) 0)") while checking expression at index 2
Support contains 18 out of 375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 181 edges and 375 vertex of which 7 / 375 are part of one of the 1 SCC in 47 ms
Free SCC test removed 6 places
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 684 edges and 369 vertex of which 366 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.18 ms
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 366 transition count 223
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 137 place count 303 transition count 223
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 137 place count 303 transition count 164
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 262 place count 237 transition count 164
Symmetric choice reduction at 2 with 37 rule applications. Total rules 299 place count 237 transition count 164
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 37 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 373 place count 200 transition count 127
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 4 ms
Ensure Unique test removed 6 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 499 place count 134 transition count 67
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 500 place count 134 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 501 place count 133 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 133 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 503 place count 132 transition count 65
Applied a total of 503 rules in 165 ms. Remains 132 /375 variables (removed 243) and now considering 65/296 (removed 231) transitions.
Finished structural reductions, in 1 iterations. Remains : 132/375 places, 65/296 transitions.
Finished random walk after 372346 steps, including 5557 resets, run visited all 3 properties in 836 ms. (steps per millisecond=445 )
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589250958304

--------------------
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-06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;