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 JoinFreeModules-PT-0010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r191-blw7-149581061600034
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496737799664

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: JoinFreeModules_PT_0010
(NrP: 51 NrTr: 81 NrArc: 232)

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

net check time: 0m 0.000sec

init dd package: 0m 0.984sec

parse successfull
net created successfully

Net: JoinFreeModules_PT_0010
(NrP: 51 NrTr: 81 NrArc: 232)

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

net check time: 0m 0.000sec

init dd package: 0m 3.216sec


RS generation: 0m 0.079sec


-> reachability set: #nodes 1422 (1.4e+03) #states 1,590,240,687,854,486,655,624,010,000,000,000 (33)



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

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

abstracting: (3<=p33)
states: 606,421,927,378,002,805,996,333,000,000,000 (32)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.126sec

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

abstracting: (2<=p16)
states: 1,020,341,034,647,304,595,785,549,000,000,000 (33)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.158sec

checking: EF [~ [p20<=p8]]
normalized: E [true U ~ [p20<=p8]]

abstracting: (p20<=p8)
states: 839,795,327,505,773,003,290,644,400,000,000 (32)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.170sec

checking: AG [~ [[[2<=p49 & 3<=p2] | ~ [2<=p31]]]]
normalized: ~ [E [true U [[2<=p49 & 3<=p2] | ~ [2<=p31]]]]

abstracting: (2<=p31)
states: 1,020,341,034,647,304,595,785,549,000,000,000 (33)
abstracting: (3<=p2)
states: 615,552,495,920,707,992,535,801,000,000,000 (32)
abstracting: (2<=p49)
states: 965,557,623,391,073,476,548,741,000,000,000 (32)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.233sec

checking: EF [[~ [p35<=p23] & 3<=p18]]
normalized: E [true U [3<=p18 & ~ [p35<=p23]]]

abstracting: (p35<=p23)
states: 839,795,327,505,773,003,290,644,400,000,000 (32)
abstracting: (3<=p18)
states: 606,421,927,378,002,805,996,333,000,000,000 (32)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.546sec

checking: EF [[p28<=p5 & p31<=p5]]
normalized: E [true U [p28<=p5 & p31<=p5]]

abstracting: (p31<=p5)
states: 880,863,226,829,074,489,445,797,000,000,000 (32)
abstracting: (p28<=p5)
states: 988,800,526,821,714,223,336,053,400,000,000 (32)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.307sec

checking: AG [[[~ [p27<=p40] | ~ [2<=p49]] & 1<=p18]]
normalized: ~ [E [true U ~ [[1<=p18 & [~ [p27<=p40] | ~ [2<=p49]]]]]]

abstracting: (2<=p49)
states: 965,557,623,391,073,476,548,741,000,000,000 (32)
abstracting: (p27<=p40)
states: 980,188,012,467,058,059,142,903,700,000,000 (32)
abstracting: (1<=p18)
states: 1,193,060,956,246,811,041,157,152,000,000,000 (33)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.255sec

checking: EF [[[[p8<=p48 | p12<=p12] & ~ [p47<=p13]] & 2<=p6]]
normalized: E [true U [2<=p6 & [~ [p47<=p13] & [p8<=p48 | p12<=p12]]]]

abstracting: (p12<=p12)
states: 1,590,240,687,854,486,655,624,010,000,000,000 (33)
abstracting: (p8<=p48)
states: 925,130,465,719,891,652,606,884,400,000,000 (32)
abstracting: (p47<=p13)
states: 916,214,691,253,749,307,377,555,400,000,000 (32)
abstracting: (2<=p6)
states: 1,020,341,034,647,304,595,785,549,000,000,000 (33)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.717sec

checking: AG [[~ [1<=p16] | [p49<=p16 | [p21<=p7 | p36<=p28]]]]
normalized: ~ [E [true U ~ [[[p49<=p16 | [p21<=p7 | p36<=p28]] | ~ [1<=p16]]]]]

abstracting: (1<=p16)
states: 1,269,909,908,147,913,027,864,341,000,000,000 (33)
abstracting: (p36<=p28)
states: 811,244,461,979,731,872,940,914,000,000,000 (32)
abstracting: (p21<=p7)
states: 818,259,854,954,928,401,833,081,000,000,000 (32)
abstracting: (p49<=p16)
states: 916,900,940,125,479,741,054,863,900,000,000 (32)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.408sec

