Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460600166.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBLF-PT-S04J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460600166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 17K Apr 11 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:43 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 PolyORBLF-PT-S04J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717118277524

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=PolyORBLF-PT-S04J04T06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 01:17:59] [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-31 01:17:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 01:17:59] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-05-31 01:17:59] [INFO ] Transformed 554 places.
[2024-05-31 01:17:59] [INFO ] Transformed 2998 transitions.
[2024-05-31 01:17:59] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Normalized transition count is 1348 out of 1372 initially.
// Phase 1: matrix 1348 rows 554 cols
[2024-05-31 01:17:59] [INFO ] Computed 50 invariants in 124 ms
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 15) seen :26
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :28
[2024-05-31 01:18:00] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2024-05-31 01:18:00] [INFO ] Computed 50 invariants in 85 ms
[2024-05-31 01:18:00] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-31 01:18:00] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 35 ms returned unsat
[2024-05-31 01:18:00] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 01:18:00] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 8 ms returned unsat
[2024-05-31 01:18:00] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 01:18:00] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned unsat
[2024-05-31 01:18:00] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-31 01:18:00] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-31 01:18:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:01] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2024-05-31 01:18:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:18:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-31 01:18:02] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-31 01:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:04] [INFO ] [Nat]Absence check using state equation in 2660 ms returned sat
[2024-05-31 01:18:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:18:06] [INFO ] [Nat]Added 120 Read/Feed constraints in 1633 ms returned sat
[2024-05-31 01:18:06] [INFO ] Deduced a trap composed of 123 places in 366 ms of which 13 ms to minimize.
[2024-05-31 01:18:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 455 ms
[2024-05-31 01:18:07] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned unsat
[2024-05-31 01:18:07] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-31 01:18:07] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 24 ms returned sat
[2024-05-31 01:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:09] [INFO ] [Real]Absence check using state equation in 2259 ms returned sat
[2024-05-31 01:18:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:18:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 01:18:09] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-31 01:18:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:14] [INFO ] [Nat]Absence check using state equation in 4886 ms returned unknown
[2024-05-31 01:18:14] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 01:18:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 21 ms returned unsat
[2024-05-31 01:18:14] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 01:18:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned unsat
[2024-05-31 01:18:14] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 01:18:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned unsat
[2024-05-31 01:18:14] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-31 01:18:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned unsat
[2024-05-31 01:18:15] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-31 01:18:15] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 32 ms returned unsat
[2024-05-31 01:18:15] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 01:18:15] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned unsat
[2024-05-31 01:18:15] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-31 01:18:15] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 15 ms returned unsat
[2024-05-31 01:18:15] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 01:18:15] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 3, 5, 1, 132, 4, 1, 1, 3, 1, 1, 2, 1] Max seen :[1, 1, 3, 5, 1, 3, 4, 1, 1, 3, 1, 1, 2, 1]
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 550 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 496 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 112 place count 496 transition count 1258
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 232 place count 436 transition count 1258
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 352 place count 376 transition count 1198
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 364 place count 376 transition count 1186
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 376 place count 364 transition count 1186
Applied a total of 376 rules in 292 ms. Remains 364 /554 variables (removed 190) and now considering 1186/1372 (removed 186) transitions.
[2024-05-31 01:18:15] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
// Phase 1: matrix 1162 rows 364 cols
[2024-05-31 01:18:15] [INFO ] Computed 46 invariants in 28 ms
[2024-05-31 01:18:16] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 324 transitions.
Found 324 dead transitions using SMT.
Drop transitions removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 364/554 places, 862/1372 transitions.
Applied a total of 0 rules in 28 ms. Remains 364 /364 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1051 ms. Remains : 364/554 places, 862/1372 transitions.
Normalized transition count is 838 out of 862 initially.
// Phase 1: matrix 838 rows 364 cols
[2024-05-31 01:18:16] [INFO ] Computed 46 invariants in 16 ms
Incomplete random walk after 1000000 steps, including 153 resets, run finished after 4639 ms. (steps per millisecond=215 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1075 resets, run finished after 2516 ms. (steps per millisecond=397 ) properties (out of 1) seen :3
[2024-05-31 01:18:23] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 364 cols
[2024-05-31 01:18:23] [INFO ] Computed 46 invariants in 36 ms
[2024-05-31 01:18:23] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 01:18:23] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 22 ms returned sat
[2024-05-31 01:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:24] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2024-05-31 01:18:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:18:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 01:18:24] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-31 01:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:26] [INFO ] [Nat]Absence check using state equation in 1760 ms returned sat
[2024-05-31 01:18:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:18:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 896 ms returned sat
[2024-05-31 01:18:27] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 1 ms to minimize.
[2024-05-31 01:18:28] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 2 ms to minimize.
[2024-05-31 01:18:28] [INFO ] Deduced a trap composed of 118 places in 230 ms of which 1 ms to minimize.
[2024-05-31 01:18:29] [INFO ] Deduced a trap composed of 113 places in 230 ms of which 1 ms to minimize.
[2024-05-31 01:18:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1916 ms
Current structural bounds on expressions (after SMT) : [3] Max seen :[3]
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 30407 ms.

BK_STOP 1717118309661

--------------------
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="PolyORBLF-PT-S04J04T06"
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 PolyORBLF-PT-S04J04T06, 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 r307-tajo-171654460600166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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