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 Philosophers-COL-002000, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r064kn-blw3-143254880700502
=====================================================================

--------------------
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 Philosophers-COL-002000-ReachabilityBounds-0
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-1
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-10
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-11
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-12
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-13
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-14
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-15
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-2
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-3
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-4
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-5
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-6
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-7
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-8
FORMULA_NAME Philosophers-COL-002000-ReachabilityBounds-9

=== Now, execution of the tool begins

BK_START 1432747604939

Model: Philosophers-COL-002000
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

Unfolding complete |P|=10000|T|=10000|A|=32000
Time for unfolding: 0m0sec

(NrP: 10000 NrTr: 10000 NrArc: 32000)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:1m58sec

init dd package: 0m3sec


before gc: list nodes free: 3563983

after gc: idd nodes used:24515, unused:63975485; list nodes free:285051949

RS generation: 5m47sec


-> reachability set: #nodes 39989 (4.0e+04) #states 89,240,295,546,891,924,270,672,649,935,778,278,688,035,230,297,482,427,564,186,278,869,831,368,899,426,804,395,349,818,845,150,351,045,227,513,741,030,117,676,724,574,391,458,923,069,593,675,874,571,665,943,315,815,652,246,922,075,618,156,964,104,200,504,422,656,065,931,958,970,315,316,843,340,925,950,705,707,596,486,969,435,437,278,303,739,318,900,349,056,828,871,662,095,992,953,838,352,833,572,954,409,590,047,130,305,407,364,577,321,405,805,749,409,146,560,585,559,472,178,537,937,997,773,270,571,367,506,215,022,286,796,823,368,023,035,378,428,455,228,196,497,982,465,423,316,439,059,329,364,289,173,495,659,999,738,257,634,269,161,699,005,310,879,885,391,290,690,594,059,382,453,893,266,549,156,239,224,802,070,243,172,901,057,349,924,345,978,547,673,376,372,600,969,122,411,965,343,367,413,364,288,305,306,967,578,101,155,976,603,389,299,852,185,797,926,667,789,027,418,487,782,311,828,337,581,873,021,175,003,420,612,246,989,472,411,910,456,488,154,003,275,469,060,700,850,126,998,889,597,252,995,801,928,086,595,514,605,021,055,162,709,746,053,688,489,850,535,612,764,501,074,699,555,542,203,466,328,127 (835)



before gc: list nodes free: 3517344

after gc: idd nodes used:110145, unused:63889855; list nodes free:284637322

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


before gc: list nodes free: 3472041

after gc: idd nodes used:90453, unused:63909547; list nodes free:284737494

before gc: list nodes free: 3513468

after gc: idd nodes used:113493, unused:63886507; list nodes free:284619606
checking: maxVal(fork)<=2
normalized: maxVal(fork)<=2


FORMULA Philosophers-COL-002000-ReachabilityBounds-0CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(think)<=2
normalized: maxVal(think)<=2


FORMULA Philosophers-COL-002000-ReachabilityBounds-1CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(think)<=1
normalized: maxVal(think)<=1


FORMULA Philosophers-COL-002000-ReachabilityBounds-2CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(catch1)<=1
normalized: maxVal(catch1)<=1


FORMULA Philosophers-COL-002000-ReachabilityBounds-3CANNOT_COMPUTE

MC time: 0m0sec

checking: [[[maxVal(catch1)<=2 & maxVal(catch2)<=2] & [maxVal(eat)<=3 & maxVal(fork)<=1]] & [maxVal(catch1)<=1 & [[maxVal(catch1)<=1 & maxVal(eat)<=2] & [[[maxVal(think)<=2 & maxVal(catch2)<=1] & [maxVal(eat)<=3 & maxVal(think)<=1]] & [maxVal(eat)<=1 & maxVal(think)<=1]]]]]
normalized: [[maxVal(catch1)<=1 & [[[maxVal(eat)<=1 & maxVal(think)<=1] & [[maxVal(eat)<=3 & maxVal(think)<=1] & [maxVal(think)<=2 & maxVal(catch2)<=1]]] & [maxVal(catch1)<=1 & maxVal(eat)<=2]]] & [[maxVal(eat)<=3 & maxVal(fork)<=1] & [maxVal(catch1)<=2 & maxVal(catch2)<=2]]]


FORMULA Philosophers-COL-002000-ReachabilityBounds-4CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(eat)<=1
normalized: maxVal(eat)<=1


FORMULA Philosophers-COL-002000-ReachabilityBounds-5CANNOT_COMPUTE

MC time: 0m0sec

