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_IBM5964-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-146416418000043
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464330456035


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: IBM5964_PT_none
(NrP: 263 NrTr: 139 NrArc: 541)

net check time: 0m 0.000sec

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

init dd package: 0m 3.663sec


RS generation: 0m 0.036sec


-> reachability set: #nodes 1027 (1.0e+03) #states 15,546 (4)



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

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

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

FORMULA IBM5964-PT-none-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [1<=callToTask_s00002741_output_s00000981]]
normalized: ~ [E [true U 1<=callToTask_s00002741_output_s00000981]]

abstracting: (1<=callToTask_s00002741_output_s00000981) states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [1<=callToProcess_s00002411_output_s00000981]
normalized: E [true U 1<=callToProcess_s00002411_output_s00000981]

abstracting: (1<=callToProcess_s00002411_output_s00000981) states: 0
-> the formula is FALSE

FORMULA IBM5964-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=callToTask_s00005897_output_s00000938) states: 169
-> the formula is TRUE

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

MC time: 0m 0.061sec

checking: EF [~ [fork_s00001067_activated_s00000991<=fork_s00001293_activated_s00000991]]
normalized: E [true U ~ [fork_s00001067_activated_s00000991<=fork_s00001293_activated_s00000991]]

abstracting: (fork_s00001067_activated_s00000991<=fork_s00001293_activated_s00000991) states: 15,546 (4)
-> the formula is FALSE

FORMULA IBM5964-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[1<=merge_s00001120_input_s00001513 | 1<=callToProcess_s00002538_output_s00000938]]]]
normalized: E [true U [1<=merge_s00001120_input_s00001513 | 1<=callToProcess_s00002538_output_s00000938]]

abstracting: (1<=callToProcess_s00002538_output_s00000938) states: 763
abstracting: (1<=merge_s00001120_input_s00001513) states: 0
-> the formula is TRUE

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

MC time: 0m 0.039sec

checking: EF [~ [~ [[1<=callToTask_s00002189_inputCriterion_s00000937_used & merge_s00001291_input_s00000986<=decision_s00001616_activated]]]]
normalized: E [true U [1<=callToTask_s00002189_inputCriterion_s00000937_used & merge_s00001291_input_s00000986<=decision_s00001616_activated]]

abstracting: (merge_s00001291_input_s00000986<=decision_s00001616_activated) states: 15,546 (4)
abstracting: (1<=callToTask_s00002189_inputCriterion_s00000937_used) states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [[callToTask_s00002741_output_s00000979<=callToTask_s00002185_input_s00000950 | ~ [~ [1<=callToTask_s00005969_input_s00000952]]]]
normalized: ~ [E [true U ~ [[callToTask_s00002741_output_s00000979<=callToTask_s00002185_input_s00000950 | 1<=callToTask_s00005969_input_s00000952]]]]

abstracting: (1<=callToTask_s00005969_input_s00000952) states: 0
abstracting: (callToTask_s00002741_output_s00000979<=callToTask_s00002185_input_s00000950) states: 15,546 (4)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [[2<=callToTask_s00002741_output_s00000956 & [fork_s00001293_input_s00000952<=callToTask_s00005897_output_s00000938 | ~ [1<=callToTask_s00005971_output_s00000938]]]]
normalized: E [true U [2<=callToTask_s00002741_output_s00000956 & [fork_s00001293_input_s00000952<=callToTask_s00005897_output_s00000938 | ~ [1<=callToTask_s00005971_output_s00000938]]]]

abstracting: (1<=callToTask_s00005971_output_s00000938) states: 0
abstracting: (fork_s00001293_input_s00000952<=callToTask_s00005897_output_s00000938) states: 15,546 (4)
abstracting: (2<=callToTask_s00002741_output_s00000956) states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[[1<=callToTask_s00005965_inputCriterion_s00000937_used | callToTask_s00001746_input_s00000987<=callToTask_s00005972_input_s00000935] & 3<=callToTask_s00005897_output_s00000956]]
normalized: E [true U [3<=callToTask_s00005897_output_s00000956 & [1<=callToTask_s00005965_inputCriterion_s00000937_used | callToTask_s00001746_input_s00000987<=callToTask_s00005972_input_s00000935]]]

