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 ResAllocation-PT-R003C015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r078kn-ebro-143262779601075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432915844773

Model: ResAllocation-PT-R003C015
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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 90 NrTr: 60 NrArc: 264)

net check time: 0m0sec

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

init dd package: 0m6sec


RS generation: 0m0sec


-> reachability set: #nodes 607 (6.1e+02) #states 578,878,464 (8)



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

checking: AG [~ [[2<=r_11_0 | [3<=p_10_1 & 3<=p_10_2]]]]
normalized: ~ [E [true U [2<=r_11_0 | [3<=p_10_1 & 3<=p_10_2]]]]

abstracting: (3<=p_10_2) states: 0
abstracting: (3<=p_10_1) states: 0
abstracting: (2<=r_11_0) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[3<=r_13_2 & [1<=p_5_1 | [3<=p_6_2 & r_7_2<=r_11_1]]]]
normalized: E [true U [3<=r_13_2 & [1<=p_5_1 | [3<=p_6_2 & r_7_2<=r_11_1]]]]

abstracting: (r_7_2<=r_11_1) states: 429,333,504 (8)
abstracting: (3<=p_6_2) states: 0
abstracting: (1<=p_5_1) states: 144,236,544 (8)
abstracting: (3<=r_13_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [p_5_0<=r_3_2]
normalized: ~ [E [true U ~ [p_5_0<=r_3_2]]]

abstracting: (p_5_0<=r_3_2) states: 546,395,136 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11sec

checking: AG [[[~ [2<=p_6_1] | [2<=p_1_0 & 3<=p_2_2]] | [[r_6_0<=p_4_1 & r_8_0<=p_7_2] | ~ [2<=r_7_0]]]]
normalized: ~ [E [true U ~ [[[[r_6_0<=p_4_1 & r_8_0<=p_7_2] | ~ [2<=r_7_0]] | [~ [2<=p_6_1] | [2<=p_1_0 & 3<=p_2_2]]]]]]

abstracting: (3<=p_2_2) states: 0
abstracting: (2<=p_1_0) states: 0
abstracting: (2<=p_6_1) states: 0
abstracting: (2<=r_7_0) states: 0
abstracting: (r_8_0<=p_7_2) states: 407,225,344 (8)
abstracting: (r_6_0<=p_4_1) states: 372,121,088 (8)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m5sec

checking: AG [[p_7_0<=p_6_2 | [2<=r_10_2 | [r_4_2<=r_6_1 | r_8_0<=r_14_1]]]]
normalized: ~ [E [true U ~ [[p_7_0<=p_6_2 | [2<=r_10_2 | [r_4_2<=r_6_1 | r_8_0<=r_14_1]]]]]]

abstracting: (r_8_0<=r_14_1) states: 467,789,824 (8)
abstracting: (r_4_2<=r_6_1) states: 439,574,016 (8)
abstracting: (2<=r_10_2) states: 0
abstracting: (p_7_0<=p_6_2) states: 504,780,800 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: AG [~ [[[p_8_2<=r_0_1 & p_9_0<=r_4_1] & [3<=r_9_0 & p_5_2<=p_13_2]]]]
normalized: ~ [E [true U [[p_8_2<=r_0_1 & p_9_0<=r_4_1] & [3<=r_9_0 & p_5_2<=p_13_2]]]]

abstracting: (p_5_2<=p_13_2) states: 426,819,072 (8)
abstracting: (3<=r_9_0) states: 0
abstracting: (p_9_0<=r_4_1) states: 539,771,904 (8)
abstracting: (p_8_2<=r_0_1) states: 534,795,264 (8)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m50sec

checking: EF [[[[3<=r_13_0 & p_5_0<=p_11_0] & [p_4_2<=r_5_0 | 2<=p_13_0]] & [~ [r_7_1<=r_6_1] | [p_14_1<=p_7_1 | 3<=p_9_1]]]]
normalized: E [true U [[[p_14_1<=p_7_1 | 3<=p_9_1] | ~ [r_7_1<=r_6_1]] & [[p_4_2<=r_5_0 | 2<=p_13_0] & [3<=r_13_0 & p_5_0<=p_11_0]]]]

abstracting: (p_5_0<=p_11_0) states: 515,218,432 (8)
abstracting: (3<=r_13_0) states: 0
abstracting: (2<=p_13_0) states: 0
abstracting: (p_4_2<=r_5_0) states: 541,077,504 (8)
abstracting: (r_7_1<=r_6_1) states: 485,541,888 (8)
abstracting: (3<=p_9_1) states: 0
abstracting: (p_14_1<=p_7_1) states: 407,786,496 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m8sec

checking: EF [2<=r_1_2]
normalized: E [true U 2<=r_1_2]

abstracting: (2<=r_1_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[p_8_2<=r_3_0 & 2<=r_8_2]]
normalized: E [true U [p_8_2<=r_3_0 & 2<=r_8_2]]

abstracting: (2<=r_8_2) states: 0
abstracting: (p_8_2<=r_3_0) states: 538,174,464 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m7sec

checking: AG [~ [2<=p_7_0]]
normalized: ~ [E [true U 2<=p_7_0]]

abstracting: (2<=p_7_0) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[2<=r_10_2 & p_1_2<=r_5_0] & [1<=r_2_2 | p_7_0<=p_11_2]] & [~ [p_0_2<=p_6_2] | [1<=p_7_1 | p_8_2<=r_4_0]]]]
normalized: E [true U [[[1<=p_7_1 | p_8_2<=r_4_0] | ~ [p_0_2<=p_6_2]] & [[1<=r_2_2 | p_7_0<=p_11_2] & [2<=r_10_2 & p_1_2<=r_5_0]]]]

