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_Eratosthenes-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441598900331
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494878789441

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: Eratosthenes_PT_010
(NrP: 9 NrTr: 8 NrArc: 24)

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

net check time: 0m 0.000sec

init dd package: 0m 1.151sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 9 (9.0e+00) #states 32



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

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

abstracting: (1<=p2)
states: 32
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p6<=p5)
states: 32
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p10<=p5)
states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p7<=p4)
states: 16
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [p9<=p2] | 2<=p3]]
normalized: ~ [E [true U ~ [[2<=p3 | ~ [p9<=p2]]]]]

abstracting: (p9<=p2)
states: 32
abstracting: (2<=p3)
states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [~ [2<=p3]] & [[2<=p5 & 3<=p10] | ~ [2<=p8]]]]
normalized: E [true U [[~ [2<=p8] | [2<=p5 & 3<=p10]] & 2<=p3]]

abstracting: (2<=p3)
states: 0
abstracting: (3<=p10)
states: 0
abstracting: (2<=p5)
states: 0
abstracting: (2<=p8)
states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [1<=p8] | [~ [1<=p9] | ~ [p9<=p6]]]]
normalized: ~ [E [true U ~ [[[~ [p9<=p6] | ~ [1<=p9]] | ~ [1<=p8]]]]]

abstracting: (1<=p8)
states: 16
abstracting: (1<=p9)
states: 16
abstracting: (p9<=p6)
states: 24
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [~ [1<=p2]] & [1<=p5 | [1<=p2 | p2<=p8]]]]
normalized: E [true U [[[1<=p2 | p2<=p8] | 1<=p5] & 1<=p2]]

abstracting: (1<=p2)
states: 32
abstracting: (1<=p5)
states: 32
abstracting: (p2<=p8)
states: 16
abstracting: (1<=p2)
states: 32
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[p4<=p5 & p5<=p10]] | ~ [~ [3<=p10]]]]
normalized: ~ [E [true U ~ [[~ [[p4<=p5 & p5<=p10]] | 3<=p10]]]]

abstracting: (3<=p10)
states: 0
abstracting: (p5<=p10)
states: 16
abstracting: (p4<=p5)
states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[p10<=p5 | p5<=p10] & p2<=p10]]]
normalized: E [true U ~ [[[p10<=p5 | p5<=p10] & p2<=p10]]]

abstracting: (p2<=p10)
states: 16
abstracting: (p5<=p10)
states: 16
abstracting: (p10<=p5)
states: 32
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[1<=p2 & 1<=p6]] & [[p10<=p6 | p7<=p8] & ~ [1<=p8]]]]
normalized: E [true U [[~ [1<=p8] & [p10<=p6 | p7<=p8]] & ~ [[1<=p2 & 1<=p6]]]]

abstracting: (1<=p6)
states: 16
abstracting: (1<=p2)
states: 32
abstracting: (p7<=p8)
states: 16
abstracting: (p10<=p6)
states: 24
abstracting: (1<=p8)
states: 16
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[p7<=p3 | 3<=p7] | [2<=p4 & p6<=p3]] | ~ [~ [p2<=p6]]]]
normalized: E [true U [[[2<=p4 & p6<=p3] | [p7<=p3 | 3<=p7]] | p2<=p6]]

abstracting: (p2<=p6)
states: 16
abstracting: (3<=p7)
states: 0
abstracting: (p7<=p3)
states: 32
abstracting: (p6<=p3)
states: 32
abstracting: (2<=p4)
states: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[p5<=p7 & p7<=p2] & [p5<=p7 | p8<=p8]]]]
normalized: ~ [E [true U [[p5<=p7 | p8<=p8] & [p5<=p7 & p7<=p2]]]]

abstracting: (p7<=p2)
states: 32
abstracting: (p5<=p7)
states: 32
abstracting: (p8<=p8)
states: 32
abstracting: (p5<=p7)
states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p3<=p2)
states: 32
abstracting: (p2<=p3)
states: 32
abstracting: (p6<=p5)
states: 32
abstracting: (2<=p5)
states: 0
abstracting: (1<=p8)
states: 16
abstracting: (1<=p10)
states: 16
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[p10<=p9 | 3<=p3] | 3<=p10] | [[2<=p6 | 2<=p6] & [1<=p6 & p3<=p5]]]]
normalized: ~ [E [true U ~ [[[[1<=p6 & p3<=p5] & [2<=p6 | 2<=p6]] | [[p10<=p9 | 3<=p3] | 3<=p10]]]]]

abstracting: (3<=p10)
states: 0
abstracting: (3<=p3)
states: 0
abstracting: (p10<=p9)
states: 24
abstracting: (2<=p6)
states: 0
abstracting: (2<=p6)
states: 0
abstracting: (p3<=p5)
states: 32
abstracting: (1<=p6)
states: 16
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[2<=p6 | 1<=p4] | [p8<=p5 & p4<=p7]] | [[3<=p4 | p8<=p8] | [2<=p3 | 1<=p9]]]]
normalized: ~ [E [true U ~ [[[[2<=p3 | 1<=p9] | [3<=p4 | p8<=p8]] | [[p8<=p5 & p4<=p7] | [2<=p6 | 1<=p4]]]]]]

abstracting: (1<=p4)
states: 16
abstracting: (2<=p6)
states: 0
abstracting: (p4<=p7)
states: 32
abstracting: (p8<=p5)
states: 32
abstracting: (p8<=p8)
states: 32
abstracting: (3<=p4)
states: 0
abstracting: (1<=p9)
states: 16
abstracting: (2<=p3)
states: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 386(3.9e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 216 259 475
used/not used/entry size/cache size: 247 67108617 16 1024MB
basic ops cache: hits/miss/sum: 624 537 1161
used/not used/entry size/cache size: 1095 16776121 12 192MB
unary ops cache: hits/miss/sum: 0 36 36
used/not used/entry size/cache size: 36 8388572 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 67 34 101
used/not used/entry size/cache size: 34 2097118 32 64MB
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 67108478
1 386
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.804sec


BK_STOP 1494878791275

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p7

The net has transition(s) that can never fire:


check for constant places
p2
p3
p7
p5
found 4 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:28 (3), effective:5 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

iterations count:10 (1), effective:1 (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="S_Eratosthenes-PT-010"
export BK_EXAMINATION="ReachabilityCardinality"
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_Eratosthenes-PT-010.tgz
mv S_Eratosthenes-PT-010 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_Eratosthenes-PT-010, examination is ReachabilityCardinality"
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-149441598900331"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;