abstracting: (callToTask_s00001746_input_s00000987<=callToTask_s00005972_input_s00000935) states: 15,546 (4)
abstracting: (1<=callToTask_s00005965_inputCriterion_s00000937_used) states: 0
abstracting: (3<=callToTask_s00005897_output_s00000956) states: 169
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [~ [[~ [1<=fork_s00001293_activated_s00000993] | [callToTask_s00005965_input_s00000935<=callToTask_s00005972_input_s00000950 & 1<=callToTask_s00002181_output_s00000979]]]]
normalized: E [true U ~ [[~ [1<=fork_s00001293_activated_s00000993] | [callToTask_s00005965_input_s00000935<=callToTask_s00005972_input_s00000950 & 1<=callToTask_s00002181_output_s00000979]]]]

abstracting: (1<=callToTask_s00002181_output_s00000979) states: 0
abstracting: (callToTask_s00005965_input_s00000935<=callToTask_s00005972_input_s00000950) states: 15,546 (4)
abstracting: (1<=fork_s00001293_activated_s00000993) states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [[~ [[callToTask_s00005970_input_s00000950<=callToProcess_s00001273_inputCriterion_s00000937_used & 2<=callToProcess_s00005925_output_s00000959]] | ~ [[merge_s00000945_input_s00000987<=merge_s00001290_activated & merge_s00001292_input_s00000935<=join_s00001295_input_s00000952]]]]
normalized: ~ [E [true U ~ [[~ [[callToTask_s00005970_input_s00000950<=callToProcess_s00001273_inputCriterion_s00000937_used & 2<=callToProcess_s00005925_output_s00000959]] | ~ [[merge_s00000945_input_s00000987<=merge_s00001290_activated & merge_s00001292_input_s00000935<=join_s00001295_input_s00000952]]]]]]

abstracting: (merge_s00001292_input_s00000935<=join_s00001295_input_s00000952) states: 11,570 (4)
abstracting: (merge_s00000945_input_s00000987<=merge_s00001290_activated) states: 15,546 (4)
abstracting: (2<=callToProcess_s00005925_output_s00000959) states: 369
abstracting: (callToTask_s00005970_input_s00000950<=callToProcess_s00001273_inputCriterion_s00000937_used) states: 15,546 (4)
-> the formula is FALSE

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

MC time: 0m 0.047sec

checking: AG [~ [[[callToTask_s00002741_inputCriterion_s00000937_used<=callToTask_s00002427_input_s00001013 & 1<=callToTask_s00005966_output_s00000979] & [fork_s00001067_input_s00000935<=fork_s00001067_activated_s00000993 & callToTask_s00005969_inputCriterion_s00000937_used<=callToTask_s00005965_input_s00000950]]]]
normalized: ~ [E [true U [[fork_s00001067_input_s00000935<=fork_s00001067_activated_s00000993 & callToTask_s00005969_inputCriterion_s00000937_used<=callToTask_s00005965_input_s00000950] & [callToTask_s00002741_inputCriterion_s00000937_used<=callToTask_s00002427_input_s00001013 & 1<=callToTask_s00005966_output_s00000979]]]]

abstracting: (1<=callToTask_s00005966_output_s00000979) states: 0
abstracting: (callToTask_s00002741_inputCriterion_s00000937_used<=callToTask_s00002427_input_s00001013) states: 15,546 (4)
abstracting: (callToTask_s00005969_inputCriterion_s00000937_used<=callToTask_s00005965_input_s00000950) states: 15,546 (4)
abstracting: (fork_s00001067_input_s00000935<=fork_s00001067_activated_s00000993) states: 15,546 (4)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AG [[~ [[3<=callToProcess_s00004075_input_s00000986 & callToTask_s00001746_input_s00000950<=callToTask_s00005969_output_s00000960]] | [~ [merge_s00001120_input_s00000987<=callToTask_s00001632_output_s00000938] & [callToTask_s00005967_input_s00000935<=callToTask_s00005969_input_s00000935 & callToTask_s00005967_input_s00000950<=callToProcess_s00001273_inputCriterion_s00000937_used]]]]
normalized: ~ [E [true U ~ [[[~ [merge_s00001120_input_s00000987<=callToTask_s00001632_output_s00000938] & [callToTask_s00005967_input_s00000935<=callToTask_s00005969_input_s00000935 & callToTask_s00005967_input_s00000950<=callToProcess_s00001273_inputCriterion_s00000937_used]] | ~ [[3<=callToProcess_s00004075_input_s00000986 & callToTask_s00001746_input_s00000950<=callToTask_s00005969_output_s00000960]]]]]]

