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 GPPP-PT-C0010N0000000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468027700489
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465038907630


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: GPPP_PT_C0010N0000000010
(NrP: 33 NrTr: 22 NrArc: 83)

net check time: 0m 0.000sec

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

init dd package: 0m 3.666sec


RS generation: 0m 0.284sec


-> reachability set: #nodes 20770 (2.1e+04) #states 23,537,012,497 (10)



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

checking: AG [3<=NADPplus]
normalized: ~ [E [true U ~ [3<=NADPplus]]]

abstracting: (3<=NADPplus) states: 20,345,791,291 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.284sec

checking: AG [AG [1<=NADPplus]]
normalized: ~ [E [true U E [true U ~ [1<=NADPplus]]]]

abstracting: (1<=NADPplus) states: 22,481,799,890 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

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

abstracting: (2<=R5P) states: 1,755,369 (6)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: AF [EG [~ [1<=F6P]]]
normalized: ~ [EG [~ [EG [~ [1<=F6P]]]]]

abstracting: (1<=F6P) states: 5,348,036,185 (9)
.............................................................................................................................................................
EG iterations: 157
..............................................................................................................................................................................................................
EG iterations: 206
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.943sec

checking: EF [~ [EF [1<=NADH]]]
normalized: E [true U ~ [E [true U 1<=NADH]]]

abstracting: (1<=NADH) states: 23,110,396,761 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.888sec

checking: EX [EF [ADP<=_3PG]]
normalized: EX [E [true U ADP<=_3PG]]

abstracting: (ADP<=_3PG) states: 1
.-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EG [[1<=NADH | ~ [1<=GAP]]]
normalized: EG [[1<=NADH | ~ [1<=GAP]]]

abstracting: (1<=GAP) states: 11,401,412,367 (10)
abstracting: (1<=NADH) states: 23,110,396,761 (10)
.................................................................................................................................................................................................................................................................................
EG iterations: 273
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.091sec

checking: EX [EF [Gluc<=NADPH]]
normalized: EX [E [true U Gluc<=NADPH]]

abstracting: (Gluc<=NADPH) states: 17,094,753,430 (10)
.-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.072sec

checking: AG [S7P<=Gluc]
normalized: ~ [E [true U ~ [S7P<=Gluc]]]

abstracting: (S7P<=Gluc) states: 22,335,191,920 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.466sec

checking: AG [~ [~ [[3<=NADplus | start<=NADPH]]]]
normalized: ~ [E [true U ~ [[3<=NADplus | start<=NADPH]]]]

abstracting: (start<=NADPH) states: 23,537,012,496 (10)
abstracting: (3<=NADplus) states: 23,537,012,497 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.834sec

checking: EG [[EF [GSH<=c1] & AG [PEP<=_2PG]]]
normalized: EG [[E [true U GSH<=c1] & ~ [E [true U ~ [PEP<=_2PG]]]]]

abstracting: (PEP<=_2PG) states: 15,659,595,094 (10)
abstracting: (GSH<=c1) states: 7,385,299,225 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.945sec

checking: EF [AG [[c2<=FBP & GAP<=E4P]]]
normalized: E [true U ~ [E [true U ~ [[c2<=FBP & GAP<=E4P]]]]]

abstracting: (GAP<=E4P) states: 12,710,526,775 (10)
abstracting: (c2<=FBP) states: 34,476,052 (7)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.168sec

checking: AG [[EX [start<=Gluc] | [[3<=Ru5P & 2<=ADP] | NADplus<=Lac]]]
normalized: ~ [E [true U ~ [[[NADplus<=Lac | [3<=Ru5P & 2<=ADP]] | EX [start<=Gluc]]]]]

abstracting: (start<=Gluc) states: 23,537,012,496 (10)
.abstracting: (2<=ADP) states: 23,537,012,496 (10)
abstracting: (3<=Ru5P) states: 18,631,380,349 (10)
abstracting: (NADplus<=Lac) states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.152sec

checking: E [[[NADPH<=FBP | 2<=c1] | ~ [_2PG<=start]] U AX [2<=FBP]]
normalized: E [[~ [_2PG<=start] | [NADPH<=FBP | 2<=c1]] U ~ [EX [~ [2<=FBP]]]]

abstracting: (2<=FBP) states: 840,206,706 (8)
.abstracting: (2<=c1) states: 22,888,181,782 (10)
abstracting: (NADPH<=FBP) states: 1,459,105,967 (9)
abstracting: (_2PG<=start) states: 11,908,791,763 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.881sec

checking: [[EX [[3<=NADplus | G6P<=R5P]] | 3<=GSH] & E [[3<=E4P | 2<=NADPplus] U [Gluc<=NADH & 1<=_3PG]]]
normalized: [E [[3<=E4P | 2<=NADPplus] U [Gluc<=NADH & 1<=_3PG]] & [3<=GSH | EX [[3<=NADplus | G6P<=R5P]]]]

abstracting: (G6P<=R5P) states: 3,953,615,176 (9)
abstracting: (3<=NADplus) states: 23,537,012,497 (10)
.abstracting: (3<=GSH) states: 19,175,728,003 (10)
abstracting: (1<=_3PG) states: 11,628,220,734 (10)
abstracting: (Gluc<=NADH) states: 13,170,167,202 (10)
abstracting: (2<=NADPplus) states: 21,418,482,813 (10)
abstracting: (3<=E4P) states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.752sec

checking: ~ [[AG [[b2<=Pi | start<=Pyr]] & [1<=PEP | [[NADPplus<=a1 & E4P<=NADPH] | ~ [_2PG<=b2]]]]]
normalized: ~ [[[1<=PEP | [~ [_2PG<=b2] | [NADPplus<=a1 & E4P<=NADPH]]] & ~ [E [true U ~ [[b2<=Pi | start<=Pyr]]]]]]

abstracting: (start<=Pyr) states: 23,537,012,496 (10)
abstracting: (b2<=Pi) states: 23,537,012,497 (10)
abstracting: (E4P<=NADPH) states: 23,426,652,421 (10)
abstracting: (NADPplus<=a1) states: 9,401,643,399 (9)
abstracting: (_2PG<=b2) states: 23,044,939,762 (10)
abstracting: (1<=PEP) states: 11,628,220,734 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.594sec


Total processing time: 0m40.430sec


BK_STOP 1465038948126

--------------------
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

12435
iterations count:1541 (70), effective:367 (16)

initing FirstDep: 0m 0.000sec


iterations count:490 (22), effective:74 (3)

iterations count:512 (23), effective:78 (3)

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

iterations count:581 (26), effective:107 (4)

iterations count:620 (28), effective:118 (5)
19486
iterations count:1193 (54), effective:259 (11)

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

iterations count:352 (16), effective:70 (3)

iterations count:879 (39), effective:171 (7)

iterations count:637 (28), effective:126 (5)

iterations count:648 (29), effective:122 (5)

iterations count:108 (4), effective:12 (0)
12562
iterations count:1636 (74), effective:399 (18)
25448 38344 38898 37818 38641
iterations count:5012 (227), effective:1083 (49)

iterations count:843 (38), effective:165 (7)

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="GPPP-PT-C0010N0000000010"
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/GPPP-PT-C0010N0000000010.tgz
mv GPPP-PT-C0010N0000000010 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 GPPP-PT-C0010N0000000010, 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-146468027700489"
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 ;