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 Kanban-PT-0200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913400151
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463726598035


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: Kanban_PT_0200
(NrP: 16 NrTr: 16 NrArc: 40)

net check time: 0m 0.000sec

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

init dd package: 0m 3.987sec


RS generation: 1m29.110sec


-> reachability set: #nodes 42816 (4.3e+04) #states 31,731,714,717,364,931,267,341 (22)



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

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

abstracting: (1<=P4) states: 31,262,773,120,556,582,529,400 (22)
-> the formula is FALSE

FORMULA Kanban-PT-0200-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.840sec

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

abstracting: (3<=Pout1) states: 30,338,795,785,827,556,889,400 (22)
-> the formula is TRUE

FORMULA Kanban-PT-0200-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.889sec

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

abstracting: (2<=P3) states: 30,191,612,974,704,762,249,340 (22)
-> the formula is TRUE

FORMULA Kanban-PT-0200-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.404sec

checking: EF [[2<=Pout2 & 3<=Pout2]]
normalized: E [true U [2<=Pout2 & 3<=Pout2]]

abstracting: (3<=Pout2) states: 30,565,202,860,007,390,834,490 (22)
abstracting: (2<=Pout2) states: 30,951,447,898,483,561,745,940 (22)
-> the formula is TRUE

FORMULA Kanban-PT-0200-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.358sec

checking: EF [P1<=Pout2]
normalized: E [true U P1<=Pout2]

abstracting: (P1<=Pout2) states: 17,226,268,855,701,390,676,506 (22)
-> the formula is TRUE

FORMULA Kanban-PT-0200-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.117sec

checking: AG [~ [[~ [2<=Pout1] & 2<=Pback1]]]
normalized: ~ [E [true U [2<=Pback1 & ~ [2<=Pout1]]]]

abstracting: (2<=Pout1) states: 30,798,474,509,855,247,145,300 (22)
abstracting: (2<=Pback1) states: 30,798,474,509,855,247,145,300 (22)
-> the formula is FALSE

FORMULA Kanban-PT-0200-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.327sec

checking: AG [~ [~ [[1<=P3 | Pm2<=Pback1]]]]
normalized: ~ [E [true U ~ [[1<=P3 | Pm2<=Pback1]]]]

abstracting: (Pm2<=Pback1) states: 14,771,002,111,454,340,904,936 (22)
abstracting: (1<=P3) states: 30,954,001,837,959,140,259,340 (22)

FORMULA Kanban-PT-0200-ReachabilityCardinality-9 CANNOT_COMPUTE

MC time: 4m46.018sec

checking: AG [~ [[~ [3<=Pout4] & P3<=Pout4]]]
normalized: ~ [E [true U [P3<=Pout4 & ~ [3<=Pout4]]]]


FORMULA Kanban-PT-0200-ReachabilityCardinality-12 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [[~ [~ [Pback1<=Pback4]] | 2<=P4]]
normalized: ~ [E [true U ~ [[Pback1<=Pback4 | 2<=P4]]]]


FORMULA Kanban-PT-0200-ReachabilityCardinality-14 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [[~ [[Pout2<=Pm4 & 3<=Pout4]] | ~ [[P2<=Pback3 & 2<=Pout3]]]]
normalized: ~ [E [true U ~ [[~ [[P2<=Pback3 & 2<=Pout3]] | ~ [[Pout2<=Pm4 & 3<=Pout4]]]]]]


FORMULA Kanban-PT-0200-ReachabilityCardinality-2 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [[[[1<=Pback3 | 1<=Pm4] & 2<=P1] | [~ [1<=Pback4] | [3<=Pback1 | 1<=Pback4]]]]
normalized: ~ [E [true U ~ [[[[3<=Pback1 | 1<=Pback4] | ~ [1<=Pback4]] | [2<=P1 & [1<=Pback3 | 1<=Pm4]]]]]]


before gc: list nodes free: 106

after gc: idd nodes used:42831, unused:63957169; list nodes free:691516362
abstracting: (1<=Pm4) states: 31,262,773,120,556,582,529,400 (22)
abstracting: (1<=Pback3) states: 31,340,285,183,640,390,411,090 (22)
abstracting: (2<=P1) states: 30,798,474,509,855,247,145,300 (22)
abstracting: (1<=Pback4) states: 31,262,773,120,556,582,529,400 (22)
abstracting: (1<=Pback4) states: 31,262,773,120,556,582,529,400 (22)
abstracting: (3<=Pback1) states: 30,338,795,785,827,556,889,400 (22)
-> the formula is TRUE

