About the Execution of MARCIE for RobotManipulation-PT-00010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7616.360 | 14256.00 | 14009.00 | 30.20 | TTFTTFFTTFFFFFTT | normal |
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-00010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r201-smll-149581161700219
=====================================================================
--------------------
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-00010-CTLCardinality-0
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-1
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-15
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-2
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-3
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-4
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-5
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-6
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-7
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-8
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1495924193510
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_00010
(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.146sec
parse successfull
net created successfully
Net: RobotManipulation_PT_00010
(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.806sec
RS generation: 0m 0.123sec
-> reachability set: #nodes 9437 (9.4e+03) #states 20,030,010 (7)
starting MCC model checker
--------------------------
checking: AG [EF [~ [1<=r_stopped]]]
normalized: ~ [E [true U ~ [E [true U ~ [1<=r_stopped]]]]]
abstracting: (1<=r_stopped)
states: 16,033,875 (7)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.556sec
checking: EG [AG [~ [3<=p_rel]]]
normalized: EG [~ [E [true U 3<=p_rel]]]
abstracting: (3<=p_rel)
states: 6,249,100 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.149sec
checking: EF [AG [[1<=p_sc & 3<=moved]]]
normalized: E [true U ~ [E [true U ~ [[1<=p_sc & 3<=moved]]]]]
abstracting: (3<=moved)
states: 6,249,100 (6)
abstracting: (1<=p_sc)
states: 13,813,800 (7)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.099sec
checking: EG [E [2<=r_stopped U access<=r_moving]]
normalized: EG [E [2<=r_stopped U access<=r_moving]]
abstracting: (access<=r_moving)
states: 1,400,256 (6)
abstracting: (2<=r_stopped)
states: 12,498,200 (7)
.......................
EG iterations: 23
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.558sec
checking: AG [AF [[initialized<=p_i2 | 3<=p_m]]]
normalized: ~ [E [true U EG [~ [[initialized<=p_i2 | 3<=p_m]]]]]
abstracting: (3<=p_m)
states: 16,891,798 (7)
abstracting: (initialized<=p_i2)
states: 20,030,010 (7)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: [EF [AG [3<=r_stopped]] & off<=initialized]
normalized: [off<=initialized & E [true U ~ [E [true U ~ [3<=r_stopped]]]]]
abstracting: (3<=r_stopped)
states: 9,493,825 (6)
abstracting: (off<=initialized)
states: 9,392,526 (6)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.281sec
checking: ~ [[EF [~ [move<=p_i1]] | 3<=moved]]
normalized: ~ [[3<=moved | E [true U ~ [move<=p_i1]]]]
abstracting: (move<=p_i1)
states: 14,254,526 (7)
abstracting: (3<=moved)
states: 6,249,100 (6)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.420sec
checking: A [~ [~ [2<=p_m]] U EF [p_i1<=r_moving]]
normalized: [~ [EG [~ [E [true U p_i1<=r_moving]]]] & ~ [E [~ [E [true U p_i1<=r_moving]] U [~ [2<=p_m] & ~ [E [true U p_i1<=r_moving]]]]]]
abstracting: (p_i1<=r_moving)
states: 8,342,763 (6)
abstracting: (2<=p_m)
states: 18,506,950 (7)
abstracting: (p_i1<=r_moving)
states: 8,342,763 (6)
abstracting: (p_i1<=r_moving)
states: 8,342,763 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.304sec
checking: [E [~ [3<=p_i2] U 3<=p_rel] | 1<=p_rel]
normalized: [1<=p_rel | E [~ [3<=p_i2] U 3<=p_rel]]
abstracting: (3<=p_rel)
states: 6,249,100 (6)
abstracting: (3<=p_i2)
states: 15,622,750 (7)
abstracting: (1<=p_rel)
states: 13,813,800 (7)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.044sec
checking: AG [E [2<=p_i2 U r_moving<=access]]
normalized: ~ [E [true U ~ [E [2<=p_i2 U r_moving<=access]]]]
abstracting: (r_moving<=access)
states: 19,034,730 (7)
abstracting: (2<=p_i2)
states: 17,596,150 (7)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.924sec
checking: E [off<=initialized U EF [r_stopped<=p_m]]
normalized: E [off<=initialized U E [true U r_stopped<=p_m]]
abstracting: (r_stopped<=p_m)
states: 15,501,200 (7)
abstracting: (off<=initialized)
states: 9,392,526 (6)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.129sec
checking: EF [~ [[initialized<=initialized | [r_stopped<=r_stopped | initialized<=p_rdy]]]]
normalized: E [true U ~ [[initialized<=initialized | [r_stopped<=r_stopped | initialized<=p_rdy]]]]
abstracting: (initialized<=p_rdy)
states: 11,823,526 (7)
abstracting: (r_stopped<=r_stopped)
states: 20,030,010 (7)
abstracting: (initialized<=initialized)
states: 20,030,010 (7)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.074sec
checking: [~ [move<=p_rdy] | [EF [[2<=p_rel & 1<=r_moving]] | EG [~ [off<=initialized]]]]
normalized: [[EG [~ [off<=initialized]] | E [true U [2<=p_rel & 1<=r_moving]]] | ~ [move<=p_rdy]]
abstracting: (move<=p_rdy)
states: 11,823,526 (7)
abstracting: (1<=r_moving)
states: 13,813,800 (7)
abstracting: (2<=p_rel)
states: 9,373,650 (6)
abstracting: (off<=initialized)
states: 9,392,526 (6)
.......................
EG iterations: 23
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.309sec
checking: [AX [EX [initialized<=p_i2]] & [AF [1<=r_active] & E [r_moving<=p_sc U initialized<=initialize]]]
normalized: [[E [r_moving<=p_sc U initialized<=initialize] & ~ [EG [~ [1<=r_active]]]] & ~ [EX [~ [EX [initialized<=p_i2]]]]]
abstracting: (initialized<=p_i2)
states: 20,030,010 (7)
..abstracting: (1<=r_active)
states: 20,029,758 (7)
.......................
EG iterations: 23
abstracting: (initialized<=initialize)
states: 14,254,526 (7)
abstracting: (r_moving<=p_sc)
states: 11,823,526 (7)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.902sec
checking: [[[[p_sc<=initialized & 3<=move] & 2<=r_stopped] | AG [[2<=r_stopped | p_sc<=r_moving]]] & initialize<=p_m]
normalized: [initialize<=p_m & [~ [E [true U ~ [[2<=r_stopped | p_sc<=r_moving]]]] | [2<=r_stopped & [p_sc<=initialized & 3<=move]]]]
abstracting: (3<=move)
states: 6,249,100 (6)
abstracting: (p_sc<=initialized)
states: 11,823,526 (7)
abstracting: (2<=r_stopped)
states: 12,498,200 (7)
abstracting: (p_sc<=r_moving)
states: 11,823,526 (7)
abstracting: (2<=r_stopped)
states: 12,498,200 (7)
abstracting: (initialize<=p_m)
states: 14,779,622 (7)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.640sec
checking: [[[AG [2<=p_rdy] & ~ [[2<=p_i1 & 1<=p_i2]]] | AG [[2<=r_stopped | access<=p_rel]]] | ~ [[EX [3<=r_active] | move<=move]]]
normalized: [~ [[move<=move | EX [3<=r_active]]] | [~ [E [true U ~ [[2<=r_stopped | access<=p_rel]]]] | [~ [[2<=p_i1 & 1<=p_i2]] & ~ [E [true U ~ [2<=p_rdy]]]]]]
abstracting: (2<=p_rdy)
states: 9,373,650 (6)
abstracting: (1<=p_i2)
states: 19,141,980 (7)
abstracting: (2<=p_i1)
states: 13,813,800 (7)
abstracting: (access<=p_rel)
states: 1,400,256 (6)
abstracting: (2<=r_stopped)
states: 12,498,200 (7)
abstracting: (3<=r_active)
states: 20,022,124 (7)
.abstracting: (move<=move)
states: 20,030,010 (7)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.302sec
totally nodes used: 1174246 (1.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7121733 3188159 10309892
used/not used/entry size/cache size: 3860656 63248208 16 1024MB
basic ops cache: hits/miss/sum: 3384392 1771009 5155401
used/not used/entry size/cache size: 2745053 14032163 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: 374600 184609 559209
used/not used/entry size/cache size: 182587 8206021 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 66120127
1 926219
2 36271
3 14609
4 2066
5 1551
6 991
7 1256
8 816
9 600
>= 10 4358
Total processing time: 0m14.142sec
BK_STOP 1495924207766
--------------------
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.001sec
iterations count:853 (77), effective:201 (18)
initing FirstDep: 0m 0.000sec
iterations count:131 (11), effective:40 (3)
iterations count:128 (11), effective:27 (2)
iterations count:181 (16), effective:17 (1)
iterations count:357 (32), effective:106 (9)
iterations count:119 (10), effective:36 (3)
iterations count:93 (8), effective:29 (2)
iterations count:63 (5), effective:31 (2)
iterations count:63 (5), effective:31 (2)
iterations count:63 (5), effective:31 (2)
iterations count:128 (11), effective:27 (2)
iterations count:47 (4), effective:18 (1)
iterations count:464 (42), effective:140 (12)
iterations count:131 (11), effective:40 (3)
iterations count:11 (1), effective:0 (0)
iterations count:130 (11), effective:27 (2)
iterations count:107 (9), effective:29 (2)
iterations count:190 (17), effective:64 (5)
iterations count:87 (7), effective:19 (1)
iterations count:192 (17), effective:53 (4)
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-00010"
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-00010.tgz
mv RobotManipulation-PT-00010 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-00010, 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-149581161700219"
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 '
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 ;