Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701700154.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 gold2021
Input is AutoFlight-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701700154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 9.4K Apr 30 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 30 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 70K May 10 09:33 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 AutoFlight-PT-03b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652727717231

Running Version 0
[2022-05-16 19:01:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 19:01:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:01:59] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2022-05-16 19:01:59] [INFO ] Transformed 298 places.
[2022-05-16 19:01:59] [INFO ] Transformed 296 transitions.
[2022-05-16 19:01:59] [INFO ] Found NUPN structural information;
[2022-05-16 19:01:59] [INFO ] Parsed PT model containing 298 places and 296 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 296 rows 298 cols
[2022-05-16 19:01:59] [INFO ] Computed 22 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 62 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :12
FORMULA AutoFlight-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
// Phase 1: matrix 296 rows 298 cols
[2022-05-16 19:01:59] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 19:01:59] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2022-05-16 19:01:59] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:01:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:01:59] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-16 19:01:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:01:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 34 ms returned sat
[2022-05-16 19:01:59] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:00] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-05-16 19:02:00] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 15 ms to minimize.
[2022-05-16 19:02:00] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2022-05-16 19:02:00] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2022-05-16 19:02:00] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2022-05-16 19:02:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 561 ms
[2022-05-16 19:02:00] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-16 19:02:01] [INFO ] Added : 275 causal constraints over 56 iterations in 1025 ms. Result :sat
Minimization took 82 ms.
[2022-05-16 19:02:01] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2022-05-16 19:02:01] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:01] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-16 19:02:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:02:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2022-05-16 19:02:02] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 10 ms returned sat
[2022-05-16 19:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:02] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-16 19:02:02] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2022-05-16 19:02:02] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2022-05-16 19:02:02] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 0 ms to minimize.
[2022-05-16 19:02:02] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2022-05-16 19:02:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 325 ms
[2022-05-16 19:02:02] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-16 19:02:03] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2022-05-16 19:02:03] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2022-05-16 19:02:03] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2022-05-16 19:02:03] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
[2022-05-16 19:02:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 320 ms
[2022-05-16 19:02:03] [INFO ] Added : 292 causal constraints over 59 iterations in 1373 ms. Result :sat
Minimization took 104 ms.
[2022-05-16 19:02:04] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2022-05-16 19:02:04] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:04] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-16 19:02:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:02:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2022-05-16 19:02:04] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:04] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-16 19:02:04] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2022-05-16 19:02:04] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2022-05-16 19:02:04] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2022-05-16 19:02:04] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2022-05-16 19:02:04] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2022-05-16 19:02:04] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
[2022-05-16 19:02:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 500 ms
[2022-05-16 19:02:04] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-16 19:02:05] [INFO ] Added : 278 causal constraints over 56 iterations in 1169 ms. Result :sat
Minimization took 70 ms.
[2022-05-16 19:02:06] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2022-05-16 19:02:06] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:06] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-16 19:02:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:02:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2022-05-16 19:02:06] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 19:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:02:06] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-16 19:02:06] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2022-05-16 19:02:06] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2022-05-16 19:02:06] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2022-05-16 19:02:06] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2022-05-16 19:02:06] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2022-05-16 19:02:06] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2022-05-16 19:02:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 448 ms
[2022-05-16 19:02:06] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-16 19:02:07] [INFO ] Added : 278 causal constraints over 56 iterations in 1020 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 20900 steps, including 144 resets, run finished after 88 ms. (steps per millisecond=237 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA AutoFlight-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 19900 steps, including 113 resets, run finished after 55 ms. (steps per millisecond=361 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17000 steps, including 113 resets, run finished after 63 ms. (steps per millisecond=269 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16900 steps, including 111 resets, run finished after 29 ms. (steps per millisecond=582 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 298 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 298/298 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 297 transition count 181
Reduce places removed 114 places and 1 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 135 rules applied. Total rules applied 249 place count 183 transition count 159
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 255 place count 177 transition count 159
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 255 place count 177 transition count 116
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 341 place count 134 transition count 116
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 369 place count 106 transition count 88
Iterating global reduction 3 with 28 rules applied. Total rules applied 397 place count 106 transition count 88
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 397 place count 106 transition count 79
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 415 place count 97 transition count 79
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 461 place count 74 transition count 56
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 473 place count 74 transition count 44
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 485 place count 62 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 486 place count 61 transition count 43
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 24 rules applied. Total rules applied 510 place count 50 transition count 30
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 523 place count 37 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 523 place count 37 transition count 20
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 543 place count 27 transition count 20
Applied a total of 543 rules in 75 ms. Remains 27 /298 variables (removed 271) and now considering 20/295 (removed 275) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/298 places, 20/295 transitions.
// Phase 1: matrix 20 rows 27 cols
[2022-05-16 19:02:08] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 42503 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties (out of 1) seen :1
FORMULA AutoFlight-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652727729736

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="AutoFlight-PT-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is AutoFlight-PT-03b, 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 r010-tajo-165245701700154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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