fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r232su-smll-143354324800160
Last Updated
August 19, 2015

About the Execution of Marcie for Parking-PT-416

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8435.880 3600000.00 3599829.00 282.90 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-2270
Executing tool marcie
Input is Parking-PT-416, examination is CTLFireabilitySimple
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324800160
=====================================================================


--------------------
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-416-CTLFireabilitySimple-0
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-1
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-10
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-11
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-12
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-13
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-14
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-15
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-2
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-3
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-4
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-5
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-6
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-7
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-8
FORMULA_NAME Parking-PT-416-CTLFireabilitySimple-9

=== Now, execution of the tool begins

BK_START 1433641684089

Model: Parking-PT-416
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --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=3 --place-order=5

parse successfull
net created successfully

(NrP: 305 NrTr: 433 NrArc: 1289)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 0m7sec


-> reachability set: #nodes 39550 (4.0e+04) #states 8,440,470,781,232,316,153,857 (21)



starting MCC model checker
--------------------------

checking: AF [IS-FIREABLE [t418]]
normalized: ~ [EG [~ [IS-FIREABLE [t418]]]]

.
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-416-CTLFireabilitySimple-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m6sec

checking: EF [IS-FIREABLE [t310]]
normalized: E [true U IS-FIREABLE [t310]]


before gc: list nodes free: 2863821

after gc: idd nodes used:768974, unused:63231026; list nodes free:290135073

BK_TIME_CONFINEMENT_REACHED

--------------------
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


initing FirstDep: 0m0sec

819 1157 2427 3627 7462 10047 12721 24391 28308 29933 42851
iterations count:11692 (27), effective:634 (1)

initing FirstDep: 0m0sec

30574 29922 43253 64435 64680 87419 95849 134131 134382 152722 138687 139620 156363 176132 195645 193213 181845 177745 217424 263286 282110 333573 353526 355122 351493 355044 327403 330746 331286 321619 301038 314645 316066 315430 306819 292762 295310 619582 736230 1078046 1248234 1308424 1411382 1428352 1372044 1395943 1295158 1334306 1330386 1275236

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="Parking-PT-416"
export BK_EXAMINATION="CTLFireabilitySimple"
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/Parking-PT-416.tgz
mv Parking-PT-416 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is Parking-PT-416, 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 r232su-smll-143354324800160"
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 '' CTLFireabilitySimple.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;