fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r221su-smll-146468028100642
Last Updated
June 30, 2016

About the Execution of Marcie for PaceMaker-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6066.760 47627.00 46990.00 30.00 FTFFTTTFTTTFTTTF 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 PaceMaker-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468028100642
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1465104123785


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

Net: PaceMaker_PT_none
(NrP: 70 NrTr: 164 NrArc: 954)

net check time: 0m 0.000sec

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

init dd package: 0m 3.697sec


RS generation: 0m 0.582sec


-> reachability set: #nodes 776 (7.8e+02) #states 368,026,085,700,403,200 (17)



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

checking: EF [~ [EG [SIG_Clk1<=A_SIG_APOut]]]
normalized: E [true U ~ [EG [SIG_Clk1<=A_SIG_APOut]]]

abstracting: (SIG_Clk1<=A_SIG_APOut) states: 276,077,933,494,272,000 (17)
.
EG iterations: 1
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.443sec

checking: EX [EF [[2<=SIG_Vget & 2<=SANode]]]
normalized: EX [E [true U [2<=SIG_Vget & 2<=SANode]]]

abstracting: (2<=SANode) states: 368,026,085,700,403,200 (17)
abstracting: (2<=SIG_Vget) states: 0
.-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AG [~ [~ [AtrNoiseGenerator<=SIG_VS]]] | EG [EF [PVARP<=A_AVJ]]]
normalized: [EG [E [true U PVARP<=A_AVJ]] | ~ [E [true U ~ [AtrNoiseGenerator<=SIG_VS]]]]

abstracting: (AtrNoiseGenerator<=SIG_VS) states: 0
abstracting: (PVARP<=A_AVJ) states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.860sec

checking: A [EX [SIG_VS<=SIG_APOut] U EF [AVI<=RAConductor]]
normalized: [~ [EG [~ [E [true U AVI<=RAConductor]]]] & ~ [E [~ [E [true U AVI<=RAConductor]] U [~ [EX [SIG_VS<=SIG_APOut]] & ~ [E [true U AVI<=RAConductor]]]]]]

abstracting: (AVI<=RAConductor) states: 57,602,481,979,392,000 (16)
abstracting: (SIG_VS<=SIG_APOut) states: 275,961,195,056,332,800 (17)
.abstracting: (AVI<=RAConductor) states: 57,602,481,979,392,000 (16)
abstracting: (AVI<=RAConductor) states: 57,602,481,979,392,000 (16)
.
EG iterations: 1
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.238sec

checking: [SANodeEctopic<=A_SIG_IncrClk | AG [A_SIG_Vget<=A_SANodeEctopic]]
normalized: [SANodeEctopic<=A_SIG_IncrClk | ~ [E [true U ~ [A_SIG_Vget<=A_SANodeEctopic]]]]

abstracting: (A_SIG_Vget<=A_SANodeEctopic) states: 368,026,085,700,403,200 (17)
abstracting: (SANodeEctopic<=A_SIG_IncrClk) states: 0
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.606sec

checking: E [[~ [AVJ<=A_AtrNoiseGenerator] | 3<=URI] U [~ [3<=A_Atrium] | ~ [1<=LRI]]]
normalized: E [[3<=URI | ~ [AVJ<=A_AtrNoiseGenerator]] U [~ [3<=A_Atrium] | ~ [1<=LRI]]]

abstracting: (1<=LRI) states: 368,026,085,700,403,200 (17)
abstracting: (3<=A_Atrium) states: 368,026,085,700,403,200 (17)
abstracting: (AVJ<=A_AtrNoiseGenerator) states: 184,013,042,850,201,600 (17)
abstracting: (3<=URI) states: 368,026,085,700,403,200 (17)
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.437sec

