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 180K
-rw-r--r-- 1 mcc users 3.3K 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.6K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.6K 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 23K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is AutoFlight-PT-03a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-qhx1-152646241100084
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526644831494

info: Time: 3600 - MCC
===========================================================================================
prep: translating AutoFlight-PT-03a 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-03a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ AutoFlight-PT-03a @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 162/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 82
lola: finding significant places
lola: 82 places, 80 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 80 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-03a-ReachabilityFireability.task
lola: E (F ((FIREABLE(t64) AND FIREABLE(t36)))) : A (G ((NOT FIREABLE(t20) OR NOT FIREABLE(t3) OR NOT FIREABLE(t53) OR NOT FIREABLE(t58) OR (NOT FIREABLE(t22) AND NOT FIREABLE(t76) AND FIREABLE(t8) AND FIREABLE(t37) AND FIREABLE(t12) AND FIREABLE(t0))))) : E (F ((NOT FIREABLE(t73) AND (FIREABLE(t74) OR FIREABLE(t62)) AND (FIREABLE(t10) OR FIREABLE(t57) OR NOT FIREABLE(t69)) AND FIREABLE(t56)))) : A (G ((NOT FIREABLE(t46) OR NOT FIREABLE(t69)))) : A (G (NOT FIREABLE(t2))) : E (F ((((FIREABLE(t42) OR FIREABLE(t77)) AND FIREABLE(t43)) OR (NOT FIREABLE(t70) AND FIREABLE(t74)) OR (FIREABLE(t50) AND (NOT FIREABLE(t43) OR NOT FIREABLE(t21)))))) : E (F (FIREABLE(t74))) : E (F ((FIREABLE(t50) AND (FIREABLE(t13) OR FIREABLE(t75) OR NOT FIREABLE(t17)) AND (NOT FIREABLE(t75) OR NOT FIREABLE(t49))))) : E (F (FIREABLE(t2))) : E (F (((NOT FIREABLE(t16) OR NOT FIREABLE(t26)) AND FIREABLE(t10) AND (FIREABLE(t0) OR FIREABLE(t32))))) : A (G ((NOT FIREABLE(t22) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t27)) OR NOT FIREABLE(t56)))) : A (G (((NOT FIREABLE(t3) AND NOT FIREABLE(t38)) OR NOT FIREABLE(t49) OR NOT FIREABLE(t73)))) : E (F ((((FIREABLE(t34) OR FIREABLE(t63) OR FIREABLE(t66) OR FIREABLE(t0)) AND NOT FIREABLE(t54)) OR (FIREABLE(t57) AND FIREABLE(t15) AND FIREABLE(t8) AND FIREABLE(t20) AND FIREABLE(t10))))) : E (F (FIREABLE(t65))) : A (G ((FIREABLE(t35) OR FIREABLE(t75) OR NOT FIREABLE(t74)))) : A (G ((NOT FIREABLE(t66) OR FIREABLE(t58))))
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 (G (NOT FIREABLE(t2)))
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(t2)))
lola: processed formula length: 24
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola:
========================================
FORMULA AutoFlight-PT-03a-ReachabilityFireability-4 FALSE 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(t74)))
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)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-03a-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)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-0.sara
lola: The predicate is reachable.
lola: 81 markings, 113 edges
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2)))
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(t2)))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t2)
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: 8 markings, 7 edges
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-8 TRUE 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: E (F (FIREABLE(t65)))
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(t65)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t65)
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: 13 markings, 12 edges
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file AutoFlight-PT-03a-ReachabilityFireability-0.sara.
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t64) AND FIREABLE(t36))))
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(t64) AND FIREABLE(t36))))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t64) AND FIREABLE(t36))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-03a-ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2499 markings, 11619 edges
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-0 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 (G ((NOT FIREABLE(t46) OR NOT FIREABLE(t69))))
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(t46) OR NOT FIREABLE(t69))))
lola: processed formula length: 49
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t46) AND FIREABLE(t69))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-03a-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2502 markings, 11798 edges
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-3 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: A (G ((NOT FIREABLE(t66) OR FIREABLE(t58))))
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(t66) OR FIREABLE(t58))))
lola: processed formula length: 45
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t66) AND NOT FIREABLE(t58))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-6-0.sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-15 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: A (G ((FIREABLE(t35) OR FIREABLE(t75) OR NOT FIREABLE(t74))))
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(t35) OR FIREABLE(t75) OR NOT FIREABLE(t74))))
lola: processed formula length: 63
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t35) AND NOT FIREABLE(t75) AND FIREABLE(t74))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 113 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t3) AND NOT FIREABLE(t38)) OR NOT FIREABLE(t49) OR NOT FIREABLE(t73))))
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(t3) AND NOT FIREABLE(t38)) OR NOT FIREABLE(t49) OR NOT FIREABLE(t73))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-03a-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
sara: try reading problem file AutoFlight-PT-03a-ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(t3) OR FIREABLE(t38)) AND FIREABLE(t49) AND FIREABLE(t73))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running 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: 2596 markings, 12133 edges
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-11 TRUE 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 (G ((NOT FIREABLE(t22) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t27)) OR NOT FIREABLE(t56))))
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(t22) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t27)) OR NOT FIREABLE(t56))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t22) AND (FIREABLE(t7) OR FIREABLE(t27)) AND FIREABLE(t56))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-9-0.sara
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-10 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 (F (((NOT FIREABLE(t16) OR NOT FIREABLE(t26)) AND FIREABLE(t10) AND (FIREABLE(t0) OR FIREABLE(t32)))))
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(t16) OR NOT FIREABLE(t26)) AND FIREABLE(t10) AND (FIREABLE(t0) OR FIREABLE(t32)))))
lola: processed formula length: 106
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t16) OR NOT FIREABLE(t26)) AND FIREABLE(t10) AND (FIREABLE(t0) OR FIREABLE(t32)))
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 56 edges

