Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r074-smll-167814399700029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CSRepetitions-COL-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399700029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Feb 25 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15K Mar 5 18:22 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 CSRepetitions-COL-05-UpperBounds-00
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-01
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-02
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-03
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-04
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-05
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-06
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-07
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-08
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-09
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-10
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-11
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-12
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-13
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-14
FORMULA_NAME CSRepetitions-COL-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678233562474

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-07 23:59:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-07 23:59:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 23:59:25] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-07 23:59:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 23:59:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 905 ms
[2023-03-07 23:59:26] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 206 PT places and 325.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
[2023-03-07 23:59:26] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 7 ms.
[2023-03-07 23:59:26] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 6 cols
[2023-03-07 23:59:26] [INFO ] Computed 2 place invariants in 4 ms
FORMULA CSRepetitions-COL-05-UpperBounds-11 25 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA CSRepetitions-COL-05-UpperBounds-10 25 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA CSRepetitions-COL-05-UpperBounds-06 25 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA CSRepetitions-COL-05-UpperBounds-02 25 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA CSRepetitions-COL-05-UpperBounds-00 25 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-07 23:59:26] [INFO ] Invariant cache hit.
[2023-03-07 23:59:26] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-07 23:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-07 23:59:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:59:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 23:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:26] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-07 23:59:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 23:59:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-07 23:59:26] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-07 23:59:26] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-07 23:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-07 23:59:27] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-07 23:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-07 23:59:27] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-07 23:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-07 23:59:27] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-07 23:59:27] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-07 23:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-07 23:59:27] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-07 23:59:27] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-07 23:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-07 23:59:27] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-07 23:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-07 23:59:27] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-07 23:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-07 23:59:27] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-07 23:59:27] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [25, 5, 5, -1, 5, 5, 5, -1, 25, -1, -1]
FORMULA CSRepetitions-COL-05-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA CSRepetitions-COL-05-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA CSRepetitions-COL-05-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 5
[2023-03-07 23:59:27] [INFO ] Unfolded HLPN to a Petri net with 102 places and 125 transitions 375 arcs in 16 ms.
[2023-03-07 23:59:27] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 197 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :80
FORMULA CSRepetitions-COL-05-UpperBounds-13 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-COL-05-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-COL-05-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-COL-05-UpperBounds-01 25 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :20
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :20
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :20
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :20
// Phase 1: matrix 125 rows 102 cols
[2023-03-07 23:59:27] [INFO ] Computed 26 place invariants in 13 ms
[2023-03-07 23:59:27] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2023-03-07 23:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:28] [INFO ] [Real]Absence check using state equation in 73 ms returned unsat
[2023-03-07 23:59:28] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2023-03-07 23:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:28] [INFO ] [Real]Absence check using state equation in 65 ms returned unsat
[2023-03-07 23:59:28] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2023-03-07 23:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:28] [INFO ] [Real]Absence check using state equation in 58 ms returned unsat
[2023-03-07 23:59:28] [INFO ] [Real]Absence check using 26 positive place invariants in 12 ms returned sat
[2023-03-07 23:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:59:28] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5] Max seen :[5, 5, 5, 5]
FORMULA CSRepetitions-COL-05-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-COL-05-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-COL-05-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-COL-05-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2951 ms.
ITS solved all properties within timeout

BK_STOP 1678233569724

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="CSRepetitions-COL-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is CSRepetitions-COL-05, 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 r074-smll-167814399700029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-05.tgz
mv CSRepetitions-COL-05 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 ;