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 S_GPPP-PT-C0001N0000000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441599100507
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494883432802

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

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

net check time: 0m 0.000sec

init dd package: 0m 1.074sec

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000001
(NrP: 33 NrTr: 22 NrArc: 83)

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

net check time: 0m 0.000sec

init dd package: 0m 3.586sec


RS generation: 0m 0.010sec


-> reachability set: #nodes 561 (5.6e+02) #states 10,380 (4)



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

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

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

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

MC time: 0m 0.000sec

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

abstracting: (1<=_2PG)
states: 2,670 (3)
-> the formula is FALSE

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

MC time: 0m 0.013sec

checking: E [EF [1<=Gluc] U AX [3<=GSSG]]
normalized: E [E [true U 1<=Gluc] U ~ [EX [~ [3<=GSSG]]]]

abstracting: (3<=GSSG)
states: 0
.abstracting: (1<=Gluc)
states: 1,638 (3)
-> the formula is FALSE

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

MC time: 0m 0.012sec

checking: ~ [EF [AX [ADP<=FBP]]]
normalized: ~ [E [true U ~ [EX [~ [ADP<=FBP]]]]]

abstracting: (ADP<=FBP)
states: 24
.-> the formula is FALSE

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

MC time: 0m 0.008sec

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

abstracting: (_1_3_BPG<=_1_3_BPG)
states: 10,380 (4)
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AX [EF [[3<=_1_3_BPG & 3<=GAP]]]
normalized: ~ [EX [~ [E [true U [3<=_1_3_BPG & 3<=GAP]]]]]

abstracting: (3<=GAP)
states: 780
abstracting: (3<=_1_3_BPG)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [EF [AX [2<=PEP]] & Pi<=PEP]
normalized: [E [true U ~ [EX [~ [2<=PEP]]]] & Pi<=PEP]

abstracting: (Pi<=PEP)
states: 234
abstracting: (2<=PEP)
states: 420
.-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: AF [[EG [1<=Gluc] & AG [ATP<=ADP]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [ATP<=ADP]]] & EG [1<=Gluc]]]]]

abstracting: (1<=Gluc)
states: 1,638 (3)
.................
EG iterations: 17
abstracting: (ATP<=ADP)
states: 9,546 (3)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.016sec

checking: EF [[~ [[3<=GAP & 2<=_2PG]] & 2<=E4P]]
normalized: E [true U [2<=E4P & ~ [[3<=GAP & 2<=_2PG]]]]

abstracting: (2<=_2PG)
states: 420
abstracting: (3<=GAP)
states: 780
abstracting: (2<=E4P)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [E [[3<=start | NADH<=FBP] U [3<=NADH & NADplus<=E4P]]]
normalized: ~ [E [[3<=start | NADH<=FBP] U [3<=NADH & NADplus<=E4P]]]

abstracting: (NADplus<=E4P)
states: 7,464 (3)
abstracting: (3<=NADH)
states: 0
abstracting: (NADH<=FBP)
states: 2,136 (3)
abstracting: (3<=start)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AG [[[~ [1<=a2] & GAP<=b1] | ~ [[c2<=DHAP & 1<=_1_3_BPG]]]]
normalized: ~ [E [true U ~ [[[~ [1<=a2] & GAP<=b1] | ~ [[c2<=DHAP & 1<=_1_3_BPG]]]]]]

abstracting: (1<=_1_3_BPG)
states: 1,998 (3)
abstracting: (c2<=DHAP)
states: 1,158 (3)
abstracting: (GAP<=b1)
states: 10,032 (4)
abstracting: (1<=a2)
states: 3,576 (3)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: [EX [[~ [1<=E4P] | [1<=Lac | Pyr<=c2]]] & AG [AX [F6P<=Pi]]]
normalized: [EX [[[1<=Lac | Pyr<=c2] | ~ [1<=E4P]]] & ~ [E [true U EX [~ [F6P<=Pi]]]]]

