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 340K
-rw-r--r-- 1 mcc users 3.7K 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.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 9.8K 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.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 169K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is AutoFlight-PT-24a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-qhx1-152646241200154
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526665590427

info: Time: 3600 - MCC
===========================================================================================
prep: translating AutoFlight-PT-24a 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-24a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ AutoFlight-PT-24a @ 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: 1212/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 607
lola: finding significant places
lola: 607 places, 605 transitions, 459 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 584 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-24a-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t601) OR NOT FIREABLE(t121) OR NOT FIREABLE(t22) OR NOT FIREABLE(t141) OR FIREABLE(t272) OR FIREABLE(t484) OR FIREABLE(t115) OR FIREABLE(t446) OR FIREABLE(t96)))) : E (F ((FIREABLE(t554) AND (FIREABLE(t190) OR NOT FIREABLE(t121) OR (FIREABLE(t331) AND (FIREABLE(t581) OR FIREABLE(t559))))))) : A (G ((NOT FIREABLE(t383) OR NOT FIREABLE(t485) OR NOT FIREABLE(t189) OR FIREABLE(t554)))) : E (F (((FIREABLE(t46) AND FIREABLE(t82) AND NOT FIREABLE(t533)) OR FIREABLE(t412) OR (FIREABLE(t2) AND FIREABLE(t600) AND FIREABLE(t377) AND FIREABLE(t269))))) : A (G ((NOT FIREABLE(t327) OR NOT FIREABLE(t133)))) : E (F ((NOT FIREABLE(t10) AND NOT FIREABLE(t209) AND NOT FIREABLE(t210) AND FIREABLE(t184)))) : E (F ((FIREABLE(t534) AND FIREABLE(t185) AND FIREABLE(t315)))) : E (F ((FIREABLE(t376) AND (NOT FIREABLE(t524) OR NOT FIREABLE(t437) OR FIREABLE(t239))))) : E (F ((FIREABLE(t394) OR (FIREABLE(t49) AND FIREABLE(t154))))) : E (F (((FIREABLE(t109) OR FIREABLE(t534)) AND FIREABLE(t357) AND (NOT FIREABLE(t584) OR FIREABLE(t352)) AND (FIREABLE(t450) OR FIREABLE(t135))))) : A (G (NOT FIREABLE(t368))) : E (F (((FIREABLE(t254) AND FIREABLE(t341) AND (FIREABLE(t157) OR FIREABLE(t269)) AND NOT FIREABLE(t36) AND NOT FIREABLE(t298)) OR (FIREABLE(t571) AND FIREABLE(t25))))) : E (F ((FIREABLE(t470) AND (NOT FIREABLE(t360) OR FIREABLE(t380)) AND (NOT FIREABLE(t258) OR NOT FIREABLE(t180) OR FIREABLE(t198))))) : E (F ((FIREABLE(t543) OR FIREABLE(t459)))) : E (F (((FIREABLE(t441) AND FIREABLE(t472) AND (FIREABLE(t604) OR FIREABLE(t598)) AND FIREABLE(t356)) OR FIREABLE(t455)))) : A (G ((NOT FIREABLE(t590) OR NOT FIREABLE(t394))))
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(t368)))
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(t368)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t368)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 115 markings, 114 edges
lola: ========================================

FORMULA AutoFlight-PT-24a-ReachabilityFireability-10 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: A (G ((NOT FIREABLE(t327) OR NOT FIREABLE(t133))))
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(t327) OR NOT FIREABLE(t133))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t327) AND FIREABLE(t133))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2083 markings, 5475 edges
lola: ========================================