checking: [[[[[[maxVal(eat)<=1 & maxVal(fork)<=3] & [maxVal(eat)<=3 & maxVal(eat)<=3]] & maxVal(fork)<=2] & maxVal(catch1)<=1] & maxVal(catch1)<=1] & [maxVal(eat)<=2 & [[[[maxVal(fork)<=3 & maxVal(catch1)<=2] & maxVal(catch2)<=2] & maxVal(catch2)<=3] & maxVal(catch1)<=1]]]
normalized: [[maxVal(eat)<=2 & [maxVal(catch1)<=1 & [maxVal(catch2)<=3 & [maxVal(catch2)<=2 & [maxVal(fork)<=3 & maxVal(catch1)<=2]]]]] & [maxVal(catch1)<=1 & [maxVal(catch1)<=1 & [maxVal(fork)<=2 & [[maxVal(eat)<=3 & maxVal(eat)<=3] & [maxVal(eat)<=1 & maxVal(fork)<=3]]]]]]


FORMULA Philosophers-COL-002000-ReachabilityBounds-6CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(think)<=3
normalized: maxVal(think)<=3


FORMULA Philosophers-COL-002000-ReachabilityBounds-7CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(think)<=1 & [maxVal(catch2)<=3 & [maxVal(think)<=2 & [[[maxVal(catch1)<=1 & maxVal(catch2)<=3] & maxVal(catch2)<=3] & [maxVal(catch1)<=1 & maxVal(eat)<=3]]]]]
normalized: [maxVal(think)<=1 & [maxVal(catch2)<=3 & [maxVal(think)<=2 & [[maxVal(catch2)<=3 & [maxVal(catch1)<=1 & maxVal(catch2)<=3]] & [maxVal(catch1)<=1 & maxVal(eat)<=3]]]]]


FORMULA Philosophers-COL-002000-ReachabilityBounds-8CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(think)<=1 & [maxVal(catch1)<=1 & [[maxVal(eat)<=3 & [maxVal(eat)<=1 & [maxVal(think)<=2 & maxVal(catch1)<=3]]] & maxVal(think)<=3]]]
normalized: [maxVal(think)<=1 & [maxVal(catch1)<=1 & [maxVal(think)<=3 & [maxVal(eat)<=3 & [maxVal(eat)<=1 & [maxVal(think)<=2 & maxVal(catch1)<=3]]]]]]


FORMULA Philosophers-COL-002000-ReachabilityBounds-9CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(think)<=3
normalized: maxVal(think)<=3


FORMULA Philosophers-COL-002000-ReachabilityBounds-10CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(catch2)<=3 & maxVal(eat)<=2]
normalized: [maxVal(catch2)<=3 & maxVal(eat)<=2]


FORMULA Philosophers-COL-002000-ReachabilityBounds-11CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(catch2)<=2
normalized: maxVal(catch2)<=2


FORMULA Philosophers-COL-002000-ReachabilityBounds-12CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(think)<=1 & [[[maxVal(fork)<=1 & maxVal(think)<=2] & [[maxVal(think)<=2 & [maxVal(fork)<=1 & maxVal(eat)<=2]] & [maxVal(fork)<=1 & [maxVal(think)<=1 & maxVal(eat)<=1]]]] & maxVal(eat)<=3]]
normalized: [maxVal(think)<=1 & [maxVal(eat)<=3 & [[[maxVal(fork)<=1 & [maxVal(think)<=1 & maxVal(eat)<=1]] & [maxVal(think)<=2 & [maxVal(fork)<=1 & maxVal(eat)<=2]]] & [maxVal(fork)<=1 & maxVal(think)<=2]]]]


FORMULA Philosophers-COL-002000-ReachabilityBounds-13CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(eat)<=1
normalized: maxVal(eat)<=1


FORMULA Philosophers-COL-002000-ReachabilityBounds-14CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(eat)<=3
normalized: maxVal(eat)<=3


FORMULA Philosophers-COL-002000-ReachabilityBounds-15CANNOT_COMPUTE

MC time: 0m0sec


Total processing time: 17m10sec


BK_STOP 1432748635313

--------------------
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: 0m1sec

10387 10772 11155 11540 11925 12310 12695 13080 13462 13847 14232 14617 15002 15387 15772 16155 16540 16925 17310 17695 18080 18462 18847 19232 19617 39989 39989 39989 39989 39989 39989 39989 39989 39989 39989
iterations count:35994 (3), effective:4000 (0)

initing FirstDep: 0m1sec

Unknown names:
maxVal(fork)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(think)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(think)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(catch1)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(catch2)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(eat)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(fork)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(think)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(eat)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(catch1)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(think)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(eat)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(catch2)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(think)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(eat)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(eat)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

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="Philosophers-COL-002000"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/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/Philosophers-COL-002000.tgz
mv Philosophers-COL-002000 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 Philosophers-COL-002000, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r064kn-blw3-143254880700502"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;