fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r075-tall-162039097100016
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DES-PT-01b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1102.056 3600000.00 52091.00 103.40 TTTTTTTFTFFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097100016.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 DES-PT-01b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 7.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 68K 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 DES-PT-01b-ReachabilityFireability-00
FORMULA_NAME DES-PT-01b-ReachabilityFireability-01
FORMULA_NAME DES-PT-01b-ReachabilityFireability-02
FORMULA_NAME DES-PT-01b-ReachabilityFireability-03
FORMULA_NAME DES-PT-01b-ReachabilityFireability-04
FORMULA_NAME DES-PT-01b-ReachabilityFireability-05
FORMULA_NAME DES-PT-01b-ReachabilityFireability-06
FORMULA_NAME DES-PT-01b-ReachabilityFireability-07
FORMULA_NAME DES-PT-01b-ReachabilityFireability-08
FORMULA_NAME DES-PT-01b-ReachabilityFireability-09
FORMULA_NAME DES-PT-01b-ReachabilityFireability-10
FORMULA_NAME DES-PT-01b-ReachabilityFireability-11
FORMULA_NAME DES-PT-01b-ReachabilityFireability-12
FORMULA_NAME DES-PT-01b-ReachabilityFireability-13
FORMULA_NAME DES-PT-01b-ReachabilityFireability-14
FORMULA_NAME DES-PT-01b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620499194074

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 18:39:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 18:39:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 18:39:55] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-08 18:39:55] [INFO ] Transformed 284 places.
[2021-05-08 18:39:55] [INFO ] Transformed 235 transitions.
[2021-05-08 18:39:55] [INFO ] Found NUPN structural information;
[2021-05-08 18:39:55] [INFO ] Parsed PT model containing 284 places and 235 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 100 resets, run finished after 84 ms. (steps per millisecond=119 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1]
FORMULA DES-PT-01b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0]
// Phase 1: matrix 235 rows 284 cols
[2021-05-08 18:39:55] [INFO ] Computed 65 place invariants in 15 ms
[2021-05-08 18:39:56] [INFO ] [Real]Absence check using 40 positive place invariants in 33 ms returned sat
[2021-05-08 18:39:56] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 18:39:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:39:56] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-08 18:39:56] [INFO ] Deduced a trap composed of 10 places in 129 ms
[2021-05-08 18:39:56] [INFO ] Deduced a trap composed of 27 places in 97 ms
[2021-05-08 18:39:56] [INFO ] Deduced a trap composed of 19 places in 65 ms
[2021-05-08 18:39:56] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2021-05-08 18:39:56] [INFO ] Deduced a trap composed of 43 places in 76 ms
[2021-05-08 18:39:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 529 ms
[2021-05-08 18:39:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:39:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 33 ms returned sat
[2021-05-08 18:39:57] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 18:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 18:39:57] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-08 18:39:57] [INFO ] Deduced a trap composed of 9 places in 88 ms
[2021-05-08 18:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2021-05-08 18:39:57] [INFO ] Computed and/alt/rep : 234/415/234 causal constraints in 18 ms.
[2021-05-08 18:39:58] [INFO ] Added : 218 causal constraints over 44 iterations in 807 ms. Result :unsat
[2021-05-08 18:39:58] [INFO ] [Real]Absence check using 40 positive place invariants in 23 ms returned sat
[2021-05-08 18:39:58] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 18:39:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:39:58] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2021-05-08 18:39:58] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2021-05-08 18:39:58] [INFO ] Deduced a trap composed of 15 places in 101 ms
[2021-05-08 18:39:58] [INFO ] Deduced a trap composed of 21 places in 94 ms
[2021-05-08 18:39:58] [INFO ] Deduced a trap composed of 28 places in 83 ms
[2021-05-08 18:39:58] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2021-05-08 18:39:59] [INFO ] Deduced a trap composed of 21 places in 66 ms
[2021-05-08 18:39:59] [INFO ] Deduced a trap composed of 23 places in 60 ms
[2021-05-08 18:39:59] [INFO ] Deduced a trap composed of 20 places in 56 ms
[2021-05-08 18:39:59] [INFO ] Deduced a trap composed of 17 places in 54 ms
[2021-05-08 18:39:59] [INFO ] Deduced a trap composed of 19 places in 57 ms
[2021-05-08 18:39:59] [INFO ] Deduced a trap composed of 26 places in 74 ms
[2021-05-08 18:39:59] [INFO ] Deduced a trap composed of 25 places in 48 ms
[2021-05-08 18:39:59] [INFO ] Deduced a trap composed of 22 places in 38 ms
[2021-05-08 18:39:59] [INFO ] Deduced a trap composed of 23 places in 42 ms
[2021-05-08 18:39:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1118 ms
[2021-05-08 18:39:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:39:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 45 ms returned sat
[2021-05-08 18:39:59] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 18:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 18:39:59] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2021-05-08 18:40:00] [INFO ] Deduced a trap composed of 15 places in 69 ms
[2021-05-08 18:40:00] [INFO ] Deduced a trap composed of 17 places in 63 ms
[2021-05-08 18:40:00] [INFO ] Deduced a trap composed of 26 places in 58 ms
[2021-05-08 18:40:00] [INFO ] Deduced a trap composed of 13 places in 65 ms
[2021-05-08 18:40:00] [INFO ] Deduced a trap composed of 14 places in 58 ms
[2021-05-08 18:40:00] [INFO ] Deduced a trap composed of 21 places in 38 ms
[2021-05-08 18:40:00] [INFO ] Deduced a trap composed of 24 places in 39 ms
[2021-05-08 18:40:00] [INFO ] Deduced a trap composed of 14 places in 18 ms
[2021-05-08 18:40:00] [INFO ] Deduced a trap composed of 15 places in 17 ms
[2021-05-08 18:40:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 531 ms
[2021-05-08 18:40:00] [INFO ] Computed and/alt/rep : 234/415/234 causal constraints in 16 ms.
[2021-05-08 18:40:01] [INFO ] Added : 214 causal constraints over 44 iterations in 767 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
FORMULA DES-PT-01b-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 40000 steps, including 472 resets, run finished after 154 ms. (steps per millisecond=259 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 284 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 284/284 places, 235/235 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 513 edges and 284 vertex of which 273 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 273 transition count 206
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 47 place count 251 transition count 206
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 47 place count 251 transition count 197
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 65 place count 242 transition count 197
Symmetric choice reduction at 2 with 18 rule applications. Total rules 83 place count 242 transition count 197
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 119 place count 224 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 119 place count 224 transition count 178
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 223 transition count 178
Symmetric choice reduction at 2 with 15 rule applications. Total rules 136 place count 223 transition count 178
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 166 place count 208 transition count 163
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 182 place count 208 transition count 147
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 186 place count 205 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 186 place count 205 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 190 place count 203 transition count 144
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 324 place count 136 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 330 place count 133 transition count 85
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 332 place count 133 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 334 place count 131 transition count 83
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 335 place count 131 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 336 place count 130 transition count 82
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 339 place count 130 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 340 place count 129 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 341 place count 128 transition count 81
Applied a total of 341 rules in 111 ms. Remains 128 /284 variables (removed 156) and now considering 81/235 (removed 154) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/284 places, 81/235 transitions.
Incomplete random walk after 1000000 steps, including 55273 resets, run finished after 2727 ms. (steps per millisecond=366 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 12651 resets, run finished after 1138 ms. (steps per millisecond=878 ) properties seen :[0]
Interrupted probabilistic random walk after 20006522 steps, run timeout after 30001 ms. (steps per millisecond=666 ) properties seen :[0]
Probabilistic random walk after 20006522 steps, saw 2369969 distinct states, run finished after 30001 ms. (steps per millisecond=666 ) properties seen :[0]
// Phase 1: matrix 81 rows 128 cols
[2021-05-08 18:40:35] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 18:40:35] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 18:40:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 18:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:40:35] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-08 18:40:35] [INFO ] Deduced a trap composed of 6 places in 33 ms
[2021-05-08 18:40:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-08 18:40:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:40:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 18:40:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 18:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 18:40:35] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-08 18:40:35] [INFO ] Deduced a trap composed of 6 places in 42 ms
[2021-05-08 18:40:35] [INFO ] Deduced a trap composed of 8 places in 24 ms
[2021-05-08 18:40:35] [INFO ] Deduced a trap composed of 8 places in 15 ms
[2021-05-08 18:40:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 102 ms
[2021-05-08 18:40:35] [INFO ] Computed and/alt/rep : 71/280/71 causal constraints in 15 ms.
[2021-05-08 18:40:35] [INFO ] Added : 57 causal constraints over 12 iterations in 109 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Finished Parikh walk after 282 steps, including 12 resets, run visited all 1 properties in 3 ms. (steps per millisecond=94 )
FORMULA DES-PT-01b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_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="DES-PT-01b"
export BK_EXAMINATION="ReachabilityFireability"
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 DES-PT-01b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01b.tgz
mv DES-PT-01b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;