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 Philosophers-COL-000200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r089kn-ebro-146369093600250
=====================================================================

--------------------
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-000200-ReachabilityCardinality-0
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-1
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-10
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-11
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-12
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-13
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-14
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-15
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-2
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-3
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-4
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-5
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-6
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-7
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-8
FORMULA_NAME Philosophers-COL-000200-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1464107899624


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Unfolding complete |P|=1000|T|=1000|A|=3200
Time for unfolding: 0m 0.881sec

Net: Philosophers_COL_000200
(NrP: 1000 NrTr: 1000 NrArc: 3200)

net check time: 0m 0.000sec

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

init dd package: 0m 7.017sec


RS generation: 0m 3.504sec


-> reachability set: #nodes 5180 (5.2e+03) #states 265,613,988,875,874,769,338,781,322,035,779,626,829,233,452,653,394,495,974,574,961,739,092,490,901,302,182,994,384,699,044,001 (95)



starting MCC model checker
--------------------------

checking: AG [~ [~ [3<=sum(fork_Id99, fork_Id98, fork_Id97, fork_Id96, fork_Id95, fork_Id94, fork_Id93, fork_Id92, fork_Id91, fork_Id90, fork_Id9, fork_Id89, fork_Id88, fork_Id87, fork_Id86, fork_Id85, fork_Id84, fork_Id83, fork_Id82, fork_Id81, fork_Id80, fork_Id8, fork_Id79, fork_Id78, fork_Id77, fork_Id76, fork_Id75, fork_Id74, fork_Id73, fork_Id72, fork_Id71, fork_Id70, fork_Id7, fork_Id69, fork_Id68, fork_Id67, fork_Id66, fork_Id65, fork_Id64, fork_Id63, fork_Id62, fork_Id61, fork_Id60, fork_Id6, fork_Id59, fork_Id58, fork_Id57, fork_Id56, fork_Id55, fork_Id54, fork_Id53, fork_Id52, fork_Id51, fork_Id50, fork_Id5, fork_Id49, fork_Id48, fork_Id47, fork_Id46, fork_Id45, fork_Id44, fork_Id43, fork_Id42, fork_Id41, fork_Id40, fork_Id4, fork_Id39, fork_Id38, fork_Id37, fork_Id36, fork_Id35, fork_Id34, fork_Id33, fork_Id32, fork_Id31, fork_Id30, fork_Id3, fork_Id29, fork_Id28, fork_Id27, fork_Id26, fork_Id25, fork_Id24, fork_Id23, fork_Id22, fork_Id21, fork_Id200, fork_Id20, fork_Id2, fork_Id199, fork_Id198, fork_Id197, fork_Id196, fork_Id195, fork_Id194, fork_Id193, fork_Id192, fork_Id191, fork_Id190, fork_Id19, fork_Id189, fork_Id188, fork_Id187, fork_Id186, fork_Id185, fork_Id184, fork_Id183, fork_Id182, fork_Id181, fork_Id180, fork_Id18, fork_Id179, fork_Id178, fork_Id177, fork_Id176, fork_Id175, fork_Id174, fork_Id173, fork_Id172, fork_Id171, fork_Id170, fork_Id17, fork_Id169, fork_Id168, fork_Id167, fork_Id166, fork_Id165, fork_Id164, fork_Id163, fork_Id162, fork_Id161, fork_Id160, fork_Id16, fork_Id159, fork_Id158, fork_Id157, fork_Id156, fork_Id155, fork_Id154, fork_Id153, fork_Id152, fork_Id151, fork_Id150, fork_Id15, fork_Id149, fork_Id148, fork_Id147, fork_Id146, fork_Id145, fork_Id144, fork_Id143, fork_Id142, fork_Id141, fork_Id140, fork_Id14, fork_Id139, fork_Id138, fork_Id137, fork_Id136, fork_Id135, fork_Id134, fork_Id133, fork_Id132, fork_Id131, fork_Id130, fork_Id13, fork_Id129, fork_Id128, fork_Id127, fork_Id126, fork_Id125, fork_Id124, fork_Id123, fork_Id122, fork_Id121, fork_Id120, fork_Id12, fork_Id119, fork_Id118, fork_Id117, fork_Id116, fork_Id115, fork_Id114, fork_Id113, fork_Id112, fork_Id111, fork_Id110, fork_Id11, fork_Id109, fork_Id108, fork_Id107, fork_Id106, fork_Id105, fork_Id104, fork_Id103, fork_Id102, fork_Id101, fork_Id100, fork_Id10, fork_Id1)]]]
normalized: ~ [E [true U ~ [3<=sum(fork_Id99, fork_Id98, fork_Id97, fork_Id96, fork_Id95, fork_Id94, fork_Id93, fork_Id92, fork_Id91, fork_Id90, fork_Id9, fork_Id89, fork_Id88, fork_Id87, fork_Id86, fork_Id85, fork_Id84, fork_Id83, fork_Id82, fork_Id81, fork_Id80, fork_Id8, fork_Id79, fork_Id78, fork_Id77, fork_Id76, fork_Id75, fork_Id74, fork_Id73, fork_Id72, fork_Id71, fork_Id70, fork_Id7, fork_Id69, fork_Id68, fork_Id67, fork_Id66, fork_Id65, fork_Id64, fork_Id63, fork_Id62, fork_Id61, fork_Id60, fork_Id6, fork_Id59, fork_Id58, fork_Id57, fork_Id56, fork_Id55, fork_Id54, fork_Id53, fork_Id52, fork_Id51, fork_Id50, fork_Id5, fork_Id49, fork_Id48, fork_Id47, fork_Id46, fork_Id45, fork_Id44, fork_Id43, fork_Id42, fork_Id41, fork_Id40, fork_Id4, fork_Id39, fork_Id38, fork_Id37, fork_Id36, fork_Id35, fork_Id34, fork_Id33, fork_Id32, fork_Id31, fork_Id30, fork_Id3, fork_Id29, fork_Id28, fork_Id27, fork_Id26, fork_Id25, fork_Id24, fork_Id23, fork_Id22, fork_Id21, fork_Id200, fork_Id20, fork_Id2, fork_Id199, fork_Id198, fork_Id197, fork_Id196, fork_Id195, fork_Id194, fork_Id193, fork_Id192, fork_Id191, fork_Id190, fork_Id19, fork_Id189, fork_Id188, fork_Id187, fork_Id186, fork_Id185, fork_Id184, fork_Id183, fork_Id182, fork_Id181, fork_Id180, fork_Id18, fork_Id179, fork_Id178, fork_Id177, fork_Id176, fork_Id175, fork_Id174, fork_Id173, fork_Id172, fork_Id171, fork_Id170, fork_Id17, fork_Id169, fork_Id168, fork_Id167, fork_Id166, fork_Id165, fork_Id164, fork_Id163, fork_Id162, fork_Id161, fork_Id160, fork_Id16, fork_Id159, fork_Id158, fork_Id157, fork_Id156, fork_Id155, fork_Id154, fork_Id153, fork_Id152, fork_Id151, fork_Id150, fork_Id15, fork_Id149, fork_Id148, fork_Id147, fork_Id146, fork_Id145, fork_Id144, fork_Id143, fork_Id142, fork_Id141, fork
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.016sec

1452 1896 2341 5171 5180
iterations count:5583 (5), effective:600 (0)

initing FirstDep: 0m 0.012sec

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="Philosophers-COL-000200"
export BK_EXAMINATION="ReachabilityCardinality"
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/Philosophers-COL-000200.tgz
mv Philosophers-COL-000200 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 Philosophers-COL-000200, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r089kn-ebro-146369093600250"
echo "====================================================================="
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
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 ;