Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017000677.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-PT-S04J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017000677
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 21K Apr 29 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 29 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 29 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 310K Apr 29 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 18K May 9 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 9 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K May 9 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.3M May 10 09:34 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-S04J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652913419176

Running Version 202205111006
[2022-05-18 22:37:00] [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-18 22:37:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 22:37:00] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2022-05-18 22:37:00] [INFO ] Transformed 966 places.
[2022-05-18 22:37:00] [INFO ] Transformed 5354 transitions.
[2022-05-18 22:37:00] [INFO ] Parsed PT model containing 966 places and 5354 transitions in 470 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Normalized transition count is 2604 out of 2644 initially.
// Phase 1: matrix 2604 rows 966 cols
[2022-05-18 22:37:01] [INFO ] Computed 62 place invariants in 197 ms
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :40
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :40
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :39
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :39
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :39
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :39
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :40
[2022-05-18 22:37:01] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2022-05-18 22:37:01] [INFO ] Computed 62 place invariants in 98 ms
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 16 ms returned unsat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 34 ms returned unsat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 46 ms returned unsat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 41 ms returned unsat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 32 ms returned unsat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-05-18 22:37:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 43 ms returned sat
[2022-05-18 22:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:37:06] [INFO ] [Real]Absence check using state equation in 3134 ms returned sat
[2022-05-18 22:37:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:37:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2022-05-18 22:37:06] [INFO ] [Nat]Absence check using 16 positive and 46 generalized place invariants in 43 ms returned sat
[2022-05-18 22:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:37:11] [INFO ] [Nat]Absence check using state equation in 4864 ms returned unknown
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 35 ms returned unsat
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 20 ms returned unsat
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 34 ms returned unsat
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 38 ms returned unsat
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2022-05-18 22:37:11] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 34 ms returned unsat
[2022-05-18 22:37:12] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2022-05-18 22:37:12] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 38 ms returned unsat
[2022-05-18 22:37:12] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2022-05-18 22:37:12] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 46 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 1, 2, 4, -1, 1, 10, 1, 1, 1, 1, 1] Max seen :[4, 4, 1, 2, 4, 9, 1, 10, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 966 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 962 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 872 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 184 place count 872 transition count 2434
Deduced a syphon composed of 120 places in 4 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 424 place count 752 transition count 2434
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 604 place count 662 transition count 2344
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 624 place count 662 transition count 2324
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 644 place count 642 transition count 2324
Applied a total of 644 rules in 445 ms. Remains 642 /966 variables (removed 324) and now considering 2324/2644 (removed 320) transitions.
[2022-05-18 22:37:12] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 642 cols
[2022-05-18 22:37:12] [INFO ] Computed 58 place invariants in 49 ms
[2022-05-18 22:37:14] [INFO ] Dead Transitions using invariants and state equation in 1882 ms found 540 transitions.
Found 540 dead transitions using SMT.
Drop transitions removed 540 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 540 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 642/966 places, 1784/2644 transitions.
Applied a total of 0 rules in 60 ms. Remains 642 /642 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 642/966 places, 1784/2644 transitions.
Normalized transition count is 1744 out of 1784 initially.
// Phase 1: matrix 1744 rows 642 cols
[2022-05-18 22:37:14] [INFO ] Computed 58 place invariants in 38 ms
Incomplete random walk after 1000000 steps, including 66 resets, run finished after 7179 ms. (steps per millisecond=139 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2467 ms. (steps per millisecond=405 ) properties (out of 1) seen :9
[2022-05-18 22:37:24] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
// Phase 1: matrix 1744 rows 642 cols
[2022-05-18 22:37:24] [INFO ] Computed 58 place invariants in 36 ms
[2022-05-18 22:37:24] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-18 22:37:24] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 25 ms returned sat
[2022-05-18 22:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:37:27] [INFO ] [Real]Absence check using state equation in 3128 ms returned sat
[2022-05-18 22:37:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:37:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-18 22:37:27] [INFO ] [Nat]Absence check using 17 positive and 41 generalized place invariants in 29 ms returned sat
[2022-05-18 22:37:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:37:29] [INFO ] [Nat]Absence check using state equation in 1211 ms returned sat
[2022-05-18 22:37:29] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-05-18 22:37:31] [INFO ] [Nat]Added 200 Read/Feed constraints in 2011 ms returned sat
[2022-05-18 22:37:31] [INFO ] Deduced a trap composed of 42 places in 335 ms of which 4 ms to minimize.
[2022-05-18 22:37:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 401 ms
Current structural bounds on expressions (after SMT) : [9] Max seen :[9]
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-07 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31207 ms.

BK_STOP 1652913451577

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-S04J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-PT-S04J06T10, 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 r168-tall-165277017000677"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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