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.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 43K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is AutoFlight-PT-06a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-qhx1-152646241200126
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526656629085

info: Time: 3600 - MCC
===========================================================================================
prep: translating AutoFlight-PT-06a 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-06a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ AutoFlight-PT-06a @ 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: 312/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 157
lola: finding significant places
lola: 157 places, 155 transitions, 117 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 152 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-06a-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t31) OR NOT FIREABLE(t1) OR NOT FIREABLE(t116) OR (FIREABLE(t116) AND FIREABLE(t95))))) : E (F ((FIREABLE(t126) AND FIREABLE(t32) AND (FIREABLE(t107) OR FIREABLE(t59))))) : A (G ((FIREABLE(t144) OR NOT FIREABLE(t88) OR (FIREABLE(t28) AND NOT FIREABLE(t126) AND FIREABLE(t92) AND FIREABLE(t108) AND (FIREABLE(t122) OR FIREABLE(t45)))))) : A (G ((((NOT FIREABLE(t149) OR NOT FIREABLE(t1)) AND NOT FIREABLE(t46)) OR NOT FIREABLE(t84)))) : A (G ((NOT FIREABLE(t143) OR NOT FIREABLE(t63) OR NOT FIREABLE(t104) OR FIREABLE(t121) OR (FIREABLE(t19) AND (FIREABLE(t79) OR FIREABLE(t150) OR NOT FIREABLE(t15)))))) : E (F ((((NOT FIREABLE(t21) AND NOT FIREABLE(t38)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t38))) AND FIREABLE(t2)))) : E (F (FIREABLE(t102))) : A (G (NOT FIREABLE(t128))) : A (G (((FIREABLE(t74) AND FIREABLE(t23)) OR (NOT FIREABLE(t93) AND FIREABLE(t117)) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t9))))) : E (F (((FIREABLE(t66) OR NOT FIREABLE(t90)) AND (FIREABLE(t143) OR (FIREABLE(t138) AND FIREABLE(t33))) AND (NOT FIREABLE(t54) OR (FIREABLE(t34) AND FIREABLE(t63) AND NOT FIREABLE(t72)))))) : A (G ((NOT FIREABLE(t107) OR NOT FIREABLE(t113)))) : A (G ((NOT FIREABLE(t126) OR NOT FIREABLE(t20)))) : E (F (FIREABLE(t142))) : A (G (((FIREABLE(t3) AND FIREABLE(t42) AND NOT FIREABLE(t79) AND FIREABLE(t49)) OR NOT FIREABLE(t117)))) : E (F (FIREABLE(t46))) : A (G ((NOT FIREABLE(t143) OR NOT FIREABLE(t87) OR FIREABLE(t35) OR (FIREABLE(t152) AND FIREABLE(t109)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t102)))
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(t102)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t102)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-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-06a-ReachabilityFireability-6 TRUE 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 (NOT FIREABLE(t128)))
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(t128)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t128)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-7 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: E (F (FIREABLE(t142)))
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(t142)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t142)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 113 markings, 279 edges
lola: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-12 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(t46)))
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(t46)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t46)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-14 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: A (G ((NOT FIREABLE(t107) OR NOT FIREABLE(t113))))
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(t107) OR NOT FIREABLE(t113))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t107) AND FIREABLE(t113))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-4-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: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-10 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: A (G ((NOT FIREABLE(t126) OR NOT FIREABLE(t20))))
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(t126) OR NOT FIREABLE(t20))))
lola: processed formula length: 50
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t126) AND FIREABLE(t20))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t149) OR NOT FIREABLE(t1)) AND NOT FIREABLE(t46)) OR NOT FIREABLE(t84))))
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(t149) OR NOT FIREABLE(t1)) AND NOT FIREABLE(t46)) OR NOT FIREABLE(t84))))
lola: processed formula length: 97
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t149) AND FIREABLE(t1)) OR FIREABLE(t46)) AND FIREABLE(t84))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 365789 markings, 2409565 edges, 73158 markings/sec, 0 secs
lola: sara is running 5 secs || 693068 markings, 4838228 edges, 65456 markings/sec, 5 secs
lola: sara is running 10 secs || 946959 markings, 7295520 edges, 50778 markings/sec, 10 secs
lola: sara is running 15 secs || 1233693 markings, 9731623 edges, 57347 markings/sec, 15 secs
lola: sara is running 20 secs || 1486862 markings, 12169249 edges, 50634 markings/sec, 20 secs
lola: sara is running 25 secs || 1785256 markings, 14629159 edges, 59679 markings/sec, 25 secs
lola: sara is running 30 secs || 2084549 markings, 17103996 edges, 59859 markings/sec, 30 secs
lola: sara is running 35 secs || 2346027 markings, 19567548 edges, 52296 markings/sec, 35 secs
lola: sara is running 40 secs || 2600499 markings, 22129108 edges, 50894 markings/sec, 40 secs
lola: sara is running 45 secs || 2848356 markings, 24591158 edges, 49571 markings/sec, 45 secs
lola: sara is running 50 secs || 3089499 markings, 26982230 edges, 48229 markings/sec, 50 secs
lola: sara is running 55 secs || 3306505 markings, 29425359 edges, 43401 markings/sec, 55 secs
lola: sara is running 60 secs || 3532515 markings, 31803097 edges, 45202 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3628089 markings, 33687063 edges
lola: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(t21) AND NOT FIREABLE(t38)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t38))) AND 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 ((((NOT FIREABLE(t21) AND NOT FIREABLE(t38)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t38))) AND FIREABLE(t2))))
lola: processed formula length: 116
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t21) AND NOT FIREABLE(t38)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t38))) AND FIREABLE(t2))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-7-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: result: yes
lola: produced by: state space
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-7-0.sara.
lola: The predicate is reachable.
lola: 9 markings, 8 edges

