About the Execution of LoLA for AutoFlight-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4243.920 | 3600000.00 | 1585636.00 | 12265.80 | FFTTTTFFTTFTTTTT | 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 204K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 48K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is AutoFlight-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-qhx1-152646241100077
=====================================================================
--------------------
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 AutoFlight-PT-02b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1526643802688
info: Time: 3600 - MCC
===========================================================================================
prep: translating AutoFlight-PT-02b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating AutoFlight-PT-02b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ AutoFlight-PT-02b @ 3567 seconds
lola: LoLA will run for 3567 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 410/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 206
lola: finding significant places
lola: 206 places, 204 transitions, 190 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 232 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-02b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t74) AND FIREABLE(t75)))) : E (F (((FIREABLE(t147) AND FIREABLE(t67)) OR (FIREABLE(t176) AND FIREABLE(t200) AND FIREABLE(t145) AND FIREABLE(t115) AND (FIREABLE(t30) OR FIREABLE(t27)))))) : E (F (FIREABLE(t198))) : E (F (FIREABLE(t154))) : E (F (FIREABLE(t145))) : A (G ((FIREABLE(t203) OR FIREABLE(t172) OR NOT FIREABLE(t45) OR NOT FIREABLE(t20) OR ((FIREABLE(t110) OR FIREABLE(t38) OR FIREABLE(t170) OR FIREABLE(t24)) AND FIREABLE(t62))))) : A (G (NOT FIREABLE(t136))) : A (G (((FIREABLE(t154) AND FIREABLE(t169)) OR NOT FIREABLE(t156) OR (FIREABLE(t133) AND NOT FIREABLE(t94)) OR FIREABLE(t94)))) : E (F ((FIREABLE(t72) AND NOT FIREABLE(t17) AND NOT FIREABLE(t32) AND NOT FIREABLE(t51) AND (NOT FIREABLE(t196) OR NOT FIREABLE(t181) OR NOT FIREABLE(t103) OR NOT FIREABLE(t150))))) : E (F ((NOT FIREABLE(t142) AND NOT FIREABLE(t191) AND (NOT FIREABLE(t147) OR NOT FIREABLE(t182)) AND (FIREABLE(t88) OR FIREABLE(t124))))) : E (F ((FIREABLE(t146) AND FIREABLE(t36) AND FIREABLE(t47) AND FIREABLE(t92)))) : E (F (FIREABLE(t19))) : E (F (((NOT FIREABLE(t66) AND FIREABLE(t100)) OR FIREABLE(t189)))) : E (F (FIREABLE(t3))) : E (F ((FIREABLE(t19) AND ((NOT FIREABLE(t193) AND NOT FIREABLE(t106)) OR FIREABLE(t45))))) : A (G ((NOT FIREABLE(t105) OR NOT FIREABLE(t2) OR (NOT FIREABLE(t133) AND NOT FIREABLE(t136)) OR FIREABLE(t134))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t198)))
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(t198)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t198)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-02b-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7540 markings, 11112 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t154)))
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(t154)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t154)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t145)))
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(t145)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t145)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-2-0.sara
FORMULA AutoFlight-PT-02b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t136)))
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(t136)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t136)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-3-0.sara
FORMULA AutoFlight-PT-02b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: ========================================
state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-02b-ReachabilityFireability-2-0.sara.
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t19)))
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(t19)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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: sara: try reading problem file AutoFlight-PT-02b-ReachabilityFireability-3-0.sara.
rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t19)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 57 markings, 56 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-11 TRUE 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: E (F (FIREABLE(t3)))
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(t3)))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-5-0.sara
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-13 TRUE 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: E (F ((FIREABLE(t74) AND FIREABLE(t75))))
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(t74) AND FIREABLE(t75))))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t74) AND FIREABLE(t75))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-6-0.sara
lola: sara: place or transition ordering is non-deterministic
state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-02b-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-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 (F (((NOT FIREABLE(t66) AND FIREABLE(t100)) OR FIREABLE(t189))))
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(t66) AND FIREABLE(t100)) OR FIREABLE(t189))))
lola: processed formula length: 67
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t66) AND FIREABLE(t100)) OR FIREABLE(t189))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-7-0.sara
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-12 TRUE 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: E (F ((FIREABLE(t146) AND FIREABLE(t36) AND FIREABLE(t47) AND FIREABLE(t92))))
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(t146) AND FIREABLE(t36) AND FIREABLE(t47) AND FIREABLE(t92))))
lola: processed formula length: 78
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t146) AND FIREABLE(t36) AND FIREABLE(t47) AND FIREABLE(t92))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 20 markings, 19 edges
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-8-0.sara
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-10 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: E (F ((FIREABLE(t19) AND ((NOT FIREABLE(t193) AND NOT FIREABLE(t106)) OR FIREABLE(t45)))))
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(t19) AND ((NOT FIREABLE(t193) AND NOT FIREABLE(t106)) OR FIREABLE(t45)))))
lola: processed formula length: 91
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t19) AND ((NOT FIREABLE(t193) AND NOT FIREABLE(t106)) OR FIREABLE(t45)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 57 markings, 56 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-14 TRUE 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: A (G (((FIREABLE(t154) AND FIREABLE(t169)) OR NOT FIREABLE(t156) OR (FIREABLE(t133) AND NOT FIREABLE(t94)) OR FIREABLE(t94))))
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 (((FIREABLE(t154) AND FIREABLE(t169)) OR NOT FIREABLE(t156) OR (FIREABLE(t133) AND NOT FIREABLE(t94)) OR FIREABLE(t94))))
lola: processed formula length: 129
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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: ((NOT FIREABLE(t154) OR NOT FIREABLE(t169)) AND FIREABLE(t156) AND (NOT FIREABLE(t133) OR FIREABLE(t94)) AND NOT FIREABLE(t94))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-7 FALSE 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: A (G ((NOT FIREABLE(t105) OR NOT FIREABLE(t2) OR (NOT FIREABLE(t133) AND NOT FIREABLE(t136)) OR FIREABLE(t134))))
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(t105) OR NOT FIREABLE(t2) OR (NOT FIREABLE(t133) AND NOT FIREABLE(t136)) OR FIREABLE(t134))))
lola: processed formula length: 116
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t105) AND FIREABLE(t2) AND (FIREABLE(t133) OR FIREABLE(t136)) AND NOT FIREABLE(t134))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-11-0.sara
lola: 9 markings, 8 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t142) AND NOT FIREABLE(t191) AND (NOT FIREABLE(t147) OR NOT FIREABLE(t182)) AND (FIREABLE(t88) OR FIREABLE(t124)))))
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(t142) AND NOT FIREABLE(t191) AND (NOT FIREABLE(t147) OR NOT FIREABLE(t182)) AND (FIREABLE(t88) OR FIREABLE(t124)))))
lola: processed formula length: 138
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t142) AND NOT FIREABLE(t191) AND (NOT FIREABLE(t147) OR NOT FIREABLE(t182)) AND (FIREABLE(t88) OR FIREABLE(t124)))
lola: state equation: Generated DNF with 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file AutoFlight-PT-02b-ReachabilityFireability-11-0.sara.
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t72) AND NOT FIREABLE(t17) AND NOT FIREABLE(t32) AND NOT FIREABLE(t51) AND (NOT FIREABLE(t196) OR NOT FIREABLE(t181) OR NOT FIREABLE(t103) OR NOT FIREABLE(t150)))))
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(t72) AND NOT FIREABLE(t17) AND NOT FIREABLE(t32) AND NOT FIREABLE(t51) AND (NOT FIREABLE(t196) OR NOT FIREABLE(t181) OR NOT FIREABLE(t103) OR NOT FIREABLE(t150)))))
lola: processed formula length: 183
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t72) AND NOT FIREABLE(t17) AND NOT FIREABLE(t32) AND NOT FIREABLE(t51) AND (NOT FIREABLE(t196) OR NOT FIREABLE(t181) OR NOT FIREABLE(t103) OR NOT FIREABLE(t150)))
lola: state equation: Generated DNF with 30 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-02b-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7539 markings, 11111 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t147) AND FIREABLE(t67)) OR (FIREABLE(t176) AND FIREABLE(t200) AND FIREABLE(t145) AND FIREABLE(t115) AND (FIREABLE(t30) OR FIREABLE(t27))))))
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(t147) AND FIREABLE(t67)) OR (FIREABLE(t176) AND FIREABLE(t200) AND FIREABLE(t145) AND FIREABLE(t115) AND (FIREABLE(t30) OR FIREABLE(t27))))))
lola: processed formula length: 160
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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(t147) AND FIREABLE(t67)) OR (FIREABLE(t176) AND FIREABLE(t200) AND FIREABLE(t145) AND FIREABLE(t115) AND (FIREABLE(t30) OR FIREABLE(t27))))
lola: state equation: Generated DNF with 16 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-02b-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 744691 markings, 1395066 edges, 148938 markings/sec, 0 secs
lola: sara is running 5 secs || 1521649 markings, 2821980 edges, 155392 markings/sec, 5 secs
lola: sara is running 10 secs || 2142682 markings, 4319513 edges, 124207 markings/sec, 10 secs
sara: warning, failure of lp_solve (at job 4765)
lola: sara is running 15 secs || 2676491 markings, 5840407 edges, 106762 markings/sec, 15 secs
lola: sara is running 20 secs || 3188393 markings, 7335491 edges, 102380 markings/sec, 20 secs
lola: sara is running 25 secs || 3796454 markings, 8807653 edges, 121612 markings/sec, 25 secs
lola: sara is running 30 secs || 4492030 markings, 10157951 edges, 139115 markings/sec, 30 secs
lola: sara is running 35 secs || 5122370 markings, 11525178 edges, 126068 markings/sec, 35 secs
lola: sara is running 40 secs || 5682234 markings, 12921641 edges, 111973 markings/sec, 40 secs
lola: sara is running 45 secs || 6365964 markings, 14274727 edges, 136746 markings/sec, 45 secs
lola: sara is running 50 secs || 7021290 markings, 15595035 edges, 131065 markings/sec, 50 secs
lola: sara is running 55 secs || 7559145 markings, 16956470 edges, 107571 markings/sec, 55 secs
lola: sara is running 60 secs || 8083378 markings, 18348677 edges, 104847 markings/sec, 60 secs
lola: sara is running 65 secs || 8611756 markings, 19741447 edges, 105676 markings/sec, 65 secs
lola: sara is running 70 secs || 9100491 markings, 21145658 edges, 97747 markings/sec, 70 secs
lola: sara is running 75 secs || 9639496 markings, 22625673 edges, 107801 markings/sec, 75 secs
lola: sara is running 80 secs || 10052342 markings, 24078319 edges, 82569 markings/sec, 80 secs
lola: sara is running 85 secs || 10513152 markings, 25532276 edges, 92162 markings/sec, 85 secs
lola: sara is running 90 secs || 10975212 markings, 26994780 edges, 92412 markings/sec, 90 secs
lola: sara is running 95 secs || 11382911 markings, 28445178 edges, 81540 markings/sec, 95 secs
lola: sara is running 100 secs || 11893074 markings, 29893309 edges, 102033 markings/sec, 100 secs
lola: sara is running 105 secs || 12314615 markings, 31357241 edges, 84308 markings/sec, 105 secs
lola: sara is running 110 secs || 12771538 markings, 32801816 edges, 91385 markings/sec, 110 secs
lola: sara is running 115 secs || 13218250 markings, 34232463 edges, 89342 markings/sec, 115 secs
lola: sara is running 120 secs || 13625943 markings, 35646044 edges, 81539 markings/sec, 120 secs
lola: sara is running 125 secs || 14104625 markings, 37053049 edges, 95736 markings/sec, 125 secs
lola: sara is running 130 secs || 14541531 markings, 38487360 edges, 87381 markings/sec, 130 secs
lola: sara is running 135 secs || 14975387 markings, 39937231 edges, 86771 markings/sec, 135 secs
lola: sara is running 140 secs || 15450686 markings, 41431823 edges, 95060 markings/sec, 140 secs
lola: sara is running 145 secs || 15880779 markings, 42896787 edges, 86019 markings/sec, 145 secs
lola: sara is running 150 secs || 16374053 markings, 44386421 edges, 98655 markings/sec, 150 secs
lola: sara is running 155 secs || 17097427 markings, 45753993 edges, 144675 markings/sec, 155 secs
lola: sara is running 160 secs || 17654056 markings, 47127924 edges, 111326 markings/sec, 160 secs
lola: sara is running 165 secs || 18167095 markings, 48506637 edges, 102608 markings/sec, 165 secs
lola: sara is running 170 secs || 18702303 markings, 49912680 edges, 107042 markings/sec, 170 secs
lola: sara is running 175 secs || 19327684 markings, 51267592 edges, 125076 markings/sec, 175 secs
lola: sara is running 180 secs || 19816492 markings, 52691839 edges, 97762 markings/sec, 180 secs
lola: sara is running 185 secs || 20586858 markings, 54017247 edges, 154073 markings/sec, 185 secs
lola: sara is running 190 secs || 21243546 markings, 55384926 edges, 131338 markings/sec, 190 secs
lola: sara is running 195 secs || 21956751 markings, 56733011 edges, 142641 markings/sec, 195 secs
lola: sara is running 200 secs || 22714758 markings, 58050170 edges, 151601 markings/sec, 200 secs
lola: sara is running 205 secs || 23365390 markings, 59315916 edges, 130126 markings/sec, 205 secs
lola: sara is running 210 secs || 23996680 markings, 60583062 edges, 126258 markings/sec, 210 secs
lola: sara is running 215 secs || 24610103 markings, 61851986 edges, 122685 markings/sec, 215 secs
lola: sara is running 220 secs || 25363473 markings, 63096258 edges, 150674 markings/sec, 220 secs
lola: sara is running 225 secs || 26180763 markings, 64343655 edges, 163458 markings/sec, 225 secs
lola: sara is running 230 secs || 26878663 markings, 65630316 edges, 139580 markings/sec, 230 secs
lola: sara is running 235 secs || 27522385 markings, 66904943 edges, 128744 markings/sec, 235 secs
lola: sara is running 240 secs || 28187631 markings, 68205107 edges, 133049 markings/sec, 240 secs
lola: sara is running 245 secs || 28882906 markings, 69535889 edges, 139055 markings/sec, 245 secs
lola: sara is running 250 secs || 29676089 markings, 70792741 edges, 158637 markings/sec, 250 secs
lola: sara is running 255 secs || 30532172 markings, 72065136 edges, 171217 markings/sec, 255 secs
lola: sara is running 260 secs || 31340753 markings, 73326349 edges, 161716 markings/sec, 260 secs
lola: sara is running 265 secs || 32086653 markings, 74599828 edges, 149180 markings/sec, 265 secs
lola: sara is running 270 secs || 32922113 markings, 75874498 edges, 167092 markings/sec, 270 secs
lola: sara is running 275 secs || 33688524 markings, 77187923 edges, 153282 markings/sec, 275 secs
lola: sara is running 280 secs || 34465177 markings, 78433100 edges, 155331 markings/sec, 280 secs
lola: sara is running 285 secs || 35281916 markings, 79635852 edges, 163348 markings/sec, 285 secs
lola: sara is running 290 secs || 35951654 markings, 80889045 edges, 133948 markings/sec, 290 secs
lola: sara is running 295 secs || 36677956 markings, 82109877 edges, 145260 markings/sec, 295 secs
lola: sara is running 300 secs || 37416561 markings, 83334069 edges, 147721 markings/sec, 300 secs
lola: sara is running 305 secs || 38093109 markings, 84577775 edges, 135310 markings/sec, 305 secs
lola: sara is running 310 secs || 38796293 markings, 85836488 edges, 140637 markings/sec, 310 secs
lola: sara is running 315 secs || 39548015 markings, 87064692 edges, 150344 markings/sec, 315 secs
lola: sara is running 320 secs || 40272339 markings, 88285894 edges, 144865 markings/sec, 320 secs
lola: sara is running 325 secs || 40776005 markings, 89715130 edges, 100733 markings/sec, 325 secs
lola: sara is running 330 secs || 41297144 markings, 91090021 edges, 104228 markings/sec, 330 secs
lola: sara is running 335 secs || 41830778 markings, 92478846 edges, 106727 markings/sec, 335 secs
lola: sara is running 340 secs || 42338178 markings, 93852912 edges, 101480 markings/sec, 340 secs
lola: sara is running 345 secs || 42839467 markings, 95261905 edges, 100258 markings/sec, 345 secs
lola: sara is running 350 secs || 43402211 markings, 96667960 edges, 112549 markings/sec, 350 secs
lola: sara is running 355 secs || 43918704 markings, 98078939 edges, 103299 markings/sec, 355 secs
lola: sara is running 360 secs || 44328162 markings, 99523655 edges, 81892 markings/sec, 360 secs
lola: sara is running 365 secs || 44803821 markings, 100976831 edges, 95132 markings/sec, 365 secs
lola: sara is running 370 secs || 45224238 markings, 102395079 edges, 84083 markings/sec, 370 secs
lola: sara is running 375 secs || 45672752 markings, 103825943 edges, 89703 markings/sec, 375 secs
lola: sara is running 380 secs || 46080736 markings, 105228342 edges, 81597 markings/sec, 380 secs
lola: sara is running 385 secs || 46508318 markings, 106674154 edges, 85516 markings/sec, 385 secs
lola: sara is running 390 secs || 46932177 markings, 108099857 edges, 84772 markings/sec, 390 secs
lola: sara is running 395 secs || 47358186 markings, 109535050 edges, 85202 markings/sec, 395 secs
lola: sara is running 400 secs || 47790778 markings, 110947367 edges, 86518 markings/sec, 400 secs
lola: sara is running 405 secs || 48196618 markings, 112378110 edges, 81168 markings/sec, 405 secs
lola: sara is running 410 secs || 48647669 markings, 113854258 edges, 90210 markings/sec, 410 secs
lola: sara is running 415 secs || 49074999 markings, 115345511 edges, 85466 markings/sec, 415 secs
lola: sara is running 420 secs || 49689278 markings, 116780776 edges, 122856 markings/sec, 420 secs
lola: sara is running 425 secs || 50460488 markings, 118047040 edges, 154242 markings/sec, 425 secs
lola: sara is running 430 secs || 51146070 markings, 119351092 edges, 137116 markings/sec, 430 secs
lola: sara is running 435 secs || 51675489 markings, 120742559 edges, 105884 markings/sec, 435 secs
lola: sara is running 440 secs || 52157329 markings, 122152182 edges, 96368 markings/sec, 440 secs
lola: sara is running 445 secs || 52645402 markings, 123542921 edges, 97615 markings/sec, 445 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 53113285 markings, 124896076 edges
lola: ========================================
FORMULA AutoFlight-PT-02b-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t203) OR FIREABLE(t172) OR NOT FIREABLE(t45) OR NOT FIREABLE(t20) OR ((FIREABLE(t110) OR FIREABLE(t38) OR FIREABLE(t170) OR FIREABLE(t24)) AND FIREABLE(t62)))))
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 ((FIREABLE(t203) OR FIREABLE(t172) OR NOT FIREABLE(t45) OR NOT FIREABLE(t20) OR ((FIREABLE(t110) OR FIREABLE(t38) OR FIREABLE(t170) OR FIREABLE(t24)) AND FIREABLE(t62)))))
lola: processed formula length: 183
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-02b-ReachabilityFireability.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: (NOT FIREABLE(t203) AND NOT FIREABLE(t172) AND FIREABLE(t45) AND FIREABLE(t20) AND ((NOT FIREABLE(t110) AND NOT FIREABLE(t38) AND NOT FIREABLE(t170) AND NOT FIREABLE(t24)) OR NOT FIREABLE(t62)))
lola: state equation: Generated DNF with 84 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02b-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-02b-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 612747 markings, 1466527 edges, 122549 markings/sec, 0 secs
lola: sara is running 5 secs || 1273762 markings, 3008404 edges, 132203 markings/sec, 5 secs
sara: warning, failure of lp_solve (at job 1684)
lola: sara is running 10 secs || 1918998 markings, 4517966 edges, 129047 markings/sec, 10 secs
lola: sara is running 15 secs || 2516954 markings, 6026549 edges, 119591 markings/sec, 15 secs
lola: sara is running 20 secs || 3138734 markings, 7545130 edges, 124356 markings/sec, 20 secs
lola: sara is running 25 secs || 3766975 markings, 9052189 edges, 125648 markings/sec, 25 secs
lola: sara is running 30 secs || 4377477 markings, 10534786 edges, 122100 markings/sec, 30 secs
lola: sara is running 35 secs || 5038357 markings, 12044869 edges, 132176 markings/sec, 35 secs
lola: sara is running 40 secs || 5697603 markings, 13548161 edges, 131849 markings/sec, 40 secs
lola: sara is running 45 secs || 6379324 markings, 15127491 edges, 136344 markings/sec, 45 secs
lola: sara is running 50 secs || 7052092 markings, 16680159 edges, 134554 markings/sec, 50 secs
lola: sara is running 55 secs || 7704778 markings, 18218781 edges, 130537 markings/sec, 55 secs
lola: sara is running 60 secs || 8318055 markings, 19685154 edges, 122655 markings/sec, 60 secs
lola: sara is running 65 secs || 8939399 markings, 21140063 edges, 124269 markings/sec, 65 secs
lola: sara is running 70 secs || 9556924 markings, 22590238 edges, 123505 markings/sec, 70 secs
lola: sara is running 75 secs || 10172362 markings, 24060324 edges, 123088 markings/sec, 75 secs
lola: sara is running 80 secs || 10762462 markings, 25550188 edges, 118020 markings/sec, 80 secs
lola: sara is running 85 secs || 11347023 markings, 27047527 edges, 116912 markings/sec, 85 secs
lola: sara is running 90 secs || 11936109 markings, 28550279 edges, 117817 markings/sec, 90 secs
lola: sara is running 95 secs || 12527336 markings, 30069997 edges, 118245 markings/sec, 95 secs
lola: sara is running 100 secs || 13199336 markings, 31644065 edges, 134400 markings/sec, 100 secs
lola: sara is running 105 secs || 13861214 markings, 33220189 edges, 132376 markings/sec, 105 secs
lola: sara is running 110 secs || 14498471 markings, 34769235 edges, 127451 markings/sec, 110 secs
lola: sara is running 115 secs || 15131991 markings, 36292979 edges, 126704 markings/sec, 115 secs
lola: sara is running 120 secs || 15767870 markings, 37820364 edges, 127176 markings/sec, 120 secs
lola: sara is running 125 secs || 16389176 markings, 39330982 edges, 124261 markings/sec, 125 secs
lola: sara is running 130 secs || 17029124 markings, 40869979 edges, 127990 markings/sec, 130 secs
lola: sara is running 135 secs || 17646350 markings, 42426137 edges, 123445 markings/sec, 135 secs
lola: sara is running 140 secs || 18274676 markings, 43952797 edges, 125665 markings/sec, 140 secs
lola: sara is running 145 secs || 18895851 markings, 45443440 edges, 124235 markings/sec, 145 secs
lola: sara is running 150 secs || 19478913 markings, 46905284 edges, 116612 markings/sec, 150 secs
lola: sara is running 155 secs || 20070381 markings, 48368174 edges, 118294 markings/sec, 155 secs
lola: sara is running 160 secs || 20685930 markings, 49855299 edges, 123110 markings/sec, 160 secs
lola: sara is running 165 secs || 21308804 markings, 51368413 edges, 124575 markings/sec, 165 secs
lola: sara is running 170 secs || 21922098 markings, 52831956 edges, 122659 markings/sec, 170 secs
lola: sara is running 175 secs || 22533125 markings, 54288786 edges, 122205 markings/sec, 175 secs
lola: sara is running 180 secs || 23145814 markings, 55783902 edges, 122538 markings/sec, 180 secs
lola: sara is running 185 secs || 23758052 markings, 57321562 edges, 122448 markings/sec, 185 secs
lola: sara is running 190 secs || 24371119 markings, 58845311 edges, 122613 markings/sec, 190 secs
lola: sara is running 195 secs || 24966085 markings, 60323388 edges, 118993 markings/sec, 195 secs
lola: sara is running 200 secs || 25572360 markings, 61802614 edges, 121255 markings/sec, 200 secs
lola: sara is running 205 secs || 26158163 markings, 63297309 edges, 117161 markings/sec, 205 secs
lola: sara is running 210 secs || 26788921 markings, 64839706 edges, 126152 markings/sec, 210 secs
lola: sara is running 215 secs || 27390220 markings, 66332360 edges, 120260 markings/sec, 215 secs
lola: sara is running 220 secs || 27986178 markings, 67810361 edges, 119192 markings/sec, 220 secs
lola: sara is running 225 secs || 28613623 markings, 69339640 edges, 125489 markings/sec, 225 secs
lola: sara is running 230 secs || 29230002 markings, 70888407 edges, 123276 markings/sec, 230 secs
lola: sara is running 235 secs || 29849401 markings, 72427478 edges, 123880 markings/sec, 235 secs
lola: sara is running 240 secs || 30451266 markings, 73922920 edges, 120373 markings/sec, 240 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 30685763 markings, 74509064 edges
FORMULA AutoFlight-PT-02b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes no no yes yes no yes yes yes yes yes
lola:
preliminary result: no no yes yes yes yes no no yes yes no yes yes yes yes yes
lola: ========================================
lola: memory consumption: 14812 KB
lola: time consumption: 702 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="AutoFlight-PT-02b"
export BK_EXAMINATION="ReachabilityFireability"
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/AutoFlight-PT-02b.tgz
mv AutoFlight-PT-02b 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 AutoFlight-PT-02b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-qhx1-152646241100077"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 ;