About the Execution of Marcie for PolyORBNT-PT-S05J40
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8190.390 | 3575319.00 | 3574766.00 | 282.80 | [undef] | Cannot compute |
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-2265
Executing tool marcie
Input is PolyORBNT-PT-S05J40, examination is CTLFireabilitySimple
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r078kn-ebro-143262779200641
=====================================================================
--------------------
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 PolyORBNT-COL-S05J40-CTLFireabilitySimple-0
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-1
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-10
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-11
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-12
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-13
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-14
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-15
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-2
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-3
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-4
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-5
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-6
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-7
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-8
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireabilitySimple-9
=== Now, execution of the tool begins
BK_START 1432906374914
Model: PolyORBNT-PT-S05J40
reachability algorithm:
Transition chaining algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=2 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=CTLFireabilitySimple.xml --memory=6 --suppress --rs-algorithm=2 --place-order=5
parse successfull
net created successfully
(NrP: 629 NrTr: 1590 NrArc: 10704)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m4sec
init dd package: 0m6sec
before gc: list nodes free: 5408261
after gc: idd nodes used:23712003, unused:40287997; list nodes free:177036152
before gc: list nodes free: 5914098
after gc: idd nodes used:39075243, unused:24924757; list nodes free:112976324
before gc: list nodes free: 10181332
after gc: idd nodes used:48524835, unused:15475165; list nodes free:74268950
before gc: list nodes free: 8893256
after gc: idd nodes used:51941862, unused:12058138; list nodes free:60259290
before gc: list nodes free: 10198091
after gc: idd nodes used:53013824, unused:10986176; list nodes free:55693436
before gc: list nodes free: 9699323
after gc: idd nodes used:53437196, unused:10562804; list nodes free:53875521
before gc: list nodes free: 9665816
after gc: idd nodes used:53653581, unused:10346419; list nodes free:52855087
before gc: list nodes free: 9659868
after gc: idd nodes used:54088320, unused:9911680; list nodes free:50993287
RS generation: 57m45sec
-> last computed set: #nodes 40682415 (4.1e+07) #states 127,504,663 (8)
CANNOT_COMPUTE
BK_STOP 1432909950233
--------------------
content from stderr:
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
.../home/mcc/workspace/dssz_util/src/dssz/idd/idd.cc:804: DD Exception: No free nodes
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="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="CTLFireabilitySimple"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-S05J40 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is PolyORBNT-PT-S05J40, examination is CTLFireabilitySimple"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r078kn-ebro-143262779200641"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireabilitySimple" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireabilitySimple" != "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 "CTLFireabilitySimple.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireabilitySimple.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireabilitySimple.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 ;