FORMULA AutoFlight-PT-06a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================sara: place or transition ordering is non-deterministic
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t31) OR NOT FIREABLE(t1) OR NOT FIREABLE(t116) OR (FIREABLE(t116) AND FIREABLE(t95)))))
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(t31) OR NOT FIREABLE(t1) OR NOT FIREABLE(t116) OR (FIREABLE(t116) AND FIREABLE(t95)))))
lola: processed formula length: 110
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t31) AND FIREABLE(t1) AND FIREABLE(t116) AND (NOT FIREABLE(t116) OR NOT FIREABLE(t95)))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t126) AND FIREABLE(t32) AND (FIREABLE(t107) OR FIREABLE(t59)))))
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(t126) AND FIREABLE(t32) AND (FIREABLE(t107) OR FIREABLE(t59)))))
lola: processed formula length: 81
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t126) AND FIREABLE(t32) AND (FIREABLE(t107) OR FIREABLE(t59)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t3) AND FIREABLE(t42) AND NOT FIREABLE(t79) AND FIREABLE(t49)) OR NOT FIREABLE(t117))))
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(t3) AND FIREABLE(t42) AND NOT FIREABLE(t79) AND FIREABLE(t49)) OR NOT FIREABLE(t117))))
lola: processed formula length: 105
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t3) OR NOT FIREABLE(t42) OR FIREABLE(t79) OR NOT FIREABLE(t49)) AND FIREABLE(t117))
lola: state equation: Generated DNF with 13 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 700 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t143) OR NOT FIREABLE(t87) OR FIREABLE(t35) OR (FIREABLE(t152) AND FIREABLE(t109)))))
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(t143) OR NOT FIREABLE(t87) OR FIREABLE(t35) OR (FIREABLE(t152) AND FIREABLE(t109)))))
lola: processed formula length: 108
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t143) AND FIREABLE(t87) AND NOT FIREABLE(t35) AND (NOT FIREABLE(t152) OR NOT FIREABLE(t109)))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-11-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: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 875 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t74) AND FIREABLE(t23)) OR (NOT FIREABLE(t93) AND FIREABLE(t117)) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t9)))))
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(t74) AND FIREABLE(t23)) OR (NOT FIREABLE(t93) AND FIREABLE(t117)) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t9)))))
lola: processed formula length: 130
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t74) OR NOT FIREABLE(t23)) AND (FIREABLE(t93) OR NOT FIREABLE(t117)) AND (FIREABLE(t7) OR FIREABLE(t9)))
lola: state equation: Generated DNF with 60 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-12-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-06a-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1167 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t144) OR NOT FIREABLE(t88) OR (FIREABLE(t28) AND NOT FIREABLE(t126) AND FIREABLE(t92) AND FIREABLE(t108) AND (FIREABLE(t122) OR FIREABLE(t45))))))
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(t144) OR NOT FIREABLE(t88) OR (FIREABLE(t28) AND NOT FIREABLE(t126) AND FIREABLE(t92) AND FIREABLE(t108) AND (FIREABLE(t122) OR FIREABLE(t45))))))
lola: processed formula length: 165
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t144) AND FIREABLE(t88) AND (NOT FIREABLE(t28) OR FIREABLE(t126) OR NOT FIREABLE(t92) OR NOT FIREABLE(t108) OR (NOT FIREABLE(t122) AND NOT FIREABLE(t45))))
lola: state equation: Generated DNF with 58 literals and 14 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-13-0.sara
lola: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1750 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t143) OR NOT FIREABLE(t63) OR NOT FIREABLE(t104) OR FIREABLE(t121) OR (FIREABLE(t19) AND (FIREABLE(t79) OR FIREABLE(t150) OR NOT FIREABLE(t15))))))
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(t143) OR NOT FIREABLE(t63) OR NOT FIREABLE(t104) OR FIREABLE(t121) OR (FIREABLE(t19) AND (FIREABLE(t79) OR FIREABLE(t150) OR NOT FIREABLE(t15))))))
lola: processed formula length: 173
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t143) AND FIREABLE(t63) AND FIREABLE(t104) AND NOT FIREABLE(t121) AND (NOT FIREABLE(t19) OR (NOT FIREABLE(t79) AND NOT FIREABLE(t150) AND FIREABLE(t15))))
lola: state equation: Generated DNF with 48 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-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: ========================================