checking: EF [[~ [[p20<=p1 & p17<=p8]] & [[3<=p45 | 1<=p30] | 2<=p25]]]
normalized: E [true U [[2<=p25 | [3<=p45 | 1<=p30]] & ~ [[p20<=p1 & p17<=p8]]]]

abstracting: (p17<=p8)
states: 916,214,691,253,749,307,377,555,400,000,000 (32)
abstracting: (p20<=p1)
states: 925,228,761,314,250,918,969,151,400,000,000 (32)
abstracting: (1<=p30)
states: 1,234,148,514,688,984,380,584,758,000,000,000 (33)
abstracting: (3<=p45)
states: 715,988,749,890,465,044,469,949,000,000,000 (32)
abstracting: (2<=p25)
states: 942,731,202,034,310,510,200,071,000,000,000 (32)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.798sec

checking: EF [[[[3<=p37 & 1<=p29] & [p14<=p37 & 1<=p6]] & ~ [[1<=p47 & 2<=p40]]]]
normalized: E [true U [~ [[1<=p47 & 2<=p40]] & [[p14<=p37 & 1<=p6] & [3<=p37 & 1<=p29]]]]

abstracting: (1<=p29)
states: 1,240,996,441,096,013,270,489,359,000,000,000 (33)
abstracting: (3<=p37)
states: 615,552,495,920,707,992,535,801,000,000,000 (32)
abstracting: (1<=p6)
states: 1,269,909,908,147,913,027,864,341,000,000,000 (33)
abstracting: (p14<=p37)
states: 836,612,734,595,074,090,183,466,200,000,000 (32)
abstracting: (2<=p40)
states: 942,731,202,034,310,510,200,071,000,000,000 (32)
abstracting: (1<=p47)
states: 1,202,191,524,789,516,227,696,620,000,000,000 (33)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.839sec

checking: EF [[[2<=p37 & 2<=p39] & [[3<=p10 | 1<=p1] & [p25<=p13 & 2<=p2]]]]
normalized: E [true U [[[3<=p10 | 1<=p1] & [p25<=p13 & 2<=p2]] & [2<=p37 & 2<=p39]]]

abstracting: (2<=p39)
states: 965,557,623,391,073,476,548,741,000,000,000 (32)
abstracting: (2<=p37)
states: 874,251,937,964,021,611,154,061,000,000,000 (32)
abstracting: (2<=p2)
states: 874,251,937,964,021,611,154,061,000,000,000 (32)
abstracting: (p25<=p13)
states: 839,795,327,505,773,003,290,644,400,000,000 (32)
abstracting: (1<=p1)
states: 1,269,909,908,147,913,027,864,341,000,000,000 (33)
abstracting: (3<=p10)
states: 715,988,749,890,465,044,469,949,000,000,000 (32)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.397sec

checking: AG [[[p37<=p16 | 3<=p11] | [p<=p1 | [p29<=p33 | 1<=p36]]]]
normalized: ~ [E [true U ~ [[[p<=p1 | [p29<=p33 | 1<=p36]] | [p37<=p16 | 3<=p11]]]]]

abstracting: (3<=p11)
states: 753,271,904,773,177,889,506,110,000,000,000 (32)
abstracting: (p37<=p16)
states: 1,003,146,222,731,813,819,651,353,900,000,000 (33)
abstracting: (1<=p36)
states: 1,269,909,908,147,913,027,864,341,000,000,000 (33)
abstracting: (p29<=p33)
states: 829,763,351,957,017,655,592,016,800,000,000 (32)
abstracting: (p<=p1)
states: 1,269,909,908,147,913,027,864,341,000,000,000 (33)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.408sec

checking: AG [[[[1<=p6 & p14<=p22] & p20<=p37] | [3<=p50 | p37<=p36]]]
normalized: ~ [E [true U ~ [[[p20<=p37 & [1<=p6 & p14<=p22]] | [3<=p50 | p37<=p36]]]]]

