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_IBM703-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418000052
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464330467915


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: IBM703_PT_none
(NrP: 262 NrTr: 284 NrArc: 572)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec

init dd package: 0m 3.746sec


RS generation: 0m 0.142sec


-> reachability set: #nodes 755 (7.6e+02) #states 8,370 (3)



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

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

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

FORMULA IBM703-PT-none-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA IBM703-PT-none-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [3<=decision_s00000774_activated]
normalized: E [true U 3<=decision_s00000774_activated]

abstracting: (3<=decision_s00000774_activated) states: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [~ [~ [3<=task_s00000717_output_s00000264]]]]
normalized: ~ [E [true U 3<=task_s00000717_output_s00000264]]

abstracting: (3<=task_s00000717_output_s00000264) states: 0
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[1<=task_s00000723_inputCriterion_s00000257_used & [3<=merge_s00000455_input_s00000263 | 1<=task_s00000726_input_s00000263]]]]
normalized: ~ [E [true U [1<=task_s00000723_inputCriterion_s00000257_used & [3<=merge_s00000455_input_s00000263 | 1<=task_s00000726_input_s00000263]]]]

abstracting: (1<=task_s00000726_input_s00000263) states: 5
abstracting: (3<=merge_s00000455_input_s00000263) states: 0
abstracting: (1<=task_s00000723_inputCriterion_s00000257_used) states: 5
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[~ [[1<=task_s00000714_input_s00000263 | merge_s00000455_input_s00000290<=merge_s00000319_activated]] & 2<=task_s00000729_output_s00000264]]
normalized: E [true U [2<=task_s00000729_output_s00000264 & ~ [[1<=task_s00000714_input_s00000263 | merge_s00000455_input_s00000290<=merge_s00000319_activated]]]]

abstracting: (merge_s00000455_input_s00000290<=merge_s00000319_activated) states: 8,310 (3)
abstracting: (1<=task_s00000714_input_s00000263) states: 1
abstracting: (2<=task_s00000729_output_s00000264) states: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [~ [[[3<=task_s00000742_inputCriterion_s00000257_used & merge_s00000462_activated<=merge_s00000283_activated] & 1<=decision_s00000805_activated]]]
normalized: ~ [E [true U [1<=decision_s00000805_activated & [3<=task_s00000742_inputCriterion_s00000257_used & merge_s00000462_activated<=merge_s00000283_activated]]]]

abstracting: (merge_s00000462_activated<=merge_s00000283_activated) states: 8,365 (3)
abstracting: (3<=task_s00000742_inputCriterion_s00000257_used) states: 0
abstracting: (1<=decision_s00000805_activated) states: 5
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[1<=task_s00000719_input_s00000263 & [3<=merge_s00000319_input_s00000290 & task_s00000750_output_s00000264<=decision_s00000793_activated]]]]
normalized: ~ [E [true U [1<=task_s00000719_input_s00000263 & [3<=merge_s00000319_input_s00000290 & task_s00000750_output_s00000264<=decision_s00000793_activated]]]]

abstracting: (task_s00000750_output_s00000264<=decision_s00000793_activated) states: 8,100 (3)
abstracting: (3<=merge_s00000319_input_s00000290) states: 0
abstracting: (1<=task_s00000719_input_s00000263) states: 5
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[3<=task_s00000746_input_s00000263 & decision_s00000793_activated<=task_s00000706_input_s00000263] | 2<=task_s00000741_output_s00000264]]
normalized: E [true U [2<=task_s00000741_output_s00000264 | [3<=task_s00000746_input_s00000263 & decision_s00000793_activated<=task_s00000706_input_s00000263]]]

abstracting: (decision_s00000793_activated<=task_s00000706_input_s00000263) states: 8,365 (3)
abstracting: (3<=task_s00000746_input_s00000263) states: 0
abstracting: (2<=task_s00000741_output_s00000264) states: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[~ [2<=decision_s00000773_input_s00000263] | ~ [merge_s00000320_input_s00000263<=decision_s00000773_input_s00000263]] | ~ [[2<=merge_s00000320_activated & 1<=task_s00000704_inputCriterion_s00000257_used]]]]
normalized: ~ [E [true U ~ [[[~ [merge_s00000320_input_s00000263<=decision_s00000773_input_s00000263] | ~ [2<=decision_s00000773_input_s00000263]] | ~ [[2<=merge_s00000320_activated & 1<=task_s00000704_inputCriterion_s00000257_used]]]]]]