FORMULA AutoFlight-PT-24a-ReachabilityFireability-4 FALSE 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(t543) OR FIREABLE(t459))))
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(t543) OR FIREABLE(t459))))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t543) OR FIREABLE(t459))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA AutoFlight-PT-24a-ReachabilityFireability-13 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: A (G ((NOT FIREABLE(t590) OR NOT FIREABLE(t394))))
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(t590) OR NOT FIREABLE(t394))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t590) AND FIREABLE(t394))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-3-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-24a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t394) OR (FIREABLE(t49) AND 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(t394) OR (FIREABLE(t49) AND FIREABLE(t154)))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t394) OR (FIREABLE(t49) AND FIREABLE(t154)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-4-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-24a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t534) AND FIREABLE(t185) AND FIREABLE(t315))))
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(t534) AND FIREABLE(t185) AND FIREABLE(t315))))
lola: processed formula length: 62
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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)
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-4-0.sara.
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t534) AND FIREABLE(t185) AND FIREABLE(t315))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

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-24a-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t383) OR NOT FIREABLE(t485) OR NOT FIREABLE(t189) OR FIREABLE(t554))))
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(t383) OR NOT FIREABLE(t485) OR NOT FIREABLE(t189) OR FIREABLE(t554))))
lola: processed formula length: 93
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t383) AND FIREABLE(t485) AND FIREABLE(t189) AND NOT FIREABLE(t554))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-6-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-24a-ReachabilityFireability-2 TRUE 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 ((FIREABLE(t376) AND (NOT FIREABLE(t524) OR NOT FIREABLE(t437) OR FIREABLE(t239)))))
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(t376) AND (NOT FIREABLE(t524) OR NOT FIREABLE(t437) OR FIREABLE(t239)))))
lola: processed formula length: 91
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t376) AND (NOT FIREABLE(t524) OR NOT FIREABLE(t437) OR FIREABLE(t239)))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 107 markings, 106 edges
lola: ========================================

FORMULA AutoFlight-PT-24a-ReachabilityFireability-7 TRUE 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: E (F ((NOT FIREABLE(t10) AND NOT FIREABLE(t209) AND NOT FIREABLE(t210) AND FIREABLE(t184))))
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(t10) AND NOT FIREABLE(t209) AND NOT FIREABLE(t210) AND FIREABLE(t184))))
lola: processed formula length: 92
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t10) AND NOT FIREABLE(t209) AND NOT FIREABLE(t210) AND FIREABLE(t184))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-8-0.sara
lola: ========================================

FORMULA AutoFlight-PT-24a-ReachabilityFireability-5 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: E (F ((FIREABLE(t554) AND (FIREABLE(t190) OR NOT FIREABLE(t121) OR (FIREABLE(t331) AND (FIREABLE(t581) OR FIREABLE(t559)))))))
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(t554) AND (FIREABLE(t190) OR NOT FIREABLE(t121) OR (FIREABLE(t331) AND (FIREABLE(t581) OR FIREABLE(t559)))))))
lola: processed formula length: 129
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t554) AND (FIREABLE(t190) OR NOT FIREABLE(t121) OR (FIREABLE(t331) AND (FIREABLE(t581) OR FIREABLE(t559)))))
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 39 edges
lola: ========================================

FORMULA AutoFlight-PT-24a-ReachabilityFireability-1 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: E (F (((FIREABLE(t441) AND FIREABLE(t472) AND (FIREABLE(t604) OR FIREABLE(t598)) AND FIREABLE(t356)) OR FIREABLE(t455))))
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(t441) AND FIREABLE(t472) AND (FIREABLE(t604) OR FIREABLE(t598)) AND FIREABLE(t356)) OR FIREABLE(t455))))
lola: processed formula length: 123
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t441) AND FIREABLE(t472) AND (FIREABLE(t604) OR FIREABLE(t598)) AND FIREABLE(t356)) OR FIREABLE(t455))
lola: state equation: Generated DNF with 18 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-10-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: 6611 markings, 27276 edges
lola: ========================================

