About the Execution of Marcie for S_Parking-PT-832
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9880.240 | 3600000.00 | 3600020.00 | 122.20 | ?????F????????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 S_Parking-PT-832, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444131201204
=====================================================================
--------------------
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 Parking-PT-832-ReachabilityCardinality-0
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-1
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-15
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-2
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-3
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-4
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-5
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-6
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-7
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-8
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464964939054
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: Parking_PT_832
(NrP: 737 NrTr: 993 NrArc: 2993)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
init dd package: 0m 3.845sec
RS generation: 0m12.530sec
-> reachability set: #nodes 3718 (3.7e+03) #states 1,464,804,011,006,526,709,487,658,044,459,985,273,521,543,577,600,000,001 (54)
starting MCC model checker
--------------------------
checking: EF [2<=p675]
normalized: E [true U 2<=p675]
abstracting: (2<=p675) states: 0
-> the formula is FALSE
FORMULA Parking-PT-832-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [3<=p200]
normalized: E [true U 3<=p200]
abstracting: (3<=p200) states: 0
-> the formula is FALSE
FORMULA Parking-PT-832-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [p568<=p161]
normalized: ~ [E [true U ~ [p568<=p161]]]
abstracting: (p568<=p161) states: 1,432,976,170,767,372,548,886,444,733,864,311,519,430,211,272,704,000,001 (54)
before gc: list nodes free: 3070059
after gc: idd nodes used:1545987, unused:62454013; list nodes free:286531690
before gc: list nodes free: 1741331
after gc: idd nodes used:1480769, unused:62519231; list nodes free:286840203
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
initing FirstDep: 0m 0.010sec
1473 1702 1823 1989 2142 2364 2501 2636 2788 2982 3103 3281 3470 5598 4940 5974 3550 4802 6228 8678 8696 5906 8056 5584 7416 5262 6776 6118 4670 5496 4838
iterations count:31693 (31), effective:1026 (1)
initing FirstDep: 0m 0.004sec
4957 5164 5509 25654 25767 29900 56161 56304 60383 67706 68624 81438 100937 121373 149796 320508 371326 421408 500867 415519 574708 617417 773534 774310 1462974 1474543 1474618
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="S_Parking-PT-832"
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/S_Parking-PT-832.tgz
mv S_Parking-PT-832 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 S_Parking-PT-832, 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 r185kn-smll-146444131201204"
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 ;