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-162039097300176.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 DLCround-PT-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097300176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K 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:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 08:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 08:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 963K 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 DLCround-PT-07b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-07b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620538365874

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 05:32:47] [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 05:32:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 05:32:47] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2021-05-09 05:32:47] [INFO ] Transformed 2703 places.
[2021-05-09 05:32:47] [INFO ] Transformed 4071 transitions.
[2021-05-09 05:32:47] [INFO ] Found NUPN structural information;
[2021-05-09 05:32:47] [INFO ] Parsed PT model containing 2703 places and 4071 transitions in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 130 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 115 ms. (steps per millisecond=86 ) properties seen :[0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1]
FORMULA DLCround-PT-07b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[1, 0, 0, 0, 0, 0]
FORMULA DLCround-PT-07b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 4071 rows 2703 cols
[2021-05-09 05:32:48] [INFO ] Computed 132 place invariants in 67 ms
[2021-05-09 05:32:48] [INFO ] [Real]Absence check using 132 positive place invariants in 288 ms returned sat
[2021-05-09 05:32:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:32:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 05:32:53] [INFO ] [Real]Absence check using state equation in 4255 ms returned (error "Failed to check-sat")
[2021-05-09 05:32:53] [INFO ] [Real]Absence check using 132 positive place invariants in 239 ms returned sat
[2021-05-09 05:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:32:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 05:32:58] [INFO ] [Real]Absence check using state equation in 4388 ms returned (error "Failed to check-sat")
[2021-05-09 05:32:58] [INFO ] [Real]Absence check using 132 positive place invariants in 263 ms returned sat
[2021-05-09 05:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:33:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 05:33:03] [INFO ] [Real]Absence check using state equation in 4484 ms returned (error "Failed to check-sat")
[2021-05-09 05:33:03] [INFO ] [Real]Absence check using 132 positive place invariants in 291 ms returned sat
[2021-05-09 05:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:33:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 05:33:08] [INFO ] [Real]Absence check using state equation in 4385 ms returned (error "Failed to check-sat")
[2021-05-09 05:33:08] [INFO ] [Real]Absence check using 132 positive place invariants in 303 ms returned sat
[2021-05-09 05:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:33:13] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 05:33:13] [INFO ] [Real]Absence check using state equation in 4379 ms returned (error "Failed to check-sat")
Support contains 38 out of 2703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Graph (trivial) has 2473 edges and 2703 vertex of which 453 / 2703 are part of one of the 38 SCC in 27 ms
Free SCC test removed 415 places
Drop transitions removed 466 transitions
Reduce isomorphic transitions removed 466 transitions.
Performed 1014 Post agglomeration using F-continuation condition.Transition count delta: 1014
Iterating post reduction 0 with 1480 rules applied. Total rules applied 1481 place count 2288 transition count 2591
Reduce places removed 1014 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 1074 rules applied. Total rules applied 2555 place count 1274 transition count 2531
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 34 rules applied. Total rules applied 2589 place count 1247 transition count 2524
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2592 place count 1244 transition count 2524
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 2592 place count 1244 transition count 2510
Deduced a syphon composed of 14 places in 9 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 2620 place count 1230 transition count 2510
Symmetric choice reduction at 4 with 336 rule applications. Total rules 2956 place count 1230 transition count 2510
Deduced a syphon composed of 336 places in 25 ms
Reduce places removed 336 places and 336 transitions.
Iterating global reduction 4 with 672 rules applied. Total rules applied 3628 place count 894 transition count 2174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3630 place count 894 transition count 2172
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 142 Pre rules applied. Total rules applied 3630 place count 894 transition count 2030
Deduced a syphon composed of 142 places in 21 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 5 with 284 rules applied. Total rules applied 3914 place count 752 transition count 2030
Symmetric choice reduction at 5 with 48 rule applications. Total rules 3962 place count 752 transition count 2030
Deduced a syphon composed of 48 places in 6 ms
Reduce places removed 48 places and 503 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4058 place count 704 transition count 1527
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 4072 place count 704 transition count 1513
Performed 180 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 6 with 360 rules applied. Total rules applied 4432 place count 524 transition count 1326
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 4436 place count 524 transition count 1322
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4439 place count 524 transition count 1322
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 33 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 4445 place count 521 transition count 1289
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -361
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 4525 place count 481 transition count 1650
Drop transitions removed 32 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 7 with 34 rules applied. Total rules applied 4559 place count 481 transition count 1616
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4563 place count 479 transition count 1644
Free-agglomeration rule applied 243 times with reduction of 112 identical transitions.
Iterating global reduction 8 with 243 rules applied. Total rules applied 4806 place count 479 transition count 1289
Reduce places removed 243 places and 0 transitions.
Drop transitions removed 449 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 462 transitions.
Iterating post reduction 8 with 705 rules applied. Total rules applied 5511 place count 236 transition count 827
Symmetric choice reduction at 9 with 3 rule applications. Total rules 5514 place count 236 transition count 827
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 33 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 5520 place count 233 transition count 794
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 5523 place count 233 transition count 791
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 5527 place count 233 transition count 791
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 5528 place count 233 transition count 791
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 10 with 48 rules applied. Total rules applied 5576 place count 233 transition count 743
Symmetric choice reduction at 10 with 5 rule applications. Total rules 5581 place count 233 transition count 743
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 58 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 5591 place count 228 transition count 685
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 5596 place count 228 transition count 680
Free-agglomeration rule applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 5601 place count 228 transition count 675
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 11 places :
Also discarding 0 output transitions
Graph (complete) has 677 edges and 223 vertex of which 212 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Iterating post reduction 11 with 56 rules applied. Total rules applied 5657 place count 212 transition count 625
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 5660 place count 212 transition count 622
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 5662 place count 212 transition count 620
Applied a total of 5662 rules in 794 ms. Remains 212 /2703 variables (removed 2491) and now considering 620/4071 (removed 3451) transitions.
Finished structural reductions, in 1 iterations. Remains : 212/2703 places, 620/4071 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 4948 ms. (steps per millisecond=202 ) properties seen :[1, 1, 0, 0, 1]
FORMULA DLCround-PT-07b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2216 ms. (steps per millisecond=451 ) properties seen :[1, 0]
FORMULA DLCround-PT-07b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2241 ms. (steps per millisecond=446 ) properties seen :[0]
[2021-05-09 05:33:23] [INFO ] Flow matrix only has 226 transitions (discarded 394 similar events)
// Phase 1: matrix 226 rows 212 cols
[2021-05-09 05:33:23] [INFO ] Computed 122 place invariants in 2 ms
[2021-05-09 05:33:23] [INFO ] [Real]Absence check using 122 positive place invariants in 34 ms returned sat
[2021-05-09 05:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:33:23] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-09 05:33:23] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 05:33:23] [INFO ] [Real]Added 71 Read/Feed constraints in 33 ms returned sat
[2021-05-09 05:33:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:33:23] [INFO ] [Nat]Absence check using 122 positive place invariants in 46 ms returned sat
[2021-05-09 05:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 05:33:24] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-09 05:33:24] [INFO ] [Nat]Added 71 Read/Feed constraints in 15 ms returned sat
[2021-05-09 05:33:24] [INFO ] Computed and/alt/rep : 616/7843/222 causal constraints in 28 ms.
[2021-05-09 05:33:25] [INFO ] Added : 199 causal constraints over 40 iterations in 1184 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
FORMULA DLCround-PT-07b-ReachabilityFireability-13 TRUE 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="DLCround-PT-07b"
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 DLCround-PT-07b, 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-162039097300176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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