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 JoinFreeModules-PT-0003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r191-blw7-149581061600003
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496737772205

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: JoinFreeModules_PT_0003
(NrP: 16 NrTr: 25 NrArc: 71)

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

net check time: 0m 0.000sec

init dd package: 0m 1.057sec

parse successfull
net created successfully

Net: JoinFreeModules_PT_0003
(NrP: 16 NrTr: 25 NrArc: 71)

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

net check time: 0m 0.000sec

init dd package: 0m 3.426sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 55 (5.5e+01) #states 35,937 (4)



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

checking: 3<=p12
normalized: 3<=p12

abstracting: (3<=p12)
states: 4,356 (3)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: 1<=p1
normalized: 1<=p1

abstracting: (1<=p1)
states: 27,225 (4)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EF [~ [p3<=p8]]]
normalized: ~ [E [true U ~ [E [true U ~ [p3<=p8]]]]]

abstracting: (p3<=p8)
states: 23,760 (4)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (p<=p)
states: 35,937 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p3<=p3)
states: 35,937 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: p13<=p5
normalized: p13<=p5

abstracting: (p13<=p5)
states: 20,031 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [EX [p11<=p13] U AG [p<=p4]]
normalized: E [EX [p11<=p13] U ~ [E [true U ~ [p<=p4]]]]

abstracting: (p<=p4)
states: 18,513 (4)
abstracting: (p11<=p13)
states: 14,157 (4)
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[[1<=p3 & 3<=p8] | 1<=p6] U AG [1<=p2]]
normalized: E [[[1<=p3 & 3<=p8] | 1<=p6] U ~ [E [true U ~ [1<=p2]]]]

abstracting: (1<=p2)
states: 22,869 (4)
abstracting: (1<=p6)
states: 27,225 (4)
abstracting: (3<=p8)
states: 3,267 (3)
abstracting: (1<=p3)
states: 20,691 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [EF [p<=p10] U ~ [[3<=p7 | 2<=p12]]]
normalized: E [E [true U p<=p10] U ~ [[3<=p7 | 2<=p12]]]

abstracting: (2<=p12)
states: 10,890 (4)
abstracting: (3<=p7)
states: 4,356 (3)
abstracting: (p<=p10)
states: 11,979 (4)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [~ [p5<=p]] | [1<=p11 & ~ [p7<=p1]]]]
normalized: ~ [E [true U ~ [[[~ [p7<=p1] & 1<=p11] | p5<=p]]]]

abstracting: (p5<=p)
states: 32,670 (4)
abstracting: (1<=p11)
states: 27,225 (4)
abstracting: (p7<=p1)
states: 27,489 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[~ [p3<=p9] | [3<=p5 | p15<=p4]] | EX [2<=p2]]]
normalized: ~ [E [true U ~ [[EX [2<=p2] | [[3<=p5 | p15<=p4] | ~ [p3<=p9]]]]]]

abstracting: (p3<=p9)
states: 24,585 (4)
abstracting: (p15<=p4)
states: 28,446 (4)
abstracting: (3<=p5)
states: 3,267 (3)
abstracting: (2<=p2)
states: 10,890 (4)
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [[[p10<=p9 | p9<=p12] | [p7<=p11 & p12<=p10]]]]
normalized: E [true U ~ [[[p7<=p11 & p12<=p10] | [p10<=p9 | p9<=p12]]]]

abstracting: (p9<=p12)
states: 22,176 (4)
abstracting: (p10<=p9)
states: 32,670 (4)
abstracting: (p12<=p10)
states: 18,051 (4)
abstracting: (p7<=p11)
states: 27,489 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [E [[2<=p11 | p4<=p10] U [2<=p & p7<=p1]] & p<=p12]
normalized: [E [[2<=p11 | p4<=p10] U [2<=p & p7<=p1]] & p<=p12]