abstracting: (1<=task_s00000704_inputCriterion_s00000257_used) states: 5
abstracting: (2<=merge_s00000320_activated) states: 0
abstracting: (2<=decision_s00000773_input_s00000263) states: 0
abstracting: (merge_s00000320_input_s00000263<=decision_s00000773_input_s00000263) states: 8,369 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[[[3<=decision_s00000789_activated & 1<=decision_s00000764_input_s00000263] & [2<=merge_s00000446_input_s00000263 & task_s00000763_input_s00000263<=decision_s00000801_activated]] & ~ [3<=task_s00000761_input_s00000263]]]
normalized: E [true U [~ [3<=task_s00000761_input_s00000263] & [[2<=merge_s00000446_input_s00000263 & task_s00000763_input_s00000263<=decision_s00000801_activated] & [3<=decision_s00000789_activated & 1<=decision_s00000764_input_s00000263]]]]

abstracting: (1<=decision_s00000764_input_s00000263) states: 5
abstracting: (3<=decision_s00000789_activated) states: 0
abstracting: (task_s00000763_input_s00000263<=decision_s00000801_activated) states: 8,365 (3)
abstracting: (2<=merge_s00000446_input_s00000263) states: 0
abstracting: (3<=task_s00000761_input_s00000263) states: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[[[decision_s00000805_activated<=task_s00000721_inputCriterion_s00000257_used | 1<=stopNode_s00000597_input_default] | ~ [decision_s00000773_activated<=task_s00000742_inputCriterion_s00000257_used]] & 2<=task_s00000738_input_s00000263]]
normalized: E [true U [2<=task_s00000738_input_s00000263 & [[decision_s00000805_activated<=task_s00000721_inputCriterion_s00000257_used | 1<=stopNode_s00000597_input_default] | ~ [decision_s00000773_activated<=task_s00000742_inputCriterion_s00000257_used]]]]

abstracting: (decision_s00000773_activated<=task_s00000742_inputCriterion_s00000257_used) states: 8,245 (3)
abstracting: (1<=stopNode_s00000597_input_default) states: 1
abstracting: (decision_s00000805_activated<=task_s00000721_inputCriterion_s00000257_used) states: 8,365 (3)
abstracting: (2<=task_s00000738_input_s00000263) states: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[~ [3<=task_s00000741_input_s00000263] | [fork_s00000464_activated_s00000272<=task_s00000728_output_s00000264 | 1<=task_s00000738_input_s00000263]] | [1<=task_s00000743_inputCriterion_s00000257_used | [2<=task_s00000745_output_s00000264 | 3<=task_s00000708_inputCriterion_s00000257_used]]]]
normalized: ~ [E [true U ~ [[[1<=task_s00000743_inputCriterion_s00000257_used | [2<=task_s00000745_output_s00000264 | 3<=task_s00000708_inputCriterion_s00000257_used]] | [~ [3<=task_s00000741_input_s00000263] | [fork_s00000464_activated_s00000272<=task_s00000728_output_s00000264 | 1<=task_s00000738_input_s00000263]]]]]]