checking: E [[~ [VtrNoiseGenerator<=URI] & ~ [A_SIG_NextVtrBeat<=A_LRI]] U AG [SIG_Vget<=A_VRG]]
normalized: E [[~ [A_SIG_NextVtrBeat<=A_LRI] & ~ [VtrNoiseGenerator<=URI]] U ~ [E [true U ~ [SIG_Vget<=A_VRG]]]]

abstracting: (SIG_Vget<=A_VRG) states: 368,026,085,700,403,200 (17)
abstracting: (VtrNoiseGenerator<=URI) states: 245,350,723,800,268,800 (17)
abstracting: (A_SIG_NextVtrBeat<=A_LRI) states: 368,026,085,700,403,200 (17)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec

checking: EF [[~ [[SIG_Clk1<=A_RVConductor & 1<=A_SIG_AS]] | ~ [[A_RVConductor<=VRG | 2<=A_SANode]]]]
normalized: E [true U [~ [[A_RVConductor<=VRG | 2<=A_SANode]] | ~ [[SIG_Clk1<=A_RVConductor & 1<=A_SIG_AS]]]]

abstracting: (1<=A_SIG_AS) states: 184,013,042,850,201,600 (17)
abstracting: (SIG_Clk1<=A_RVConductor) states: 368,026,085,700,403,200 (17)
abstracting: (2<=A_SANode) states: 368,026,085,700,403,200 (17)
abstracting: (A_RVConductor<=VRG) states: 216,464,871,967,948,800 (17)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.156sec

checking: EG [[AG [RAConductor<=A_URI] | [[A_SIG_AP<=SIG_AS & 2<=A_SIG_State] & 3<=A_RAConductor]]]
normalized: EG [[[3<=A_RAConductor & [A_SIG_AP<=SIG_AS & 2<=A_SIG_State]] | ~ [E [true U ~ [RAConductor<=A_URI]]]]]

abstracting: (RAConductor<=A_URI) states: 153,186,752,633,241,600 (17)
abstracting: (2<=A_SIG_State) states: 0
abstracting: (A_SIG_AP<=SIG_AS) states: 276,019,564,275,302,400 (17)
abstracting: (3<=A_RAConductor) states: 368,026,085,700,403,200 (17)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.790sec

checking: [E [[A_SIG_Aget<=Atrium | 1<=A_AVJOut] U [2<=A_AtrNoiseGenerator & URI<=RAConductor]] & AX [AG [2<=URI]]]
normalized: [~ [EX [E [true U ~ [2<=URI]]]] & E [[A_SIG_Aget<=Atrium | 1<=A_AVJOut] U [2<=A_AtrNoiseGenerator & URI<=RAConductor]]]

abstracting: (URI<=RAConductor) states: 92,163,971,167,027,200 (16)
abstracting: (2<=A_AtrNoiseGenerator) states: 368,026,085,700,403,200 (17)
abstracting: (1<=A_AVJOut) states: 368,026,085,700,403,200 (17)
abstracting: (A_SIG_Aget<=Atrium) states: 368,026,085,700,403,200 (17)
abstracting: (2<=URI) states: 368,026,085,700,403,200 (17)
.-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.989sec

checking: [[EX [~ [AVJOut<=A_dV]] | AG [SIG_AgetOut<=A_AtrNoiseGenerator]] | [A_dV<=A_SIG_NextVtrBeat & Atrium<=A_AVJ]]
normalized: [[A_dV<=A_SIG_NextVtrBeat & Atrium<=A_AVJ] | [~ [E [true U ~ [SIG_AgetOut<=A_AtrNoiseGenerator]]] | EX [~ [AVJOut<=A_dV]]]]

abstracting: (AVJOut<=A_dV) states: 234,627,850,882,252,800 (17)
.abstracting: (SIG_AgetOut<=A_AtrNoiseGenerator) states: 368,026,085,700,403,200 (17)
abstracting: (Atrium<=A_AVJ) states: 283,152,336,342,220,800 (17)
abstracting: (A_dV<=A_SIG_NextVtrBeat) states: 0
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.042sec

