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

About the Execution of 2020-gold for DLCshifumi-PT-3b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
409.096 3600000.00 58660.00 290.90 TTTTFTTTTFTFFTFT 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-162039097400240.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 DLCshifumi-PT-3b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097400240
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 DLCshifumi-PT-3b-ReachabilityFireability-00
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-01
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-02
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-03
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-04
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-05
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-06
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-07
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-08
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-09
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-10
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-11
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-12
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-13
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-14
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620551151861

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 09:05:53] [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-09 09:05:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 09:05:53] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2021-05-09 09:05:53] [INFO ] Transformed 7058 places.
[2021-05-09 09:05:53] [INFO ] Transformed 9611 transitions.
[2021-05-09 09:05:53] [INFO ] Found NUPN structural information;
[2021-05-09 09:05:53] [INFO ] Parsed PT model containing 7058 places and 9611 transitions in 474 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 282 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 159 ms. (steps per millisecond=62 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0]
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 9611 rows 7058 cols
[2021-05-09 09:05:54] [INFO ] Computed 282 place invariants in 175 ms
[2021-05-09 09:05:57] [INFO ] [Real]Absence check using 282 positive place invariants in 1241 ms returned sat
[2021-05-09 09:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:05:59] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 09:05:59] [INFO ] [Real]Absence check using state equation in 2648 ms returned (error "Failed to check-sat")
[2021-05-09 09:06:01] [INFO ] [Real]Absence check using 282 positive place invariants in 1133 ms returned sat
[2021-05-09 09:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:06:04] [INFO ] [Real]Absence check using state equation in 2831 ms returned (error "Solver has unexpectedly terminated")
[2021-05-09 09:06:06] [INFO ] [Real]Absence check using 282 positive place invariants in 1228 ms returned sat
[2021-05-09 09:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:06:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 09:06:09] [INFO ] [Real]Absence check using state equation in 2927 ms returned (error "Failed to check-sat")
[2021-05-09 09:06:11] [INFO ] [Real]Absence check using 282 positive place invariants in 1142 ms returned sat
[2021-05-09 09:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:06:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 09:06:14] [INFO ] [Real]Absence check using state equation in 2899 ms returned (error "Failed to check-sat")
[2021-05-09 09:06:16] [INFO ] [Real]Absence check using 282 positive place invariants in 1138 ms returned sat
[2021-05-09 09:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:06:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 09:06:19] [INFO ] [Real]Absence check using state equation in 3009 ms returned (error "Failed to check-sat")
[2021-05-09 09:06:22] [INFO ] [Real]Absence check using 282 positive place invariants in 1269 ms returned sat
[2021-05-09 09:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:06:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 09:06:24] [INFO ] [Real]Absence check using state equation in 2747 ms returned (error "Failed to check-sat")
[2021-05-09 09:06:26] [INFO ] [Real]Absence check using 282 positive place invariants in 1216 ms returned sat
[2021-05-09 09:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:06:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 09:06:29] [INFO ] [Real]Absence check using state equation in 2965 ms returned (error "Failed to check-sat")
[2021-05-09 09:06:31] [INFO ] [Real]Absence check using 282 positive place invariants in 1220 ms returned sat
[2021-05-09 09:06:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:06:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 09:06:34] [INFO ] [Real]Absence check using state equation in 2926 ms returned (error "Failed to check-sat")
Support contains 48 out of 7058 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7058/7058 places, 9611/9611 transitions.
Graph (trivial) has 6703 edges and 7058 vertex of which 753 / 7058 are part of one of the 49 SCC in 27 ms
Free SCC test removed 704 places
Drop transitions removed 795 transitions
Reduce isomorphic transitions removed 795 transitions.
Performed 3496 Post agglomeration using F-continuation condition.Transition count delta: 3496
Iterating post reduction 0 with 4291 rules applied. Total rules applied 4292 place count 6354 transition count 5320
Reduce places removed 3496 places and 0 transitions.
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Iterating post reduction 1 with 3733 rules applied. Total rules applied 8025 place count 2858 transition count 5083
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 185 rules applied. Total rules applied 8210 place count 2742 transition count 5014
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 8243 place count 2709 transition count 5014
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 8243 place count 2709 transition count 4955
Deduced a syphon composed of 59 places in 106 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 8361 place count 2650 transition count 4955
Symmetric choice reduction at 4 with 729 rule applications. Total rules 9090 place count 2650 transition count 4955
Deduced a syphon composed of 729 places in 28 ms
Reduce places removed 729 places and 729 transitions.
Iterating global reduction 4 with 1458 rules applied. Total rules applied 10548 place count 1921 transition count 4226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 10552 place count 1921 transition count 4222
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 10555 place count 1919 transition count 4221
Performed 266 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 266 Pre rules applied. Total rules applied 10555 place count 1919 transition count 3955
Deduced a syphon composed of 266 places in 73 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 6 with 532 rules applied. Total rules applied 11087 place count 1653 transition count 3955
Symmetric choice reduction at 6 with 84 rule applications. Total rules 11171 place count 1653 transition count 3955
Deduced a syphon composed of 84 places in 22 ms
Reduce places removed 84 places and 822 transitions.
Iterating global reduction 6 with 168 rules applied. Total rules applied 11339 place count 1569 transition count 3133
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 6 with 72 rules applied. Total rules applied 11411 place count 1569 transition count 3061
Performed 396 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 396 places in 1 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 7 with 792 rules applied. Total rules applied 12203 place count 1173 transition count 2662
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 12206 place count 1173 transition count 2659
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 12408 place count 1072 transition count 2868
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 12409 place count 1072 transition count 2867
Performed 26 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 52 rules applied. Total rules applied 12461 place count 1046 transition count 3001
Drop transitions removed 25 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 12487 place count 1046 transition count 2975
Free-agglomeration rule applied 581 times with reduction of 319 identical transitions.
Iterating global reduction 10 with 581 rules applied. Total rules applied 13068 place count 1046 transition count 2075
Reduce places removed 581 places and 0 transitions.
Drop transitions removed 748 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 762 transitions.
Discarding 93 places :
Also discarding 87 output transitions
Drop transitions removed 87 transitions
Graph (complete) has 1641 edges and 465 vertex of which 372 are kept as prefixes of interest. Removing 93 places using SCC suffix rule.7 ms
Iterating post reduction 10 with 1344 rules applied. Total rules applied 14412 place count 372 transition count 1226
Drop transitions removed 147 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 11 with 164 rules applied. Total rules applied 14576 place count 372 transition count 1062
Symmetric choice reduction at 12 with 11 rule applications. Total rules 14587 place count 372 transition count 1062
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 33 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 14609 place count 361 transition count 1029
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 14636 place count 361 transition count 1002
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 14637 place count 361 transition count 1001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14638 place count 360 transition count 1001
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 14644 place count 360 transition count 1241
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Iterating post reduction 14 with 236 rules applied. Total rules applied 14880 place count 354 transition count 1011
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 14881 place count 354 transition count 1011
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 15 with 39 rules applied. Total rules applied 14920 place count 354 transition count 972
Applied a total of 14920 rules in 2121 ms. Remains 354 /7058 variables (removed 6704) and now considering 972/9611 (removed 8639) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/7058 places, 972/9611 transitions.
Finished random walk after 13293 steps, including 0 resets, run visited all 8 properties in 119 ms. (steps per millisecond=111 )
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-01 TRUE 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="DLCshifumi-PT-3b"
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 DLCshifumi-PT-3b, 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-162039097400240"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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