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-00020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r201-smll-149581161800228
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495924418887

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: RobotManipulation_PT_00020
(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.159sec

parse successfull
net created successfully

Net: RobotManipulation_PT_00020
(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 3.825sec


RS generation: 0m 1.033sec


-> reachability set: #nodes 58057 (5.8e+04) #states 4,108,911,268 (9)



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

checking: ~ [AF [1<=p_rdy]]
normalized: EG [~ [1<=p_rdy]]

abstracting: (1<=p_rdy)
states: 3,354,213,280 (9)
...................................................................................................................................................................
EG iterations: 163
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 9.333sec

checking: EF [AG [~ [p_rdy<=initialize]]]
normalized: E [true U ~ [E [true U p_rdy<=initialize]]]

abstracting: (p_rdy<=initialize)
states: 2,769,140,660 (9)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.985sec

checking: E [~ [3<=p_m] U AG [2<=move]]
normalized: E [~ [3<=p_m] U ~ [E [true U ~ [2<=move]]]]

abstracting: (2<=move)
states: 2,725,298,290 (9)
abstracting: (3<=p_m)
states: 3,956,598,646 (9)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.760sec

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

abstracting: (move<=p_m)
states: 4,108,911,268 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.148sec

checking: AG [[~ [~ [r_active<=access]] | 1<=off]]
normalized: ~ [E [true U ~ [[r_active<=access | 1<=off]]]]

abstracting: (1<=off)
states: 3,668,670,775 (9)
abstracting: (r_active<=access)
states: 651,682,460 (8)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.580sec

checking: EF [AG [[access<=p_i1 & p_i2<=access]]]
normalized: E [true U ~ [E [true U ~ [[access<=p_i1 & p_i2<=access]]]]]

abstracting: (p_i2<=access)
states: 4,046,019,769 (9)
abstracting: (access<=p_i1)
states: 35,023,758 (7)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.572sec

checking: ~ [~ [AG [[moved<=r_stopped | r_stopped<=r_moving]]]]
normalized: ~ [E [true U ~ [[moved<=r_stopped | r_stopped<=r_moving]]]]

abstracting: (r_stopped<=r_moving)
states: 1,751,068,660 (9)
abstracting: (moved<=r_stopped)
states: 2,675,471,964 (9)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.520sec

checking: E [initialize<=r_stopped U [[3<=r_stopped & 1<=p_sc] & access<=p_sc]]
normalized: E [initialize<=r_stopped U [access<=p_sc & [3<=r_stopped & 1<=p_sc]]]

abstracting: (1<=p_sc)
states: 3,354,213,280 (9)
abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)
abstracting: (access<=p_sc)
states: 205,036,260 (8)
abstracting: (initialize<=r_stopped)
states: 2,054,455,634 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.820sec

checking: EF [~ [[p_i1<=p_i1 & [p_i2<=access | p_rel<=p_sc]]]]
normalized: E [true U ~ [[p_i1<=p_i1 & [p_i2<=access | p_rel<=p_sc]]]]

abstracting: (p_rel<=p_sc)
states: 2,260,104,660 (9)
abstracting: (p_i2<=access)
states: 4,046,019,769 (9)
abstracting: (p_i1<=p_i1)
states: 4,108,911,268 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.121sec

checking: [~ [A [initialized<=access U 1<=initialized]] & EX [[2<=r_stopped & ~ [access<=move]]]]
normalized: [EX [[2<=r_stopped & ~ [access<=move]]] & ~ [[~ [EG [~ [1<=initialized]]] & ~ [E [~ [1<=initialized] U [~ [initialized<=access] & ~ [1<=initialized]]]]]]]

abstracting: (1<=initialized)
states: 3,354,213,280 (9)
abstracting: (initialized<=access)
states: 4,108,911,268 (9)
abstracting: (1<=initialized)
states: 3,354,213,280 (9)
abstracting: (1<=initialized)
states: 3,354,213,280 (9)
...................................................................................
EG iterations: 83
abstracting: (access<=move)
states: 205,036,260 (8)
abstracting: (2<=r_stopped)
states: 3,247,163,920 (9)
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.224sec

checking: [A [2<=r_stopped U [1<=p_rdy & 3<=r_stopped]] | ~ [EF [[r_moving<=off & 2<=initialized]]]]
normalized: [~ [E [true U [r_moving<=off & 2<=initialized]]] | [~ [EG [~ [[1<=p_rdy & 3<=r_stopped]]]] & ~ [E [~ [[1<=p_rdy & 3<=r_stopped]] U [~ [2<=r_stopped] & ~ [[1<=p_rdy & 3<=r_stopped]]]]]]]

abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)
abstracting: (1<=p_rdy)
states: 3,354,213,280 (9)
abstracting: (2<=r_stopped)
states: 3,247,163,920 (9)
abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)
abstracting: (1<=p_rdy)
states: 3,354,213,280 (9)
abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)
abstracting: (1<=p_rdy)
states: 3,354,213,280 (9)
.
EG iterations: 1
abstracting: (2<=initialized)
states: 2,725,298,290 (9)
abstracting: (r_moving<=off)
states: 2,675,471,964 (9)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.062sec

checking: [p_rel<=initialize & AG [[[1<=p_sc | 2<=p_i1] | [1<=p_i2 & 3<=off]]]]
normalized: [p_rel<=initialize & ~ [E [true U ~ [[[1<=p_i2 & 3<=off] | [1<=p_sc | 2<=p_i1]]]]]]

