Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640624700016.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FlexibleBarrier-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640624700016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716495727013

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-23 20:22:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:22:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:22:08] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-23 20:22:08] [INFO ] Transformed 542 places.
[2024-05-23 20:22:08] [INFO ] Transformed 621 transitions.
[2024-05-23 20:22:08] [INFO ] Found NUPN structural information;
[2024-05-23 20:22:08] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 621 rows 542 cols
[2024-05-23 20:22:08] [INFO ] Computed 8 invariants in 24 ms
Incomplete random walk after 10000 steps, including 196 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :9
FORMULA FlexibleBarrier-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 5) seen :1
FORMULA FlexibleBarrier-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-23 20:22:09] [INFO ] Invariant cache hit.
[2024-05-23 20:22:09] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-23 20:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:09] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 20:22:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:22:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-23 20:22:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:09] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 20:22:09] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 5 ms to minimize.
[2024-05-23 20:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-23 20:22:10] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 69 ms.
[2024-05-23 20:22:13] [INFO ] Deduced a trap composed of 162 places in 114 ms of which 0 ms to minimize.
[2024-05-23 20:22:13] [INFO ] Deduced a trap composed of 133 places in 62 ms of which 1 ms to minimize.
[2024-05-23 20:22:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2024-05-23 20:22:13] [INFO ] Added : 444 causal constraints over 89 iterations in 3905 ms. Result :sat
Minimization took 194 ms.
[2024-05-23 20:22:14] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-23 20:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:14] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 20:22:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:22:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-23 20:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:14] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-23 20:22:14] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 37 ms.
[2024-05-23 20:22:19] [INFO ] Deduced a trap composed of 135 places in 67 ms of which 1 ms to minimize.
[2024-05-23 20:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-05-23 20:22:19] [INFO ] Added : 502 causal constraints over 101 iterations in 4425 ms. Result :sat
Minimization took 201 ms.
[2024-05-23 20:22:19] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-23 20:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:19] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 20:22:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:22:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-23 20:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:19] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 20:22:20] [INFO ] Deduced a trap composed of 161 places in 121 ms of which 1 ms to minimize.
[2024-05-23 20:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-23 20:22:20] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 29 ms.
[2024-05-23 20:22:23] [INFO ] Deduced a trap composed of 250 places in 126 ms of which 0 ms to minimize.
[2024-05-23 20:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-23 20:22:23] [INFO ] Added : 477 causal constraints over 96 iterations in 3935 ms. Result :sat
Minimization took 186 ms.
[2024-05-23 20:22:24] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-23 20:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:24] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 20:22:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:22:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-23 20:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:24] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 20:22:24] [INFO ] Deduced a trap composed of 214 places in 125 ms of which 1 ms to minimize.
[2024-05-23 20:22:25] [INFO ] Deduced a trap composed of 190 places in 107 ms of which 1 ms to minimize.
[2024-05-23 20:22:25] [INFO ] Deduced a trap composed of 193 places in 97 ms of which 1 ms to minimize.
[2024-05-23 20:22:25] [INFO ] Deduced a trap composed of 191 places in 103 ms of which 1 ms to minimize.
[2024-05-23 20:22:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 548 ms
[2024-05-23 20:22:25] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 30 ms.
[2024-05-23 20:22:28] [INFO ] Added : 477 causal constraints over 96 iterations in 3650 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 520 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 4 ms
Free SCC test removed 32 places
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 510 transition count 436
Reduce places removed 146 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 294 place count 364 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 363 transition count 435
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 295 place count 363 transition count 406
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 353 place count 334 transition count 406
Discarding 168 places :
Symmetric choice reduction at 3 with 168 rule applications. Total rules 521 place count 166 transition count 238
Iterating global reduction 3 with 168 rules applied. Total rules applied 689 place count 166 transition count 238
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 689 place count 166 transition count 230
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 705 place count 158 transition count 230
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 711 place count 158 transition count 224
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 736 place count 133 transition count 199
Iterating global reduction 4 with 25 rules applied. Total rules applied 761 place count 133 transition count 199
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 785 place count 133 transition count 175
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 843 place count 104 transition count 146
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 849 place count 104 transition count 140
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 855 place count 98 transition count 134
Iterating global reduction 6 with 6 rules applied. Total rules applied 861 place count 98 transition count 134
Free-agglomeration rule applied 63 times.
Iterating global reduction 6 with 63 rules applied. Total rules applied 924 place count 98 transition count 71
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 90 edges and 35 vertex of which 15 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 89 rules applied. Total rules applied 1013 place count 15 transition count 46
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 1041 place count 15 transition count 18
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1042 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1043 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 13 edges and 12 vertex of which 9 / 12 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 4 rules applied. Total rules applied 1047 place count 6 transition count 16
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1060 place count 4 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1061 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1062 place count 3 transition count 4
Applied a total of 1062 rules in 93 ms. Remains 3 /542 variables (removed 539) and now considering 4/621 (removed 617) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 3/542 places, 4/621 transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-23 20:22:29] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 2) seen :2
FORMULA FlexibleBarrier-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21594 ms.

BK_STOP 1716495750951

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FlexibleBarrier-PT-06b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640624700016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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