fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857300502
Last Updated
May 14, 2023

About the Execution of Marcie+red for FlexibleBarrier-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9593.392 3600000.00 3635172.00 8102.50 TTFTTFFFTTFFTTFF normal

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.r170-tall-167838857300502.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 FlexibleBarrier-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 374K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678557409952

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 17:56:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 17:56:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 17:56:51] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-11 17:56:51] [INFO ] Transformed 1402 places.
[2023-03-11 17:56:51] [INFO ] Transformed 1613 transitions.
[2023-03-11 17:56:51] [INFO ] Found NUPN structural information;
[2023-03-11 17:56:51] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 132 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 10) seen :2
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1613 rows 1402 cols
[2023-03-11 17:56:52] [INFO ] Computed 12 place invariants in 63 ms
[2023-03-11 17:56:53] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2023-03-11 17:56:53] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 17:56:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2023-03-11 17:56:54] [INFO ] After 993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 17:56:55] [INFO ] Deduced a trap composed of 62 places in 396 ms of which 6 ms to minimize.
[2023-03-11 17:56:55] [INFO ] Deduced a trap composed of 478 places in 318 ms of which 1 ms to minimize.
[2023-03-11 17:56:55] [INFO ] Deduced a trap composed of 443 places in 290 ms of which 1 ms to minimize.
[2023-03-11 17:56:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1225 ms
[2023-03-11 17:56:56] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 1 ms to minimize.
[2023-03-11 17:56:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2023-03-11 17:56:57] [INFO ] Deduced a trap composed of 481 places in 426 ms of which 1 ms to minimize.
[2023-03-11 17:56:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2023-03-11 17:56:57] [INFO ] After 3807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 433 ms.
[2023-03-11 17:56:58] [INFO ] After 4865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 88 ms.
Support contains 6 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1361 edges and 1402 vertex of which 62 / 1402 are part of one of the 10 SCC in 6 ms
Free SCC test removed 52 places
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 356 place count 1350 transition count 1195
Reduce places removed 355 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 995 transition count 1194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 713 place count 994 transition count 1194
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 713 place count 994 transition count 1107
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 887 place count 907 transition count 1107
Discarding 507 places :
Symmetric choice reduction at 3 with 507 rule applications. Total rules 1394 place count 400 transition count 600
Iterating global reduction 3 with 507 rules applied. Total rules applied 1901 place count 400 transition count 600
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1901 place count 400 transition count 591
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1919 place count 391 transition count 591
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 1998 place count 312 transition count 512
Iterating global reduction 3 with 79 rules applied. Total rules applied 2077 place count 312 transition count 512
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 2154 place count 312 transition count 435
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 2262 place count 258 transition count 381
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2282 place count 258 transition count 361
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2292 place count 248 transition count 351
Iterating global reduction 5 with 10 rules applied. Total rules applied 2302 place count 248 transition count 351
Free-agglomeration rule applied 186 times.
Iterating global reduction 5 with 186 rules applied. Total rules applied 2488 place count 248 transition count 165
Reduce places removed 186 places and 0 transitions.
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 166 edges and 62 vertex of which 52 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 267 rules applied. Total rules applied 2755 place count 52 transition count 85
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 2769 place count 52 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2770 place count 51 transition count 70
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 40 edges and 50 vertex of which 16 / 50 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 2772 place count 42 transition count 70
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 2788 place count 42 transition count 54
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 2788 place count 42 transition count 46
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 2804 place count 34 transition count 46
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 2812 place count 34 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 2828 place count 26 transition count 30
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2836 place count 26 transition count 22
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 2857 place count 13 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2858 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2859 place count 12 transition count 13
Applied a total of 2859 rules in 226 ms. Remains 12 /1402 variables (removed 1390) and now considering 13/1613 (removed 1600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 12/1402 places, 13/1613 transitions.
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=12 )
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7034 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FlexibleBarrier_PT_10b
(NrP: 1402 NrTr: 1613 NrArc: 4025)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.142sec

net check time: 0m 0.000sec

init dd package: 0m 2.688sec


before gc: list nodes free: 1389336

after gc: idd nodes used:1391123, unused:62608877; list nodes free:260416816

before gc: list nodes free: 1912259

after gc: idd nodes used:2500403, unused:61499597; list nodes free:255855150
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6556308 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102956 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.009sec

1532519 2061157 2033382 2375523 2352297 2546407

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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="ReachabilityCardinality"
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 FlexibleBarrier-PT-10b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857300502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10b.tgz
mv FlexibleBarrier-PT-10b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;