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-2265
Executing tool marcie
Input is NeoElection-COL-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236504100821
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432549647466

Model: NeoElection-COL-3
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

Unfolding complete |P|=384|T|=1048|A|=6000
Time for unfolding: 0m0sec

(NrP: 384 NrTr: 1048 NrArc: 6000)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m6sec


-> reachability set: #nodes 21040 (2.1e+04) #states 974,325 (5)



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

checking: E [~ [[P_masterList<=P_poll__handlingMessage & P_stage<=P_polling]] U ~ [dead<=P_masterState]]
normalized: E [~ [[P_masterList<=P_poll__handlingMessage & P_stage<=P_polling]] U ~ [dead<=P_masterState]]

abstracting: (dead<=P_masterState) states: 0
abstracting: (P_stage<=P_polling) states: 0
abstracting: (P_masterList<=P_poll__handlingMessage) states: 0
-> the formula is TRUE

FORMULA NeoElection-COL-3-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m14sec

checking: ~ [~ [EF [[3<=P_crashed & 1<=P_negotiation]]]]
normalized: E [true U [3<=P_crashed & 1<=P_negotiation]]


FORMULA NeoElection-COL-3-CTLCardinality-1CANNOT_COMPUTE

MC time: 0m0sec

checking: [[[~ [P_stage<=P_masterList] & AX [dead<=P_electionInit]] | [AG [2<=P_stage] | AG [2<=P_poll__pollEnd]]] & [EX [[P_poll__handlingMessage<=P_startNeg__broadcasting & P_polling<=P_polling]] & EG [[P_startNeg__broadcasting<=P_masterList | 2<=P_polling]]]]
normalized: [[[~ [E [true U ~ [2<=P_poll__pollEnd]]] | ~ [E [true U ~ [2<=P_stage]]]] | [~ [EX [~ [dead<=P_electionInit]]] & ~ [P_stage<=P_masterList]]] & [EG [[P_startNeg__broadcasting<=P_masterList | 2<=P_polling]] & EX [[P_poll__handlingMessage<=P_startNeg__broadcasting & P_polling<=P_polling]]]]

abstracting: (P_polling<=P_polling) states: 0
abstracting: (P_poll__handlingMessage<=P_startNeg__broadcasting) states: 0
.
FORMULA NeoElection-COL-3-CTLCardinality-2CANNOT_COMPUTE

MC time: 1m26sec

checking: A [[P_electionFailed<=P_electionFailed | [P_electionInit<=P_polling | 2<=P_startNeg__broadcasting]] U ~ [1<=P_masterList]]
normalized: [~ [EG [1<=P_masterList]] & ~ [E [~ [[P_electionFailed<=P_electionFailed | [P_electionInit<=P_polling | 2<=P_startNeg__broadcasting]]] U [1<=P_masterList & ~ [[P_electionFailed<=P_electionFailed | [P_electionInit<=P_polling | 2<=P_startNeg__broadcasting]]]]]]]


FORMULA NeoElection-COL-3-CTLCardinality-3CANNOT_COMPUTE

MC time: 0m0sec

checking: [EG [P_poll__networl<=P_electedSecondary] & E [1<=P_crashed U [P_stage<=P_poll__pollEnd | 2<=P_electionInit]]]
normalized: [E [1<=P_crashed U [P_stage<=P_poll__pollEnd | 2<=P_electionInit]] & EG [P_poll__networl<=P_electedSecondary]]

abstracting: (P_poll__networl<=P_electedSecondary) states: 0
.
EG iterations: 1

FORMULA NeoElection-COL-3-CTLCardinality-4CANNOT_COMPUTE

MC time: 0m41sec