abstracting: (1<=task_s00000738_input_s00000263) states: 5
abstracting: (fork_s00000464_activated_s00000272<=task_s00000728_output_s00000264) states: 8,310 (3)
abstracting: (3<=task_s00000741_input_s00000263) states: 0
abstracting: (3<=task_s00000708_inputCriterion_s00000257_used) states: 0
abstracting: (2<=task_s00000745_output_s00000264) states: 0
abstracting: (1<=task_s00000743_inputCriterion_s00000257_used) states: 145
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[~ [2<=callToProcess_s00000807_output_s00000264] | ~ [1<=decision_s00000784_input_s00000263]] | [[task_s00000763_input_s00000263<=task_s00000756_output_s00000264 & fork_s00000466_activated_s00000274<=task_s00000752_inputCriterion_s00000257_used] & 1<=task_s00000728_inputCriterion_s00000257_used]]]
normalized: ~ [E [true U ~ [[[~ [2<=callToProcess_s00000807_output_s00000264] | ~ [1<=decision_s00000784_input_s00000263]] | [1<=task_s00000728_inputCriterion_s00000257_used & [task_s00000763_input_s00000263<=task_s00000756_output_s00000264 & fork_s00000466_activated_s00000274<=task_s00000752_inputCriterion_s00000257_used]]]]]]

abstracting: (fork_s00000466_activated_s00000274<=task_s00000752_inputCriterion_s00000257_used) states: 8,145 (3)
abstracting: (task_s00000763_input_s00000263<=task_s00000756_output_s00000264) states: 8,365 (3)
abstracting: (1<=task_s00000728_inputCriterion_s00000257_used) states: 5
abstracting: (1<=decision_s00000784_input_s00000263) states: 5
abstracting: (2<=callToProcess_s00000807_output_s00000264) states: 0
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[task_s00000732_input_s00000263<=fork_s00000463_activated_s00000274 | [~ [task_s00000730_input_s00000263<=task_s00000733_inputCriterion_s00000257_used] | [task_s00000725_input_s00000263<=task_s00000709_inputCriterion_s00000257_used | merge_s00000450_activated<=merge_s00000283_input_s00000263]]]]
normalized: ~ [E [true U ~ [[task_s00000732_input_s00000263<=fork_s00000463_activated_s00000274 | [[task_s00000725_input_s00000263<=task_s00000709_inputCriterion_s00000257_used | merge_s00000450_activated<=merge_s00000283_input_s00000263] | ~ [task_s00000730_input_s00000263<=task_s00000733_inputCriterion_s00000257_used]]]]]]

abstracting: (task_s00000730_input_s00000263<=task_s00000733_inputCriterion_s00000257_used) states: 8,365 (3)
abstracting: (merge_s00000450_activated<=merge_s00000283_input_s00000263) states: 8,225 (3)
abstracting: (task_s00000725_input_s00000263<=task_s00000709_inputCriterion_s00000257_used) states: 8,225 (3)
abstracting: (task_s00000732_input_s00000263<=fork_s00000463_activated_s00000274) states: 8,100 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[[[merge_s00000320_input_s00000263<=merge_s00000288_activated & task_s00000712_output_s00000264<=task_s00000710_output_s00000264] & 2<=merge_s00000455_input_s00000290] & [2<=process_s00000030__s00000703_input_s00000263 & ~ [task_s00000742_output_s00000264<=task_s00000712_output_s00000264]]]]
normalized: E [true U [[2<=process_s00000030__s00000703_input_s00000263 & ~ [task_s00000742_output_s00000264<=task_s00000712_output_s00000264]] & [2<=merge_s00000455_input_s00000290 & [merge_s00000320_input_s00000263<=merge_s00000288_activated & task_s00000712_output_s00000264<=task_s00000710_output_s00000264]]]]

abstracting: (task_s00000712_output_s00000264<=task_s00000710_output_s00000264) states: 8,369 (3)
abstracting: (merge_s00000320_input_s00000263<=merge_s00000288_activated) states: 8,369 (3)
abstracting: (2<=merge_s00000455_input_s00000290) states: 0
abstracting: (task_s00000742_output_s00000264<=task_s00000712_output_s00000264) states: 8,225 (3)
abstracting: (2<=process_s00000030__s00000703_input_s00000263) states: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec


Total processing time: 0m 5.430sec


BK_STOP 1464330473376

--------------------
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.002sec

579
iterations count:1716 (6), effective:266 (0)

initing FirstDep: 0m 0.000sec

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_IBM703-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/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/S_IBM703-PT-none.tgz
mv S_IBM703-PT-none 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_IBM703-PT-none, 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 r161kn-blw3-146416418000052"
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 '' 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 ;