abstracting: (callToTask_s00001746_input_s00000950<=callToTask_s00005969_output_s00000960) states: 15,546 (4)
abstracting: (3<=callToProcess_s00004075_input_s00000986) states: 0
abstracting: (callToTask_s00005967_input_s00000950<=callToProcess_s00001273_inputCriterion_s00000937_used) states: 15,546 (4)
abstracting: (callToTask_s00005967_input_s00000935<=callToTask_s00005969_input_s00000935) states: 15,546 (4)
abstracting: (merge_s00001120_input_s00000987<=callToTask_s00001632_output_s00000938) states: 15,546 (4)
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[~ [callToTask_s00005972_input_s00001009<=callToTask_s00005966_output_s00000938] | [merge_s00001290_input_s00001009<=callToTask_s00002526_input_s00000950 | callToTask_s00001746_input_s00000950<=endNode_s00000942_input_default]] & [callToTask_s00005849_output_s00000960<=merge_s00001120_input_s00001012 & [2<=callToTask_s00002186_input_s00000935 & 2<=merge_s00001120_input_s00001013]]]]
normalized: E [true U [[callToTask_s00005849_output_s00000960<=merge_s00001120_input_s00001012 & [2<=callToTask_s00002186_input_s00000935 & 2<=merge_s00001120_input_s00001013]] & [[merge_s00001290_input_s00001009<=callToTask_s00002526_input_s00000950 | callToTask_s00001746_input_s00000950<=endNode_s00000942_input_default] | ~ [callToTask_s00005972_input_s00001009<=callToTask_s00005966_output_s00000938]]]]

abstracting: (callToTask_s00005972_input_s00001009<=callToTask_s00005966_output_s00000938) states: 15,546 (4)
abstracting: (callToTask_s00001746_input_s00000950<=endNode_s00000942_input_default) states: 15,546 (4)
abstracting: (merge_s00001290_input_s00001009<=callToTask_s00002526_input_s00000950) states: 13,355 (4)
abstracting: (2<=merge_s00001120_input_s00001013) states: 0
abstracting: (2<=callToTask_s00002186_input_s00000935) states: 0
abstracting: (callToTask_s00005849_output_s00000960<=merge_s00001120_input_s00001012) states: 15,546 (4)
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: AG [[[[endNode_s00000942_input_default<=fork_s00001293_input_s00000935 | 1<=callToTask_s00005897_output_s00000938] | [callToTask_s00001746_inputCriterion_s00000937_used<=decision_s00001616_activated & 1<=decision_s00001618_activated]] | [[1<=fork_s00001293_activated_s00000993 & 3<=callToTask_s00005897_inputCriterion_s00000937_used] | ~ [callToProcess_s00005925_output_s00000938<=callToProcess_s00001273_inputCriterion_s00000937_used]]]]
normalized: ~ [E [true U ~ [[[[1<=fork_s00001293_activated_s00000993 & 3<=callToTask_s00005897_inputCriterion_s00000937_used] | ~ [callToProcess_s00005925_output_s00000938<=callToProcess_s00001273_inputCriterion_s00000937_used]] | [[callToTask_s00001746_inputCriterion_s00000937_used<=decision_s00001616_activated & 1<=decision_s00001618_activated] | [endNode_s00000942_input_default<=fork_s00001293_input_s00000935 | 1<=callToTask_s00005897_output_s00000938]]]]]]

abstracting: (1<=callToTask_s00005897_output_s00000938) states: 4,928 (3)
abstracting: (endNode_s00000942_input_default<=fork_s00001293_input_s00000935) states: 14,783 (4)
abstracting: (1<=decision_s00001618_activated) states: 0
abstracting: (callToTask_s00001746_inputCriterion_s00000937_used<=decision_s00001616_activated) states: 15,546 (4)
abstracting: (callToProcess_s00005925_output_s00000938<=callToProcess_s00001273_inputCriterion_s00000937_used) states: 12,658 (4)
abstracting: (3<=callToTask_s00005897_inputCriterion_s00000937_used) states: 169
abstracting: (1<=fork_s00001293_activated_s00000993) states: 0
-> the formula is FALSE

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

MC time: 0m 0.033sec


Total processing time: 0m 5.403sec


BK_STOP 1464330461475

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


iterations count:378 (2), effective:51 (0)

initing FirstDep: 0m 0.000sec


iterations count:323 (2), effective:40 (0)

iterations count:229 (1), effective:17 (0)

iterations count:323 (2), effective:40 (0)

iterations count:206 (1), effective:15 (0)

iterations count:237 (1), effective:21 (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="S_IBM5964-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_IBM5964-PT-none.tgz
mv S_IBM5964-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_IBM5964-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-146416418000043"
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 ;