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-N0005P1, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-ebro-149580906300187
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495816706182

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_N0005P1
(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.287sec

parse successfull
net created successfully

Net: ClientsAndServers_PT_N0005P1
(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.730sec


RS generation: 3m16.751sec


-> reachability set: #nodes 545079 (5.5e+05) #states 211,714,654,767 (11)



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

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

abstracting: (3<=CwA)
states: 210,718,180,574 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.583sec

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

abstracting: (3<=MpA)
states: 16,698,686,517 (10)
-> the formula is TRUE

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

MC time: 0m 8.592sec

checking: EF [[~ [~ [3<=StR]] & 1<=MtF]]
normalized: E [true U [3<=StR & 1<=MtF]]

abstracting: (1<=MtF)
states: 93,508,716,980 (10)
abstracting: (3<=StR)
states: 16,698,780,477 (10)
-> the formula is TRUE

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

MC time: 0m25.058sec

checking: EF [[~ [~ [3<=MwU]] & SwG<=MpG]]
normalized: E [true U [3<=MwU & SwG<=MpG]]

abstracting: (SwG<=MpG)
states: 30,783,998,430 (10)
abstracting: (3<=MwU)
states: 16,698,780,477 (10)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.111sec

checking: EF [[3<=SF & [[1<=MpA | 1<=CF] & ~ [1<=CG]]]]
normalized: E [true U [3<=SF & [~ [1<=CG] & [1<=MpA | 1<=CF]]]]

abstracting: (1<=CF)
states: 180,492,554,396 (11)
abstracting: (1<=MpA)
states: 96,784,631,615 (10)
abstracting: (1<=CG)
states: 180,492,554,396 (11)
abstracting: (3<=SF)
states: 15,057,985,374 (10)
-> the formula is TRUE

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

MC time: 0m38.195sec

checking: EF [[[[1<=SwA | Ci<=Ci] & ~ [3<=SG]] & ~ [1<=Uf]]]
normalized: E [true U [~ [1<=Uf] & [~ [3<=SG] & [1<=SwA | Ci<=Ci]]]]

abstracting: (Ci<=Ci)
states: 211,714,654,767 (11)
abstracting: (1<=SwA)
states: 196,622,015,897 (11)
abstracting: (3<=SG)
states: 15,057,985,374 (10)
abstracting: (1<=Uf)
states: 203,868,470,652 (11)
-> the formula is TRUE

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

MC time: 0m 7.053sec

checking: EF [~ [[[MpG<=SA | 2<=Uf] | [CR<=Ci & 2<=MpG]]]]
normalized: E [true U ~ [[[CR<=Ci & 2<=MpG] | [MpG<=SA | 2<=Uf]]]]

abstracting: (2<=Uf)
states: 194,966,020,557 (11)
abstracting: (MpG<=SA)
states: 147,268,347,779 (11)
abstracting: (2<=MpG)
states: 38,875,393,935 (10)
abstracting: (CR<=Ci)
states: 112,333,698,229 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.136sec

checking: EF [[2<=CF & [~ [SwA<=StF] | [SG<=SwA | 2<=CG]]]]
normalized: E [true U [2<=CF & [[SG<=SwA | 2<=CG] | ~ [SwA<=StF]]]]

abstracting: (SwA<=StF)
states: 44,679,750,629 (10)
abstracting: (2<=CG)
states: 152,998,296,759 (11)
abstracting: (SG<=SwA)
states: 190,593,651,587 (11)
abstracting: (2<=CF)
states: 152,998,296,759 (11)
-> the formula is TRUE

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

MC time: 1m 2.356sec

checking: EF [[~ [[SpA<=Cb | 2<=SpG]] & [[2<=CG & 2<=StF] | [1<=SF & 1<=Si]]]]
normalized: E [true U [[[1<=SF & 1<=Si] | [2<=CG & 2<=StF]] & ~ [[SpA<=Cb | 2<=SpG]]]]

abstracting: (2<=SpG)
states: 38,875,393,935 (10)
abstracting: (SpA<=Cb)
states: 189,459,863,461 (11)
abstracting: (2<=StF)
states: 38,875,393,935 (10)
abstracting: (2<=CG)
states: 152,998,296,759 (11)
abstracting: (1<=Si)
states: 109,278,992,043 (11)
abstracting: (1<=SF)
states: 93,508,716,980 (10)
-> the formula is TRUE

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

MC time: 2m 6.343sec

checking: EF [[[~ [CR<=MtF] | [MpA<=MpG & SA<=SwG]] & 3<=SwA]]
normalized: E [true U [3<=SwA & [[MpA<=MpG & SA<=SwG] | ~ [CR<=MtF]]]]

abstracting: (CR<=MtF)
states: 41,019,602,338 (10)
abstracting: (SA<=SwG)
states: 189,151,335,881 (11)
abstracting: (MpA<=MpG)
states: 143,374,068,449 (11)
abstracting: (3<=SwA)
states: 120,712,241,883 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.750sec

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

abstracting: (3<=MpA)
states: 16,698,686,517 (10)
abstracting: (2<=Ci)
states: 163,490,881,521 (11)
abstracting: (1<=CwG)
states: 211,672,459,779 (11)
abstracting: (1<=SR)
states: 96,784,775,165 (10)
abstracting: (CwG<=Ci)
states: 35,085,163,690 (10)
abstracting: (2<=SG)
states: 38,875,393,935 (10)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.293sec

checking: AG [[[[SpA<=CA | SwA<=SR] & [3<=Si & 1<=SR]] | SR<=SwG]]
normalized: ~ [E [true U ~ [[SR<=SwG | [[3<=Si & 1<=SR] & [SpA<=CA | SwA<=SR]]]]]]

abstracting: (SwA<=SR)
states: 46,324,494,431 (10)
abstracting: (SpA<=CA)
states: 192,789,429,706 (11)
abstracting: (1<=SR)
states: 96,784,775,165 (10)
abstracting: (3<=Si)
states: 23,913,006,795 (10)
abstracting: (SR<=SwG)
states: 211,714,654,767 (11)
-> the formula is TRUE

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

MC time: 0m 7.444sec

checking: EF [[SwA<=SwA & [[CwG<=CA | SF<=CG] & ~ [Cb<=Ci]]]]
normalized: E [true U [SwA<=SwA & [~ [Cb<=Ci] & [CwG<=CA | SF<=CG]]]]

abstracting: (SF<=CG)
states: 190,134,730,951 (11)
abstracting: (CwG<=CA)
states: 35,085,163,690 (10)
abstracting: (Cb<=Ci)
states: 122,698,717,201 (11)
abstracting: (SwA<=SwA)
states: 211,714,654,767 (11)

before gc: list nodes free: 152

after gc: idd nodes used:11320149, unused:52679851; list nodes free:422718870
MC time: 12m47.038sec

checking: AG [[[[MwU<=CwA | StR<=SF] | [3<=SwA | 1<=SR]] | [SwA<=SwA | [2<=CA | 2<=Si]]]]
normalized: ~ [E [true U ~ [[[SwA<=SwA | [2<=CA | 2<=Si]] | [[3<=SwA | 1<=SR] | [MwU<=CwA | StR<=SF]]]]]]

abstracting: (StR<=SF)
states: 143,373,924,899 (11)
abstracting: (MwU<=CwA)
states: 211,243,491,986 (11)
abstracting: (1<=SR)
states: 96,784,775,165 (10)
abstracting: (3<=SwA)
states: 120,712,241,883 (11)
abstracting: (2<=Si)
states: 52,999,844,139 (10)
abstracting: (2<=CA)
states: 163,490,881,521 (11)
abstracting: (SwA<=SwA)
states: 211,714,654,767 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.079sec

checking: EF [[~ [[3<=SG | MwU<=Cb]] & [[SwA<=MpG & Uf<=SR] | [3<=SF & MpA<=SpA]]]]
normalized: E [true U [[[3<=SF & MpA<=SpA] | [SwA<=MpG & Uf<=SR]] & ~ [[3<=SG | MwU<=Cb]]]]

abstracting: (MwU<=Cb)
states: 189,459,828,151 (11)
abstracting: (3<=SG)
states: 15,057,985,374 (10)
abstracting: (Uf<=SR)
states: 14,435,272,775 (10)
abstracting: (SwA<=MpG)
states: 44,679,750,629 (10)
abstracting: (MpA<=SpA)
states: 144,462,409,073 (11)
abstracting: (3<=SF)
states: 15,057,985,374 (10)

BK_STOP 1495818542940

--------------------
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:4822 (267), effective:1040 (57)

initing FirstDep: 0m 0.005sec


iterations count:147 (8), effective:30 (1)

iterations count:275 (15), effective:59 (3)

iterations count:454 (25), effective:94 (5)

iterations count:481 (26), effective:128 (7)

iterations count:1424 (79), effective:317 (17)

iterations count:1437 (79), effective:323 (17)

iterations count:219 (12), effective:45 (2)

iterations count:405 (22), effective:105 (5)

iterations count:458 (25), effective:104 (5)

iterations count:589 (32), effective:115 (6)

sat_reach.icc:155: Timeout: after 760 sec


iterations count:1878 (104), effective:435 (24)
/home/mcc/BenchKit/BenchKit_head.sh: line 15: 325 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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-N0005P1"
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-N0005P1.tgz
mv ClientsAndServers-PT-N0005P1 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-N0005P1, 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-149580906300187"
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 ;