About the Execution of M4M.struct for SimpleLoadBal-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
532.760 | 46164.00 | 4679.00 | 970.60 | TFTFTTTFTFFTFTFF | normal |
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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-smll-152708748900143
=====================================================================
--------------------
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-CTLCardinality-00
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-01
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-02
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-03
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-04
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-05
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-06
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-07
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-08
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-09
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-10
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-11
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-12
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-13
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-14
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527213640388
BK_STOP 1527213686552
--------------------
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': 'CTLCardinality', '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': 83, 'Memory': 100.54, 'Tool': 'gspn'}, {'Time': 165, 'Memory': 111.23, 'Tool': 'lola'}, {'Time': 302, 'Memory': 111.09, 'Tool': 'lola'}, {'Time': 1616, 'Memory': 166.35, 'Tool': 'gspn'}, {'Time': 2629, 'Memory': 2206.22, 'Tool': 'marcie'}, {'Time': 2780, 'Memory': 2206.35, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.9879518072289157x far from the best tool gspn.
CTLCardinality lola SimpleLoadBal-PT-02...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ SimpleLoadBal-PT-02 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 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-CTLCardinality.task
lola: (P-lb_routing_1_1 <= P-server_notification_ack_2) : (E ((((3 <= P-server_idle_2) AND (1 <= P-client_request_1)) U (P-lb_load_2_2 <= 1))) AND E (X (A (G ((2 <= P-lb_load_1_0)))))) : (((E (G ((P-lb_load_2_2 <= P-server_waiting_2))) OR E (G ((P-client_waiting_2 <= P-server_notification_ack_2)))) AND ((P-lb_load_2_1 <= 1) OR (P-server_request_2_1 <= 0) OR ((P-client_idle_2 + 1 <= P-lb_load_2_2) AND (P-client_idle_1 <= 1)))) AND A (((1 <= P-lb_routing_1_1) U (P-server_request_2_1 <= P-server_processed_2)))) : E (((1 <= P-server_request_1_1) U (((P-client_waiting_1 <= P-client_request_2) OR (P-server_request_2_1 <= P-server_processed_2)) AND ((3 <= P-client_ack_2) OR (1 <= P-server_waiting_1))))) : NOT(A (F (A (F ((3 <= P-server_notification_ack_2)))))) : E (X (((P-client_ack_2 <= 1) OR ((P-lb_load_2_2 <= 1) AND (P-lb_load_1_1 + 1 <= P-server_waiting_1))))) : NOT((E (X ((P-server_waiting_2 <= P-client_ack_1))) AND (P-server_processed_1 + 1 <= P-lb_routing_1_2))) : A (G (((P-lb_routing_1_1 <= P-server_idle_1) OR (3 <= P-server_request_1_1)))) : (P-server_waiting_1 <= P-server_request_1_1) : E (G ((A (F ((2 <= P-lb_load_1_2))) OR E (F ((2 <= P-lb_balancing_1)))))) : (((P-lb_idle_1 <= P-lb_routing_1_1) OR (2 <= P-server_idle_1)) AND ((P-server_request_2_2 <= P-lb_load_1_0) OR (P-server_request_2_1 <= P-server_request_1_2)) AND (P-lb_load_1_2 <= 1)) : ((A (X ((P-lb_load_1_2 + 1 <= P-client_idle_1))) AND ((3 <= P-lb_load_2_2) AND (P-client_idle_1 <= P-server_notification_ack_2))) OR E ((((2 <= P-server_idle_1) AND (2 <= P-server_notification_ack_2)) U ((P-lb_routing_1_2 <= P-server_waiting_2) AND (P-server_request_1_2 <= P-server_request_2_2))))) : (3 <= P-client_idle_1) : NOT(E ((((P-server_processed_2 <= P-server_notification_ack_2) AND (3 <= P-server_notification_ack_1)) U (2 <= P-server_idle_1)))) : (2 <= P-lb_balancing_1) : E ((((P-client_idle_2 <= P-server_notification_2) AND (1 <= P-client_ack_2) AND ((3 <= P-server_request_1_2) OR (P-lb_load_1_0 <= P-server_waiting_1))) U A (X ((2 <= P-server_notification_ack_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: (P-lb_routing_1_1 <= P-server_notification_ack_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-lb_routing_1_1 <= P-server_notification_ack_2)
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.task
lola: processed formula with 1 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((3 <= P-server_idle_2) AND (1 <= P-client_request_1)) U (P-lb_load_2_2 <= 1))) AND E (X (A (G ((2 <= P-lb_load_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= P-server_idle_2) AND (1 <= P-client_request_1)) U (P-lb_load_2_2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= P-server_idle_2) AND (1 <= P-client_request_1)) U (P-lb_load_2_2 <= 1))
lola: processed formula length: 80
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((2 <= P-lb_load_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (P-lb_load_1_0 <= 1))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: 2 markings, 1 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: (((E (G ((P-lb_load_2_2 <= P-server_waiting_2))) OR E (G ((P-client_waiting_2 <= P-server_notification_ack_2)))) AND ((P-lb_load_2_1 <= 1) OR (P-server_request_2_1 <= 0) OR ((P-client_idle_2 + 1 <= P-lb_load_2_2) AND (P-client_idle_1 <= 1)))) AND A (((1 <= P-lb_routing_1_1) U (P-server_request_2_1 <= P-server_processed_2))))
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: E (G ((P-lb_load_2_2 <= P-server_waiting_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (P-server_waiting_2 + 1 <= P-lb_load_2_2)))
lola: processed formula length: 56
lola: 3 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: 27 markings, 27 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-lb_load_2_1 <= 1) OR (P-server_request_2_1 <= 0) OR ((P-client_idle_2 + 1 <= P-lb_load_2_2) AND (P-client_idle_1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-lb_load_2_1 <= 1) OR (P-server_request_2_1 <= 0) OR ((P-client_idle_2 + 1 <= P-lb_load_2_2) AND (P-client_idle_1 <= 1)))
lola: processed formula length: 126
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.task
lola: processed formula with 4 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= P-lb_routing_1_1) U (P-server_request_2_1 <= P-server_processed_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= P-lb_routing_1_1) U (P-server_request_2_1 <= P-server_processed_2)))
lola: processed formula: A (((1 <= P-lb_routing_1_1) U (P-server_request_2_1 <= P-server_processed_2)))
lola: processed formula length: 78
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= P-server_request_1_1) U (((P-client_waiting_1 <= P-client_request_2) OR (P-server_request_2_1 <= P-server_processed_2)) AND ((3 <= P-client_ack_2) OR (1 <= P-server_waiting_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= P-server_request_1_1) U (((P-client_waiting_1 <= P-client_request_2) OR (P-server_request_2_1 <= P-server_processed_2)) AND ((3 <= P-client_ack_2) OR (1 <= P-server_waiting_1))))
lola: processed formula length: 188
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (F ((3 <= P-server_notification_ack_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= P-server_notification_ack_2)))
lola: processed formula length: 49
lola: 6 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((P-client_ack_2 <= 1) OR ((P-lb_load_2_2 <= 1) AND (P-lb_load_1_1 + 1 <= P-server_waiting_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((P-client_ack_2 <= 1) OR ((P-lb_load_2_2 <= 1) AND (P-lb_load_1_1 + 1 <= P-server_waiting_1))))
lola: processed formula length: 100
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X ((P-server_waiting_2 <= P-client_ack_1))) AND (P-server_processed_1 + 1 <= P-lb_routing_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((P-client_ack_1 + 1 <= P-server_waiting_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((P-client_ack_1 + 1 <= P-server_waiting_2)))
lola: processed formula: A (X ((P-client_ack_1 + 1 <= P-server_waiting_2)))
lola: processed formula length: 50
lola: 5 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-lb_routing_1_2 <= P-server_processed_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-lb_routing_1_2 <= P-server_processed_1)
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.task
lola: processed formula with 1 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-lb_routing_1_1 <= P-server_idle_1) OR (3 <= P-server_request_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-server_waiting_1 <= P-server_request_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-server_waiting_1 <= P-server_request_1_1)
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.task
lola: processed formula with 1 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((2 <= P-lb_load_1_2))) OR E (F ((2 <= P-lb_balancing_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (2 <= P-lb_load_1_2))) AND NOT(E(TRUE U (2 <= P-lb_balancing_1))))))
lola: processed formula length: 95
lola: 4 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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 3 significant temporal operators and needs 13 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, 333 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P-lb_idle_1 <= P-lb_routing_1_1) OR (2 <= P-server_idle_1)) AND ((P-server_request_2_2 <= P-lb_load_1_0) OR (P-server_request_2_1 <= P-server_request_1_2)) AND (P-lb_load_1_2 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((P-lb_idle_1 <= P-lb_routing_1_1) OR (2 <= P-server_idle_1)) AND ((P-server_request_2_2 <= P-lb_load_1_0) OR (P-server_request_2_1 <= P-server_request_1_2)) AND (P-lb_load_1_2 <= 1))
lola: processed formula length: 186
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.task
lola: processed formula with 5 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (X ((P-lb_load_1_2 + 1 <= P-client_idle_1))) AND ((3 <= P-lb_load_2_2) AND (P-client_idle_1 <= P-server_notification_ack_2))) OR E ((((2 <= P-server_idle_1) AND (2 <= P-server_notification_ack_2)) U ((P-lb_routing_1_2 <= P-server_waiting_2) AND (P-server_request_1_2 <= P-server_request_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((P-lb_load_1_2 + 1 <= P-client_idle_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((P-lb_load_1_2 + 1 <= P-client_idle_1)))
lola: processed formula: A (X ((P-lb_load_1_2 + 1 <= P-client_idle_1)))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= P-server_idle_1) AND (2 <= P-server_notification_ack_2)) U ((P-lb_routing_1_2 <= P-server_waiting_2) AND (P-server_request_1_2 <= P-server_request_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= P-server_idle_1) AND (2 <= P-server_notification_ack_2)) U ((P-lb_routing_1_2 <= P-server_waiting_2) AND (P-server_request_1_2 <= P-server_request_2_2)))
lola: processed formula length: 162
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P-client_idle_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P-client_idle_1)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.task
lola: processed formula with 1 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((P-server_processed_2 <= P-server_notification_ack_2) AND (3 <= P-server_notification_ack_1)) U (2 <= P-server_idle_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((P-server_notification_ack_2 + 1 <= P-server_processed_2) OR (P-server_notification_ack_1 <= 2)) R (P-server_idle_1 <= 1)))
lola: processed formula: A ((((P-server_notification_ack_2 + 1 <= P-server_processed_2) OR (P-server_notification_ack_1 <= 2)) R (P-server_idle_1 <= 1)))
lola: processed formula length: 129
lola: 4 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= P-lb_balancing_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P-lb_balancing_1)
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.task
lola: processed formula with 1 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((P-client_idle_2 <= P-server_notification_2) AND (1 <= P-client_ack_2) AND ((3 <= P-server_request_1_2) OR (P-lb_load_1_0 <= P-server_waiting_1))) U A (X ((2 <= P-server_notification_ack_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((P-client_idle_2 <= P-server_notification_2) AND (1 <= P-client_ack_2) AND ((3 <= P-server_request_1_2) OR (P-lb_load_1_0 <= P-server_waiting_1))) U AX((2 <= P-server_notification_ack_2)))
lola: processed formula length: 192
lola: 2 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-PT-02-CTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes yes no yes no no yes no yes no no
FORMULA SimpleLoadBal-PT-02-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-PT-02-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="CTLCardinality"
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 CTLCardinality"
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-152708748900143"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 '
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 ;