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 IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913200048
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463723588860


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=CTLCardinality.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.006sec

init dd package: 0m 4.022sec


RS generation: 0m 0.133sec


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



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

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

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

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

MC time: 0m 0.001sec

checking: AF [AF [2<=decision_s00000764_activated]]
normalized: ~ [EG [EG [~ [2<=decision_s00000764_activated]]]]

abstracting: (2<=decision_s00000764_activated) states: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [AF [[2<=decision_s00000789_activated | 2<=task_s00000732_output_s00000264]]]
normalized: ~ [E [true U EG [~ [[2<=decision_s00000789_activated | 2<=task_s00000732_output_s00000264]]]]]

abstracting: (2<=task_s00000732_output_s00000264) states: 0
abstracting: (2<=decision_s00000789_activated) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.061sec

checking: EG [[AF [1<=task_s00000737_output_s00000264] | AG [2<=task_s00000756_inputCriterion_s00000257_used]]]
normalized: EG [[~ [E [true U ~ [2<=task_s00000756_inputCriterion_s00000257_used]]] | ~ [EG [~ [1<=task_s00000737_output_s00000264]]]]]

abstracting: (1<=task_s00000737_output_s00000264) states: 5
..........
EG iterations: 10
abstracting: (2<=task_s00000756_inputCriterion_s00000257_used) states: 0
...........
EG iterations: 11
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.220sec

checking: EF [E [1<=task_s00000756_input_s00000263 U 3<=task_s00000712_inputCriterion_s00000257_used]]
normalized: E [true U E [1<=task_s00000756_input_s00000263 U 3<=task_s00000712_inputCriterion_s00000257_used]]

abstracting: (3<=task_s00000712_inputCriterion_s00000257_used) states: 0
abstracting: (1<=task_s00000756_input_s00000263) states: 145
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EX [E [task_s00000759_inputCriterion_s00000257_used<=task_s00000719_output_s00000264 U 2<=task_s00000740_input_s00000263]]
normalized: EX [E [task_s00000759_inputCriterion_s00000257_used<=task_s00000719_output_s00000264 U 2<=task_s00000740_input_s00000263]]

abstracting: (2<=task_s00000740_input_s00000263) states: 0
abstracting: (task_s00000759_inputCriterion_s00000257_used<=task_s00000719_output_s00000264) states: 8,365 (3)
.-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [~ [[~ [2<=decision_s00000776_activated] & ~ [task_s00000757_inputCriterion_s00000257_used<=merge_s00000446_input_s00000447]]]]
normalized: EG [~ [[~ [task_s00000757_inputCriterion_s00000257_used<=merge_s00000446_input_s00000447] & ~ [2<=decision_s00000776_activated]]]]

abstracting: (2<=decision_s00000776_activated) states: 0
abstracting: (task_s00000757_inputCriterion_s00000257_used<=merge_s00000446_input_s00000447) states: 8,245 (3)
..................
EG iterations: 18
-> the formula is TRUE

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

MC time: 0m 0.660sec

checking: ~ [[~ [~ [decision_s00000775_input_s00000263<=decision_s00000805_activated]] & [EG [task_s00000752_inputCriterion_s00000257_used<=task_s00000707_inputCriterion_s00000257_used] | AF [1<=task_s00000753_inputCriterion_s00000257_used]]]]
normalized: ~ [[decision_s00000775_input_s00000263<=decision_s00000805_activated & [~ [EG [~ [1<=task_s00000753_inputCriterion_s00000257_used]]] | EG [task_s00000752_inputCriterion_s00000257_used<=task_s00000707_inputCriterion_s00000257_used]]]]

abstracting: (task_s00000752_inputCriterion_s00000257_used<=task_s00000707_inputCriterion_s00000257_used) states: 8,369 (3)
....
EG iterations: 4
abstracting: (1<=task_s00000753_inputCriterion_s00000257_used) states: 1
..
EG iterations: 2
abstracting: (decision_s00000775_input_s00000263<=decision_s00000805_activated) states: 8,369 (3)
-> the formula is FALSE

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

MC time: 0m 0.290sec

checking: ~ [AF [[[3<=merge_s00000452_input_s00000285 & merge_s00000454_activated<=task_s00000746_output_s00000264] & [1<=task_s00000739_inputCriterion_s00000257_used | 2<=task_s00000738_input_s00000263]]]]
normalized: EG [~ [[[1<=task_s00000739_inputCriterion_s00000257_used | 2<=task_s00000738_input_s00000263] & [3<=merge_s00000452_input_s00000285 & merge_s00000454_activated<=task_s00000746_output_s00000264]]]]