FORMULA AutoFlight-PT-24a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t470) AND (NOT FIREABLE(t360) OR FIREABLE(t380)) AND (NOT FIREABLE(t258) OR NOT FIREABLE(t180) OR 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(t470) AND (NOT FIREABLE(t360) OR FIREABLE(t380)) AND (NOT FIREABLE(t258) OR NOT FIREABLE(t180) OR FIREABLE(t198)))))
lola: processed formula length: 135
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t470) AND (NOT FIREABLE(t360) OR FIREABLE(t380)) AND (NOT FIREABLE(t258) OR NOT FIREABLE(t180) OR FIREABLE(t198)))
lola: state equation: Generated DNF with 52 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA AutoFlight-PT-24a-ReachabilityFireability-12 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(t109) OR FIREABLE(t534)) AND FIREABLE(t357) AND (NOT FIREABLE(t584) OR FIREABLE(t352)) AND (FIREABLE(t450) OR FIREABLE(t135)))))
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(t109) OR FIREABLE(t534)) AND FIREABLE(t357) AND (NOT FIREABLE(t584) OR FIREABLE(t352)) AND (FIREABLE(t450) OR FIREABLE(t135)))))
lola: processed formula length: 148
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t109) OR FIREABLE(t534)) AND FIREABLE(t357) AND (NOT FIREABLE(t584) OR FIREABLE(t352)) AND (FIREABLE(t450) OR FIREABLE(t135)))
lola: state equation: Generated DNF with 70 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.

FORMULA AutoFlight-PT-24a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t46) AND FIREABLE(t82) AND NOT FIREABLE(t533)) OR FIREABLE(t412) OR (FIREABLE(t2) AND FIREABLE(t600) AND FIREABLE(t377) AND FIREABLE(t269)))))
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) AND FIREABLE(t82) AND NOT FIREABLE(t533)) OR FIREABLE(t412) OR (FIREABLE(t2) AND FIREABLE(t600) AND FIREABLE(t377) AND FIREABLE(t269)))))
lola: processed formula length: 161
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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: 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) AND FIREABLE(t82) AND NOT FIREABLE(t533)) OR FIREABLE(t412) OR (FIREABLE(t2) AND FIREABLE(t600) AND FIREABLE(t377) AND FIREABLE(t269)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola:
FORMULA AutoFlight-PT-24a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t254) AND FIREABLE(t341) AND (FIREABLE(t157) OR FIREABLE(t269)) AND NOT FIREABLE(t36) AND NOT FIREABLE(t298)) OR (FIREABLE(t571) AND FIREABLE(t25)))))
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(t254) AND FIREABLE(t341) AND (FIREABLE(t157) OR FIREABLE(t269)) AND NOT FIREABLE(t36) AND NOT FIREABLE(t298)) OR (FIREABLE(t571) AND FIREABLE(t25)))))
lola: processed formula length: 169
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-24a-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: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(t254) AND FIREABLE(t341) AND (FIREABLE(t157) OR FIREABLE(t269)) AND NOT FIREABLE(t36) AND NOT FIREABLE(t298)) OR (FIREABLE(t571) AND FIREABLE(t25)))
lola: state equation: Generated DNF with 33 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA AutoFlight-PT-24a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t601) OR NOT FIREABLE(t121) OR NOT FIREABLE(t22) OR NOT FIREABLE(t141) OR FIREABLE(t272) OR FIREABLE(t484) OR FIREABLE(t115) OR FIREABLE(t446) OR FIREABLE(t96))))
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(t601) OR NOT FIREABLE(t121) OR NOT FIREABLE(t22) OR NOT FIREABLE(t141) OR FIREABLE(t272) OR FIREABLE(t484) OR FIREABLE(t115) OR FIREABLE(t446) OR FIREABLE(t96))))
lola: processed formula length: 190
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-24a-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(t601) AND FIREABLE(t121) AND FIREABLE(t22) AND FIREABLE(t141) AND NOT FIREABLE(t272) AND NOT FIREABLE(t484) AND NOT FIREABLE(t115) AND NOT FIREABLE(t446) AND NOT FIREABLE(t96))
lola: state equation: Generated DNF with 40 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-24a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-24a-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1165 markings, 2914 edges

FORMULA AutoFlight-PT-24a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes no yes yes yes no yes yes yes yes yes
lola:
preliminary result: no yes yes yes no yes no yes yes yes no yes yes yes yes yes
lola: ========================================
lola: memory consumption: 15752 KB
lola: time consumption: 2 seconds

BK_STOP 1526665613976

--------------------
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-24a"
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-24a.tgz
mv AutoFlight-PT-24a 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-24a, 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-152646241200154"
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 ;