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-3254
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 r111-blw7-149441636800079
=====================================================================

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

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: IBM703_PT_none
(NrP: 262 NrTr: 284 NrArc: 572)

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

net check time: 0m 0.000sec

init dd package: 0m 1.056sec


RS generation: 0m 0.003sec


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



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

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (2<=merge_s00000458_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.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [[3<=decision_s00000793_activated | ~ [3<=task_s00000752_inputCriterion_s00000257_used]]]
normalized: ~ [E [true U ~ [[3<=decision_s00000793_activated | ~ [3<=task_s00000752_inputCriterion_s00000257_used]]]]]

abstracting: (3<=task_s00000752_inputCriterion_s00000257_used)
states: 0
abstracting: (3<=decision_s00000793_activated)
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.000sec

checking: AG [[~ [2<=merge_s00000446_activated] | 2<=decision_s00000787_input_s00000263]]
normalized: ~ [E [true U ~ [[2<=decision_s00000787_input_s00000263 | ~ [2<=merge_s00000446_activated]]]]]

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

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

MC time: 0m 0.000sec

checking: EF [[1<=task_s00000712_inputCriterion_s00000257_used & 1<=task_s00000736_inputCriterion_s00000257_used]]
normalized: E [true U [1<=task_s00000712_inputCriterion_s00000257_used & 1<=task_s00000736_inputCriterion_s00000257_used]]

abstracting: (1<=task_s00000736_inputCriterion_s00000257_used)
states: 270
abstracting: (1<=task_s00000712_inputCriterion_s00000257_used)
states: 1
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[~ [~ [decision_s00000801_activated<=callToProcess_s00000807_inputCriterion_s00000257_used]] | ~ [~ [decision_s00000804_activated<=task_s00000738_inputCriterion_s00000257_used]]]]
normalized: ~ [E [true U ~ [[decision_s00000801_activated<=callToProcess_s00000807_inputCriterion_s00000257_used | decision_s00000804_activated<=task_s00000738_inputCriterion_s00000257_used]]]]

abstracting: (decision_s00000804_activated<=task_s00000738_inputCriterion_s00000257_used)
states: 8,345 (3)
abstracting: (decision_s00000801_activated<=callToProcess_s00000807_inputCriterion_s00000257_used)
states: 8,369 (3)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [~ [[merge_s00000456_activated<=decision_s00000764_input_s00000263 | stopNode_s00000597_input_default<=task_s00000720_input_s00000263]]]
normalized: E [true U ~ [[merge_s00000456_activated<=decision_s00000764_input_s00000263 | stopNode_s00000597_input_default<=task_s00000720_input_s00000263]]]

abstracting: (stopNode_s00000597_input_default<=task_s00000720_input_s00000263)
states: 8,369 (3)
abstracting: (merge_s00000456_activated<=decision_s00000764_input_s00000263)
states: 8,365 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[2<=task_s00000747_inputCriterion_s00000257_used & [~ [merge_s00000445_activated<=task_s00000749_output_s00000264] | ~ [2<=task_s00000737_inputCriterion_s00000257_used]]]]
normalized: E [true U [2<=task_s00000747_inputCriterion_s00000257_used & [~ [merge_s00000445_activated<=task_s00000749_output_s00000264] | ~ [2<=task_s00000737_inputCriterion_s00000257_used]]]]

abstracting: (2<=task_s00000737_inputCriterion_s00000257_used)
states: 0
abstracting: (merge_s00000445_activated<=task_s00000749_output_s00000264)
states: 8,369 (3)
abstracting: (2<=task_s00000747_inputCriterion_s00000257_used)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [~ [[~ [3<=task_s00000757_inputCriterion_s00000257_used] | [1<=callToProcess_s00000807_input_s00000263 | task_s00000755_input_s00000263<=alpha]]]]
normalized: E [true U ~ [[~ [3<=task_s00000757_inputCriterion_s00000257_used] | [1<=callToProcess_s00000807_input_s00000263 | task_s00000755_input_s00000263<=alpha]]]]

abstracting: (task_s00000755_input_s00000263<=alpha)
states: 8,225 (3)
abstracting: (1<=callToProcess_s00000807_input_s00000263)
states: 145
abstracting: (3<=task_s00000757_inputCriterion_s00000257_used)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [~ [[[2<=task_s00000753_inputCriterion_s00000257_used | 3<=merge_s00000806_activated] & [decision_s00000776_activated<=fork_s00000466_activated_s00000272 | task_s00000726_input_s00000263<=merge_s00000449_input_s00000285]]]]
normalized: ~ [E [true U [[2<=task_s00000753_inputCriterion_s00000257_used | 3<=merge_s00000806_activated] & [decision_s00000776_activated<=fork_s00000466_activated_s00000272 | task_s00000726_input_s00000263<=merge_s00000449_input_s00000285]]]]

