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

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

=== Now, execution of the tool begins

BK_START 1465057676715


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_C1000N0000000010
(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.702sec


RS generation: 0m 0.210sec


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



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

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

abstracting: (3<=F6P) states: 16,907,667 (7)
-> the formula is TRUE

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

MC time: 0m 0.164sec

checking: ~ [AF [b1<=FBP]]
normalized: EG [~ [b1<=FBP]]

abstracting: (b1<=FBP) states: 9,004 (3)
...........................................
EG iterations: 43
-> the formula is FALSE

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

MC time: 0m56.631sec

checking: EG [AG [F6P<=b2]]
normalized: EG [~ [E [true U ~ [F6P<=b2]]]]

abstracting: (F6P<=b2) states: 14,184,612,091 (10)

EG iterations: 0
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.387sec

checking: AG [[2<=NADPplus | AX [2<=a2]]]
normalized: ~ [E [true U ~ [[2<=NADPplus | ~ [EX [~ [2<=a2]]]]]]]

abstracting: (2<=a2) states: 14,184,015,774 (10)
.abstracting: (2<=NADPplus) states: 12,967,632,465 (10)
-> the formula is FALSE

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

MC time: 0m 0.062sec

checking: E [AG [2<=GSSG] U 3<=Pyr]
normalized: E [~ [E [true U ~ [2<=GSSG]]] U 3<=Pyr]

abstracting: (3<=Pyr) states: 1,311,646,473 (9)
abstracting: (2<=GSSG) states: 11,712,725,635 (10)
-> the formula is FALSE

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

MC time: 0m 0.577sec

checking: [AG [EF [2<=E4P]] & AF [AF [c2<=Xu5P]]]
normalized: [~ [EG [EG [~ [c2<=Xu5P]]]] & ~ [E [true U ~ [E [true U 2<=E4P]]]]]

abstracting: (2<=E4P) states: 0
abstracting: (c2<=Xu5P) states: 26,713,066 (7)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 3.496sec

checking: [EF [EG [GSH<=G6P]] & EG [3<=b1]]
normalized: [EG [3<=b1] & E [true U EG [GSH<=G6P]]]

abstracting: (GSH<=G6P) states: 6,747,393,067 (9)
..................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 370
abstracting: (3<=b1) states: 14,184,358,263 (10)
...........................................
EG iterations: 43
-> the formula is FALSE

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

MC time: 1m43.535sec

checking: EX [AG [[Lac<=ATP | 1<=NADplus]]]
normalized: EX [~ [E [true U ~ [[Lac<=ATP | 1<=NADplus]]]]]

abstracting: (1<=NADplus) states: 14,184,612,091 (10)
abstracting: (Lac<=ATP) states: 13,346,895,451 (10)
.-> the formula is TRUE

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

MC time: 0m 0.128sec

checking: AG [EX [[3<=ADP | ATP<=FBP]]]
normalized: ~ [E [true U ~ [EX [[3<=ADP | ATP<=FBP]]]]]

abstracting: (ATP<=FBP) states: 1,250,057,479 (9)
abstracting: (3<=ADP) states: 14,184,612,090 (10)
.-> the formula is FALSE

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

MC time: 0m 0.622sec

checking: EF [AG [[a2<=b2 | Xu5P<=NADPplus]]]
normalized: E [true U ~ [E [true U ~ [[a2<=b2 | Xu5P<=NADPplus]]]]]

abstracting: (Xu5P<=NADPplus) states: 7,802,154,815 (9)
abstracting: (a2<=b2) states: 14,184,612,091 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.567sec

checking: ~ [E [[DHAP<=G6P | FBP<=S7P] U 2<=NADH]]
normalized: ~ [E [[DHAP<=G6P | FBP<=S7P] U 2<=NADH]]

abstracting: (2<=NADH) states: 12,779,341,311 (10)
abstracting: (FBP<=S7P) states: 11,826,752,455 (10)
abstracting: (DHAP<=G6P) states: 13,469,936,530 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.756sec

checking: [[[EF [1<=F6P] & 3<=FBP] | AF [[3<=_1_3_BPG | 1<=NADH]]] | AG [EF [G6P<=_3PG]]]
normalized: [~ [E [true U ~ [E [true U G6P<=_3PG]]]] | [~ [EG [~ [[3<=_1_3_BPG | 1<=NADH]]]] | [3<=FBP & E [true U 1<=F6P]]]]

abstracting: (1<=F6P) states: 2,555,110,735 (9)
abstracting: (3<=FBP) states: 13,140,642 (7)
abstracting: (1<=NADH) states: 13,838,382,921 (10)
abstracting: (3<=_1_3_BPG) states: 834,149,406 (8)
.
EG iterations: 1
abstracting: (G6P<=_3PG) states: 1,790,958,763 (9)
-> the formula is TRUE

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

MC time: 0m 5.216sec

checking: EF [~ [[NADplus<=c2 | [Pyr<=NADplus & Pyr<=start]]]]
normalized: E [true U ~ [[NADplus<=c2 | [Pyr<=NADplus & Pyr<=start]]]]

abstracting: (Pyr<=start) states: 7,183,405,714 (9)
abstracting: (Pyr<=NADplus) states: 14,184,612,091 (10)
abstracting: (NADplus<=c2) states: 14,157,899,025 (10)
-> the formula is FALSE

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

MC time: 0m 3.198sec

checking: [[AG [~ [1<=PEP]] | ~ [AF [ADP<=NADplus]]] | ~ [A [1<=_3PG U S7P<=Pi]]]
normalized: [~ [[~ [EG [~ [S7P<=Pi]]] & ~ [E [~ [S7P<=Pi] U [~ [1<=_3PG] & ~ [S7P<=Pi]]]]]] | [EG [~ [ADP<=NADplus]] | ~ [E [true U 1<=PEP]]]]

abstracting: (1<=PEP) states: 6,495,048,153 (9)

BK_TIME_CONFINEMENT_REACHED

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

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

initing FirstDep: 0m 0.000sec


iterations count:127 (5), effective:16 (0)

iterations count:223 (10), effective:23 (1)

iterations count:890 (40), effective:202 (9)

iterations count:109 (4), effective:25 (1)

iterations count:22 (1), effective:0 (0)
27231
iterations count:1825 (82), effective:437 (19)
19382
iterations count:1738 (79), effective:435 (19)

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

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

iterations count:110 (5), effective:14 (0)
97732
iterations count:1663 (75), effective:304 (13)

iterations count:183 (8), effective:28 (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-C1000N0000000010"
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-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 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-C1000N0000000010, 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-146468027900561"
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 ;