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.r263-tall-171654371900026.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 MultiCrashLeafsetExtension-PT-S16C07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654371900026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 12 06:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 06:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.7M 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 MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716627887084

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=MultiCrashLeafsetExtension-PT-S16C07
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 09:04:48] [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-25 09:04:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:04:48] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2024-05-25 09:04:48] [INFO ] Transformed 6222 places.
[2024-05-25 09:04:49] [INFO ] Transformed 8685 transitions.
[2024-05-25 09:04:49] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 8413 out of 8685 initially.
// Phase 1: matrix 8413 rows 6222 cols
[2024-05-25 09:04:49] [INFO ] Computed 611 invariants in 442 ms
Incomplete random walk after 10000 steps, including 138 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :2
[2024-05-25 09:04:50] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2024-05-25 09:04:50] [INFO ] Computed 611 invariants in 271 ms
[2024-05-25 09:04:51] [INFO ] [Real]Absence check using 52 positive place invariants in 86 ms returned sat
[2024-05-25 09:04:51] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 142 ms returned unsat
[2024-05-25 09:04:52] [INFO ] [Real]Absence check using 52 positive place invariants in 100 ms returned sat
[2024-05-25 09:04:52] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 169 ms returned unsat
[2024-05-25 09:04:53] [INFO ] [Real]Absence check using 52 positive place invariants in 69 ms returned sat
[2024-05-25 09:04:53] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 236 ms returned sat
[2024-05-25 09:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:04:57] [INFO ] [Real]Absence check using state equation in 4159 ms returned unknown
[2024-05-25 09:04:58] [INFO ] [Real]Absence check using 52 positive place invariants in 77 ms returned sat
[2024-05-25 09:04:58] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 252 ms returned sat
[2024-05-25 09:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:05:02] [INFO ] [Real]Absence check using state equation in 4053 ms returned unknown
[2024-05-25 09:05:03] [INFO ] [Real]Absence check using 52 positive place invariants in 69 ms returned sat
[2024-05-25 09:05:03] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 132 ms returned unsat
[2024-05-25 09:05:04] [INFO ] [Real]Absence check using 52 positive place invariants in 73 ms returned sat
[2024-05-25 09:05:04] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 246 ms returned sat
[2024-05-25 09:05:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:05:08] [INFO ] [Real]Absence check using state equation in 4146 ms returned unknown
[2024-05-25 09:05:09] [INFO ] [Real]Absence check using 52 positive place invariants in 69 ms returned sat
[2024-05-25 09:05:09] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 165 ms returned unsat
[2024-05-25 09:05:09] [INFO ] [Real]Absence check using 52 positive place invariants in 73 ms returned sat
[2024-05-25 09:05:10] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 138 ms returned unsat
[2024-05-25 09:05:10] [INFO ] [Real]Absence check using 52 positive place invariants in 70 ms returned sat
[2024-05-25 09:05:10] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 135 ms returned unsat
[2024-05-25 09:05:11] [INFO ] [Real]Absence check using 52 positive place invariants in 70 ms returned sat
[2024-05-25 09:05:11] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 138 ms returned unsat
[2024-05-25 09:05:12] [INFO ] [Real]Absence check using 52 positive place invariants in 70 ms returned sat
[2024-05-25 09:05:12] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 130 ms returned unsat
[2024-05-25 09:05:12] [INFO ] [Real]Absence check using 52 positive place invariants in 73 ms returned sat
[2024-05-25 09:05:13] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 133 ms returned unsat
[2024-05-25 09:05:13] [INFO ] [Real]Absence check using 52 positive place invariants in 70 ms returned sat
[2024-05-25 09:05:13] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 129 ms returned unsat
[2024-05-25 09:05:14] [INFO ] [Real]Absence check using 52 positive place invariants in 79 ms returned sat
[2024-05-25 09:05:14] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 238 ms returned sat
[2024-05-25 09:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:05:18] [INFO ] [Real]Absence check using state equation in 4151 ms returned unknown
[2024-05-25 09:05:19] [INFO ] [Real]Absence check using 52 positive place invariants in 68 ms returned sat
[2024-05-25 09:05:19] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 140 ms returned unsat
[2024-05-25 09:05:20] [INFO ] [Real]Absence check using 52 positive place invariants in 69 ms returned sat
[2024-05-25 09:05:20] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 130 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 17, 1, 1, 51, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1] Max seen :[1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.23 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions removed 1902 transitions
Trivial Post-agglo rules discarded 1902 transitions
Performed 1902 trivial Post agglomeration. Transition count delta: 1902
Iterating post reduction 0 with 1902 rules applied. Total rules applied 1903 place count 6188 transition count 6783
Reduce places removed 1902 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1903 rules applied. Total rules applied 3806 place count 4286 transition count 6782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3807 place count 4285 transition count 6782
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 3807 place count 4285 transition count 6544
Deduced a syphon composed of 238 places in 5 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 4283 place count 4047 transition count 6544
Discarding 1664 places :
Symmetric choice reduction at 3 with 1664 rule applications. Total rules 5947 place count 2383 transition count 4880
Iterating global reduction 3 with 1664 rules applied. Total rules applied 7611 place count 2383 transition count 4880
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 7611 place count 2383 transition count 4867
Deduced a syphon composed of 13 places in 7 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 7637 place count 2370 transition count 4867
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 7873 place count 2134 transition count 3215
Iterating global reduction 3 with 236 rules applied. Total rules applied 8109 place count 2134 transition count 3215
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 8143 place count 2117 transition count 3198
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 3 with 162 rules applied. Total rules applied 8305 place count 2117 transition count 4452
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 8467 place count 1955 transition count 4452
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 8484 place count 1955 transition count 4452
Applied a total of 8484 rules in 2869 ms. Remains 1955 /6222 variables (removed 4267) and now considering 4452/8685 (removed 4233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2870 ms. Remains : 1955/6222 places, 4452/8685 transitions.
Normalized transition count is 4054 out of 4452 initially.
// Phase 1: matrix 4054 rows 1955 cols
[2024-05-25 09:05:23] [INFO ] Computed 577 invariants in 85 ms
Incomplete random walk after 1000000 steps, including 22913 resets, run finished after 19261 ms. (steps per millisecond=51 ) properties (out of 4) seen :4
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 4298 resets, run finished after 4222 ms. (steps per millisecond=236 ) properties (out of 1) seen :1
[2024-05-25 09:05:46] [INFO ] Flow matrix only has 4054 transitions (discarded 398 similar events)
// Phase 1: matrix 4054 rows 1955 cols
[2024-05-25 09:05:46] [INFO ] Computed 577 invariants in 70 ms
[2024-05-25 09:05:47] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-25 09:05:47] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 29 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 58719 ms.

BK_STOP 1716627948287

--------------------
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="MultiCrashLeafsetExtension-PT-S16C07"
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 MultiCrashLeafsetExtension-PT-S16C07, 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 r263-tall-171654371900026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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