abstracting: (task_s00000726_input_s00000263<=merge_s00000449_input_s00000285)
states: 8,365 (3)
abstracting: (decision_s00000776_activated<=fork_s00000466_activated_s00000272)
states: 8,225 (3)
abstracting: (3<=merge_s00000806_activated)
states: 0
abstracting: (2<=task_s00000753_inputCriterion_s00000257_used)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[[~ [1<=merge_s00000319_input_s00000290] & ~ [task_s00000727_inputCriterion_s00000257_used<=decision_s00000804_activated]] & [[1<=task_s00000712_output_s00000264 | 2<=task_s00000763_input_s00000263] & ~ [decision_s00000783_input_s00000263<=merge_s00000446_input_s00000290]]]]
normalized: E [true U [[[1<=task_s00000712_output_s00000264 | 2<=task_s00000763_input_s00000263] & ~ [decision_s00000783_input_s00000263<=merge_s00000446_input_s00000290]] & [~ [1<=merge_s00000319_input_s00000290] & ~ [task_s00000727_inputCriterion_s00000257_used<=decision_s00000804_activated]]]]

abstracting: (task_s00000727_inputCriterion_s00000257_used<=decision_s00000804_activated)
states: 8,345 (3)
abstracting: (1<=merge_s00000319_input_s00000290)
states: 5
abstracting: (decision_s00000783_input_s00000263<=merge_s00000446_input_s00000290)
states: 8,365 (3)
abstracting: (2<=task_s00000763_input_s00000263)
states: 0
abstracting: (1<=task_s00000712_output_s00000264)
states: 1
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [[[~ [2<=task_s00000721_output_s00000264] | ~ [3<=task_s00000730_output_s00000264]] & [[merge_s00000454_activated<=task_s00000712_inputCriterion_s00000257_used | task_s00000721_inputCriterion_s00000257_used<=merge_s00000446_input_s00000447] | [3<=task_s00000738_input_s00000263 | 2<=task_s00000730_output_s00000264]]]]
normalized: ~ [E [true U ~ [[[~ [2<=task_s00000721_output_s00000264] | ~ [3<=task_s00000730_output_s00000264]] & [[merge_s00000454_activated<=task_s00000712_inputCriterion_s00000257_used | task_s00000721_inputCriterion_s00000257_used<=merge_s00000446_input_s00000447] | [3<=task_s00000738_input_s00000263 | 2<=task_s00000730_output_s00000264]]]]]]

abstracting: (2<=task_s00000730_output_s00000264)
states: 0
abstracting: (3<=task_s00000738_input_s00000263)
states: 0
abstracting: (task_s00000721_inputCriterion_s00000257_used<=merge_s00000446_input_s00000447)
states: 8,225 (3)
abstracting: (merge_s00000454_activated<=task_s00000712_inputCriterion_s00000257_used)
states: 8,365 (3)
abstracting: (3<=task_s00000730_output_s00000264)
states: 0
abstracting: (2<=task_s00000721_output_s00000264)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[[[task_s00000710_output_s00000264<=task_s00000740_input_s00000263 | task_s00000753_inputCriterion_s00000257_used<=task_s00000709_inputCriterion_s00000257_used] & [task_s00000729_output_s00000264<=task_s00000750_inputCriterion_s00000257_used & 3<=merge_s00000446_activated]] | [~ [task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_input_s00000290] & [decision_s00000789_activated<=task_s00000755_inputCriterion_s00000257_used & 2<=fork_s00000465_activated_s00000274]]]]
normalized: E [true U [[[decision_s00000789_activated<=task_s00000755_inputCriterion_s00000257_used & 2<=fork_s00000465_activated_s00000274] & ~ [task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_input_s00000290]] | [[task_s00000710_output_s00000264<=task_s00000740_input_s00000263 | task_s00000753_inputCriterion_s00000257_used<=task_s00000709_inputCriterion_s00000257_used] & [task_s00000729_output_s00000264<=task_s00000750_inputCriterion_s00000257_used & 3<=merge_s00000446_activated]]]]

abstracting: (3<=merge_s00000446_activated)
states: 0
abstracting: (task_s00000729_output_s00000264<=task_s00000750_inputCriterion_s00000257_used)
states: 8,365 (3)
abstracting: (task_s00000753_inputCriterion_s00000257_used<=task_s00000709_inputCriterion_s00000257_used)
states: 8,369 (3)
abstracting: (task_s00000710_output_s00000264<=task_s00000740_input_s00000263)
states: 8,369 (3)
abstracting: (task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_input_s00000290)
states: 8,365 (3)
abstracting: (2<=fork_s00000465_activated_s00000274)
states: 0
abstracting: (decision_s00000789_activated<=task_s00000755_inputCriterion_s00000257_used)
states: 8,365 (3)
-> the formula is FALSE

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

MC time: 0m 0.004sec

totally nodes used: 14047(1.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 14496 18988 33484
used/not used/entry size/cache size: 16753 67092111 16 1024MB
basic ops cache: hits/miss/sum: 11321 30687 42008
used/not used/entry size/cache size: 48242 16728974 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 2600 2704 5304
used/not used/entry size/cache size: 2704 2094448 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67094817
1 14047
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.542sec


BK_STOP 1494775445155

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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: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="/tmp/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-3254"
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 r111-blw7-149441636800079"
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 ;