FORMULA Kanban-PT-0200-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.928sec

checking: EF [[~ [Pback3<=P2] | [[P4<=Pback3 | 3<=Pback2] | P1<=Pout1]]]
normalized: E [true U [~ [Pback3<=P2] | [P1<=Pout1 | [P4<=Pback3 | 3<=Pback2]]]]

abstracting: (3<=Pback2) states: 30,565,202,860,007,390,834,490 (22)
abstracting: (P4<=Pback3) states: 17,226,268,855,701,390,676,506 (22)
abstracting: (P1<=Pout1) states: 15,983,676,018,577,100,515,591 (22)
abstracting: (Pback3<=P2) states: 11,377,702,399,158,213,961,486 (22)
-> the formula is TRUE

FORMULA Kanban-PT-0200-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m18.513sec

checking: AG [[[~ [Pout3<=Pout1] | ~ [3<=Pout2]] | [2<=Pm3 & [Pback1<=Pout2 | 1<=P2]]]]
normalized: ~ [E [true U ~ [[[2<=Pm3 & [Pback1<=Pout2 | 1<=P2]] | [~ [3<=Pout2] | ~ [Pout3<=Pout1]]]]]]

abstracting: (Pout3<=Pout1) states: 14,771,002,111,454,340,904,936 (22)
abstracting: (3<=Pout2) states: 30,565,202,860,007,390,834,490 (22)
abstracting: (1<=P2) states: 30,954,001,837,959,140,259,340 (22)
abstracting: (Pback1<=Pout2) states: 17,226,268,855,701,390,676,506 (22)
abstracting: (2<=Pm3) states: 30,951,447,898,483,561,745,940 (22)

FORMULA Kanban-PT-0200-ReachabilityCardinality-6 CANNOT_COMPUTE

MC time: 10m21.003sec

checking: EF [[[[2<=Pback4 & 3<=Pm1] | [Pout2<=P2 & 3<=P3]] & P4<=Pout4]]
normalized: E [true U [P4<=Pout4 & [[Pout2<=P2 & 3<=P3] | [2<=Pback4 & 3<=Pm1]]]]


FORMULA Kanban-PT-0200-ReachabilityCardinality-10 CANNOT_COMPUTE

MC time: 0m 0.002sec

checking: AG [[~ [~ [1<=P4]] | [[Pback3<=Pm4 & Pm4<=Pback4] & [Pm2<=Pm2 | 2<=Pback2]]]]
normalized: ~ [E [true U ~ [[1<=P4 | [[Pm2<=Pm2 | 2<=Pback2] & [Pback3<=Pm4 & Pm4<=Pback4]]]]]]


FORMULA Kanban-PT-0200-ReachabilityCardinality-3 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[[[Pm1<=P3 | 3<=Pout2] & Pm2<=Pout3] & [[3<=Pm3 & Pm4<=P1] & ~ [2<=P2]]]]
normalized: E [true U [[~ [2<=P2] & [3<=Pm3 & Pm4<=P1]] & [Pm2<=Pout3 & [Pm1<=P3 | 3<=Pout2]]]]


FORMULA Kanban-PT-0200-ReachabilityCardinality-1 CANNOT_COMPUTE

MC time: 0m 0.000sec


Total processing time: 22m50.037sec


BK_STOP 1463727968493

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

466 1181 6681 17248 33907 42064 43845 43306 42567 42428 44095 43556 42817 42745
iterations count:14216 (888), effective:4400 (275)

initing FirstDep: 0m 0.000sec


iterations count:616 (38), effective:200 (12)

iterations count:136 (8), effective:33 (2)
25596 38328 42816
iterations count:3001 (187), effective:796 (49)

iterations count:82 (5), effective:18 (1)
42971 43036 42880 83856
iterations count:4416 (276), effective:1200 (75)

iterations count:287 (17), effective:219 (13)
std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc


iterations count:616 (38), effective:200 (12)
std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

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="Kanban-PT-0200"
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/Kanban-PT-0200.tgz
mv Kanban-PT-0200 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 Kanban-PT-0200, 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 r065kn-blw3-146358913400151"
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 ;