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 RobotManipulation-PT-00002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r201-smll-149581161700205
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495923868951

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: RobotManipulation_PT_00002
(NrP: 15 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 1.452sec

parse successfull
net created successfully

Net: RobotManipulation_PT_00002
(NrP: 15 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 4.131sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 301 (3.0e+02) #states 1,430 (3)



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

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

abstracting: (3<=moved)
states: 20
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

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

abstracting: (p_sc<=p_sc)
states: 1,430 (3)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (initialized<=access)
states: 1,430 (3)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[3<=p_rel & [2<=p_i2 | 3<=access]]]]
normalized: ~ [E [true U [[2<=p_i2 | 3<=access] & 3<=p_rel]]]

abstracting: (3<=p_rel)
states: 20
abstracting: (3<=access)
states: 490
abstracting: (2<=p_i2)
states: 650
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[2<=p_i1 & access<=moved] & 3<=p_sc]]]
normalized: ~ [E [true U [[2<=p_i1 & access<=moved] & 3<=p_sc]]]

abstracting: (3<=p_sc)
states: 20
abstracting: (access<=moved)
states: 320
abstracting: (2<=p_i1)
states: 440
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [2<=off] | [1<=access | initialize<=p_i1]]]]
normalized: E [true U ~ [[[1<=access | initialize<=p_i1] | ~ [2<=off]]]]

abstracting: (2<=off)
states: 200
abstracting: (initialize<=p_i1)
states: 813
abstracting: (1<=access)
states: 1,290 (3)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[3<=p_rdy & 3<=p_i2] | ~ [2<=moved]] & ~ [initialize<=initialize]]]
normalized: E [true U [~ [initialize<=initialize] & [~ [2<=moved] | [3<=p_rdy & 3<=p_i2]]]]

abstracting: (3<=p_i2)
states: 290
abstracting: (3<=p_rdy)
states: 20
abstracting: (2<=moved)
states: 110
abstracting: (initialize<=initialize)
states: 1,430 (3)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[moved<=p_m & r_stopped<=r_moving] | [p_m<=p_m | 2<=p_i1]]]]
normalized: E [true U ~ [[[p_m<=p_m | 2<=p_i1] | [moved<=p_m & r_stopped<=r_moving]]]]

abstracting: (r_stopped<=r_moving)
states: 946
abstracting: (moved<=p_m)
states: 1,430 (3)
abstracting: (2<=p_i1)
states: 440
abstracting: (p_m<=p_m)
states: 1,430 (3)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[p_m<=r_active & 1<=move] & r_active<=p_sc] & ~ [initialize<=moved]]]
normalized: E [true U [~ [initialize<=moved] & [[p_m<=r_active & 1<=move] & r_active<=p_sc]]]

abstracting: (r_active<=p_sc)
states: 50
abstracting: (1<=move)
states: 440
abstracting: (p_m<=r_active)
states: 1,326 (3)
abstracting: (initialize<=moved)
states: 677
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[[p_i2<=move | p_rel<=r_active] | [p_i2<=initialize & 2<=move]]]]
normalized: E [true U ~ [[[p_i2<=initialize & 2<=move] | [p_i2<=move | p_rel<=r_active]]]]

abstracting: (p_rel<=r_active)
states: 1,430 (3)
abstracting: (p_i2<=move)
states: 510
abstracting: (2<=move)
states: 110
abstracting: (p_i2<=initialize)
states: 990
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [[1<=move | p_rdy<=initialize]] & [[3<=p_m & r_active<=p_rel] | 3<=moved]]]
normalized: E [true U [[3<=moved | [3<=p_m & r_active<=p_rel]] & ~ [[1<=move | p_rdy<=initialize]]]]

abstracting: (p_rdy<=initialize)
states: 1,218 (3)
abstracting: (1<=move)
states: 440
abstracting: (r_active<=p_rel)
states: 50
abstracting: (3<=p_m)
states: 170
abstracting: (3<=moved)
states: 20
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[2<=r_moving & r_active<=moved] | [initialize<=r_active & 3<=r_stopped]] & 2<=p_rel]]
normalized: E [true U [2<=p_rel & [[initialize<=r_active & 3<=r_stopped] | [2<=r_moving & r_active<=moved]]]]