checking: [3<=SIG_IncrClk | [[[[A_VRGEctopic<=A_A_dV | 3<=URIState] & 3<=SIG_Clk1] & ~ [URI<=SIG_Clk1]] | AG [SIG_Aget<=VRGEctopic]]]
normalized: [3<=SIG_IncrClk | [~ [E [true U ~ [SIG_Aget<=VRGEctopic]]] | [~ [URI<=SIG_Clk1] & [3<=SIG_Clk1 & [A_VRGEctopic<=A_A_dV | 3<=URIState]]]]]

abstracting: (3<=URIState) states: 368,026,085,700,403,200 (17)
abstracting: (A_VRGEctopic<=A_A_dV) states: 184,013,042,850,201,600 (17)
abstracting: (3<=SIG_Clk1) states: 0
abstracting: (URI<=SIG_Clk1) states: 0
abstracting: (SIG_Aget<=VRGEctopic) states: 368,026,085,700,403,200 (17)
abstracting: (3<=SIG_IncrClk) states: 0
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.540sec

checking: [A [[3<=RVConductor | 2<=A_VRP] U ~ [A_SIG_Clk0<=SANodeEctopic]] | AG [[3<=A_dV & [A_URI<=VRGEctopic | SIG_AS<=A_VRG]]]]
normalized: [~ [E [true U ~ [[3<=A_dV & [A_URI<=VRGEctopic | SIG_AS<=A_VRG]]]]] | [~ [EG [A_SIG_Clk0<=SANodeEctopic]] & ~ [E [A_SIG_Clk0<=SANodeEctopic U [A_SIG_Clk0<=SANodeEctopic & ~ [[3<=RVConductor | 2<=A_VRP]]]]]]]

abstracting: (2<=A_VRP) states: 368,026,085,700,403,200 (17)
abstracting: (3<=RVConductor) states: 368,026,085,700,403,200 (17)
abstracting: (A_SIG_Clk0<=SANodeEctopic) states: 368,026,085,700,403,200 (17)
abstracting: (A_SIG_Clk0<=SANodeEctopic) states: 368,026,085,700,403,200 (17)
abstracting: (A_SIG_Clk0<=SANodeEctopic) states: 368,026,085,700,403,200 (17)

EG iterations: 0
abstracting: (SIG_AS<=A_VRG) states: 368,026,085,700,403,200 (17)
abstracting: (A_URI<=VRGEctopic) states: 337,357,245,225,369,600 (17)
abstracting: (3<=A_dV) states: 368,026,085,700,403,200 (17)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.141sec

checking: AG [[[[3<=Atrium & 1<=A_PVARP] | [SANode<=SIG_Aget | SANode<=A_SIG_NextVtrBeat]] & [~ [2<=RVConductor] | [A_SIG_AgetOut<=A_Atrium & 1<=A_URIState]]]]
normalized: ~ [E [true U ~ [[[[A_SIG_AgetOut<=A_Atrium & 1<=A_URIState] | ~ [2<=RVConductor]] & [[SANode<=SIG_Aget | SANode<=A_SIG_NextVtrBeat] | [3<=Atrium & 1<=A_PVARP]]]]]]

abstracting: (1<=A_PVARP) states: 368,026,085,700,403,200 (17)
abstracting: (3<=Atrium) states: 368,026,085,700,403,200 (17)
abstracting: (SANode<=A_SIG_NextVtrBeat) states: 0
abstracting: (SANode<=SIG_Aget) states: 0
abstracting: (2<=RVConductor) states: 368,026,085,700,403,200 (17)
abstracting: (1<=A_URIState) states: 368,026,085,700,403,200 (17)
abstracting: (A_SIG_AgetOut<=A_Atrium) states: 368,026,085,700,403,200 (17)
-> the formula is TRUE

FORMULA PaceMaker-PT-none-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.784sec

