About the Execution of Marcie for S_Philosophers-COL-000020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5472.710 | 3600000.00 | 3600311.00 | 20.00 | ????????FT?????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-2979
Executing tool marcie
Input is S_Philosophers-COL-000020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r173kn-ebro-146433146500759
=====================================================================
--------------------
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 Philosophers-COL-000020-CTLCardinality-0
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-1
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-10
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-11
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-12
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-13
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-14
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-15
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-3
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-4
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-5
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-6
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-7
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-8
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464808684021
Marcie rev. 8535M (built: crohr on 2016-04-27)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Unfolding complete |P|=100|T|=100|A|=320
Time for unfolding: 0m 0.970sec
Net: Philosophers_COL_000020
(NrP: 100 NrTr: 100 NrArc: 320)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
init dd package: 0m 7.147sec
RS generation: 0m 0.033sec
-> reachability set: #nodes 500 (5.0e+02) #states 3,486,784,401 (9)
starting MCC model checker
--------------------------
checking: AF [~ [[~ [1<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id20, catch2_Id2, catch2_Id19, catch2_Id18, catch2_Id17, catch2_Id16, catch2_Id15, catch2_Id14, catch2_Id13, catch2_Id12, catch2_Id11, catch2_Id10, catch2_Id1)] | 1<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id20, eat_Id2, eat_Id19, eat_Id18, eat_Id17, eat_Id16, eat_Id15, eat_Id14, eat_Id13, eat_Id12, eat_Id11, eat_Id10, eat_Id1)]]]
normalized: ~ [EG [[1<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id20, eat_Id2, eat_Id19, eat_Id18, eat_Id17, eat_Id16, eat_Id15, eat_Id14, eat_Id13, eat_Id12, eat_Id11, eat_Id10, eat_Id1) | ~ [1<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id20, catch2_Id2, catch2_Id19, catch2_Id18, catch2_Id17, catch2_Id16, catch2_Id15, catch2_Id14, catch2_Id13, catch2_Id12, catch2_Id11, catch2_Id10, catch2_Id1)]]]]
abstracting: (1<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id20, catch2_Id2, catch2_Id19, catch2_Id18, catch2_Id17, catch2_Id16, catch2_Id15, catch2_Id14, catch2_Id13, catch2_Id12, catch2_Id11, catch2_Id10, catch2_Id1)) states: 3,441,545,327 (9)
abstracting: (1<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id20, eat_Id2, eat_Id19, eat_Id18, eat_Id17, eat_Id16, eat_Id15, eat_Id14, eat_Id13, eat_Id12, eat_Id11, eat_Id10, eat_Id1)) states: 3,257,958,274 (9)
...
EG iterations: 3
-> the formula is FALSE
FORMULA Philosophers-COL-000020-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.549sec
checking: EG [[3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id20, fork_Id2, fork_Id19, fork_Id18, fork_Id17, fork_Id16, fork_Id15, fork_Id14, fork_Id13, fork_Id12, fork_Id11, fork_Id10, fork_Id1) | EF [1<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id20, catch2_Id2, catch2_Id19, catch2_Id18, catch2_Id17, catch2_Id16, catch2_Id15, catch2_Id14, catch2_Id13, catch2_Id12, catch2_Id11, catch2_Id10, catch2_Id1)]]]
normalized: EG [[3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id20, fork_Id2, fork_Id19, fork_Id18, fork_Id17, fork_Id16, fork_Id15, fork_Id14, fork_Id13, fork_Id12, fork_Id11, fork_Id10, fork_Id1) | E [true U 1<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id20, catch2_Id2, catch2_Id19, catch2_Id18, catch2_Id17, catch2_Id16, catch2_Id15, catch2_Id14, catch2_Id13, catch2_Id12, catch2_Id11, catch2_Id10, catch2_Id1)]]]
abstracting: (1<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id20, catch2_Id2, catch2_Id19, catch2_Id18, catch2_Id17, catch2_Id16, catch2_Id15, catch2_Id14, catch2_Id13, catch2_Id12, catch2_Id11, catch2_Id10, catch2_Id1)) states: 3,441,545,327 (9)
abstracting: (3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id20, fork_Id2, fork_Id19, fork_Id18, fork_Id17, fork_Id16, fork_Id15, fork_Id14, fork_Id13, fork_Id12, fork_Id11, fork_Id10, fork_Id1)) states: 3,425,442,705 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Philosophers-COL-000020-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.376sec
checking: EG [E [1<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id20, think_Id2, think_Id19, think_Id18, think_Id17, think_Id16, think_Id15, think_Id14, think_Id13, think_Id12, think_Id11, think_Id10, think_Id1) U 1<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id20, eat_Id2, eat_Id19, eat_Id18, eat_Id17, eat_Id16, eat_Id15, eat_Id14, eat_Id13, eat_Id12, eat_Id11, eat_Id10, eat_Id1)]]
normalized: EG [E [1<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id20, think_Id2, think_Id19, think_Id18, think_Id17, think_Id16, think_Id15, think_Id14, think_Id13, think_Id12, think_Id11, think_Id10, think_Id1) U 1<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id20, eat_Id2, eat_Id19, eat_Id18, eat_Id17, eat_Id16, eat_Id15, eat_Id14, eat_Id13, eat_Id12, eat_Id11, eat_Id10, eat_Id1)]]
abstracting: (1<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id20, eat_Id2, eat_Id19, eat_Id18, eat_Id17, eat_Id16, eat_Id15, eat_Id14, eat_Id13, eat_Id12, eat_Id11, eat_Id10, eat_Id1)) states: 3,257,958,274 (9)
abstracting: (1<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id20, think_Id2, think_Id19, think_Id18, think_Id17, think_Id16, think_Id15, think_Id14, think_Id13, think_Id12, think_Id11, think_Id10, think_Id1)) states: 3,486,784,399 (9)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
check for maximal unmarked siphon
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.000sec
iterations count:543 (5), effective:60 (0)
initing FirstDep: 0m 0.000sec
iterations count:477 (4), effective:41 (0)
iterations count:447 (4), effective:59 (0)
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="S_Philosophers-COL-000020"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/S_Philosophers-COL-000020.tgz
mv S_Philosophers-COL-000020 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_Philosophers-COL-000020, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r173kn-ebro-146433146500759"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
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 ;