abstracting: (2<=p_i1)
states: 3,354,213,280 (9)
abstracting: (1<=p_sc)
states: 3,354,213,280 (9)
abstracting: (3<=off)
states: 2,850,092,245 (9)
abstracting: (1<=p_i2)
states: 4,046,019,769 (9)
abstracting: (p_rel<=initialize)
states: 2,769,140,660 (9)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00020-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.012sec

checking: A [[[p_i1<=off | initialized<=p_i2] | ~ [initialize<=initialized]] U EX [1<=p_sc]]
normalized: [~ [EG [~ [EX [1<=p_sc]]]] & ~ [E [~ [EX [1<=p_sc]] U [~ [[~ [initialize<=initialized] | [p_i1<=off | initialized<=p_i2]]] & ~ [EX [1<=p_sc]]]]]]

abstracting: (1<=p_sc)
states: 3,354,213,280 (9)
.abstracting: (initialized<=p_i2)
states: 4,108,911,268 (9)
abstracting: (p_i1<=off)
states: 2,054,455,634 (9)
abstracting: (initialize<=initialized)
states: 1,639,088,330 (9)
abstracting: (1<=p_sc)
states: 3,354,213,280 (9)
.abstracting: (1<=p_sc)
states: 3,354,213,280 (9)
............................................................................................................................
EG iterations: 123
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.590sec

checking: [~ [AG [[3<=r_active | p_sc<=r_stopped]]] & AX [[[initialized<=r_stopped & 3<=r_stopped] | r_moving<=p_i1]]]
normalized: [~ [EX [~ [[r_moving<=p_i1 | [initialized<=r_stopped & 3<=r_stopped]]]]] & E [true U ~ [[3<=r_active | p_sc<=r_stopped]]]]

abstracting: (p_sc<=r_stopped)
states: 2,675,471,964 (9)
abstracting: (3<=r_active)
states: 4,108,881,062 (9)
abstracting: (3<=r_stopped)
states: 2,850,092,245 (9)
abstracting: (initialized<=r_stopped)
states: 2,675,471,964 (9)
abstracting: (r_moving<=p_i1)
states: 2,769,140,660 (9)
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.853sec

checking: [EF [AG [1<=move]] | [AX [~ [r_stopped<=off]] & [[[p_sc<=r_moving & 3<=initialize] & 3<=r_moving] | EF [p_i1<=p_rel]]]]
normalized: [[[E [true U p_i1<=p_rel] | [3<=r_moving & [p_sc<=r_moving & 3<=initialize]]] & ~ [EX [r_stopped<=off]]] | E [true U ~ [E [true U ~ [1<=move]]]]]

abstracting: (1<=move)
states: 3,354,213,280 (9)
abstracting: (r_stopped<=off)
states: 2,166,435,964 (9)
.abstracting: (3<=initialize)
states: 2,986,231,105 (9)
abstracting: (p_sc<=r_moving)
states: 2,260,104,660 (9)
abstracting: (3<=r_moving)
states: 2,203,432,660 (9)
abstracting: (p_i1<=p_rel)
states: 1,639,088,330 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.265sec

checking: [~ [E [p_i1<=p_m U p_rdy<=p_m]] | [[[[p_i1<=access | r_stopped<=move] | off<=moved] | AF [3<=p_sc]] & [2<=p_rdy | EF [r_stopped<=initialize]]]]
normalized: [[[2<=p_rdy | E [true U r_stopped<=initialize]] & [~ [EG [~ [3<=p_sc]]] | [off<=moved | [p_i1<=access | r_stopped<=move]]]] | ~ [E [p_i1<=p_m U p_rdy<=p_m]]]

abstracting: (p_rdy<=p_m)
states: 3,548,819,868 (9)
abstracting: (p_i1<=p_m)
states: 3,109,533,438 (9)
abstracting: (r_stopped<=move)
states: 1,751,068,660 (9)
abstracting: (p_i1<=access)
states: 4,099,544,449 (9)
abstracting: (off<=moved)
states: 1,751,068,660 (9)
abstracting: (3<=p_sc)
states: 2,203,432,660 (9)
.
EG iterations: 1
abstracting: (r_stopped<=initialize)
states: 2,431,804,628 (9)
abstracting: (2<=p_rdy)
states: 2,725,298,290 (9)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00020-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.288sec

totally nodes used: 20926908 (2.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 170138643 59584483 229723126
used/not used/entry size/cache size: 43155322 23953542 16 1024MB
basic ops cache: hits/miss/sum: 65893600 26264598 92158198
used/not used/entry size/cache size: 14724907 2052309 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: 7614160 2382516 9996676
used/not used/entry size/cache size: 2055084 6333524 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 50814949
1 13607391
2 2090110
3 395090
4 95179
5 26333
6 16266
7 10259
8 6958
9 6145
>= 10 40184

Total processing time: 3m16.342sec


BK_STOP 1495924615441

--------------------
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:1693 (153), effective:401 (36)

initing FirstDep: 0m 0.000sec


iterations count:131 (11), effective:40 (3)

iterations count:50 (4), effective:39 (3)

iterations count:475 (43), effective:161 (14)

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

iterations count:429 (39), effective:155 (14)

iterations count:496 (45), effective:136 (12)

iterations count:676 (61), effective:127 (11)

iterations count:245 (22), effective:78 (7)

iterations count:167 (15), effective:56 (5)

iterations count:605 (55), effective:118 (10)

iterations count:1643 (149), effective:363 (33)

iterations count:51 (4), effective:40 (3)

iterations count:93 (8), effective:41 (3)

iterations count:354 (32), effective:114 (10)

iterations count:91 (8), effective:40 (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-00020"
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/RobotManipulation-PT-00020.tgz
mv RobotManipulation-PT-00020 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-00020, 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 r201-smll-149581161800228"
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 ;