abstracting: (p<=p12)
states: 22,869 (4)
abstracting: (p7<=p1)
states: 27,489 (4)
abstracting: (2<=p)
states: 0
abstracting: (p4<=p10)
states: 20,427 (4)
abstracting: (2<=p11)
states: 21,780 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EF [[~ [p10<=p11] & [3<=p5 & 3<=p]]] | [~ [[~ [p<=p15] & ~ [2<=p15]]] | EG [2<=p9]]]
normalized: [[EG [2<=p9] | ~ [[~ [2<=p15] & ~ [p<=p15]]]] | E [true U [[3<=p5 & 3<=p] & ~ [p10<=p11]]]]

abstracting: (p10<=p11)
states: 30,756 (4)
abstracting: (3<=p)
states: 0
abstracting: (3<=p5)
states: 3,267 (3)
abstracting: (p<=p15)
states: 11,979 (4)
abstracting: (2<=p15)
states: 3,267 (3)
abstracting: (2<=p9)
states: 13,068 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AF [[[p1<=p15 | 2<=p5] | p7<=p]] & E [~ [p8<=p11] U ~ [p7<=p7]]]
normalized: [E [~ [p8<=p11] U ~ [p7<=p7]] & ~ [EG [~ [[p7<=p | [p1<=p15 | 2<=p5]]]]]]

abstracting: (2<=p5)
states: 3,267 (3)
abstracting: (p1<=p15)
states: 12,507 (4)
abstracting: (p7<=p)
states: 25,047 (4)
.
EG iterations: 1
abstracting: (p7<=p7)
states: 35,937 (4)
abstracting: (p8<=p11)
states: 28,809 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [~ [[[~ [p13<=p7] & p13<=p1] & [p14<=p12 & p14<=p13]]] | [EG [[p2<=p2 | 1<=p12]] & [[[p2<=p1 | p1<=p11] | ~ [p11<=p12]] | AF [1<=p]]]]
normalized: [[[~ [EG [~ [1<=p]]] | [~ [p11<=p12] | [p2<=p1 | p1<=p11]]] & EG [[p2<=p2 | 1<=p12]]] | ~ [[[p14<=p12 & p14<=p13] & [p13<=p1 & ~ [p13<=p7]]]]]

abstracting: (p13<=p7)
states: 24,915 (4)
abstracting: (p13<=p1)
states: 28,809 (4)
abstracting: (p14<=p13)
states: 20,691 (4)
abstracting: (p14<=p12)
states: 21,780 (4)
abstracting: (1<=p12)
states: 22,869 (4)
abstracting: (p2<=p2)
states: 35,937 (4)

EG iterations: 0
abstracting: (p1<=p11)
states: 21,417 (4)
abstracting: (p2<=p1)
states: 27,225 (4)
abstracting: (p11<=p12)
states: 16,335 (4)
abstracting: (1<=p)
states: 35,937 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 12483 (1.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 15175 15715 30890
used/not used/entry size/cache size: 23994 67084870 16 1024MB
basic ops cache: hits/miss/sum: 12378 12230 24608
used/not used/entry size/cache size: 25380 16751836 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: 1468 1221 2689
used/not used/entry size/cache size: 1221 8387387 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 67096965
1 11620
2 183
3 28
4 18
5 13
6 19
7 5
8 4
9 4
>= 10 5

Total processing time: 0m 5.940sec


BK_STOP 1496737778224

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

check for maximal unmarked siphon
ok
check for constant places
p
found 1 constant places
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
p
found 1 constant places
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:116 (4), effective:36 (1)

initing FirstDep: 0m 0.000sec


iterations count:101 (4), effective:26 (1)

iterations count:40 (1), effective:5 (0)

iterations count:52 (2), effective:8 (0)

iterations count:46 (1), effective:8 (0)

iterations count:33 (1), effective:3 (0)

iterations count:84 (3), effective:22 (0)

iterations count:112 (4), effective:32 (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="JoinFreeModules-PT-0003"
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/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 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 JoinFreeModules-PT-0003, 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 r191-blw7-149581061600003"
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 ;