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-2270
Executing tool marcie
Input is S_SimpleLoadBal-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r148st-smll-143305873900067
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433207715382

Model: S_SimpleLoadBal-PT-02
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 32 NrTr: 45 NrArc: 252)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 576 (5.8e+02) #states 832



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

checking: 2<=sum(P_server_processed_2, P_server_processed_1)
normalized: 2<=sum(P_server_processed_2, P_server_processed_1)

abstracting: (2<=sum(P_server_processed_2, P_server_processed_1)) states: 54
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [AF [[1<=sum(P_server_notification_ack_2, P_server_notification_ack_1) & 2<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]
normalized: EG [~ [EG [~ [[1<=sum(P_server_notification_ack_2, P_server_notification_ack_1) & 2<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]]]

abstracting: (2<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 832
abstracting: (1<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 365
.......................
EG iterations: 23

EG iterations: 0
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AF [[[sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_server_idle_2, P_server_idle_1) | 1<=sum(P_server_waiting_2, P_server_waiting_1)] | [3<=sum(P_client_ack_2, P_client_ack_1) & 1<=P_lb_idle_1]]] | 3<=sum(P_client_request_2, P_client_request_1)]
normalized: [3<=sum(P_client_request_2, P_client_request_1) | ~ [EG [~ [[[sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_server_idle_2, P_server_idle_1) | 1<=sum(P_server_waiting_2, P_server_waiting_1)] | [3<=sum(P_client_ack_2, P_client_ack_1) & 1<=P_lb_idle_1]]]]]]

abstracting: (1<=P_lb_idle_1) states: 324
abstracting: (3<=sum(P_client_ack_2, P_client_ack_1)) states: 0
abstracting: (1<=sum(P_server_waiting_2, P_server_waiting_1)) states: 624
abstracting: (sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_server_idle_2, P_server_idle_1)) states: 57
................
EG iterations: 16
abstracting: (3<=sum(P_client_request_2, P_client_request_1)) states: 0
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [[~ [1<=sum(P_server_notification_2, P_server_notification_1)] | ~ [1<=sum(P_client_idle_2, P_client_idle_1)]] U AG [sum(P_server_notification_2, P_server_notification_1)<=sum(P_server_processed_2, P_server_processed_1)]]
normalized: E [[~ [1<=sum(P_client_idle_2, P_client_idle_1)] | ~ [1<=sum(P_server_notification_2, P_server_notification_1)]] U ~ [E [true U ~ [sum(P_server_notification_2, P_server_notification_1)<=sum(P_server_processed_2, P_server_processed_1)]]]]

abstracting: (sum(P_server_notification_2, P_server_notification_1)<=sum(P_server_processed_2, P_server_processed_1)) states: 584
abstracting: (1<=sum(P_server_notification_2, P_server_notification_1)) states: 356
abstracting: (1<=sum(P_client_idle_2, P_client_idle_1)) states: 304
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EX [sum(P_client_ack_2, P_client_ack_1)<=P_lb_idle_1]
normalized: EX [sum(P_client_ack_2, P_client_ack_1)<=P_lb_idle_1]

abstracting: (sum(P_client_ack_2, P_client_ack_1)<=P_lb_idle_1) states: 640
.-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [A [~ [2<=sum(P_client_idle_2, P_client_idle_1)] U [sum(P_server_processed_2, P_server_processed_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1) | sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1]]]
normalized: ~ [[~ [EG [~ [[sum(P_server_processed_2, P_server_processed_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1) | sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1]]]] & ~ [E [2<=sum(P_client_idle_2, P_client_idle_1) U [2<=sum(P_client_idle_2, P_client_idle_1) & ~ [[sum(P_server_processed_2, P_server_processed_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1) | sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1]]]]]]]

abstracting: (sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1) states: 610
abstracting: (sum(P_server_processed_2, P_server_processed_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 573
abstracting: (2<=sum(P_client_idle_2, P_client_idle_1)) states: 32
abstracting: (2<=sum(P_client_idle_2, P_client_idle_1)) states: 32
abstracting: (sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1) states: 610
abstracting: (sum(P_server_processed_2, P_server_processed_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 573
................
EG iterations: 16
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EF [[~ [1<=sum(P_lb_routing_1_2, P_lb_routing_1_1)] | [2<=sum(P_client_request_2, P_client_request_1) | 3<=sum(P_server_notification_ack_2, P_server_notification_ack_1)]]] | sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_notification_2, P_server_notification_1)]
normalized: [sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_notification_2, P_server_notification_1) | E [true U [[2<=sum(P_client_request_2, P_client_request_1) | 3<=sum(P_server_notification_ack_2, P_server_notification_ack_1)] | ~ [1<=sum(P_lb_routing_1_2, P_lb_routing_1_1)]]]]

abstracting: (1<=sum(P_lb_routing_1_2, P_lb_routing_1_1)) states: 144
abstracting: (3<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 0
abstracting: (2<=sum(P_client_request_2, P_client_request_1)) states: 32
abstracting: (sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_notification_2, P_server_notification_1)) states: 550
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: 1<=sum(P_server_idle_2, P_server_idle_1)
normalized: 1<=sum(P_server_idle_2, P_server_idle_1)

abstracting: (1<=sum(P_server_idle_2, P_server_idle_1)) states: 365
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [EF [[3<=P_lb_idle_1 | sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]
normalized: EG [E [true U [3<=P_lb_idle_1 | sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]

abstracting: (sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 832
abstracting: (3<=P_lb_idle_1) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EG [[[sum(P_server_waiting_2, P_server_waiting_1)<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1) | 3<=sum(P_server_idle_2, P_server_idle_1)] & ~ [sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1]]] | A [[sum(P_client_request_2, P_client_request_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0) & sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1] U ~ [2<=sum(P_client_request_2, P_client_request_1)]]]
normalized: [EG [[~ [sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1] & [sum(P_server_waiting_2, P_server_waiting_1)<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1) | 3<=sum(P_server_idle_2, P_server_idle_1)]]] | [~ [E [~ [[sum(P_client_request_2, P_client_request_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0) & sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1]] U [2<=sum(P_client_request_2, P_client_request_1) & ~ [[sum(P_client_request_2, P_client_request_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0) & sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1]]]]] & ~ [EG [2<=sum(P_client_request_2, P_client_request_1)]]]]

abstracting: (2<=sum(P_client_request_2, P_client_request_1)) states: 32
...........
EG iterations: 11
abstracting: (sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1) states: 610
abstracting: (sum(P_client_request_2, P_client_request_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 832
abstracting: (2<=sum(P_client_request_2, P_client_request_1)) states: 32
abstracting: (sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1) states: 610
abstracting: (sum(P_client_request_2, P_client_request_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 832
abstracting: (3<=sum(P_server_idle_2, P_server_idle_1)) states: 0
abstracting: (sum(P_server_waiting_2, P_server_waiting_1)<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)) states: 448
abstracting: (sum(P_server_processed_2, P_server_processed_1)<=P_lb_balancing_1) states: 610
................
EG iterations: 16
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AG [~ [[1<=sum(P_server_notification_ack_2, P_server_notification_ack_1) & sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_client_idle_2, P_client_idle_1)]]] | AG [EX [sum(P_client_idle_2, P_client_idle_1)<=sum(P_client_ack_2, P_client_ack_1)]]]
normalized: [~ [E [true U ~ [EX [sum(P_client_idle_2, P_client_idle_1)<=sum(P_client_ack_2, P_client_ack_1)]]]] | ~ [E [true U [1<=sum(P_server_notification_ack_2, P_server_notification_ack_1) & sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_client_idle_2, P_client_idle_1)]]]]

abstracting: (sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_client_idle_2, P_client_idle_1)) states: 581
abstracting: (1<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 365
abstracting: (sum(P_client_idle_2, P_client_idle_1)<=sum(P_client_ack_2, P_client_ack_1)) states: 592
.-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [E [[sum(P_client_request_2, P_client_request_1)<=P_lb_balancing_1 | 3<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)] U [P_lb_idle_1<=P_lb_balancing_1 & 3<=sum(P_client_ack_2, P_client_ack_1)]]]
normalized: ~ [E [[sum(P_client_request_2, P_client_request_1)<=P_lb_balancing_1 | 3<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)] U [P_lb_idle_1<=P_lb_balancing_1 & 3<=sum(P_client_ack_2, P_client_ack_1)]]]

abstracting: (3<=sum(P_client_ack_2, P_client_ack_1)) states: 0
abstracting: (P_lb_idle_1<=P_lb_balancing_1) states: 508
abstracting: (3<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)) states: 0
abstracting: (sum(P_client_request_2, P_client_request_1)<=P_lb_balancing_1) states: 656
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [E [[sum(P_client_request_2, P_client_request_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1) | sum(P_client_request_2, P_client_request_1)<=sum(P_client_idle_2, P_client_idle_1)] U [sum(P_client_waiting_2, P_client_waiting_1)<=sum(P_server_notification_2, P_server_notification_1) | sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)]] & [sum(P_client_waiting_2, P_client_waiting_1)<=sum(P_client_request_2, P_client_request_1) | EG [[sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_lb_routing_1_2, P_lb_routing_1_1) & sum(P_client_idle_2, P_client_idle_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)]]]]
normalized: [[sum(P_client_waiting_2, P_client_waiting_1)<=sum(P_client_request_2, P_client_request_1) | EG [[sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_lb_routing_1_2, P_lb_routing_1_1) & sum(P_client_idle_2, P_client_idle_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)]]] & E [[sum(P_client_request_2, P_client_request_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1) | sum(P_client_request_2, P_client_request_1)<=sum(P_client_idle_2, P_client_idle_1)] U [sum(P_client_waiting_2, P_client_waiting_1)<=sum(P_server_notification_2, P_server_notification_1) | sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)]]]

