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-3253
Executing tool marcie
Input is ClientsAndServers-PT-N0002P0, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-ebro-149580906300160
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495816628964

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: ClientsAndServers_PT_N0002P0
(NrP: 25 NrTr: 18 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 2.506sec

parse successfull
net created successfully

Net: ClientsAndServers_PT_N0002P0
(NrP: 25 NrTr: 18 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 7.692sec


RS generation: 0m 2.110sec


-> reachability set: #nodes 17697 (1.8e+04) #states 7,081,638 (6)



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

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

abstracting: (3<=SwA)
states: 765,570 (5)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.531sec

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

abstracting: (2<=CF)
states: 2,712,045 (6)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.352sec

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

abstracting: (2<=SA)
states: 402,021 (5)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.125sec

checking: EF [Mi<=Cb]
normalized: E [true U Mi<=Cb]

abstracting: (Mi<=Cb)
states: 513,209 (5)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.401sec

checking: AG [~ [[~ [1<=Uf] & 3<=SwG]]]
normalized: ~ [E [true U [3<=SwG & ~ [1<=Uf]]]]

abstracting: (1<=Uf)
states: 5,586,990 (6)
abstracting: (3<=SwG)
states: 771,645 (5)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.226sec

checking: EF [[Uf<=MpA & 2<=StF]]
normalized: E [true U [Uf<=MpA & 2<=StF]]

abstracting: (2<=StF)
states: 261,870 (5)
abstracting: (Uf<=MpA)
states: 1,944,120 (6)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.159sec

checking: EF [~ [[~ [2<=MpA] | [SR<=MtF & 3<=MwU]]]]
normalized: E [true U ~ [[[SR<=MtF & 3<=MwU] | ~ [2<=MpA]]]]

abstracting: (2<=MpA)
states: 402,021 (5)
abstracting: (3<=MwU)
states: 61,191 (4)
abstracting: (SR<=MtF)
states: 5,462,381 (6)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: AG [[~ [[1<=Uf & 1<=CA]] | CF<=CR]]
normalized: ~ [E [true U ~ [[CF<=CR | ~ [[1<=Uf & 1<=CA]]]]]]

abstracting: (1<=CA)
states: 5,643,787 (6)
abstracting: (1<=Uf)
states: 5,586,990 (6)
abstracting: (CF<=CR)
states: 5,217,463 (6)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.173sec

checking: EF [[[3<=SR & 2<=SG] & [~ [StF<=SA] | ~ [1<=SpG]]]]
normalized: E [true U [[~ [1<=SpG] | ~ [StF<=SA]] & [3<=SR & 2<=SG]]]

abstracting: (2<=SG)
states: 261,870 (5)
abstracting: (3<=SR)
states: 61,191 (4)
abstracting: (StF<=SA)
states: 5,841,062 (6)
abstracting: (1<=SpG)
states: 1,537,888 (6)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.142sec

checking: EF [[[~ [1<=SwA] | 3<=MpG] & [~ [SF<=CwA] & [3<=SpG & 3<=CF]]]]
normalized: E [true U [[[3<=SpG & 3<=CF] & ~ [SF<=CwA]] & [3<=MpG | ~ [1<=SwA]]]]

abstracting: (1<=SwA)
states: 5,052,733 (6)
abstracting: (3<=MpG)
states: 31,164 (4)
abstracting: (SF<=CwA)
states: 7,081,638 (6)
abstracting: (3<=CF)
states: 1,511,349 (6)
abstracting: (3<=SpG)
states: 31,164 (4)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.142sec

checking: AG [[~ [[1<=MpG & 2<=MpA]] | [~ [CG<=SG] & [3<=CwG & 3<=SpG]]]]
normalized: ~ [E [true U ~ [[[~ [CG<=SG] & [3<=CwG & 3<=SpG]] | ~ [[1<=MpG & 2<=MpA]]]]]]

abstracting: (2<=MpA)
states: 402,021 (5)
abstracting: (1<=MpG)
states: 1,537,888 (6)
abstracting: (3<=SpG)
states: 31,164 (4)
abstracting: (3<=CwG)
states: 6,287,892 (6)
abstracting: (CG<=SG)
states: 3,018,948 (6)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.311sec

checking: EF [[[[CA<=MpA & 1<=CF] & [3<=SR | 1<=CG]] & 3<=Uf]]
normalized: E [true U [3<=Uf & [[3<=SR | 1<=CG] & [CA<=MpA & 1<=CF]]]]

abstracting: (1<=CF)
states: 4,510,948 (6)
abstracting: (CA<=MpA)
states: 1,860,398 (6)
abstracting: (1<=CG)
states: 4,510,948 (6)
abstracting: (3<=SR)
states: 61,191 (4)
abstracting: (3<=Uf)
states: 2,822,484 (6)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.983sec

checking: AG [[1<=Ci | [[2<=Mi & CG<=CF] | [Ci<=Si & 3<=MwU]]]]
normalized: ~ [E [true U ~ [[1<=Ci | [[Ci<=Si & 3<=MwU] | [2<=Mi & CG<=CF]]]]]]

abstracting: (CG<=CF)
states: 4,291,606 (6)
abstracting: (2<=Mi)
states: 7,081,638 (6)
abstracting: (3<=MwU)
states: 61,191 (4)
abstracting: (Ci<=Si)
states: 1,941,960 (6)
abstracting: (1<=Ci)
states: 5,643,787 (6)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.679sec

checking: AG [[[[StR<=SG | 1<=Mi] | ~ [Si<=CG]] | [~ [CwA<=SpA] & 2<=Mi]]]
normalized: ~ [E [true U ~ [[[2<=Mi & ~ [CwA<=SpA]] | [~ [Si<=CG] | [StR<=SG | 1<=Mi]]]]]]

abstracting: (1<=Mi)
states: 7,081,638 (6)
abstracting: (StR<=SG)
states: 5,462,381 (6)
abstracting: (Si<=CG)
states: 6,092,517 (6)
abstracting: (CwA<=SpA)
states: 96,766 (4)
abstracting: (2<=Mi)
states: 7,081,638 (6)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.344sec

checking: AG [[[[3<=SpA | 2<=SpG] & ~ [3<=MpA]] | [SpA<=Uf | [SA<=StF | 1<=SwA]]]]
normalized: ~ [E [true U ~ [[[SpA<=Uf | [SA<=StF | 1<=SwA]] | [~ [3<=MpA] & [3<=SpA | 2<=SpG]]]]]]

abstracting: (2<=SpG)
states: 261,870 (5)
abstracting: (3<=SpA)
states: 59,166 (4)
abstracting: (3<=MpA)
states: 59,166 (4)
abstracting: (1<=SwA)
states: 5,052,733 (6)
abstracting: (SA<=StF)
states: 5,469,131 (6)
abstracting: (SpA<=Uf)
states: 6,635,583 (6)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.224sec

checking: AG [[[1<=MtF | [Mi<=SpA | SwA<=Mi]] | [[SR<=SpG | SpG<=CG] | ~ [1<=Cb]]]]
normalized: ~ [E [true U ~ [[[~ [1<=Cb] | [SR<=SpG | SpG<=CG]] | [1<=MtF | [Mi<=SpA | SwA<=Mi]]]]]]

abstracting: (SwA<=Mi)
states: 7,010,249 (6)
abstracting: (Mi<=SpA)
states: 0
abstracting: (1<=MtF)
states: 1,537,888 (6)
abstracting: (SpG<=CG)
states: 6,420,588 (6)
abstracting: (SR<=SpG)
states: 5,462,381 (6)
abstracting: (1<=Cb)
states: 4,510,948 (6)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.363sec

totally nodes used: 1018543 (1.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5453378 4505449 9958827
used/not used/entry size/cache size: 4983434 62125430 16 1024MB
basic ops cache: hits/miss/sum: 1808078 1708627 3516705
used/not used/entry size/cache size: 2501020 14276196 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 302376 233587 535963
used/not used/entry size/cache size: 230506 8158102 32 256MB
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 66153787
1 905358
2 42422
3 5001
4 1235
5 359
6 205
7 96
8 120
9 86
>= 10 195

Total processing time: 0m30.303sec


BK_STOP 1495816659611

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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:2022 (112), effective:438 (24)

initing FirstDep: 0m 0.001sec


iterations count:344 (19), effective:77 (4)

iterations count:164 (9), effective:33 (1)

iterations count:200 (11), effective:38 (2)

iterations count:633 (35), effective:133 (7)

iterations count:550 (30), effective:114 (6)

iterations count:509 (28), effective:114 (6)

iterations count:186 (10), effective:39 (2)

iterations count:567 (31), effective:126 (7)

iterations count:269 (14), effective:54 (3)

iterations count:521 (28), effective:117 (6)

iterations count:601 (33), effective:116 (6)

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="ClientsAndServers-PT-N0002P0"
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/ClientsAndServers-PT-N0002P0.tgz
mv ClientsAndServers-PT-N0002P0 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is ClientsAndServers-PT-N0002P0, 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 r161-ebro-149580906300160"
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 ;