abstracting: (merge_s00000454_activated<=task_s00000746_output_s00000264) states: 8,365 (3)
abstracting: (3<=merge_s00000452_input_s00000285) states: 0
abstracting: (2<=task_s00000738_input_s00000263) states: 0
abstracting: (1<=task_s00000739_inputCriterion_s00000257_used) states: 5

EG iterations: 0
-> the formula is TRUE

FORMULA IBM703-PT-none-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EG [[task_s00000761_output_s00000264<=task_s00000711_output_s00000264 | [3<=merge_s00000458_activated | ~ [decision_s00000780_input_s00000263<=task_s00000736_output_s00000264]]]]
normalized: EG [[task_s00000761_output_s00000264<=task_s00000711_output_s00000264 | [3<=merge_s00000458_activated | ~ [decision_s00000780_input_s00000263<=task_s00000736_output_s00000264]]]]

abstracting: (decision_s00000780_input_s00000263<=task_s00000736_output_s00000264) states: 8,365 (3)
abstracting: (3<=merge_s00000458_activated) states: 0
abstracting: (task_s00000761_output_s00000264<=task_s00000711_output_s00000264) states: 8,365 (3)
......
EG iterations: 6
-> the formula is TRUE

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

MC time: 0m 0.142sec

checking: EX [[AF [2<=task_s00000741_output_s00000264] & [task_s00000735_inputCriterion_s00000257_used<=task_s00000709_output_s00000264 & decision_s00000784_input_s00000263<=task_s00000721_input_s00000263]]]
normalized: EX [[[task_s00000735_inputCriterion_s00000257_used<=task_s00000709_output_s00000264 & decision_s00000784_input_s00000263<=task_s00000721_input_s00000263] & ~ [EG [~ [2<=task_s00000741_output_s00000264]]]]]

abstracting: (2<=task_s00000741_output_s00000264) states: 0

EG iterations: 0
abstracting: (decision_s00000784_input_s00000263<=task_s00000721_input_s00000263) states: 8,365 (3)
abstracting: (task_s00000735_inputCriterion_s00000257_used<=task_s00000709_output_s00000264) states: 8,100 (3)
.-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: E [EF [merge_s00000806_activated<=task_s00000711_inputCriterion_s00000257_used] U [[1<=merge_s00000457_activated & 1<=decision_s00000804_activated] & ~ [task_s00000731_inputCriterion_s00000257_used<=task_s00000752_output_s00000264]]]
normalized: E [E [true U merge_s00000806_activated<=task_s00000711_inputCriterion_s00000257_used] U [~ [task_s00000731_inputCriterion_s00000257_used<=task_s00000752_output_s00000264] & [1<=merge_s00000457_activated & 1<=decision_s00000804_activated]]]

abstracting: (1<=decision_s00000804_activated) states: 25
abstracting: (1<=merge_s00000457_activated) states: 125
abstracting: (task_s00000731_inputCriterion_s00000257_used<=task_s00000752_output_s00000264) states: 8,365 (3)
abstracting: (merge_s00000806_activated<=task_s00000711_inputCriterion_s00000257_used) states: 8,365 (3)
-> the formula is FALSE

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

MC time: 0m 0.015sec

checking: [AX [EG [task_s00000705_input_s00000263<=decision_s00000776_activated]] | [EF [[3<=task_s00000762_inputCriterion_s00000257_used & 2<=decision_s00000789_activated]] & task_s00000706_inputCriterion_s00000257_used<=fork_s00000466_activated_s00000272]]
normalized: [~ [EX [~ [EG [task_s00000705_input_s00000263<=decision_s00000776_activated]]]] | [task_s00000706_inputCriterion_s00000257_used<=fork_s00000466_activated_s00000272 & E [true U [3<=task_s00000762_inputCriterion_s00000257_used & 2<=decision_s00000789_activated]]]]

abstracting: (2<=decision_s00000789_activated) states: 0
abstracting: (3<=task_s00000762_inputCriterion_s00000257_used) states: 0
abstracting: (task_s00000706_inputCriterion_s00000257_used<=fork_s00000466_activated_s00000272) states: 8,365 (3)
abstracting: (task_s00000705_input_s00000263<=decision_s00000776_activated) states: 8,365 (3)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.062sec

checking: ~ [E [[task_s00000763_output_s00000264<=task_s00000752_inputCriterion_s00000257_used & merge_s00000457_input_s00000285<=fork_s00000464_activated_s00000274] U [task_s00000755_inputCriterion_s00000257_used<=fork_s00000463_activated_s00000274 & 3<=task_s00000718_inputCriterion_s00000257_used]]]
normalized: ~ [E [[task_s00000763_output_s00000264<=task_s00000752_inputCriterion_s00000257_used & merge_s00000457_input_s00000285<=fork_s00000464_activated_s00000274] U [task_s00000755_inputCriterion_s00000257_used<=fork_s00000463_activated_s00000274 & 3<=task_s00000718_inputCriterion_s00000257_used]]]