FORMULA AutoFlight-PT-03a-ReachabilityFireability-9 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: E (F ((FIREABLE(t50) AND (FIREABLE(t13) OR FIREABLE(t75) OR NOT FIREABLE(t17)) AND (NOT FIREABLE(t75) OR NOT FIREABLE(t49)))))
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(t50) AND (FIREABLE(t13) OR FIREABLE(t75) OR NOT FIREABLE(t17)) AND (NOT FIREABLE(t75) OR NOT FIREABLE(t49)))))
lola: processed formula length: 129
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t50) AND (FIREABLE(t13) OR FIREABLE(t75) OR NOT FIREABLE(t17)) AND (NOT FIREABLE(t75) OR NOT FIREABLE(t49)))
lola: state equation: Generated DNF with 42 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-11-0.sara
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
lola: ========================================


lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t42) OR FIREABLE(t77)) AND FIREABLE(t43)) OR (NOT FIREABLE(t70) AND FIREABLE(t74)) OR (FIREABLE(t50) AND (NOT FIREABLE(t43) OR NOT FIREABLE(t21))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file AutoFlight-PT-03a-ReachabilityFireability-10-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((FIREABLE(t42) OR FIREABLE(t77)) AND FIREABLE(t43)) OR (NOT FIREABLE(t70) AND FIREABLE(t74)) OR (FIREABLE(t50) AND (NOT FIREABLE(t43) OR NOT FIREABLE(t21))))))
lola: processed formula length: 171
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t42) OR FIREABLE(t77)) AND FIREABLE(t43)) OR (NOT FIREABLE(t70) AND FIREABLE(t74)) OR (FIREABLE(t50) AND (NOT FIREABLE(t43) OR NOT FIREABLE(t21))))
lola: state equation: Generated DNF with 20 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 56 markings, 81 edges
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-12-0.sara
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic

lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t73) AND (FIREABLE(t74) OR FIREABLE(t62)) AND (FIREABLE(t10) OR FIREABLE(t57) OR NOT FIREABLE(t69)) AND FIREABLE(t56))))
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(t73) AND (FIREABLE(t74) OR FIREABLE(t62)) AND (FIREABLE(t10) OR FIREABLE(t57) OR NOT FIREABLE(t69)) AND FIREABLE(t56))))
lola: processed formula length: 143
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t73) AND (FIREABLE(t74) OR FIREABLE(t62)) AND (FIREABLE(t10) OR FIREABLE(t57) OR NOT FIREABLE(t69)) AND FIREABLE(t56))
lola: state equation: Generated DNF with 51 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-03a-ReachabilityFireability-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: 2516 markings, 12688 edges

FORMULA AutoFlight-PT-03a-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t34) OR FIREABLE(t63) OR FIREABLE(t66) OR FIREABLE(t0)) AND NOT FIREABLE(t54)) OR (FIREABLE(t57) AND FIREABLE(t15) AND FIREABLE(t8) AND FIREABLE(t20) AND FIREABLE(t10)))))
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(t34) OR FIREABLE(t63) OR FIREABLE(t66) OR FIREABLE(t0)) AND NOT FIREABLE(t54)) OR (FIREABLE(t57) AND FIREABLE(t15) AND FIREABLE(t8) AND FIREABLE(t20) AND FIREABLE(t10)))))
lola: processed formula length: 193
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t34) OR FIREABLE(t63) OR FIREABLE(t66) OR FIREABLE(t0)) AND NOT FIREABLE(t54)) OR (FIREABLE(t57) AND FIREABLE(t15) AND FIREABLE(t8) AND FIREABLE(t20) AND FIREABLE(t10)))
lola: state equation: Generated DNF with 24 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-14-0.sara
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t20) OR NOT FIREABLE(t3) OR NOT FIREABLE(t53) OR NOT FIREABLE(t58) OR (NOT FIREABLE(t22) AND NOT FIREABLE(t76) AND FIREABLE(t8) AND FIREABLE(t37) AND FIREABLE(t12) AND FIREABLE(t0)))))
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(t20) OR NOT FIREABLE(t3) OR NOT FIREABLE(t53) OR NOT FIREABLE(t58) OR (NOT FIREABLE(t22) AND NOT FIREABLE(t76) AND FIREABLE(t8) AND FIREABLE(t37) AND FIREABLE(t12) AND FIREABLE(t0)))))
lola: processed formula length: 208
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-03a-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(t20) AND FIREABLE(t3) AND FIREABLE(t53) AND FIREABLE(t58) AND (FIREABLE(t22) OR FIREABLE(t76) OR NOT FIREABLE(t8) OR NOT FIREABLE(t37) OR NOT FIREABLE(t12) OR NOT FIREABLE(t0)))
lola: state equation: Generated DNF with 50 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-03a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-03a-ReachabilityFireability-15-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: 3671 markings, 14072 edges
lola: ========================================

FORMULA AutoFlight-PT-03a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no yes yes yes yes yes no yes yes yes no no
lola:
preliminary result: no yes no yes no yes yes yes yes yes no yes yes yes no no
lola: memory consumption: 14872 KB
lola: time consumption: 0 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-03a"
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-03a.tgz
mv AutoFlight-PT-03a 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-03a, 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-152646241100084"
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 '' ReachabilityFireability.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 ;