About the Execution of MARCIE for RobotManipulation-PT-00005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7483.860 | 8213.00 | 8020.00 | 29.70 | FTTTFTFFTFFFFTTT | 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-00005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r201-smll-149581161700214
=====================================================================
--------------------
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-00005-ReachabilityCardinality-0
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-1
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-10
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-11
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-12
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-13
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-14
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-15
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-2
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-3
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-4
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-5
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-6
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-7
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-8
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1495924071671
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_00005
(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.345sec
parse successfull
net created successfully
Net: RobotManipulation_PT_00005
(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.060sec
RS generation: 0m 0.019sec
-> reachability set: #nodes 1827 (1.8e+03) #states 184,756 (5)
starting MCC model checker
--------------------------
checking: EF [~ [~ [3<=r_moving]]]
normalized: E [true U 3<=r_moving]
abstracting: (3<=r_moving)
states: 22,880 (4)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.061sec
checking: EF [~ [move<=r_active]]
normalized: E [true U ~ [move<=r_active]]
abstracting: (move<=r_active)
states: 184,756 (5)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [~ [[access<=access | 3<=p_i1]]]]
normalized: ~ [E [true U ~ [[access<=access | 3<=p_i1]]]]
abstracting: (3<=p_i1)
states: 61,490 (4)
abstracting: (access<=access)
states: 184,756 (5)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[~ [[2<=p_sc & access<=p_rdy]] | ~ [~ [2<=move]]]]
normalized: ~ [E [true U ~ [[2<=move | ~ [[2<=p_sc & access<=p_rdy]]]]]]
abstracting: (access<=p_rdy)
states: 6,006 (3)
abstracting: (2<=p_sc)
states: 48,620 (4)
abstracting: (2<=move)
states: 48,620 (4)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: AG [~ [[[access<=r_moving & 3<=p_sc] & 3<=p_rel]]]
normalized: ~ [E [true U [3<=p_rel & [access<=r_moving & 3<=p_sc]]]]
abstracting: (3<=p_sc)
states: 22,880 (4)
abstracting: (access<=r_moving)
states: 20,504 (4)
abstracting: (3<=p_rel)
states: 22,880 (4)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: AG [~ [~ [[p_rel<=p_i1 | r_active<=initialized]]]]
normalized: ~ [E [true U ~ [[p_rel<=p_i1 | r_active<=initialized]]]]
abstracting: (r_active<=initialized)
states: 352
abstracting: (p_rel<=p_i1)
states: 141,544 (5)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EF [[access<=p_m & p_rel<=r_active]]
normalized: E [true U [access<=p_m & p_rel<=r_active]]
abstracting: (p_rel<=r_active)
states: 184,756 (5)
abstracting: (access<=p_m)
states: 62,854 (4)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: AG [[3<=r_stopped | [3<=p_i2 | [1<=move | initialize<=access]]]]
normalized: ~ [E [true U ~ [[3<=r_stopped | [3<=p_i2 | [1<=move | initialize<=access]]]]]]
abstracting: (initialize<=access)
states: 176,748 (5)
abstracting: (1<=move)
states: 97,240 (4)
abstracting: (3<=p_i2)
states: 100,100 (5)
abstracting: (3<=r_stopped)
states: 42,185 (4)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: EF [[3<=p_rel & [[3<=access | 1<=p_sc] & p_sc<=initialize]]]
normalized: E [true U [3<=p_rel & [p_sc<=initialize & [3<=access | 1<=p_sc]]]]
abstracting: (1<=p_sc)
states: 97,240 (4)
abstracting: (3<=access)
states: 160,754 (5)
abstracting: (p_sc<=initialize)
states: 141,544 (5)
abstracting: (3<=p_rel)
states: 22,880 (4)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EF [~ [[p_i2<=p_rel | [moved<=moved | r_active<=access]]]]
normalized: E [true U ~ [[p_i2<=p_rel | [moved<=moved | r_active<=access]]]]
abstracting: (r_active<=access)
states: 44,924 (4)
abstracting: (moved<=moved)
states: 184,756 (5)
abstracting: (p_i2<=p_rel)
states: 52,842 (4)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: AG [[1<=p_i2 | [initialized<=initialized | [initialize<=move & initialized<=p_i2]]]]
normalized: ~ [E [true U ~ [[1<=p_i2 | [initialized<=initialized | [initialize<=move & initialized<=p_i2]]]]]]
abstracting: (initialized<=p_i2)
states: 184,756 (5)
abstracting: (initialize<=move)
states: 81,372 (4)
abstracting: (initialized<=initialized)
states: 184,756 (5)
abstracting: (1<=p_i2)
states: 165,308 (5)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EF [~ [[[2<=access | move<=r_moving] | [r_stopped<=move & p_i1<=r_stopped]]]]
normalized: E [true U ~ [[[2<=access | move<=r_moving] | [r_stopped<=move & p_i1<=r_stopped]]]]
abstracting: (p_i1<=r_stopped)
states: 92,378 (4)
abstracting: (r_stopped<=move)
states: 99,144 (4)
abstracting: (move<=r_moving)
states: 120,344 (5)
abstracting: (2<=access)
states: 175,604 (5)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.052sec
checking: AG [[~ [[initialized<=p_rel | p_i1<=r_moving]] | [off<=access | ~ [access<=r_stopped]]]]
normalized: ~ [E [true U ~ [[~ [[initialized<=p_rel | p_i1<=r_moving]] | [off<=access | ~ [access<=r_stopped]]]]]]
abstracting: (access<=r_stopped)
states: 11,011 (4)
abstracting: (off<=access)
states: 184,756 (5)
abstracting: (p_i1<=r_moving)
states: 81,372 (4)
abstracting: (initialized<=p_rel)
states: 120,344 (5)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: EF [[[r_stopped<=off & [3<=off & p_i2<=access]] & [p_i2<=move & [2<=initialized | 3<=r_moving]]]]
normalized: E [true U [[p_i2<=move & [2<=initialized | 3<=r_moving]] & [r_stopped<=off & [3<=off & p_i2<=access]]]]
abstracting: (p_i2<=access)
states: 165,308 (5)
abstracting: (3<=off)
states: 42,185 (4)
abstracting: (r_stopped<=off)
states: 110,150 (5)
abstracting: (3<=r_moving)
states: 22,880 (4)
abstracting: (2<=initialized)
states: 48,620 (4)
abstracting: (p_i2<=move)
states: 52,842 (4)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.084sec
checking: AG [[[~ [p_i1<=p_m] & [r_moving<=r_moving | p_rel<=p_rdy]] | ~ [[1<=p_rel & p_m<=access]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p_rel & p_m<=access]] | [[r_moving<=r_moving | p_rel<=p_rdy] & ~ [p_i1<=p_m]]]]]]
abstracting: (p_i1<=p_m)
states: 131,234 (5)
abstracting: (p_rel<=p_rdy)
states: 120,344 (5)
abstracting: (r_moving<=r_moving)
states: 184,756 (5)
abstracting: (p_m<=access)
states: 138,546 (5)
abstracting: (1<=p_rel)
states: 97,240 (4)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [[~ [[move<=p_m & p_sc<=r_active]] & [p_i2<=moved | [p_m<=off & access<=r_moving]]]]
normalized: E [true U [[p_i2<=moved | [p_m<=off & access<=r_moving]] & ~ [[move<=p_m & p_sc<=r_active]]]]
abstracting: (p_sc<=r_active)
states: 184,756 (5)
abstracting: (move<=p_m)
states: 184,756 (5)
abstracting: (access<=r_moving)
states: 20,504 (4)
abstracting: (p_m<=off)
states: 64,754 (4)
abstracting: (p_i2<=moved)
states: 52,842 (4)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
totally nodes used: 78095 (7.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 294903 211917 506820
used/not used/entry size/cache size: 256249 66852615 16 1024MB
basic ops cache: hits/miss/sum: 165800 169374 335174
used/not used/entry size/cache size: 284574 16492642 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: 35815 28371 64186
used/not used/entry size/cache size: 28363 8360245 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 67040040
1 65355
2 1868
3 661
4 123
5 329
6 121
7 87
8 36
9 57
>= 10 187
Total processing time: 0m 8.099sec
BK_STOP 1495924079884
--------------------
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:433 (39), effective:101 (9)
initing FirstDep: 0m 0.000sec
iterations count:134 (12), effective:27 (2)
iterations count:188 (17), effective:57 (5)
iterations count:293 (26), effective:76 (6)
iterations count:70 (6), effective:19 (1)
iterations count:171 (15), effective:50 (4)
iterations count:177 (16), effective:59 (5)
iterations count:261 (23), effective:54 (4)
iterations count:248 (22), effective:70 (6)
iterations count:361 (32), effective:84 (7)
iterations count:151 (13), effective:38 (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-00005"
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-00005.tgz
mv RobotManipulation-PT-00005 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-00005, 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-149581161700214"
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 '
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 ;