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

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

=== Now, execution of the tool begins

BK_START 1496737785495

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_0005
(NrP: 26 NrTr: 41 NrArc: 117)

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

net check time: 0m 0.000sec

init dd package: 0m 0.999sec

parse successfull
net created successfully

Net: JoinFreeModules_PT_0005
(NrP: 26 NrTr: 41 NrArc: 117)

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

net check time: 0m 0.000sec

init dd package: 0m 3.135sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 301 (3.0e+02) #states 11,592,740,743 (10)



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

checking: AF [AF [~ [p9<=p15]]]
normalized: ~ [EG [EG [p9<=p15]]]

abstracting: (p9<=p15)
states: 6,018,740,316 (9)
.....................
EG iterations: 21
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.029sec

checking: EG [EF [p25<=p15]]
normalized: EG [E [true U p25<=p15]]

abstracting: (p25<=p15)
states: 7,678,592,629 (9)

EG iterations: 0
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0005-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: AF [p2<=p24]
normalized: ~ [EG [~ [p2<=p24]]]

abstracting: (p2<=p24)
states: 7,629,419,914 (9)
...............
EG iterations: 15
-> the formula is FALSE

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

MC time: 0m 0.040sec

checking: EG [p15<=p25]
normalized: EG [p15<=p25]

abstracting: (p15<=p25)
states: 7,678,592,629 (9)
.....................
EG iterations: 21
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0005-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: AX [EG [p4<=p13]]
normalized: ~ [EX [~ [EG [p4<=p13]]]]

abstracting: (p4<=p13)
states: 6,215,431,176 (9)
...............
EG iterations: 15
.-> the formula is TRUE

FORMULA JoinFreeModules-PT-0005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EF [~ [EF [p5<=p4]]]
normalized: E [true U ~ [E [true U p5<=p4]]]

abstracting: (p5<=p4)
states: 9,454,274,004 (9)
-> the formula is TRUE

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

MC time: 0m 0.027sec

checking: EF [EG [p8<=p13]]
normalized: E [true U EG [p8<=p13]]

abstracting: (p8<=p13)
states: 7,265,541,823 (9)
...................
EG iterations: 19
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: AF [A [p13<=p18 U 2<=p5]]
normalized: ~ [EG [~ [[~ [EG [~ [2<=p5]]] & ~ [E [~ [2<=p5] U [~ [p13<=p18] & ~ [2<=p5]]]]]]]]

abstracting: (2<=p5)
states: 3,038,873,787 (9)
abstracting: (p13<=p18)
states: 7,265,541,823 (9)
abstracting: (2<=p5)
states: 3,038,873,787 (9)
abstracting: (2<=p5)
states: 3,038,873,787 (9)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.031sec

checking: ~ [~ [[AX [p1<=p17] | AF [3<=p15]]]]
normalized: [~ [EG [~ [3<=p15]]] | ~ [EX [~ [p1<=p17]]]]

abstracting: (p1<=p17)
states: 5,623,173,142 (9)
.abstracting: (3<=p15)
states: 2,138,466,739 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: [EF [3<=p16] & AG [[[2<=p3 | p15<=p4] | ~ [3<=p17]]]]
normalized: [~ [E [true U ~ [[[2<=p3 | p15<=p4] | ~ [3<=p17]]]]] & E [true U 3<=p16]]

abstracting: (3<=p16)
states: 4,502,035,240 (9)
abstracting: (3<=p17)
states: 2,363,568,501 (9)
abstracting: (p15<=p4)
states: 8,239,161,580 (9)
abstracting: (2<=p3)
states: 4,164,382,597 (9)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0005-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: [AG [[[1<=p22 & 1<=p7] | [3<=p5 | 2<=p23]]] | ~ [EF [[1<=p8 | 2<=p4]]]]
normalized: [~ [E [true U [1<=p8 | 2<=p4]]] | ~ [E [true U ~ [[[3<=p5 | 2<=p23] | [1<=p22 & 1<=p7]]]]]]

abstracting: (1<=p7)
states: 7,766,010,789 (9)
abstracting: (1<=p22)
states: 7,766,010,789 (9)
abstracting: (2<=p23)
states: 4,164,382,597 (9)
abstracting: (3<=p5)
states: 2,138,466,739 (9)
abstracting: (2<=p4)
states: 5,627,544,050 (9)
abstracting: (1<=p8)
states: 7,428,358,146 (9)
-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: AF [[[p10<=p24 | [p11<=p21 | 1<=p3]] & p22<=p20]]
normalized: ~ [EG [~ [[p22<=p20 & [p10<=p24 | [p11<=p21 | 1<=p3]]]]]]

