About the Execution of Marcie for SharedMemory-PT-000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5452.920 | 3600000.00 | 3599950.00 | 201.50 | ??TT???????T?F?? | 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-2979
Executing tool marcie
Input is SharedMemory-PT-000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r113kn-smll-146373293500367
=====================================================================
--------------------
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 SharedMemory-COL-000010-ReachabilityCardinality-0
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-1
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-10
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-11
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-12
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-13
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-14
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-15
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-2
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-3
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-4
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-5
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-6
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-7
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-8
FORMULA_NAME SharedMemory-COL-000010-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1463876891475
Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: SharedMemory_PT_000010
(NrP: 131 NrTr: 210 NrArc: 800)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec
init dd package: 0m 3.757sec
RS generation: 0m 0.152sec
-> reachability set: #nodes 2484 (2.5e+03) #states 1,830,519 (6)
starting MCC model checker
--------------------------
checking: AG [1<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)]
normalized: ~ [E [true U ~ [1<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)]]]
abstracting: (1<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)) states: 1,830,519 (6)
-> the formula is TRUE
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: AG [[2<=sum(Active_9, Active_10, Active_2, Active_1, Active_4, Active_3, Active_6, Active_5, Active_8, Active_7) | 2<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)]]
normalized: ~ [E [true U ~ [[2<=sum(Active_9, Active_10, Active_2, Active_1, Active_4, Active_3, Active_6, Active_5, Active_8, Active_7) | 2<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)]]]]
abstracting: (2<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)) states: 1,830,519 (6)
abstracting: (2<=sum(Active_9, Active_10, Active_2, Active_1, Active_4, Active_3, Active_6, Active_5, Active_8, Active_7)) states: 1,570,935 (6)
-> the formula is TRUE
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.076sec
checking: EF [[2<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4) & sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)<=sum(Active_9, Active_10, Active_2, Active_1, Active_4, Active_3, Active_6, Active_5, Active_8, Active_7)]]
normalized: E [true U [2<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4) & sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)<=sum(Active_9, Active_10, Active_2, Active_1, Active_4, Active_3, Active_6, Active_5, Active_8, Active_7)]]
abstracting: (sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)<=sum(Active_9, Active_10, Active_2, Active_1, Active_4, Active_3, Active_6, Active_5, Active_8, Active_7)) states: 91
abstracting: (2<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4)) states: 1,570,935 (6)
-> the formula is FALSE
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.673sec
checking: EF [[~ [[1<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4) | 1<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4)]] & [sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4)<=sum(Active_9, Active_10, Active_2, Active_1, Active_4, Active_3, Active_6, Active_5, Active_8, Active_7) & Ext_Bus<=Ext_Bus]]]
normalized: E [true U [[sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4)<=sum(Active_9, Active_10, Active_2, Active_1, Active_4, Active_3, Active_6, Active_5, Active_8, Active_7) & Ext_Bus<=Ext_Bus] & ~ [[1<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4) | 1<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4)]]]]
abstracting: (1<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4)) states: 1,783,415 (6)
abstracting: (1<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4)) states: 1,783,415 (6)
abstracting: (Ext_Bus<=Ext_Bus) states: 1,830,519 (6)
abstracting: (sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4)<=sum(Active_9, Active_10, Active_2, Active_1, Active_4, Active_3, Active_6, Active_5, Active_8, Active_7)) states: 1,060,991 (6)
-> the formula is TRUE
FORMULA SharedMemory-COL-000010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.851sec
checking: AG [~ [[[sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4) & Ext_Bus<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)] & ~ [sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)]]]]
normalized: ~ [E [true U [~ [sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)] & [sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4) & Ext_Bus<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)]]]]
abstracting: (Ext_Bus<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)) states: 1,830,519 (6)
abstracting: (sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)<=sum(OwnMemAcc_9, OwnMemAcc_10, OwnMemAcc_7, OwnMemAcc_8, OwnMemAcc_5, OwnMemAcc_6, OwnMemAcc_1, OwnMemAcc_2, OwnMemAcc_3, OwnMemAcc_4)) states: 91
abstracting: (sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)<=sum(Memory_4, Memory_3, Memory_6, Memory_5, Memory_8, Memory_7, Memory_10, Memory_9, Memory_1, Memory_2)) states: 1,830,519 (6)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
check for maximal unmarked siphon
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
..........
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="SharedMemory-PT-000010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/SharedMemory-PT-000010.tgz
mv SharedMemory-PT-000010 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is SharedMemory-PT-000010, 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 r113kn-smll-146373293500367"
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 ;