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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15746.320 14256.00 26040.00 117.50 TFFFTFFFTFFTFFFT 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-158897699200518.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-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:43 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:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 104K 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-09-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589251802490

[2020-05-12 02:50:05] [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:50:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:50:05] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2020-05-12 02:50:05] [INFO ] Transformed 403 places.
[2020-05-12 02:50:05] [INFO ] Transformed 374 transitions.
[2020-05-12 02:50:05] [INFO ] Found NUPN structural information;
[2020-05-12 02:50:05] [INFO ] Parsed PT model containing 403 places and 374 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 101 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 374 rows 403 cols
[2020-05-12 02:50:05] [INFO ] Computed 65 place invariants in 16 ms
[2020-05-12 02:50:05] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-05-12 02:50:05] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 1 ms returned unsat
[2020-05-12 02:50:06] [INFO ] [Real]Absence check using 36 positive place invariants in 57 ms returned sat
[2020-05-12 02:50:06] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 38 ms returned sat
[2020-05-12 02:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:06] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2020-05-12 02:50:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:50:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 31 ms returned sat
[2020-05-12 02:50:06] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 12 ms returned sat
[2020-05-12 02:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:07] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2020-05-12 02:50:07] [INFO ] Deduced a trap composed of 18 places in 156 ms
[2020-05-12 02:50:07] [INFO ] Deduced a trap composed of 11 places in 198 ms
[2020-05-12 02:50:07] [INFO ] Deduced a trap composed of 23 places in 179 ms
[2020-05-12 02:50:07] [INFO ] Deduced a trap composed of 11 places in 191 ms
[2020-05-12 02:50:08] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2020-05-12 02:50:08] [INFO ] Deduced a trap composed of 17 places in 35 ms
[2020-05-12 02:50:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 937 ms
[2020-05-12 02:50:08] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 22 ms.
[2020-05-12 02:50:09] [INFO ] Added : 227 causal constraints over 46 iterations in 1746 ms. Result :sat
[2020-05-12 02:50:10] [INFO ] Deduced a trap composed of 26 places in 191 ms
[2020-05-12 02:50:10] [INFO ] Deduced a trap composed of 27 places in 53 ms
[2020-05-12 02:50:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-05-12 02:50:10] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2020-05-12 02:50:10] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 5 ms returned unsat
[2020-05-12 02:50:10] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2020-05-12 02:50:10] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 14 ms returned sat
[2020-05-12 02:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:10] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2020-05-12 02:50:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:50:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-05-12 02:50:10] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 13 ms returned sat
[2020-05-12 02:50:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:11] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2020-05-12 02:50:11] [INFO ] Deduced a trap composed of 11 places in 110 ms
[2020-05-12 02:50:11] [INFO ] Deduced a trap composed of 20 places in 118 ms
[2020-05-12 02:50:11] [INFO ] Deduced a trap composed of 90 places in 160 ms
[2020-05-12 02:50:11] [INFO ] Deduced a trap composed of 8 places in 176 ms
[2020-05-12 02:50:12] [INFO ] Deduced a trap composed of 20 places in 109 ms
[2020-05-12 02:50:12] [INFO ] Deduced a trap composed of 50 places in 114 ms
[2020-05-12 02:50:12] [INFO ] Deduced a trap composed of 30 places in 110 ms
[2020-05-12 02:50:12] [INFO ] Deduced a trap composed of 33 places in 107 ms
[2020-05-12 02:50:12] [INFO ] Deduced a trap composed of 91 places in 127 ms
[2020-05-12 02:50:12] [INFO ] Deduced a trap composed of 98 places in 137 ms
[2020-05-12 02:50:12] [INFO ] Deduced a trap composed of 98 places in 110 ms
[2020-05-12 02:50:12] [INFO ] Deduced a trap composed of 96 places in 105 ms
[2020-05-12 02:50:13] [INFO ] Deduced a trap composed of 96 places in 101 ms
[2020-05-12 02:50:13] [INFO ] Deduced a trap composed of 100 places in 104 ms
[2020-05-12 02:50:13] [INFO ] Deduced a trap composed of 96 places in 103 ms
[2020-05-12 02:50:13] [INFO ] Deduced a trap composed of 94 places in 101 ms
[2020-05-12 02:50:13] [INFO ] Deduced a trap composed of 96 places in 100 ms
[2020-05-12 02:50:13] [INFO ] Deduced a trap composed of 102 places in 104 ms
[2020-05-12 02:50:13] [INFO ] Deduced a trap composed of 98 places in 104 ms
[2020-05-12 02:50:13] [INFO ] Deduced a trap composed of 100 places in 101 ms
[2020-05-12 02:50:14] [INFO ] Deduced a trap composed of 103 places in 106 ms
[2020-05-12 02:50:14] [INFO ] Deduced a trap composed of 88 places in 104 ms
[2020-05-12 02:50:14] [INFO ] Deduced a trap composed of 103 places in 104 ms
[2020-05-12 02:50:14] [INFO ] Deduced a trap composed of 101 places in 103 ms
[2020-05-12 02:50:14] [INFO ] Deduced a trap composed of 99 places in 103 ms
[2020-05-12 02:50:14] [INFO ] Deduced a trap composed of 15 places in 213 ms
[2020-05-12 02:50:14] [INFO ] Deduced a trap composed of 85 places in 105 ms
[2020-05-12 02:50:15] [INFO ] Deduced a trap composed of 101 places in 115 ms
[2020-05-12 02:50:15] [INFO ] Deduced a trap composed of 19 places in 613 ms
[2020-05-12 02:50:15] [INFO ] Deduced a trap composed of 92 places in 230 ms
[2020-05-12 02:50:15] [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 s24 s25 s28 s33 s34 s35 s39 s41 s42 s48 s49 s50 s59 s60 s61 s78 s80 s82 s84 s86 s87 s88 s89 s92 s95 s105 s111 s117 s123 s135 s136 s137 s170 s189 s194 s199 s203 s204 s205 s209 s223 s225 s228 s230 s259 s263 s264 s265 s269 s272 s274 s275 s276 s278 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s295 s296 s310 s311 s312 s315 s316 s319 s320 s321 s322 s340 s341 s354 s355 s356 s357 s364 s365 s368 s370 s371 s373 s374) 0)") while checking expression at index 3
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 18800 steps, including 240 resets, run finished after 63 ms. (steps per millisecond=298 ) properties seen :[0, 0] could not realise parikh vector
Support contains 8 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 223 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 19 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 395 transition count 280
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 180 place count 310 transition count 280
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 180 place count 310 transition count 219
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 312 place count 239 transition count 219
Symmetric choice reduction at 2 with 44 rule applications. Total rules 356 place count 239 transition count 219
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 44 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 444 place count 195 transition count 175
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 444 place count 195 transition count 169
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 457 place count 188 transition count 169
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 577 place count 127 transition count 110
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 579 place count 126 transition count 113
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 581 place count 126 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 583 place count 124 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 584 place count 124 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 585 place count 123 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 586 place count 122 transition count 110
Applied a total of 586 rules in 183 ms. Remains 122 /403 variables (removed 281) and now considering 110/374 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/403 places, 110/374 transitions.
Finished random walk after 17613 steps, including 1092 resets, run visited all 2 properties in 70 ms. (steps per millisecond=251 )
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589251816746

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

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