fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r171-csrt-149580951700327
Last Updated
June 27, 2017

About the Execution of MARCIE for DLCround-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11310.700 3600000.00 3600019.00 20.20 ?FFF?T?FFF?F?T?? 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-3254
Executing tool marcie
Input is DLCround-PT-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951700327
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1495824304500

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: DLCround_PT_10a
(NrP: 337 NrTr: 2605 NrArc: 10130)

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

net check time: 0m 0.001sec

init dd package: 0m 1.275sec


after gc: zbdd nodes used:770286, unused:17979714
RS generation: 3m11.607sec


-> reachability set: #nodes 772529 (7.7e+05) #states 240,100,000,000,001 (14)



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

checking: EF [EF [2<=p43]]
normalized: E [true U E [true U 2<=p43]]

abstracting: (2<=p43)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-10a-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.275sec

checking: AF [AG [1<=p225]]
normalized: ~ [EG [E [true U ~ [1<=p225]]]]

abstracting: (1<=p225)
states: 240,100,000,000,000 (14)
.
after gc: zbdd nodes used:1545121, unused:35954879
after gc: zbdd nodes used:1807460, unused:73192540
after gc: zbdd nodes used:38659770, unused:111340230MC time: 3m50.430sec

checking: EX [EF [2<=p55]]
normalized: EX [E [true U 2<=p55]]

abstracting: (2<=p55)
states: 0
.-> the formula is FALSE

FORMULA DLCround-PT-10a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.284sec

checking: EF [3<=p235]
normalized: E [true U 3<=p235]

abstracting: (3<=p235)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-10a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [~ [p212<=p300]]]]
normalized: E [true U ~ [p212<=p300]]

abstracting: (p212<=p300)
states: 240,100,000,000,001 (14)
-> the formula is FALSE

FORMULA DLCround-PT-10a-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.250sec

checking: AG [AF [p125<=p260]]
normalized: ~ [E [true U EG [~ [p125<=p260]]]]

abstracting: (p125<=p260)
states: 240,100,000,000,001 (14)
.MC time: 4m31.153sec

checking: EF [AX [~ [p303<=p158]]]
normalized: E [true U ~ [EX [p303<=p158]]]

abstracting: (p303<=p158)
states: 240,100,000,000,001 (14)
MC time: 4m 4.235sec

checking: E [EF [3<=p248] U 3<=p157]
normalized: E [E [true U 3<=p248] U 3<=p157]

abstracting: (3<=p157)
states: 0
abstracting: (3<=p248)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-10a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.377sec

checking: AG [p5<=p273]
normalized: ~ [E [true U ~ [p5<=p273]]]

abstracting: (p5<=p273)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

FORMULA DLCround-PT-10a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [EX [[3<=p137 | p49<=p286]]]
normalized: ~ [E [true U ~ [EX [[3<=p137 | p49<=p286]]]]]

abstracting: (p49<=p286)
states: 240,100,000,000,001 (14)
abstracting: (3<=p137)
states: 0
MC time: 4m27.456sec

checking: EF [A [p267<=p153 U 2<=p168]]
normalized: E [true U [~ [E [~ [2<=p168] U [~ [p267<=p153] & ~ [2<=p168]]]] & ~ [EG [~ [2<=p168]]]]]

abstracting: (2<=p168)
states: 0

EG iterations: 0
abstracting: (2<=p168)
states: 0
abstracting: (p267<=p153)
states: 240,100,000,000,001 (14)
abstracting: (2<=p168)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-10a-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.568sec

checking: AG [[EG [2<=p103] | p53<=p275]]
normalized: ~ [E [true U ~ [[p53<=p275 | EG [2<=p103]]]]]

abstracting: (2<=p103)
states: 0
.MC time: 4m34.192sec

checking: ~ [[~ [EF [3<=p163]] | EG [~ [p225<=p27]]]]
normalized: ~ [[EG [~ [p225<=p27]] | ~ [E [true U 3<=p163]]]]

abstracting: (3<=p163)
states: 0
abstracting: (p225<=p27)
states: 34,300,000,000,001 (13)

after gc: zbdd nodes used:2322640, unused:297677360MC time: 3m57.428sec

checking: [~ [~ [2<=p13]] | EF [~ [[1<=p228 | p334<=p299]]]]
normalized: [2<=p13 | E [true U ~ [[1<=p228 | p334<=p299]]]]

abstracting: (p334<=p299)
states: 240,100,000,000,001 (14)
abstracting: (1<=p228)
states: 240,100,000,000,000 (14)
abstracting: (2<=p13)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-10a-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.970sec

checking: AG [[EF [p334<=p140] & [p304<=p296 & p179<=p159]]]
normalized: ~ [E [true U ~ [[E [true U p334<=p140] & [p304<=p296 & p179<=p159]]]]]

abstracting: (p179<=p159)
states: 240,100,000,000,001 (14)
abstracting: (p304<=p296)
states: 240,100,000,000,001 (14)
abstracting: (p334<=p140)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

FORMULA DLCround-PT-10a-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m42.553sec

checking: E [AG [p314<=p225] U [1<=p20 & [p52<=p258 | 3<=p0]]]
normalized: E [~ [E [true U ~ [p314<=p225]]] U [1<=p20 & [p52<=p258 | 3<=p0]]]

abstracting: (3<=p0)
states: 0
abstracting: (p52<=p258)
states: 240,100,000,000,001 (14)
abstracting: (1<=p20)
states: 34,300,000,000,000 (13)
abstracting: (p314<=p225)
states: 240,100,000,000,001 (14)
MC time: 3m57.004sec

checking: AF [AG [1<=p225]]
normalized: ~ [EG [E [true U ~ [1<=p225]]]]

abstracting: (1<=p225)
states: 240,100,000,000,000 (14)

BK_TIME_CONFINEMENT_REACHED

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

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

771574
iterations count:112088 (43), effective:124 (0)

initing FirstDep: 0m 0.033sec


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

net_ddint.h:438: Timeout: after 227 sec


net_ddint.h:438: Timeout: after 264 sec


net_ddint.h:596: Timeout: after 242 sec


net_ddint.h:596: Timeout: after 266 sec


net_ddint.h:438: Timeout: after 265 sec


net_ddint.h:596: Timeout: after 235 sec


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

sat_reach.icc:155: Timeout: after 236 sec


iterations count:2605 (1), effective:0 (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="DLCround-PT-10a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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/DLCround-PT-10a.tgz
mv DLCround-PT-10a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is DLCround-PT-10a, 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 r171-csrt-149580951700327"
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 ;