abstracting: (F6P<=Pi)
states: 10,380 (4)
.abstracting: (1<=E4P)
states: 4,398 (3)
abstracting: (Pyr<=c2)
states: 10,332 (4)
abstracting: (1<=Lac)
states: 6,882 (3)
.-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: E [EF [FBP<=a1] U [~ [_1_3_BPG<=Pi] | [1<=Pyr & 3<=Gluc]]]
normalized: E [E [true U FBP<=a1] U [~ [_1_3_BPG<=Pi] | [1<=Pyr & 3<=Gluc]]]

abstracting: (3<=Gluc)
states: 42
abstracting: (1<=Pyr)
states: 3,156 (3)
abstracting: (_1_3_BPG<=Pi)
states: 10,332 (4)
abstracting: (FBP<=a1)
states: 10,362 (4)
-> the formula is TRUE

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

MC time: 0m 0.008sec

checking: [~ [[[1<=Pyr & [DHAP<=a1 | ADP<=Lac]] | AF [3<=R5P]]] & EF [AF [3<=PEP]]]
normalized: [E [true U ~ [EG [~ [3<=PEP]]]] & ~ [[~ [EG [~ [3<=R5P]]] | [1<=Pyr & [DHAP<=a1 | ADP<=Lac]]]]]

abstracting: (ADP<=Lac)
states: 426
abstracting: (DHAP<=a1)
states: 9,168 (3)
abstracting: (1<=Pyr)
states: 3,156 (3)
abstracting: (3<=R5P)
states: 0

EG iterations: 0
abstracting: (3<=PEP)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[[Lac<=ADP & [Pi<=R5P | ATP<=F6P]] & AG [_1_3_BPG<=PEP]]]
normalized: E [true U [~ [E [true U ~ [_1_3_BPG<=PEP]]] & [Lac<=ADP & [Pi<=R5P | ATP<=F6P]]]]

abstracting: (ATP<=F6P)
states: 3,534 (3)
abstracting: (Pi<=R5P)
states: 132
abstracting: (Lac<=ADP)
states: 10,098 (4)
abstracting: (_1_3_BPG<=PEP)
states: 8,694 (3)
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: ~ [EX [[[start<=ADP | _2PG<=GSH] & [b1<=b1 | _1_3_BPG<=c1]]]]
normalized: ~ [EX [[[b1<=b1 | _1_3_BPG<=c1] & [start<=ADP | _2PG<=GSH]]]]

abstracting: (_2PG<=GSH)
states: 9,045 (3)
abstracting: (start<=ADP)
states: 10,374 (4)
abstracting: (_1_3_BPG<=c1)
states: 10,380 (4)
abstracting: (b1<=b1)
states: 10,380 (4)
.-> the formula is FALSE

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

MC time: 0m 0.002sec

totally nodes used: 24101 (2.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 41355 79604 120959
used/not used/entry size/cache size: 98702 67010162 16 1024MB
basic ops cache: hits/miss/sum: 12118 34199 46317
used/not used/entry size/cache size: 56908 16720308 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1852 4445 6297
used/not used/entry size/cache size: 4445 8384163 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67086614
1 21652
2 367
3 79
4 38
5 20
6 25
7 8
8 14
9 6
>= 10 41

Total processing time: 0m 6.562sec


BK_STOP 1494883439471

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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


iterations count:446 (20), effective:99 (4)

initing FirstDep: 0m 0.000sec


iterations count:215 (9), effective:44 (2)

iterations count:336 (15), effective:82 (3)

iterations count:405 (18), effective:99 (4)

iterations count:312 (14), effective:71 (3)

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

iterations count:371 (16), effective:89 (4)

iterations count:226 (10), effective:51 (2)

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="S_GPPP-PT-C0001N0000000001"
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/S_GPPP-PT-C0001N0000000001.tgz
mv S_GPPP-PT-C0001N0000000001 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 S_GPPP-PT-C0001N0000000001, 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 r101-blw3-149441599100507"
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 ;