abstracting: (sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)) states: 832
abstracting: (sum(P_client_waiting_2, P_client_waiting_1)<=sum(P_server_notification_2, P_server_notification_1)) states: 184
abstracting: (sum(P_client_request_2, P_client_request_1)<=sum(P_client_idle_2, P_client_idle_1)) states: 592
abstracting: (sum(P_client_request_2, P_client_request_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 648
abstracting: (sum(P_client_idle_2, P_client_idle_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 648
abstracting: (sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_lb_routing_1_2, P_lb_routing_1_1)) states: 832
...
EG iterations: 3
abstracting: (sum(P_client_waiting_2, P_client_waiting_1)<=sum(P_client_request_2, P_client_request_1)) states: 128
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: 3<=sum(P_server_notification_2, P_server_notification_1)
normalized: 3<=sum(P_server_notification_2, P_server_notification_1)

abstracting: (3<=sum(P_server_notification_2, P_server_notification_1)) states: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: 3<=sum(P_server_idle_2, P_server_idle_1)
normalized: 3<=sum(P_server_idle_2, P_server_idle_1)

abstracting: (3<=sum(P_server_idle_2, P_server_idle_1)) states: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [A [1<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0) U P_lb_idle_1<=sum(P_client_idle_2, P_client_idle_1)]] & [E [3<=sum(P_server_notification_ack_2, P_server_notification_ack_1) U sum(P_server_processed_2, P_server_processed_1)<=sum(P_server_notification_2, P_server_notification_1)] | AX [~ [sum(P_server_processed_2, P_server_processed_1)<=sum(P_client_request_2, P_client_request_1)]]]]
normalized: [[~ [EX [sum(P_server_processed_2, P_server_processed_1)<=sum(P_client_request_2, P_client_request_1)]] | E [3<=sum(P_server_notification_ack_2, P_server_notification_ack_1) U sum(P_server_processed_2, P_server_processed_1)<=sum(P_server_notification_2, P_server_notification_1)]] & ~ [[~ [EG [~ [P_lb_idle_1<=sum(P_client_idle_2, P_client_idle_1)]]] & ~ [E [~ [1<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)] U [~ [1<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)] & ~ [P_lb_idle_1<=sum(P_client_idle_2, P_client_idle_1)]]]]]]]

