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)
...................
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is SimpleLoadBal-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-smll-152708748900144
=====================================================================

--------------------
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-PT-02-CTLFireability-00
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-01
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-02
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-03
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-04
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-05
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-06
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-07
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-08
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-09
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-10
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-11
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-12
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-13
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-14
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1527213700748


BK_STOP 1527213746311

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using SimpleLoadBal-PT-02 as instance name.
Using SimpleLoadBal as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 183, 'Memory': 111.35, 'Tool': 'lola'}, {'Time': 188, 'Memory': 100, 'Tool': 'gspn'}, {'Time': 284, 'Memory': 112.08, 'Tool': 'lola'}, {'Time': 1688, 'Memory': 166.96, 'Tool': 'gspn'}, {'Time': 2144, 'Memory': 2206.2, 'Tool': 'marcie'}, {'Time': 2175, 'Memory': 2206.31, 'Tool': 'marcie'}, {'Time': 3260, 'Memory': 257.15, 'Tool': 'itstools'}, {'Time': 3330, 'Memory': 256.02, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola SimpleLoadBal-PT-02...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
SimpleLoadBal-PT-02: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
SimpleLoadBal-PT-02: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ SimpleLoadBal-PT-02 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 77/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 32 places, 45 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 79 transition conflict sets
lola: TASK
lola: reading formula from SimpleLoadBal-PT-02-CTLFireability.task
lola: FIREABLE(T-server_endloop_2) : (FIREABLE(T-lb_balancing_receive_notification_5) OR (NOT(A (G ((FIREABLE(T-lb_no_balance_5) AND FIREABLE(T-lb_balancing_receive_notification_3))))) AND (A (G (FIREABLE(T-client_receive_1))) AND (E (X (FIREABLE(T-lb_no_balance_4))) OR (FIREABLE(T-lb_no_balance_4) AND FIREABLE(T-client_send_1) AND (FIREABLE(T-lb_idle_receive_notification_2) OR FIREABLE(T-client_receive_1))))))) : (NOT FIREABLE(T-client_receive_2) AND ((A (X (FIREABLE(T-lb_route_to_1_11))) AND (FIREABLE(T-server_endloop_1) OR A (F (FIREABLE(T-lb_receive_client_1))))) OR E (G (((FIREABLE(T-lb_no_balance_1) OR FIREABLE(T-server_notify_1)) AND NOT FIREABLE(T-lb_no_balance_6)))))) : E (F ((((FIREABLE(T-lb_no_balance_8) OR FIREABLE(T-lb_balance_to_2_14) OR FIREABLE(T-lb_idle_receive_notification_3)) OR E (X (FIREABLE(T-server_process_1)))) OR E (X ((FIREABLE(T-lb_idle_receive_notification_5) AND FIREABLE(T-server_process_1))))))) : ((((FIREABLE(T-lb_balancing_receive_notification_6) OR FIREABLE(T-server_notify_1)) AND (E (X (FIREABLE(T-lb_route_to_1_15))) OR FIREABLE(T-server_endloop_1))) AND FIREABLE(T-lb_route_to_2_17)) OR (A (X (A (F (FIREABLE(T-lb_balancing_receive_notification_5))))) OR A (F (E (F (FIREABLE(T-client_send_2))))))) : (E (((NOT FIREABLE(T-lb_idle_receive_notification_6) AND FIREABLE(T-server_process_2)) U (FIREABLE(T-lb_route_to_1_2) OR FIREABLE(T-lb_route_to_1_6) OR FIREABLE(T-lb_idle_receive_notification_6)))) AND (A (X (E (F (FIREABLE(T-lb_route_to_1_5))))) OR A (((FIREABLE(T-lb_idle_receive_notification_2)) U (FIREABLE(T-lb_route_to_1_5) AND FIREABLE(T-lb_no_balance_4)))))) : FIREABLE(T-lb_route_to_2_17) : (A ((FIREABLE(T-lb_balancing_receive_notification_5) U (FIREABLE(T-server_endloop_2) AND FIREABLE(T-lb_no_balance_8) AND (FIREABLE(T-lb_balancing_receive_notification_2) OR FIREABLE(T-lb_route_to_1_15))))) OR NOT(NOT(A ((FIREABLE(T-lb_balancing_receive_notification_3) U FIREABLE(T-lb_idle_receive_notification_2)))))) : (A (F (E (F ((FIREABLE(T-lb_route_to_2_4) AND FIREABLE(T-lb_no_balance_6)))))) AND (NOT(E (F (FIREABLE(T-lb_route_to_1_14)))) OR E (((FIREABLE(T-lb_idle_receive_notification_5) OR FIREABLE(T-lb_balancing_receive_notification_2)) U (FIREABLE(T-lb_route_to_1_2) AND FIREABLE(T-server_notify_1)))))) : A (X ((FIREABLE(T-lb_route_to_1_10) AND (E (X (FIREABLE(T-lb_balance_to_1_6))) AND E (G (FIREABLE(T-lb_balance_to_1_6))))))) : NOT(((FIREABLE(T-lb_idle_receive_notification_6) AND E (X ((FIREABLE(T-client_receive_2) AND FIREABLE(T-lb_balance_to_2_13))))) OR ((FIREABLE(T-lb_idle_receive_notification_6) AND ((FIREABLE(T-lb_route_to_1_2) AND FIREABLE(T-lb_balance_to_2_14)) OR (FIREABLE(T-lb_no_balance_6) AND FIREABLE(T-lb_balance_to_2_14)))) OR (A (F (FIREABLE(T-lb_idle_receive_notification_3))) OR (FIREABLE(T-lb_route_to_1_1) AND (FIREABLE(T-lb_balancing_receive_notification_5) OR FIREABLE(T-client_send_2))))))) : FIREABLE(T-server_process_2) : NOT(E (F (FIREABLE(T-server_process_1)))) : E ((NOT FIREABLE(T-lb_no_balance_8) U FIREABLE(T-server_notify_2))) : E (G (A (G (FIREABLE(T-lb_balance_to_2_14))))) : FIREABLE(T-lb_balancing_receive_notification_2)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-server_endloop_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-server_endloop_2)
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(T-lb_balancing_receive_notification_5) OR (NOT(A (G ((FIREABLE(T-lb_no_balance_5) AND FIREABLE(T-lb_balancing_receive_notification_3))))) AND (A (G (FIREABLE(T-client_receive_1))) AND (E (X (FIREABLE(T-lb_no_balance_4))) OR (FIREABLE(T-lb_no_balance_4) AND FIREABLE(T-client_send_1) AND (FIREABLE(T-lb_idle_receive_notification_2) OR FIREABLE(T-client_receive_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-lb_balancing_receive_notification_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-lb_balancing_receive_notification_5)
lola: processed formula length: 47
lola: 3 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T-lb_no_balance_5) OR NOT FIREABLE(T-lb_balancing_receive_notification_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(T-client_receive_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(T-client_receive_2) AND ((A (X (FIREABLE(T-lb_route_to_1_11))) AND (FIREABLE(T-server_endloop_1) OR A (F (FIREABLE(T-lb_receive_client_1))))) OR E (G (((FIREABLE(T-lb_no_balance_1) OR FIREABLE(T-server_notify_1)) AND NOT FIREABLE(T-lb_no_balance_6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(T-client_receive_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(T-client_receive_2)
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(T-lb_route_to_1_11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(T-lb_route_to_1_11)))
lola: processed formula: A (X (FIREABLE(T-lb_route_to_1_11)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((FIREABLE(T-lb_no_balance_1) OR FIREABLE(T-server_notify_1)) AND NOT FIREABLE(T-lb_no_balance_6))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((NOT FIREABLE(T-lb_no_balance_1) AND NOT FIREABLE(T-server_notify_1)) OR FIREABLE(T-lb_no_balance_6))))
lola: processed formula length: 118
lola: 2 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(T-lb_no_balance_8) OR FIREABLE(T-lb_balance_to_2_14) OR FIREABLE(T-lb_idle_receive_notification_3)) OR E (X (FIREABLE(T-server_process_1)))) OR E (X ((FIREABLE(T-lb_idle_receive_notification_5) AND FIREABLE(T-server_process_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-lb_no_balance_8) OR FIREABLE(T-lb_balance_to_2_14) OR FIREABLE(T-lb_idle_receive_notification_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 107 markings, 122 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((FIREABLE(T-lb_balancing_receive_notification_6) OR FIREABLE(T-server_notify_1)) AND (E (X (FIREABLE(T-lb_route_to_1_15))) OR FIREABLE(T-server_endloop_1))) AND FIREABLE(T-lb_route_to_2_17)) OR (A (X (A (F (FIREABLE(T-lb_balancing_receive_notification_5))))) OR A (F (E (F (FIREABLE(T-client_send_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(T-lb_balancing_receive_notification_6) OR FIREABLE(T-server_notify_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(T-lb_balancing_receive_notification_6) OR FIREABLE(T-server_notify_1))
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (FIREABLE(T-lb_balancing_receive_notification_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U FIREABLE(T-lb_balancing_receive_notification_5)))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (FIREABLE(T-client_send_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U FIREABLE(T-client_send_2)))
lola: processed formula length: 45
lola: 3 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((NOT FIREABLE(T-lb_idle_receive_notification_6) AND FIREABLE(T-server_process_2)) U (FIREABLE(T-lb_route_to_1_2) OR FIREABLE(T-lb_route_to_1_6) OR FIREABLE(T-lb_idle_receive_notification_6)))) AND (A (X (E (F (FIREABLE(T-lb_route_to_1_5))))) OR A (((FIREABLE(T-lb_idle_receive_notification_2)) U (FIREABLE(T-lb_route_to_1_5) AND FIREABLE(T-lb_no_balance_4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(T-lb_idle_receive_notification_6) AND FIREABLE(T-server_process_2)) U (FIREABLE(T-lb_route_to_1_2) OR FIREABLE(T-lb_route_to_1_6) OR FIREABLE(T-lb_idle_receive_notification_6))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(T-lb_idle_receive_notification_6) AND FIREABLE(T-server_process_2)) U (FIREABLE(T-lb_route_to_1_2) OR FIREABLE(T-lb_route_to_1_6) OR FIREABLE(T-lb_idle_receive_notification_6)))
lola: processed formula length: 195
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-lb_route_to_2_17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-lb_route_to_2_17)
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((FIREABLE(T-lb_balancing_receive_notification_5) U (FIREABLE(T-server_endloop_2) AND FIREABLE(T-lb_no_balance_8) AND (FIREABLE(T-lb_balancing_receive_notification_2) OR FIREABLE(T-lb_route_to_1_15))))) OR NOT(NOT(A ((FIREABLE(T-lb_balancing_receive_notification_3) U FIREABLE(T-lb_idle_receive_notification_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(T-lb_balancing_receive_notification_5) U (FIREABLE(T-server_endloop_2) AND FIREABLE(T-lb_no_balance_8) AND (FIREABLE(T-lb_balancing_receive_notification_2) OR FIREABLE(T-lb_route_to_1_15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(T-lb_balancing_receive_notification_5) U (FIREABLE(T-server_endloop_2) AND FIREABLE(T-lb_no_balance_8) AND (FIREABLE(T-lb_balancing_receive_notification_2) OR FIREABLE(T-lb_route_to_1_15)))))
lola: processed formula: A ((FIREABLE(T-lb_balancing_receive_notification_5) U (FIREABLE(T-server_endloop_2) AND FIREABLE(T-lb_no_balance_8) AND (FIREABLE(T-lb_balancing_receive_notification_2) OR FIREABLE(T-lb_route_to_1_15)))))
lola: processed formula length: 205
lola: 8 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(T-lb_balancing_receive_notification_3) U FIREABLE(T-lb_idle_receive_notification_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(T-lb_balancing_receive_notification_3) U FIREABLE(T-lb_idle_receive_notification_2)))
lola: processed formula: A ((FIREABLE(T-lb_balancing_receive_notification_3) U FIREABLE(T-lb_idle_receive_notification_2)))
lola: processed formula length: 98
lola: 8 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (F ((FIREABLE(T-lb_route_to_2_4) AND FIREABLE(T-lb_no_balance_6)))))) AND (NOT(E (F (FIREABLE(T-lb_route_to_1_14)))) OR E (((FIREABLE(T-lb_idle_receive_notification_5) OR FIREABLE(T-lb_balancing_receive_notification_2)) U (FIREABLE(T-lb_route_to_1_2) AND FIREABLE(T-server_notify_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((FIREABLE(T-lb_route_to_2_4) AND FIREABLE(T-lb_no_balance_6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (FIREABLE(T-lb_route_to_2_4) AND FIREABLE(T-lb_no_balance_6))))
lola: processed formula length: 81
lola: 5 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 219 markings, 354 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(T-lb_route_to_1_10) AND (E (X (FIREABLE(T-lb_balance_to_1_6))) AND E (G (FIREABLE(T-lb_balance_to_1_6)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(T-lb_route_to_1_10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(T-lb_route_to_1_10)))
lola: processed formula: A (X (FIREABLE(T-lb_route_to_1_10)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((FIREABLE(T-lb_idle_receive_notification_6) AND E (X ((FIREABLE(T-client_receive_2) AND FIREABLE(T-lb_balance_to_2_13))))) OR ((FIREABLE(T-lb_idle_receive_notification_6) AND ((FIREABLE(T-lb_route_to_1_2) AND FIREABLE(T-lb_balance_to_2_14)) OR (FIREABLE(T-lb_no_balance_6) AND FIREABLE(T-lb_balance_to_2_14)))) OR (A (F (FIREABLE(T-lb_idle_receive_notification_3))) OR (FIREABLE(T-lb_route_to_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(T-lb_idle_receive_notification_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(T-lb_idle_receive_notification_6)
lola: processed formula length: 46
lola: 13 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(T-lb_idle_receive_notification_6) OR ((NOT FIREABLE(T-lb_route_to_1_2) OR NOT FIREABLE(T-lb_balance_to_2_14)) AND (NOT FIREABLE(T-lb_no_balance_6) OR NOT FIREABLE(T-lb_balance_to_2_14))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(T-lb_idle_receive_notification_6) OR ((NOT FIREABLE(T-lb_route_to_1_2) OR NOT FIREABLE(T-lb_balance_to_2_14)) AND (NOT FIREABLE(T-lb_no_balance_6) OR NOT FIREABLE(T-lb_balance_to_2_14))))
lola: processed formula length: 204
lola: 13 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(T-lb_idle_receive_notification_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(T-lb_idle_receive_notification_3)))
lola: processed formula length: 57
lola: 15 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24 markings, 24 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(T-lb_route_to_1_1) OR (NOT FIREABLE(T-lb_balancing_receive_notification_5) AND NOT FIREABLE(T-client_send_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(T-lb_route_to_1_1) OR (NOT FIREABLE(T-lb_balancing_receive_notification_5) AND NOT FIREABLE(T-client_send_2)))
lola: processed formula length: 125
lola: 13 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-server_process_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-server_process_2)
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (FIREABLE(T-server_process_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(T-lb_no_balance_8) U FIREABLE(T-server_notify_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT FIREABLE(T-lb_no_balance_8) U FIREABLE(T-server_notify_2))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (FIREABLE(T-lb_balance_to_2_14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U NOT FIREABLE(T-lb_balance_to_2_14))))
lola: processed formula length: 59
lola: 4 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-lb_balancing_receive_notification_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-lb_balancing_receive_notification_2)
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no no no no no yes no no yes no no
FORMULA SimpleLoadBal-PT-02-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

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="SimpleLoadBal-PT-02"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-structural"
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/SimpleLoadBal-PT-02.tgz
mv SimpleLoadBal-PT-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is SimpleLoadBal-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-smll-152708748900144"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;