abstracting: (p_1_2<=r_5_0) states: 484,387,328 (8)
abstracting: (2<=r_10_2) states: 0
abstracting: (p_7_0<=p_11_2) states: 534,254,592 (8)
abstracting: (1<=r_2_2) states: 267,206,656 (8)
abstracting: (p_0_2<=p_6_2) states: 434,494,464 (8)
abstracting: (p_8_2<=r_4_0) states: 540,017,664 (8)
abstracting: (1<=p_7_1) states: 146,332,160 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 30m0sec

checking: EF [[[[2<=r_4_0 & r_1_0<=r_7_1] & p_2_1<=p_9_2] & [p_1_2<=r_8_1 & 3<=r_7_2]]]
normalized: E [true U [[p_1_2<=r_8_1 & 3<=r_7_2] & [p_2_1<=p_9_2 & [2<=r_4_0 & r_1_0<=r_7_1]]]]

abstracting: (r_1_0<=r_7_1) states: 427,624,960 (8)
abstracting: (2<=r_4_0) states: 0
abstracting: (p_2_1<=p_9_2) states: 470,637,568 (8)
abstracting: (3<=r_7_2) states: 0
abstracting: (p_1_2<=r_8_1) states: 486,711,296 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 13m46sec

checking: EF [2<=p_3_0]
normalized: E [true U 2<=p_3_0]

abstracting: (2<=p_3_0) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [[p_7_0<=r_13_0 | 1<=p_9_2]]]]
normalized: ~ [E [true U ~ [[p_7_0<=r_13_0 | 1<=p_9_2]]]]

abstracting: (1<=p_9_2) states: 221,420,544 (8)
abstracting: (p_7_0<=r_13_0) states: 538,661,888 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[p_12_0<=r_10_1 & 2<=r_11_0]]
normalized: E [true U [p_12_0<=r_10_1 & 2<=r_11_0]]

abstracting: (2<=r_11_0) states: 0
abstracting: (p_12_0<=r_10_1) states: 459,459,072 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[[p_0_1<=r_11_1 | 3<=p_10_1] | [3<=r_11_0 & 3<=p_11_0]]]]
normalized: E [true U ~ [[[3<=r_11_0 & 3<=p_11_0] | [p_0_1<=r_11_1 | 3<=p_10_1]]]]

abstracting: (3<=p_10_1) states: 0
abstracting: (p_0_1<=r_11_1) states: 457,293,824 (8)
abstracting: (3<=p_11_0) states: 0
abstracting: (3<=r_11_0) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m32sec


Total processing time: 52m54sec


BK_STOP 1432919019508

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


iterations count:499 (8), effective:90 (1)

initing FirstDep: 0m0sec


iterations count:175 (2), effective:17 (0)

iterations count:239 (3), effective:27 (0)

iterations count:263 (4), effective:31 (0)

iterations count:139 (2), effective:15 (0)

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="ResAllocation-PT-R003C015"
export BK_EXAMINATION="ReachabilityCardinality"
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/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 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 ResAllocation-PT-R003C015, 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 r078kn-ebro-143262779601075"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 '' ReachabilityCardinality.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 ;