checking: [[1<=A_URIState & [3<=SIG_APOut & AX [URIState<=SIG_IncrClk]]] | E [[A_SIG_NextVtrBeat<=A_SIG_VgetOut | 2<=A_SIG_Clk0] U [AtrNoiseGenerator<=SIG_APOut | A_dV<=A_LRI]]]
normalized: [E [[A_SIG_NextVtrBeat<=A_SIG_VgetOut | 2<=A_SIG_Clk0] U [AtrNoiseGenerator<=SIG_APOut | A_dV<=A_LRI]] | [1<=A_URIState & [3<=SIG_APOut & ~ [EX [~ [URIState<=SIG_IncrClk]]]]]]

abstracting: (URIState<=SIG_IncrClk) states: 0
.abstracting: (3<=SIG_APOut) states: 0
abstracting: (1<=A_URIState) states: 368,026,085,700,403,200 (17)
abstracting: (A_dV<=A_LRI) states: 0
abstracting: (AtrNoiseGenerator<=SIG_APOut) states: 0
abstracting: (2<=A_SIG_Clk0) states: 0
abstracting: (A_SIG_NextVtrBeat<=A_SIG_VgetOut) states: 275,986,165,845,196,800 (17)
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.707sec

checking: [[[~ [2<=SIG_Vbeat] & [[RVConductor<=SIG_VS | SIG_VP<=SIG_VS] | ~ [1<=A_dV]]] | SIG_VPOut<=A_SIG_VgetOut] & [E [A_SIG_VP<=A_SIG_AP U SANodeEctopic<=A_SIG_AP] | AF [2<=A_SIG_Vbeat]]]
normalized: [[~ [EG [~ [2<=A_SIG_Vbeat]]] | E [A_SIG_VP<=A_SIG_AP U SANodeEctopic<=A_SIG_AP]] & [SIG_VPOut<=A_SIG_VgetOut | [[~ [1<=A_dV] | [RVConductor<=SIG_VS | SIG_VP<=SIG_VS]] & ~ [2<=SIG_Vbeat]]]]

abstracting: (2<=SIG_Vbeat) states: 0
abstracting: (SIG_VP<=SIG_VS) states: 276,019,564,275,302,400 (17)
abstracting: (RVConductor<=SIG_VS) states: 0
abstracting: (1<=A_dV) states: 368,026,085,700,403,200 (17)
abstracting: (SIG_VPOut<=A_SIG_VgetOut) states: 276,043,420,296,806,400 (17)
abstracting: (SANodeEctopic<=A_SIG_AP) states: 0
abstracting: (A_SIG_VP<=A_SIG_AP) states: 276,019,564,275,302,400 (17)
abstracting: (2<=A_SIG_Vbeat) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA PaceMaker-PT-none-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.781sec


Total processing time: 0m47.564sec


BK_STOP 1465104171412

--------------------
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.002sec

145 161 187 289 289 414 1004 1062 1053 962 1067 1093 1069 1119 1123 919 949 541 1333 1294 1195 1408
iterations count:22234 (135), effective:1515 (9)

initing FirstDep: 0m 0.000sec

3241 4342 5347 5566 5620
iterations count:5850 (35), effective:173 (1)

iterations count:164 (1), effective:0 (0)
987 1191 1786 1213 1033
iterations count:5037 (30), effective:217 (1)
987 1191 1786 1213 1033
iterations count:5037 (30), effective:217 (1)
987 1191 1786 1213 1033
iterations count:5037 (30), effective:217 (1)

iterations count:164 (1), effective:0 (0)

iterations count:415 (2), effective:10 (0)
1086 1313 1999 2484
iterations count:4630 (28), effective:189 (1)
997 1203 1796 1232 1033
iterations count:5020 (30), effective:215 (1)

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="PaceMaker-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/PaceMaker-PT-none.tgz
mv PaceMaker-PT-none 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 PaceMaker-PT-none, 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 r221su-smll-146468028100642"
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 '' 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 ;