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 176K
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 16K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is AutoFlight-PT-02a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-qhx1-152646241100067
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526640048162

info: Time: 3600 - MCC
===========================================================================================
prep: translating AutoFlight-PT-02a 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-02a formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ AutoFlight-PT-02a @ 3562 seconds
lola: LoLA will run for 3562 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 112/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 57
lola: finding significant places
lola: 57 places, 55 transitions, 41 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 56 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-02a-CTLFireability.task
lola: E (F ((NOT(E (F (FIREABLE(t21)))) AND (((FIREABLE(t13) OR FIREABLE(t9)) AND NOT FIREABLE(t22)) OR FIREABLE(t34))))) : (E (F ((E (G (FIREABLE(t12))) OR (FIREABLE(t50) AND FIREABLE(t25) AND (FIREABLE(t20) OR FIREABLE(t36)))))) AND (FIREABLE(t45) OR (A (X (NOT FIREABLE(t24))) OR (FIREABLE(t9) OR (FIREABLE(t19) AND FIREABLE(t30)) OR NOT FIREABLE(t27))))) : (A (X (E ((FIREABLE(t8) U FIREABLE(t50))))) AND NOT(E (X (A (X (FIREABLE(t18))))))) : A (F (((FIREABLE(t0) OR E (F (FIREABLE(t9)))) AND E (F (FIREABLE(t49)))))) : (E (X (FIREABLE(t22))) OR E (((NOT FIREABLE(t10) OR FIREABLE(t11)) U E (G (FIREABLE(t53)))))) : ((E (F (A (G (FIREABLE(t29))))) AND E ((NOT FIREABLE(t42) U FIREABLE(t12)))) AND E (((NOT FIREABLE(t34) AND NOT FIREABLE(t10)) U E (G (FIREABLE(t19)))))) : E (F (((A (G (FIREABLE(t20))) AND A (F (FIREABLE(t35)))) AND E ((FIREABLE(t38) U FIREABLE(t15)))))) : E ((NOT(E (G (FIREABLE(t52)))) U ((NOT FIREABLE(t37) OR NOT FIREABLE(t26)) AND A (G (FIREABLE(t0)))))) : NOT(E (F (((FIREABLE(t18) AND FIREABLE(t27)) AND E (X (FIREABLE(t14))))))) : E (F ((((FIREABLE(t20) OR FIREABLE(t39) OR (FIREABLE(t29) AND FIREABLE(t21))) AND A (G (FIREABLE(t25)))) OR A (F ((FIREABLE(t38) AND FIREABLE(t51))))))) : E (((NOT FIREABLE(t39) OR NOT FIREABLE(t52) OR ((FIREABLE(t27) OR FIREABLE(t34)) AND NOT FIREABLE(t33))) U E (X ((FIREABLE(t3) AND FIREABLE(t44)))))) : A (G ((A (X ((FIREABLE(t13) OR FIREABLE(t3)))) OR ((NOT FIREABLE(t51) OR NOT FIREABLE(t44)) AND (NOT FIREABLE(t18) OR NOT FIREABLE(t27)))))) : (A (((FIREABLE(t27) AND FIREABLE(t48) AND FIREABLE(t21)) U ((FIREABLE(t22) OR FIREABLE(t25)) AND FIREABLE(t17)))) OR A (((NOT FIREABLE(t23) OR NOT FIREABLE(t0)) U ((FIREABLE(t6) OR FIREABLE(t8)) AND NOT FIREABLE(t53))))) : E (F ((((NOT FIREABLE(t41) AND FIREABLE(t39)) AND A (G (FIREABLE(t15)))) AND FIREABLE(t31)))) : (A (G ((NOT FIREABLE(t8) AND NOT FIREABLE(t6) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t4))))) OR E (F ((A (F (FIREABLE(t29))) AND E (G (FIREABLE(t23))))))) : (((A (X ((FIREABLE(t52) AND FIREABLE(t16)))) AND A ((FIREABLE(t44) U FIREABLE(t19)))) OR E (F (FIREABLE(t15)))) AND FIREABLE(t41))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F (E (G (FIREABLE(t12))))) OR E (F ((FIREABLE(t50) AND FIREABLE(t25) AND (FIREABLE(t20) OR FIREABLE(t36)))))) AND (FIREABLE(t45) OR (A (X (NOT FIREABLE(t24))) OR (FIREABLE(t9) OR (FIREABLE(t19) AND FIREABLE(t30)) OR NOT FIREABLE(t27)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t9) OR (FIREABLE(t19) AND FIREABLE(t30)) OR NOT FIREABLE(t27))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t9) OR (FIREABLE(t19) AND FIREABLE(t30)) OR NOT FIREABLE(t27))
lola: processed formula length: 74
lola: 24 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t50) AND FIREABLE(t25) AND (FIREABLE(t20) OR 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(t50) AND FIREABLE(t25) AND (FIREABLE(t20) OR FIREABLE(t36)))))
lola: processed formula length: 79
lola: 25 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t50) AND FIREABLE(t25) AND (FIREABLE(t20) OR FIREABLE(t36)))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-02a-CTLFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 372 markings, 1235 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(t12)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(t12)
lola: processed formula length: 13
lola: 25 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 43 markings, 53 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E ((FIREABLE(t8) U FIREABLE(t50))))) AND A (X (E (X (NOT FIREABLE(t18))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E ((FIREABLE(t8) U FIREABLE(t50)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(FIREABLE(t8) U FIREABLE(t50)))
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3068 markings, 12518 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-2 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 (X (FIREABLE(t22))) OR E (((NOT FIREABLE(t10) OR FIREABLE(t11)) U E (G (FIREABLE(t53))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (EX(FIREABLE(t22)) OR E((NOT FIREABLE(t10) OR FIREABLE(t11)) U NOT(A(TRUE U NOT FIREABLE(t53)))))
lola: processed formula length: 98
lola: 28 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6949 markings, 63178 edges
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t18) OR NOT FIREABLE(t27)) OR A (X (NOT FIREABLE(t14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(E(TRUE U ((FIREABLE(t18) AND FIREABLE(t27)) AND NOT(AX(NOT FIREABLE(t14))))))
lola: processed formula length: 81
lola: 28 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6949 markings, 55285 edges
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(t39) OR NOT FIREABLE(t52) OR ((FIREABLE(t27) OR FIREABLE(t34)) AND NOT FIREABLE(t33))) U E (X ((FIREABLE(t3) AND FIREABLE(t44))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((NOT FIREABLE(t39) OR NOT FIREABLE(t52) OR ((FIREABLE(t27) OR FIREABLE(t34)) AND NOT FIREABLE(t33))) U EX((FIREABLE(t3) AND FIREABLE(t44))))
lola: processed formula length: 145
lola: 26 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 937 markings, 3589 edges
lola:
FORMULA AutoFlight-PT-02a-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X ((FIREABLE(t13) OR FIREABLE(t3)))) OR ((NOT FIREABLE(t51) OR NOT FIREABLE(t44)) AND (NOT FIREABLE(t18) OR NOT FIREABLE(t27))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT(AX((FIREABLE(t13) OR FIREABLE(t3)))) AND ((FIREABLE(t51) AND FIREABLE(t44)) OR (FIREABLE(t18) AND FIREABLE(t27))))))
lola: processed formula length: 136
lola: 28 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6949 markings, 55285 edges
lola:
FORMULA AutoFlight-PT-02a-CTLFireability-11 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 (X ((FIREABLE(t52) AND FIREABLE(t16)))) AND A ((FIREABLE(t44) U FIREABLE(t19)))) OR E (F (FIREABLE(t15)))) AND FIREABLE(t41))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes no unknown no unknown unknown unknown yes unknown yes yes unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 14452 KB
lola: time consumption: 356 seconds
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown yes no unknown no unknown unknown unknown yes unknown yes yes unknown unknown unknown unknown
lola: memory consumption: 14452 KB
lola: time consumption: 360 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t41) AND FIREABLE(t39)) AND (A (G (FIREABLE(t15))) AND FIREABLE(t31)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U ((NOT FIREABLE(t41) AND FIREABLE(t39)) AND (NOT(E(TRUE U NOT FIREABLE(t15))) AND FIREABLE(t31))))
lola: processed formula length: 106
lola: 27 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6949 markings, 55501 edges
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (NOT FIREABLE(t21))) AND (((FIREABLE(t13) OR FIREABLE(t9)) AND NOT FIREABLE(t22)) OR FIREABLE(t34)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: E(TRUE U (NOT(E(TRUE U FIREABLE(t21))) AND (((FIREABLE(t13) OR FIREABLE(t9)) AND NOT FIREABLE(t22)) OR FIREABLE(t34))))
lola: processed formula length: 121
lola: 27 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 63 markings, 255 edges
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(t0) OR E (F (FIREABLE(t9)))) AND E (F (FIREABLE(t49))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U ((FIREABLE(t0) OR E(TRUE U FIREABLE(t9))) AND E(TRUE U FIREABLE(t49))))
lola: processed formula length: 80
lola: 27 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 159 markings, 697 edges
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F (NOT FIREABLE(t52))) U ((NOT FIREABLE(t37) OR NOT FIREABLE(t26)) AND A (G (FIREABLE(t0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(A(TRUE U NOT FIREABLE(t52)) U ((NOT FIREABLE(t37) OR NOT FIREABLE(t26)) AND NOT(E(TRUE U NOT FIREABLE(t0)))))
lola: processed formula length: 112
lola: 28 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6949 markings, 72971 edges
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (FIREABLE(t20))) AND (A (F (FIREABLE(t35))) AND E ((FIREABLE(t38) U FIREABLE(t15)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (NOT(E(TRUE U NOT FIREABLE(t20))) AND (A(TRUE U FIREABLE(t35)) AND E(FIREABLE(t38) U FIREABLE(t15)))))
lola: processed formula length: 111
lola: 29 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6949 markings, 62038 edges
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (FIREABLE(t29))))) AND (E ((NOT FIREABLE(t42) U FIREABLE(t12))) AND E (((NOT FIREABLE(t34) AND NOT FIREABLE(t10)) U E (G (FIREABLE(t19)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (E(TRUE U NOT(E(TRUE U NOT FIREABLE(t29)))) AND (E(NOT FIREABLE(t42) U FIREABLE(t12)) AND E((NOT FIREABLE(t34) AND NOT FIREABLE(t10)) U NOT(A(TRUE U NOT FIREABLE(t19))))))
lola: processed formula length: 171
lola: 31 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 5 significant temporal operators and needs 22 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6949 markings, 59578 edges

FORMULA AutoFlight-PT-02a-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((FIREABLE(t27) AND FIREABLE(t48) AND FIREABLE(t21)) U ((FIREABLE(t22) OR FIREABLE(t25)) AND FIREABLE(t17)))) OR A (((NOT FIREABLE(t23) OR NOT FIREABLE(t0)) U ((FIREABLE(t6) OR FIREABLE(t8)) AND NOT FIREABLE(t53)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(t23) OR NOT FIREABLE(t0)) U ((FIREABLE(t6) OR FIREABLE(t8)) AND NOT FIREABLE(t53))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((NOT FIREABLE(t23) OR NOT FIREABLE(t0)) U ((FIREABLE(t6) OR FIREABLE(t8)) AND NOT FIREABLE(t53))))
lola: processed formula length: 104
lola: 28 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 32 markings, 61 edges
lola: ========================================
lola: subprocess 14 will run for 1593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t27) AND FIREABLE(t48) AND FIREABLE(t21)) U ((FIREABLE(t22) OR FIREABLE(t25)) AND FIREABLE(t17))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((FIREABLE(t27) AND FIREABLE(t48) AND FIREABLE(t21)) U ((FIREABLE(t22) OR FIREABLE(t25)) AND FIREABLE(t17))))
lola: processed formula length: 113
lola: 28 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((FIREABLE(t20) OR FIREABLE(t39) OR (FIREABLE(t29) AND FIREABLE(t21))) AND A (G (FIREABLE(t25)))))) OR E (F ((FIREABLE(t38) AND FIREABLE(t51)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t38) AND FIREABLE(t51))))
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(t38) AND FIREABLE(t51))))
lola: processed formula length: 41
lola: 25 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t38) AND FIREABLE(t51))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 365 markings, 1286 edges
lola: ========================================
lola: subprocess 15 will run for 3186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t20) OR FIREABLE(t39) OR (FIREABLE(t29) AND FIREABLE(t21))) AND A (G (FIREABLE(t25))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U ((FIREABLE(t20) OR FIREABLE(t39) OR (FIREABLE(t29) AND FIREABLE(t21))) AND NOT(E(TRUE U NOT FIREABLE(t25)))))
lola: processed formula length: 120
lola: 27 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6949 markings, 57037 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((NOT FIREABLE(t8) AND NOT FIREABLE(t6) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t4))))) OR E (F ((A (F (FIREABLE(t29))) AND E (G (FIREABLE(t23)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t8) AND NOT FIREABLE(t6) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t4)))))
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(t8) AND NOT FIREABLE(t6) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t4)))))
lola: processed formula length: 92
lola: 26 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(t8) OR FIREABLE(t6) OR (FIREABLE(t38) AND FIREABLE(t4)))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to AutoFlight-PT-02a-CTLFireability-15-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((A (X ((FIREABLE(t52) AND FIREABLE(t16)))) AND A ((FIREABLE(t44) U FIREABLE(t19)))) OR E (F (FIREABLE(t15)))) AND FIREABLE(t41))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t15)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file AutoFlight-PT-02a-CTLFireability-15-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t15)))
lola: processed formula length: 21
lola: 25 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t15)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to AutoFlight-PT-02a-CTLFireability-16-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: ...considering subproblem: FIREABLE(t41)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t41)
lola: processed formula length: 13
lola: 24 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (G ((NOT FIREABLE(t8) AND NOT FIREABLE(t6) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t4))))) OR E (F ((A (F (FIREABLE(t29))) AND E (G (FIREABLE(t23)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file AutoFlight-PT-02a-CTLFireability-16-0.sara.
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t8) AND NOT FIREABLE(t6) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t4)))))
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(t8) AND NOT FIREABLE(t6) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t4)))))
lola: processed formula length: 92
lola: 26 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)

lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(t8) OR FIREABLE(t6) OR (FIREABLE(t38) AND FIREABLE(t4)))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((A (F (FIREABLE(t29))) AND E (G (FIREABLE(t23))))))
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola:
rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (A(TRUE U FIREABLE(t29)) AND NOT(A(TRUE U NOT FIREABLE(t23)))))
lola: processed formula length: 72
lola: 28 rewrites
lola: closed formula file AutoFlight-PT-02a-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6949 markings, 70039 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================
lola: ========================================

FORMULA AutoFlight-PT-02a-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no no no no yes no yes yes no no no no
lola:
preliminary result: yes yes no yes no no no no yes no yes yes no no no no
lola: memory consumption: 14884 KB
lola: time consumption: 377 seconds

BK_STOP 1526640459217

--------------------
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-02a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02a.tgz
mv AutoFlight-PT-02a 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-02a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-qhx1-152646241100067"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;