FORMULA AutoFlight-PT-06a-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t66) OR NOT FIREABLE(t90)) AND (FIREABLE(t143) OR (FIREABLE(t138) AND FIREABLE(t33))) AND (NOT FIREABLE(t54) OR (FIREABLE(t34) AND FIREABLE(t63) AND NOT FIREABLE(t72))))))
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(t66) OR NOT FIREABLE(t90)) AND (FIREABLE(t143) OR (FIREABLE(t138) AND FIREABLE(t33))) AND (NOT FIREABLE(t54) OR (FIREABLE(t34) AND FIREABLE(t63) AND NOT FIREABLE(t72))))))
lola: processed formula length: 191
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-06a-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(t66) OR NOT FIREABLE(t90)) AND (FIREABLE(t143) OR (FIREABLE(t138) AND FIREABLE(t33))) AND (NOT FIREABLE(t54) OR (FIREABLE(t34) AND FIREABLE(t63) AND NOT FIREABLE(t72))))
lola: state equation: Generated DNF with 114 literals and 18 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 102 markings, 268 edges
lola:
FORMULA AutoFlight-PT-06a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
========================================lola:

SUMMARY: no yes no yes yes yes yes no no yes yes no yes no yes yes
lola:
preliminary result: no yes no yes yes yes yes no no yes yes no yes no yes yes
lola: memory consumption: 14944 KB
lola: time consumption: 69 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-06a"
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-06a.tgz
mv AutoFlight-PT-06a 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-06a, 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-152646241200126"
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 ;