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 328K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K 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 4.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 153K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SimpleLoadBal-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743000151
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527203673108

info: Time: 3600 - MCC
===========================================================================================
prep: translating SimpleLoadBal-PT-05 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating SimpleLoadBal-PT-05 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ SimpleLoadBal-PT-05 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 239/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 59
lola: finding significant places
lola: 59 places, 180 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 301 transition conflict sets
lola: TASK
lola: reading formula from SimpleLoadBal-PT-05-CTLFireability.task
lola: A ((A (F (FIREABLE(T-lb_balance_to_1_83))) U FIREABLE(T-lb_receive_client_4))) : A ((E (F (NOT FIREABLE(T-client_receive_4))) U (FIREABLE(T-lb_idle_receive_notification_11) OR A (X (FIREABLE(T-lb_balance_to_1_11)))))) : (E (G (E (F (NOT FIREABLE(T-lb_balance_to_1_46))))) AND E (F (A (F (NOT FIREABLE(T-lb_balance_to_1_46)))))) : A (G (((NOT FIREABLE(T-lb_route_to_1_59) AND NOT FIREABLE(T-lb_route_to_1_74) AND (NOT FIREABLE(T-lb_route_to_1_66) OR NOT FIREABLE(T-lb_route_to_2_35))) OR NOT FIREABLE(T-lb_route_to_2_107)))) : A (F ((FIREABLE(T-lb_balance_to_2_96) AND FIREABLE(T-lb_balance_to_1_13) AND NOT FIREABLE(T-lb_balance_to_2_166)))) : A (F ((((FIREABLE(T-server_process_10) OR FIREABLE(T-lb_route_to_1_37)) AND FIREABLE(T-lb_route_to_1_16)) OR E (G ((FIREABLE(T-lb_route_to_2_151) OR FIREABLE(T-lb_no_balance_14))))))) : A (G ((E (G (NOT FIREABLE(T-lb_balance_to_1_12))) OR A (X (FIREABLE(T-lb_route_to_1_38)))))) : E (((NOT FIREABLE(T-lb_balance_to_2_98) OR FIREABLE(T-lb_balance_to_2_169)) U FIREABLE(T-lb_route_to_1_51))) : A (F (A (X (A (X (FIREABLE(T-client_send_4))))))) : A (G (A ((NOT FIREABLE(T-lb_balance_to_2_100) U (FIREABLE(T-lb_balance_to_2_133) OR FIREABLE(T-lb_balance_to_2_170)))))) : NOT(NOT((E (F ((FIREABLE(T-lb_route_to_1_102) AND FIREABLE(T-lb_balance_to_2_132)))) AND A (F ((FIREABLE(T-server_process_2) OR FIREABLE(T-server_endloop_1))))))) : NOT((E (F (E (F (FIREABLE(T-lb_route_to_1_59))))) OR E ((NOT FIREABLE(T-lb_route_to_1_58) U (FIREABLE(T-lb_route_to_2_86) AND FIREABLE(T-lb_route_to_1_110)))))) : ((FIREABLE(T-lb_no_balance_14) OR E (F (FIREABLE(T-lb_no_balance_30)))) OR FIREABLE(T-server_process_1)) : E (F (((FIREABLE(T-server_endloop_2) OR FIREABLE(T-lb_route_to_1_16)) AND FIREABLE(T-lb_route_to_1_94) AND (FIREABLE(T-lb_route_to_1_94) OR FIREABLE(T-lb_balance_to_2_64) OR NOT FIREABLE(T-server_notify_1)) AND ((FIREABLE(T-lb_route_to_1_130) AND FIREABLE(T-lb_balance_to_1_85) AND (FIREABLE(T-server_process_6) OR FIREABLE(T-lb_route_to_2_64))) OR FIREABLE(T-server_process_5))))) : NOT((A (F (FIREABLE(T-lb_balance_to_1_119))) OR FIREABLE(T-lb_balance_to_1_81))) : E (G (A ((NOT FIREABLE(T-lb_balance_to_1_46) U FIREABLE(T-server_process_8)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F (NOT FIREABLE(T-client_receive_4))) U (FIREABLE(T-lb_idle_receive_notification_11) OR A (X (FIREABLE(T-lb_balance_to_1_11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(E(TRUE U NOT FIREABLE(T-client_receive_4)) U (FIREABLE(T-lb_idle_receive_notification_11) OR AX(FIREABLE(T-lb_balance_to_1_11))))
lola: processed formula length: 131
lola: 33 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 36 markings, 73 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G (NOT FIREABLE(T-lb_balance_to_1_12))) OR A (X (FIREABLE(T-lb_route_to_1_38))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U (A(TRUE U FIREABLE(T-lb_balance_to_1_12)) AND NOT(AX(FIREABLE(T-lb_route_to_1_38))))))
lola: processed formula length: 99
lola: 36 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 41148 markings, 180276 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (A (X (FIREABLE(T-client_send_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX(AX(FIREABLE(T-client_send_4))))
lola: processed formula length: 43
lola: 33 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 36 markings, 36 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(T-lb_route_to_1_59) AND NOT FIREABLE(T-lb_route_to_1_74) AND (NOT FIREABLE(T-lb_route_to_1_66) OR NOT FIREABLE(T-lb_route_to_2_35))) OR NOT FIREABLE(T-lb_route_to_2_107))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(T-lb_route_to_1_59) AND NOT FIREABLE(T-lb_route_to_1_74) AND (NOT FIREABLE(T-lb_route_to_1_66) OR NOT FIREABLE(T-lb_route_to_2_35))) OR NOT FIREABLE(T-lb_route_to_2_107))))
lola: processed formula length: 195
lola: 32 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(T-lb_route_to_1_59) OR FIREABLE(T-lb_route_to_1_74) OR (FIREABLE(T-lb_route_to_1_66) AND FIREABLE(T-lb_route_to_2_35))) AND FIREABLE(T-lb_route_to_2_107))
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-CTLFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-CTLFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 102731 markings, 346548 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(T-server_endloop_2) OR FIREABLE(T-lb_route_to_1_16)) AND FIREABLE(T-lb_route_to_1_94) AND (FIREABLE(T-lb_route_to_1_94) OR FIREABLE(T-lb_balance_to_2_64) OR NOT FIREABLE(T-server_notify_1)) AND ((FIREABLE(T-lb_route_to_1_130) AND FIREABLE(T-lb_balance_to_1_85) AND (FIREABLE(T-server_process_6) OR FIREABLE(T-lb_route_to_2_64))) OR FIREABLE(T-server_process_5)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(T-server_endloop_2) OR FIREABLE(T-lb_route_to_1_16)) AND FIREABLE(T-lb_route_to_1_94) AND (FIREABLE(T-lb_route_to_1_94) OR FIREABLE(T-lb_balance_to_2_64) OR NOT FIREABLE(T-server_notify_1)) AND ((FIREABLE(T-lb_route_to_1_130) AND FIREABLE(T-lb_balance_to_1_85) AND (FIREABLE(T-server_process_6) OR FIREABLE(T-lb_route_to_2_64))) OR FIREABLE(T-server_process_5)))))
lola: processed formula length: 386
lola: 31 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(T-server_endloop_2) OR FIREABLE(T-lb_route_to_1_16)) AND FIREABLE(T-lb_route_to_1_94) AND (FIREABLE(T-lb_route_to_1_94) OR FIREABLE(T-lb_balance_to_2_64) OR NOT FIREABLE(T-server_notify_1)) AND ((FIREABLE(T-lb_route_to_1_130) AND FIREABLE(T-lb_balance_to_1_85) AND (FIREABLE(T-server_process_6) OR FIREABLE(T-lb_route_to_2_64))) OR FIREABLE(T-server_process_5)))
lola: state equation: Generated DNF with 273 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 108998 markings, 351549 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(T-lb_balance_to_2_96) AND FIREABLE(T-lb_balance_to_1_13) AND NOT FIREABLE(T-lb_balance_to_2_166))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(T-lb_balance_to_2_96) OR NOT FIREABLE(T-lb_balance_to_1_13) OR FIREABLE(T-lb_balance_to_2_166))
lola: processed formula length: 111
lola: 32 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 36 markings, 36 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F (FIREABLE(T-lb_balance_to_1_83))) U FIREABLE(T-lb_receive_client_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(A(TRUE U FIREABLE(T-lb_balance_to_1_83)) U FIREABLE(T-lb_receive_client_4))
lola: processed formula length: 77
lola: 32 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 36 markings, 37 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A ((NOT FIREABLE(T-lb_balance_to_1_46) U FIREABLE(T-server_process_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(NOT FIREABLE(T-lb_balance_to_1_46) U FIREABLE(T-server_process_8)))))
lola: processed formula length: 88
lola: 32 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 37 markings, 38 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A ((NOT FIREABLE(T-lb_balance_to_2_100) U (FIREABLE(T-lb_balance_to_2_133) OR FIREABLE(T-lb_balance_to_2_170))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A(NOT FIREABLE(T-lb_balance_to_2_100) U (FIREABLE(T-lb_balance_to_2_133) OR FIREABLE(T-lb_balance_to_2_170))))))
lola: processed formula length: 130
lola: 32 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 36 markings, 37 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(T-server_process_10) OR FIREABLE(T-lb_route_to_1_37)) AND FIREABLE(T-lb_route_to_1_16)) OR E (G ((FIREABLE(T-lb_route_to_2_151) OR FIREABLE(T-lb_no_balance_14)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U (((FIREABLE(T-server_process_10) OR FIREABLE(T-lb_route_to_1_37)) AND FIREABLE(T-lb_route_to_1_16)) OR NOT(A(TRUE U (NOT FIREABLE(T-lb_route_to_2_151) AND NOT FIREABLE(T-lb_no_balance_14))))))
lola: processed formula length: 202
lola: 33 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 36 markings, 72 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (NOT FIREABLE(T-lb_balance_to_1_119))) AND NOT FIREABLE(T-lb_balance_to_1_81))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(T-lb_balance_to_1_81)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(T-lb_balance_to_1_81)
lola: processed formula length: 34
lola: 30 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(T-lb_balance_to_1_119)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(T-lb_balance_to_1_119)))
lola: processed formula length: 43
lola: 30 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 36 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(T-lb_no_balance_14) OR (E (F (FIREABLE(T-lb_no_balance_30))) OR FIREABLE(T-server_process_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-server_process_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-server_process_1)
lola: processed formula length: 28
lola: 30 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-lb_no_balance_14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-lb_no_balance_14)
lola: processed formula length: 28
lola: 30 rewrites
lola: closed formula file SimpleLoadBal-PT-05-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 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(T-lb_no_balance_30)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(T-lb_no_balance_30)))
lola: processed formula length: 36
lola: 31 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(T-lb_no_balance_30)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 114979 markings, 410503 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(T-lb_balance_to_2_98) OR FIREABLE(T-lb_balance_to_2_169)) U FIREABLE(T-lb_route_to_1_51)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((NOT FIREABLE(T-lb_balance_to_2_98) OR FIREABLE(T-lb_balance_to_2_169)) U FIREABLE(T-lb_route_to_1_51)))
lola: processed formula length: 109
lola: 33 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: FIREABLE(T-lb_route_to_1_51)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-CTLFireability-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(T-lb_route_to_1_102) AND FIREABLE(T-lb_balance_to_2_132)))) AND A (F ((FIREABLE(T-server_process_2) OR FIREABLE(T-server_endloop_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(T-server_process_2) OR FIREABLE(T-server_endloop_1))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(T-server_process_2) AND NOT FIREABLE(T-server_endloop_1))
lola: processed formula length: 71
lola: 32 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 40 markings, 40 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (NOT FIREABLE(T-lb_route_to_1_59))) AND A ((FIREABLE(T-lb_route_to_1_58) R (NOT FIREABLE(T-lb_route_to_2_86) OR NOT FIREABLE(T-lb_route_to_1_110)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(T-lb_route_to_1_59)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G (NOT FIREABLE(T-lb_route_to_1_59)))
lola: processed formula length: 40
lola: 32 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: FIREABLE(T-lb_route_to_1_59)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(T-lb_route_to_1_58) R (NOT FIREABLE(T-lb_route_to_2_86) OR NOT FIREABLE(T-lb_route_to_1_110))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A ((FIREABLE(T-lb_route_to_1_58) R (NOT FIREABLE(T-lb_route_to_2_86) OR NOT FIREABLE(T-lb_route_to_1_110))))
lola: processed formula length: 109
lola: 36 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (FIREABLE(T-lb_route_to_2_86) AND FIREABLE(T-lb_route_to_1_110))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-PT-05-CTLFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: Predicate Phi releases Predicate Psi on all paths.
lola: SUBRESULT
lola: result: yeslola:
========================================
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (NOT FIREABLE(T-lb_balance_to_1_46))))) AND E (F (NOT FIREABLE(T-lb_balance_to_1_46))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(T-lb_balance_to_1_46)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (NOT FIREABLE(T-lb_balance_to_1_46)))
lola: processed formula length: 42
lola: 31 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: NOT FIREABLE(T-lb_balance_to_1_46)
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-CTLFireability-15-0.sara
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
sara: try reading problem file SimpleLoadBal-PT-05-CTLFireability-15-0.sara.
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (NOT FIREABLE(T-lb_balance_to_1_46))))) AND E (F (NOT FIREABLE(T-lb_balance_to_1_46))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(T-lb_balance_to_1_46)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (NOT FIREABLE(T-lb_balance_to_1_46)))
lola: processed formula length: 42
lola: 31 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: NOT FIREABLE(T-lb_balance_to_1_46)
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-PT-05-CTLFireability-16-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (E (F (NOT FIREABLE(T-lb_balance_to_1_46)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: NOT FIREABLE(T-lb_balance_to_1_46)
lola: processed formula length: 34
lola: 31 rewrites
lola: closed formula file SimpleLoadBal-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 36 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SimpleLoadBal-PT-05-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no no no yes no no no yes no no yes no
lola:
preliminary result: no no yes yes no no no yes no no no yes no no yes no
sara: place or transition ordering is non-deterministic
lola: memory consumption: 15048 KB
lola: time consumption: 6 seconds


BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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-05"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
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-05.tgz
mv SimpleLoadBal-PT-05 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 lola"
echo " Input is SimpleLoadBal-PT-05, 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 r172-smll-152708743000151"
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 ;