abstracting: (1<=p3)
states: 7,428,358,146 (9)
abstracting: (p11<=p21)
states: 6,796,761,940 (9)
abstracting: (p10<=p24)
states: 8,239,161,580 (9)
abstracting: (p22<=p20)
states: 6,437,254,757 (9)
.......................
EG iterations: 23
-> the formula is FALSE

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

MC time: 0m 0.398sec

checking: AF [[[[2<=p15 & p23<=p2] & 1<=p10] | ~ [[p9<=p14 & 1<=p1]]]]
normalized: ~ [EG [~ [[[1<=p10 & [2<=p15 & p23<=p2]] | ~ [[p9<=p14 & 1<=p1]]]]]]

abstracting: (1<=p1)
states: 8,666,417,837 (9)
abstracting: (p9<=p14)
states: 7,031,698,245 (9)
abstracting: (p23<=p2)
states: 7,457,861,775 (9)
abstracting: (2<=p15)
states: 3,038,873,787 (9)
abstracting: (1<=p10)
states: 5,852,645,812 (9)
..................
EG iterations: 18
-> the formula is FALSE

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

MC time: 0m 0.050sec

checking: [EF [[p21<=p9 & [3<=p14 & p10<=p21]]] | E [~ [2<=p11] U [3<=p2 & 3<=p17]]]
normalized: [E [~ [2<=p11] U [3<=p2 & 3<=p17]] | E [true U [p21<=p9 & [3<=p14 & p10<=p21]]]]

abstracting: (p10<=p21)
states: 8,657,676,021 (9)
abstracting: (3<=p14)
states: 4,502,035,240 (9)
abstracting: (p21<=p9)
states: 6,322,518,422 (9)
abstracting: (3<=p17)
states: 2,363,568,501 (9)
abstracting: (3<=p2)
states: 2,363,568,501 (9)
abstracting: (2<=p11)
states: 6,753,052,860 (9)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.089sec

checking: [[AG [[1<=p8 | p20<=p19]] | EF [p4<=p14]] & AG [~ [[p23<=p20 & 3<=p17]]]]
normalized: [~ [E [true U [p23<=p20 & 3<=p17]]] & [E [true U p4<=p14] | ~ [E [true U ~ [[1<=p8 | p20<=p19]]]]]]

abstracting: (p20<=p19)
states: 9,454,274,004 (9)
abstracting: (1<=p8)
states: 7,428,358,146 (9)
abstracting: (p4<=p14)
states: 7,031,698,245 (9)
abstracting: (3<=p17)
states: 2,363,568,501 (9)
abstracting: (p23<=p20)
states: 6,721,363,777 (9)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: [~ [[[2<=p | p1<=p] & ~ [[p17<=p8 | p9<=p23]]]] & ~ [[3<=p4 | EG [p2<=p8]]]]
normalized: [~ [[~ [[p17<=p8 | p9<=p23]] & [2<=p | p1<=p]]] & ~ [[3<=p4 | EG [p2<=p8]]]]

abstracting: (p2<=p8)
states: 6,977,061,895 (9)
................
EG iterations: 16
abstracting: (3<=p4)
states: 4,502,035,240 (9)
abstracting: (p1<=p)
states: 4,839,687,883 (9)
abstracting: (2<=p)
states: 0
abstracting: (p9<=p23)
states: 6,215,431,176 (9)
abstracting: (p17<=p8)
states: 6,977,061,895 (9)
-> the formula is FALSE

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

MC time: 0m 0.047sec

totally nodes used: 656107 (6.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1212078 869922 2082000
used/not used/entry size/cache size: 1346033 65762831 16 1024MB
basic ops cache: hits/miss/sum: 528700 322081 850781
used/not used/entry size/cache size: 662944 16114272 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: 27002 15062 42064
used/not used/entry size/cache size: 15054 8373554 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 66527560
1 560653
2 14914
3 2075
4 430
5 218
6 169
7 166
8 100
9 252
>= 10 2327

Total processing time: 0m 6.558sec


BK_STOP 1496737792124

--------------------
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:436 (10), effective:100 (2)

initing FirstDep: 0m 0.000sec


iterations count:189 (4), effective:49 (1)

iterations count:54 (1), effective:2 (0)

iterations count:108 (2), effective:25 (0)

iterations count:57 (1), effective:9 (0)

iterations count:170 (4), effective:45 (1)

iterations count:80 (1), effective:12 (0)

iterations count:186 (4), effective:51 (1)

iterations count:305 (7), effective:36 (0)

iterations count:55 (1), effective:4 (0)

iterations count:163 (3), effective:47 (1)

iterations count:133 (3), effective:30 (0)

iterations count:85 (2), effective:19 (0)

iterations count:98 (2), effective:16 (0)

iterations count:181 (4), effective:39 (0)

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-0005"
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-0005.tgz
mv JoinFreeModules-PT-0005 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-0005, 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-149581061600021"
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 ;