abstracting: (p37<=p36)
states: 975,449,072,645,670,761,966,498,000,000,000 (32)
abstracting: (3<=p50)
states: 715,988,749,890,465,044,469,949,000,000,000 (32)
abstracting: (p14<=p22)
states: 836,612,734,595,074,090,183,466,200,000,000 (32)
abstracting: (1<=p6)
states: 1,269,909,908,147,913,027,864,341,000,000,000 (33)
abstracting: (p20<=p37)
states: 846,585,732,787,213,878,064,733,600,000,000 (32)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.656sec

checking: EF [[[[p48<=p38 & 1<=p29] | [p6<=p17 & 2<=p42]] & [[2<=p36 & p28<=p26] & ~ [2<=p49]]]]
normalized: E [true U [[~ [2<=p49] & [2<=p36 & p28<=p26]] & [[p6<=p17 & 2<=p42] | [p48<=p38 & 1<=p29]]]]

abstracting: (1<=p29)
states: 1,240,996,441,096,013,270,489,359,000,000,000 (33)
abstracting: (p48<=p38)
states: 925,130,465,719,891,652,606,884,400,000,000 (32)
abstracting: (2<=p42)
states: 874,251,937,964,021,611,154,061,000,000,000 (32)
abstracting: (p6<=p17)
states: 818,259,854,954,928,401,833,081,000,000,000 (32)
abstracting: (p28<=p26)
states: 984,579,641,188,375,948,505,966,000,000,000 (32)
abstracting: (2<=p36)
states: 1,020,341,034,647,304,595,785,549,000,000,000 (33)
abstracting: (2<=p49)
states: 965,557,623,391,073,476,548,741,000,000,000 (32)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.947sec

checking: EF [[[2<=p27 & [p17<=p16 | 3<=p7]] & [[p9<=p37 | p2<=p19] & ~ [p2<=p28]]]]
normalized: E [true U [[[p9<=p37 | p2<=p19] & ~ [p2<=p28]] & [2<=p27 & [p17<=p16 | 3<=p7]]]]

abstracting: (3<=p7)
states: 615,552,495,920,707,992,535,801,000,000,000 (32)
abstracting: (p17<=p16)
states: 975,449,072,645,670,761,966,498,000,000,000 (32)
abstracting: (2<=p27)
states: 874,251,937,964,021,611,154,061,000,000,000 (32)
abstracting: (p2<=p28)
states: 916,214,691,253,749,307,377,555,400,000,000 (32)
abstracting: (p2<=p19)
states: 988,271,550,900,958,615,838,372,100,000,000 (32)
abstracting: (p9<=p37)
states: 836,612,734,595,074,090,183,466,200,000,000 (32)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.873sec

totally nodes used: 14323247 (1.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 71185025 14435597 85620622
used/not used/entry size/cache size: 21987282 45121582 16 1024MB
basic ops cache: hits/miss/sum: 58117568 11745244 69862812
used/not used/entry size/cache size: 13081879 3695337 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: 514685 102976 617661
used/not used/entry size/cache size: 102444 8286164 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 54648827
1 11117194
2 1151723
3 106625
4 24400
5 21933
6 21104
7 5303
8 1653
9 2969
>= 10 7133

Total processing time: 0m41.111sec


BK_STOP 1496737840950

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

check for maximal unmarked siphon
ok
check for constant places
p
found 1 constant places
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
p
found 1 constant places
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


iterations count:4865 (60), effective:1313 (16)

initing FirstDep: 0m 0.000sec


iterations count:89 (1), effective:8 (0)

iterations count:108 (1), effective:9 (0)

iterations count:115 (1), effective:19 (0)

iterations count:130 (1), effective:19 (0)

iterations count:184 (2), effective:43 (0)

iterations count:1092 (13), effective:348 (4)

iterations count:91 (1), effective:10 (0)

iterations count:150 (1), effective:24 (0)

iterations count:353 (4), effective:70 (0)

iterations count:202 (2), effective:57 (0)

iterations count:259 (3), effective:64 (0)

iterations count:1043 (12), effective:332 (4)

iterations count:472 (5), effective:173 (2)

iterations count:374 (4), effective:62 (0)

iterations count:1181 (14), effective:371 (4)

iterations count:431 (5), effective:128 (1)

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="JoinFreeModules-PT-0010"
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/JoinFreeModules-PT-0010.tgz
mv JoinFreeModules-PT-0010 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 JoinFreeModules-PT-0010, 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 r191-blw7-149581061600034"
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 ;