abstracting: (r_active<=moved)
states: 50
abstracting: (2<=r_moving)
states: 110
abstracting: (3<=r_stopped)
states: 47
abstracting: (initialize<=r_active)
states: 1,314 (3)
abstracting: (2<=p_rel)
states: 110
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[3<=initialized & 2<=p_rel]] & [2<=r_active | [off<=p_m | r_moving<=p_m]]]]
normalized: ~ [E [true U ~ [[~ [[3<=initialized & 2<=p_rel]] & [2<=r_active | [off<=p_m | r_moving<=p_m]]]]]]

abstracting: (r_moving<=p_m)
states: 1,430 (3)
abstracting: (off<=p_m)
states: 1,128 (3)
abstracting: (2<=r_active)
states: 1,308 (3)
abstracting: (2<=p_rel)
states: 110
abstracting: (3<=initialized)
states: 20
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[access<=moved | p_m<=access] | [p_rdy<=initialize | 1<=p_i2]] | ~ [2<=initialize]]]
normalized: ~ [E [true U ~ [[[[access<=moved | p_m<=access] | [p_rdy<=initialize | 1<=p_i2]] | ~ [2<=initialize]]]]]

abstracting: (2<=initialize)
states: 440
abstracting: (1<=p_i2)
states: 1,100 (3)
abstracting: (p_rdy<=initialize)
states: 1,218 (3)
abstracting: (p_m<=access)
states: 1,080 (3)
abstracting: (access<=moved)
states: 320
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[r_active<=p_rdy & [initialize<=moved & 2<=access]] & [[2<=move & p_m<=initialize] | 3<=off]]]
normalized: E [true U [[r_active<=p_rdy & [initialize<=moved & 2<=access]] & [3<=off | [2<=move & p_m<=initialize]]]]

abstracting: (p_m<=initialize)
states: 840
abstracting: (2<=move)
states: 110
abstracting: (3<=off)
states: 47
abstracting: (2<=access)
states: 940
abstracting: (initialize<=moved)
states: 677
abstracting: (r_active<=p_rdy)
states: 50
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[1<=r_stopped & p_rel<=access] | [p_i1<=p_rel & p_rel<=p_rdy]] | r_stopped<=p_i2]]
normalized: ~ [E [true U ~ [[r_stopped<=p_i2 | [[1<=r_stopped & p_rel<=access] | [p_i1<=p_rel & p_rel<=p_rdy]]]]]]

abstracting: (p_rel<=p_rdy)
states: 1,082 (3)
abstracting: (p_i1<=p_rel)
states: 677
abstracting: (p_rel<=access)
states: 1,310 (3)
abstracting: (1<=r_stopped)
states: 605
abstracting: (r_stopped<=p_i2)
states: 1,256 (3)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 5788 (5.8e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7084 9744 16828
used/not used/entry size/cache size: 11328 67097536 16 1024MB
basic ops cache: hits/miss/sum: 7061 15197 22258
used/not used/entry size/cache size: 25110 16752106 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: 2334 3186 5520
used/not used/entry size/cache size: 3186 8385422 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 67103454
1 5276
2 52
3 25
4 8
5 19
6 15
7 8
8 3
9 4
>= 10 0

Total processing time: 0m 7.915sec


BK_STOP 1495923876990

--------------------
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:181 (16), effective:41 (3)

initing FirstDep: 0m 0.000sec


iterations count:110 (10), effective:27 (2)

iterations count:163 (14), effective:35 (3)

iterations count:165 (15), effective:40 (3)

iterations count:165 (15), effective:37 (3)

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="RobotManipulation-PT-00002"
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/RobotManipulation-PT-00002.tgz
mv RobotManipulation-PT-00002 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 RobotManipulation-PT-00002, 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 r201-smll-149581161700205"
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 ;