abstracting: (P_lb_idle_1<=sum(P_client_idle_2, P_client_idle_1)) states: 636
abstracting: (1<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 832
abstracting: (1<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 832
abstracting: (P_lb_idle_1<=sum(P_client_idle_2, P_client_idle_1)) states: 636
........
EG iterations: 8
abstracting: (sum(P_server_processed_2, P_server_processed_1)<=sum(P_server_notification_2, P_server_notification_1)) states: 584
abstracting: (3<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 0
abstracting: (sum(P_server_processed_2, P_server_processed_1)<=sum(P_client_request_2, P_client_request_1)) states: 590
.-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m4sec


BK_STOP 1433207720110

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

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: 0m0sec

564
iterations count:1180 (26), effective:121 (2)

initing FirstDep: 0m0sec


iterations count:215 (4), effective:22 (0)

iterations count:77 (1), effective:6 (0)

iterations count:334 (7), effective:12 (0)

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

iterations count:193 (4), effective:16 (0)

iterations count:759 (16), effective:73 (1)

iterations count:755 (16), effective:63 (1)

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

iterations count:45 (1), effective:0 (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="S_SimpleLoadBal-PT-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/S_SimpleLoadBal-PT-02.tgz
mv S_SimpleLoadBal-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is S_SimpleLoadBal-PT-02, 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 r148st-smll-143305873900067"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;