abstracting: (3<=task_s00000718_inputCriterion_s00000257_used) states: 0
abstracting: (task_s00000755_inputCriterion_s00000257_used<=fork_s00000463_activated_s00000274) states: 8,225 (3)
abstracting: (merge_s00000457_input_s00000285<=fork_s00000464_activated_s00000274) states: 8,250 (3)
abstracting: (task_s00000763_output_s00000264<=task_s00000752_inputCriterion_s00000257_used) states: 8,365 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [~ [AF [[2<=merge_s00000446_input_s00000285 & 3<=callToProcess_s00000807_input_s00000263]]] | [~ [[task_s00000730_input_s00000263<=decision_s00000773_activated | [2<=task_s00000760_inputCriterion_s00000257_used | task_s00000762_output_s00000264<=merge_s00000445_activated]]] & E [task_s00000720_input_s00000263<=decision_s00000778_activated U 1<=merge_s00000456_input_s00000263]]]
normalized: [EG [~ [[2<=merge_s00000446_input_s00000285 & 3<=callToProcess_s00000807_input_s00000263]]] | [~ [[task_s00000730_input_s00000263<=decision_s00000773_activated | [2<=task_s00000760_inputCriterion_s00000257_used | task_s00000762_output_s00000264<=merge_s00000445_activated]]] & E [task_s00000720_input_s00000263<=decision_s00000778_activated U 1<=merge_s00000456_input_s00000263]]]

abstracting: (1<=merge_s00000456_input_s00000263) states: 5
abstracting: (task_s00000720_input_s00000263<=decision_s00000778_activated) states: 8,365 (3)
abstracting: (task_s00000762_output_s00000264<=merge_s00000445_activated) states: 8,345 (3)
abstracting: (2<=task_s00000760_inputCriterion_s00000257_used) states: 0
abstracting: (task_s00000730_input_s00000263<=decision_s00000773_activated) states: 8,365 (3)
abstracting: (3<=callToProcess_s00000807_input_s00000263) states: 0
abstracting: (2<=merge_s00000446_input_s00000285) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.076sec

checking: [~ [[EX [task_s00000713_input_s00000263<=task_s00000753_output_s00000264] & EX [task_s00000719_input_s00000263<=task_s00000722_output_s00000264]]] | [~ [[[2<=task_s00000735_inputCriterion_s00000257_used & task_s00000761_input_s00000263<=task_s00000745_inputCriterion_s00000257_used] & [fork_s00000466_activated_s00000274<=decision_s00000775_activated | 3<=merge_s00000453_input_s00000263]]] & EG [task_s00000721_output_s00000264<=merge_s00000462_input_s00000285]]]
normalized: [[EG [task_s00000721_output_s00000264<=merge_s00000462_input_s00000285] & ~ [[[2<=task_s00000735_inputCriterion_s00000257_used & task_s00000761_input_s00000263<=task_s00000745_inputCriterion_s00000257_used] & [fork_s00000466_activated_s00000274<=decision_s00000775_activated | 3<=merge_s00000453_input_s00000263]]]] | ~ [[EX [task_s00000713_input_s00000263<=task_s00000753_output_s00000264] & EX [task_s00000719_input_s00000263<=task_s00000722_output_s00000264]]]]

abstracting: (task_s00000719_input_s00000263<=task_s00000722_output_s00000264) states: 8,365 (3)
.abstracting: (task_s00000713_input_s00000263<=task_s00000753_output_s00000264) states: 6,702 (3)
.abstracting: (3<=merge_s00000453_input_s00000263) states: 0
abstracting: (fork_s00000466_activated_s00000274<=decision_s00000775_activated) states: 8,145 (3)
abstracting: (task_s00000761_input_s00000263<=task_s00000745_inputCriterion_s00000257_used) states: 8,365 (3)
abstracting: (2<=task_s00000735_inputCriterion_s00000257_used) states: 0
abstracting: (task_s00000721_output_s00000264<=merge_s00000462_input_s00000285) states: 8,225 (3)
.................
EG iterations: 17
-> the formula is TRUE

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

MC time: 0m 0.457sec


Total processing time: 0m 7.670sec


BK_STOP 1463723596566

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

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

initing FirstDep: 0m 0.000sec


iterations count:284 (1), effective:0 (0)

iterations count:284 (1), effective:0 (0)

iterations count:287 (1), effective:1 (0)

iterations count:723 (2), effective:72 (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="IBM703-PT-none"
export BK_EXAMINATION="CTLCardinality"
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/IBM703-PT-none.tgz
mv 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 IBM703-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r065kn-blw3-146358913200048"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;