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

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

=== Now, execution of the tool begins

BK_START 1465039369881


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_C0100N0000000010
(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.921sec


RS generation: 0m 0.236sec


-> reachability set: #nodes 19855 (2.0e+04) #states 14,184,612,091 (10)



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

checking: AG [~ [2<=start]]
normalized: ~ [E [true U 2<=start]]

abstracting: (2<=start) states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: ~ [~ [~ [EX [3<=GSSG]]]]
normalized: ~ [EX [3<=GSSG]]

abstracting: (3<=GSSG) states: 10,455,225,550 (10)
.-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: EF [~ [AX [S7P<=Gluc]]]
normalized: E [true U EX [~ [S7P<=Gluc]]]

abstracting: (S7P<=Gluc) states: 14,184,612,091 (10)
.-> the formula is FALSE

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

MC time: 0m 0.296sec

checking: ~ [AX [AG [a1<=Gluc]]]
normalized: EX [E [true U ~ [a1<=Gluc]]]

abstracting: (a1<=Gluc) states: 14,184,612,090 (10)
.-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.145sec

checking: EF [AF [[a1<=Xu5P & 3<=DHAP]]]
normalized: E [true U ~ [EG [~ [[a1<=Xu5P & 3<=DHAP]]]]]

abstracting: (3<=DHAP) states: 836,074,380 (8)
abstracting: (a1<=Xu5P) states: 10,386,285 (7)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.060sec

checking: AG [[AG [3<=NADplus] & EF [c2<=NADPplus]]]
normalized: ~ [E [true U ~ [[E [true U c2<=NADPplus] & ~ [E [true U ~ [3<=NADplus]]]]]]]

abstracting: (3<=NADplus) states: 14,184,612,091 (10)
abstracting: (c2<=NADPplus) states: 26,713,066 (7)
-> the formula is FALSE

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

MC time: 0m 0.437sec

checking: ~ [[NADPH<=c2 & EF [[2<=R5P & 1<=NADPH]]]]
normalized: ~ [[NADPH<=c2 & E [true U [2<=R5P & 1<=NADPH]]]]

abstracting: (1<=NADPH) states: 13,466,675,506 (10)
abstracting: (2<=R5P) states: 0
abstracting: (NADPH<=c2) states: 14,159,296,101 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.132sec

checking: [F6P<=Gluc & AG [EF [ADP<=c2]]]
normalized: [F6P<=Gluc & ~ [E [true U ~ [E [true U ADP<=c2]]]]]

abstracting: (ADP<=c2) states: 225
abstracting: (F6P<=Gluc) states: 14,184,612,091 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.256sec

checking: [~ [AF [[3<=NADH | c1<=c2]]] & AG [EF [1<=start]]]
normalized: [~ [E [true U ~ [E [true U 1<=start]]]] & EG [~ [[3<=NADH | c1<=c2]]]]

abstracting: (c1<=c2) states: 14,157,899,025 (10)
abstracting: (3<=NADH) states: 10,788,237,324 (10)
.
EG iterations: 1
abstracting: (1<=start) states: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.283sec

checking: E [NADH<=DHAP U AG [PEP<=S7P]]
normalized: E [NADH<=DHAP U ~ [E [true U ~ [PEP<=S7P]]]]

abstracting: (PEP<=S7P) states: 7,689,563,938 (9)
abstracting: (NADH<=DHAP) states: 1,712,597,782 (9)
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.156sec

checking: AG [[[[3<=Lac & 2<=F6P] | 1<=a2] | [[1<=GAP & ADP<=NADPplus] | ~ [2<=FBP]]]]
normalized: ~ [E [true U ~ [[[~ [2<=FBP] | [1<=GAP & ADP<=NADPplus]] | [1<=a2 | [3<=Lac & 2<=F6P]]]]]]

abstracting: (2<=F6P) states: 304,702,569 (8)
abstracting: (3<=Lac) states: 1,311,646,473 (9)
abstracting: (1<=a2) states: 14,184,015,774 (10)
abstracting: (ADP<=NADPplus) states: 1
abstracting: (1<=GAP) states: 6,027,723,840 (9)
abstracting: (2<=FBP) states: 259,021,446 (8)
-> the formula is TRUE

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

MC time: 0m 0.336sec

checking: E [AF [NADplus<=a1] U [[3<=FBP & Pi<=ADP] & [1<=F6P & c1<=G6P]]]
normalized: E [~ [EG [~ [NADplus<=a1]]] U [[1<=F6P & c1<=G6P] & [3<=FBP & Pi<=ADP]]]

abstracting: (Pi<=ADP) states: 14,184,612,091 (10)
abstracting: (3<=FBP) states: 13,140,642 (7)
abstracting: (c1<=G6P) states: 9,791,948,259 (9)
abstracting: (1<=F6P) states: 2,555,110,735 (9)
abstracting: (NADplus<=a1) states: 4,240,032,694 (9)
............................................................................................................................................................................................................................................................................................................................................................
EG iterations: 348
-> the formula is FALSE

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

MC time: 0m18.237sec

checking: E [[Ru5P<=c2 | [3<=ATP | NADPplus<=_1_3_BPG]] U ~ [[2<=Xu5P | _2PG<=E4P]]]
normalized: E [[Ru5P<=c2 | [3<=ATP | NADPplus<=_1_3_BPG]] U ~ [[2<=Xu5P | _2PG<=E4P]]]

abstracting: (_2PG<=E4P) states: 7,919,719,309 (9)
abstracting: (2<=Xu5P) states: 12,506,226,876 (10)
abstracting: (NADPplus<=_1_3_BPG) states: 1,017,982,298 (9)
abstracting: (3<=ATP) states: 11,173,493,638 (10)
abstracting: (Ru5P<=c2) states: 14,159,450,212 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.012sec

checking: [A [[GAP<=E4P & ADP<=Pyr] U ~ [b2<=a1]] | [AG [~ [DHAP<=Pyr]] | [~ [2<=Pyr] & EF [2<=R5P]]]]
normalized: [[[E [true U 2<=R5P] & ~ [2<=Pyr]] | ~ [E [true U DHAP<=Pyr]]] | [~ [EG [b2<=a1]] & ~ [E [b2<=a1 U [b2<=a1 & ~ [[GAP<=E4P & ADP<=Pyr]]]]]]]

abstracting: (ADP<=Pyr) states: 1
abstracting: (GAP<=E4P) states: 8,376,093,433 (9)
abstracting: (b2<=a1) states: 42
abstracting: (b2<=a1) states: 42
abstracting: (b2<=a1) states: 42
...........................................
EG iterations: 43
abstracting: (DHAP<=Pyr) states: 10,212,282,490 (10)
abstracting: (2<=Pyr) states: 3,188,955,627 (9)
abstracting: (2<=R5P) states: 0
-> the formula is FALSE

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

MC time: 0m 2.669sec

checking: [AG [[[2<=Ru5P & DHAP<=Pyr] | ~ [3<=PEP]]] & AX [[[GSSG<=DHAP | _1_3_BPG<=start] | [3<=_2PG & S7P<=G6P]]]]
normalized: [~ [EX [~ [[[3<=_2PG & S7P<=G6P] | [GSSG<=DHAP | _1_3_BPG<=start]]]]] & ~ [E [true U ~ [[~ [3<=PEP] | [2<=Ru5P & DHAP<=Pyr]]]]]]

abstracting: (DHAP<=Pyr) states: 10,212,282,490 (10)
abstracting: (2<=Ru5P) states: 12,506,821,809 (10)
abstracting: (3<=PEP) states: 1,055,187,978 (9)
abstracting: (_1_3_BPG<=start) states: 8,170,999,387 (9)
abstracting: (GSSG<=DHAP) states: 2,070,995,638 (9)
abstracting: (S7P<=G6P) states: 14,183,342,071 (10)
abstracting: (3<=_2PG) states: 1,055,187,978 (9)
.-> the formula is FALSE

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

MC time: 0m 2.760sec

checking: [[1<=_3PG & [[[NADplus<=_3PG | 3<=Gluc] & [3<=FBP | GSSG<=a2]] & [[Pyr<=NADH | 3<=NADPplus] & [1<=GSSG & c2<=E4P]]]] | [EF [[2<=GAP & 2<=DHAP]] & [[[b2<=b2 & 3<=b2] & 1<=E4P] | [ADP<=b2 & Pyr<=c2]]]]
normalized: [[[[ADP<=b2 & Pyr<=c2] | [1<=E4P & [b2<=b2 & 3<=b2]]] & E [true U [2<=GAP & 2<=DHAP]]] | [1<=_3PG & [[[1<=GSSG & c2<=E4P] & [Pyr<=NADH | 3<=NADPplus]] & [[3<=FBP | GSSG<=a2] & [NADplus<=_3PG | 3<=Gluc]]]]]

abstracting: (3<=Gluc) states: 14,184,612,090 (10)
abstracting: (NADplus<=_3PG) states: 0
abstracting: (GSSG<=a2) states: 14,184,061,824 (10)
abstracting: (3<=FBP) states: 13,140,642 (7)
abstracting: (3<=NADPplus) states: 12,344,443,070 (10)
abstracting: (Pyr<=NADH) states: 14,184,612,091 (10)
abstracting: (c2<=E4P) states: 26,713,066 (7)
abstracting: (1<=GSSG) states: 12,955,699,758 (10)
abstracting: (1<=_3PG) states: 6,495,048,153 (9)
abstracting: (2<=DHAP) states: 2,361,709,584 (9)
abstracting: (2<=GAP) states: 2,361,709,584 (9)
abstracting: (3<=b2) states: 14,184,612,049 (10)
abstracting: (b2<=b2) states: 14,184,612,091 (10)
abstracting: (1<=E4P) states: 942,157,236 (8)
abstracting: (Pyr<=c2) states: 14,184,612,091 (10)
abstracting: (ADP<=b2) states: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.083sec


Total processing time: 0m39.463sec


BK_STOP 1465039409413

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

12422
iterations count:1727 (78), effective:414 (18)

initing FirstDep: 0m 0.000sec


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

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

iterations count:109 (4), effective:14 (0)

iterations count:324 (14), effective:65 (2)

iterations count:51 (2), effective:6 (0)

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

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

iterations count:183 (8), effective:28 (1)

iterations count:242 (11), effective:44 (2)

iterations count:229 (10), effective:42 (1)

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

iterations count:98 (4), effective:20 (0)

iterations count:429 (19), effective:103 (4)

iterations count:240 (10), effective:42 (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="GPPP-PT-C0100N0000000010"
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-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 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-C0100N0000000010, 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-146468027800516"
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 ;