checking: [E [[1<=P_electedSecondary | P_electedSecondary<=P_electionInit] U [P_stage<=P_startNeg__broadcasting & 3<=P_poll__waitingMessage]] & [[2<=P_electedSecondary | P_negotiation<=P_poll__networl] | A [dead<=P_electedPrimary U P_electedPrimary<=P_stage]]]
normalized: [[[~ [EG [~ [P_electedPrimary<=P_stage]]] & ~ [E [~ [dead<=P_electedPrimary] U [~ [P_electedPrimary<=P_stage] & ~ [dead<=P_electedPrimary]]]]] | [2<=P_electedSecondary | P_negotiation<=P_poll__networl]] & E [[1<=P_electedSecondary | P_electedSecondary<=P_electionInit] U [P_stage<=P_startNeg__broadcasting & 3<=P_poll__waitingMessage]]]


FORMULA NeoElection-COL-3-CTLCardinality-5CANNOT_COMPUTE

MC time: 0m0sec

checking: [[AF [[1<=dead & 2<=P_poll__handlingMessage]] | 3<=P_polling] & [~ [EG [P_electionInit<=P_crashed]] & EF [[3<=P_network & 1<=P_network]]]]
normalized: [[E [true U [3<=P_network & 1<=P_network]] & ~ [EG [P_electionInit<=P_crashed]]] & [3<=P_polling | ~ [EG [~ [[1<=dead & 2<=P_poll__handlingMessage]]]]]]


FORMULA NeoElection-COL-3-CTLCardinality-6CANNOT_COMPUTE

MC time: 0m0sec

checking: AX [[AG [P_electionInit<=P_stage] | AG [1<=P_crashed]]]
normalized: ~ [EX [~ [[~ [E [true U ~ [1<=P_crashed]]] | ~ [E [true U ~ [P_electionInit<=P_stage]]]]]]]

abstracting: (P_electionInit<=P_stage) states: 0

FORMULA NeoElection-COL-3-CTLCardinality-7CANNOT_COMPUTE

MC time: 0m39sec

checking: [A [3<=P_masterList U [P_sendAnnPs__broadcasting<=P_electedSecondary & P_stage<=P_startNeg__broadcasting]] | AG [P_masterState<=P_stage]]
normalized: [[~ [EG [~ [[P_sendAnnPs__broadcasting<=P_electedSecondary & P_stage<=P_startNeg__broadcasting]]]] & ~ [E [~ [3<=P_masterList] U [~ [3<=P_masterList] & ~ [[P_sendAnnPs__broadcasting<=P_electedSecondary & P_stage<=P_startNeg__broadcasting]]]]]] | ~ [E [true U ~ [P_masterState<=P_stage]]]]

abstracting: (P_masterState<=P_stage) states: 0
abstracting: (P_stage<=P_startNeg__broadcasting) states: 0
abstracting: (P_sendAnnPs__broadcasting<=P_electedSecondary) states: 0

FORMULA NeoElection-COL-3-CTLCardinality-8CANNOT_COMPUTE

MC time: 1m58sec

checking: EF [P_masterList<=P_startNeg__broadcasting]
normalized: E [true U P_masterList<=P_startNeg__broadcasting]

abstracting: (P_masterList<=P_startNeg__broadcasting) states: 0
-> the formula is FALSE

FORMULA NeoElection-COL-3-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39sec

checking: [[E [1<=P_stage U 3<=P_poll__handlingMessage] & ~ [~ [[1<=P_masterList & P_poll__pollEnd<=P_startNeg__broadcasting]]]] & EX [EG [P_electionFailed<=P_crashed]]]
normalized: [EX [EG [P_electionFailed<=P_crashed]] & [[1<=P_masterList & P_poll__pollEnd<=P_startNeg__broadcasting] & E [1<=P_stage U 3<=P_poll__handlingMessage]]]


FORMULA NeoElection-COL-3-CTLCardinality-10CANNOT_COMPUTE

MC time: 0m0sec

checking: ~ [[E [P_crashed<=P_masterState U P_electionFailed<=P_sendAnnPs__broadcasting] & AF [~ [2<=P_stage]]]]
normalized: ~ [[~ [EG [2<=P_stage]] & E [P_crashed<=P_masterState U P_electionFailed<=P_sendAnnPs__broadcasting]]]

abstracting: (P_electionFailed<=P_sendAnnPs__broadcasting) states: 0
abstracting: (P_crashed<=P_masterState) states: 0

FORMULA NeoElection-COL-3-CTLCardinality-11CANNOT_COMPUTE

MC time: 1m18sec

checking: [AG [[[3<=P_negotiation & 2<=P_startNeg__broadcasting] | P_electedPrimary<=P_stage]] | 2<=P_electedSecondary]
normalized: [2<=P_electedSecondary | ~ [E [true U ~ [[P_electedPrimary<=P_stage | [3<=P_negotiation & 2<=P_startNeg__broadcasting]]]]]]


FORMULA NeoElection-COL-3-CTLCardinality-12CANNOT_COMPUTE

MC time: 0m0sec

checking: AG [[[[1<=P_poll__waitingMessage & 1<=P_masterState] & [2<=P_poll__networl & 1<=P_masterList]] | [[1<=P_electedPrimary | P_poll__pollEnd<=P_poll__networl] | ~ [2<=dead]]]]
normalized: ~ [E [true U ~ [[[~ [2<=dead] | [1<=P_electedPrimary | P_poll__pollEnd<=P_poll__networl]] | [[2<=P_poll__networl & 1<=P_masterList] & [1<=P_poll__waitingMessage & 1<=P_masterState]]]]]]


FORMULA NeoElection-COL-3-CTLCardinality-13CANNOT_COMPUTE

MC time: 0m0sec

checking: A [~ [P_stage<=P_electedPrimary] U ~ [[P_startNeg__broadcasting<=P_poll__networl | P_poll__pollEnd<=P_electedSecondary]]]
normalized: [~ [EG [[P_startNeg__broadcasting<=P_poll__networl | P_poll__pollEnd<=P_electedSecondary]]] & ~ [E [P_stage<=P_electedPrimary U [P_stage<=P_electedPrimary & [P_startNeg__broadcasting<=P_poll__networl | P_poll__pollEnd<=P_electedSecondary]]]]]

abstracting: (P_poll__pollEnd<=P_electedSecondary) states: 0
abstracting: (P_startNeg__broadcasting<=P_poll__networl) states: 0
abstracting: (P_stage<=P_electedPrimary) states: 0
abstracting: (P_stage<=P_electedPrimary) states: 0
abstracting: (P_poll__pollEnd<=P_electedSecondary) states: 0
abstracting: (P_startNeg__broadcasting<=P_poll__networl) states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeoElection-COL-3-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m55sec

checking: ~ [AF [EG [3<=P_electionFailed]]]
normalized: EG [~ [EG [3<=P_electionFailed]]]


FORMULA NeoElection-COL-3-CTLCardinality-15CANNOT_COMPUTE

MC time: 0m0sec


Total processing time: 13m25sec


BK_STOP 1432550453342

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

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: 0m0sec

973 2269 3594 3757 7180 7389 7813 8569 10108 11192 12232 15010 16279 19911 21040
iterations count:15313 (14), effective:108 (0)

initing FirstDep: 0m0sec

21040
iterations count:1048 (1), effective:0 (0)
Unknown names:
P_negotiation
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_polling
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_startNeg__broadcasting
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_electionInit
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_poll__waitingMessage
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_poll__handlingMessage
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

21040
iterations count:1048 (1), effective:0 (0)
Unknown names:
P_crashed
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

21040
iterations count:1048 (1), effective:0 (0)
Unknown names:
P_masterList
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_poll__handlingMessage
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_stage
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_startNeg__broadcasting
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_masterState
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
P_electionFailed
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

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="NeoElection-COL-3"
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/NeoElection-COL-3.tgz
mv NeoElection-COL-3 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is NeoElection-COL-3, 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 r050kn-ebro-143236504100821"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 '' CTLCardinality.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 ;