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 252K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 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 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 78K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Railroad-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578900179
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526961933475

info: Time: 3600 - MCC
===========================================================================================
prep: translating Railroad-PT-010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Railroad-PT-010 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ Railroad-PT-010 @ 3567 seconds
lola: LoLA will run for 3567 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 274/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3776
lola: finding significant places
lola: 118 places, 156 transitions, 47 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 72 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-010-CTLFireability.task
lola: E (F (((E (F (FIREABLE(tr_T38_1))) AND ((FIREABLE(tr_T14_17) OR FIREABLE(tr_T33_28)) AND FIREABLE(tr_T5_1))) OR E ((FIREABLE(tr_T33_98) U FIREABLE(tr_T33_53)))))) : (NOT(A (G (((FIREABLE(tr_T33_89) AND FIREABLE(tr_T33_80)) OR NOT FIREABLE(tr_T33_112))))) OR NOT((A (G (FIREABLE(tr_T33_26))) OR FIREABLE(tr_T13_1)))) : A (G ((E (F (FIREABLE(tr_T33_30))) OR E (G (FIREABLE(tr_T4_1)))))) : (E ((NOT FIREABLE(tr_T33_45) U A (F (FIREABLE(tr_T33_115))))) OR NOT(E ((FIREABLE(tr_T33_42) U NOT FIREABLE(tr_T14_22))))) : (E (X (A (G (NOT FIREABLE(tr_T33_35))))) OR E ((A (X (FIREABLE(tr_T33_88))) U FIREABLE(tr_T14_20)))) : (NOT(((A (G (FIREABLE(tr_T33_104))) OR A (X (FIREABLE(tr_T33_78)))) AND (FIREABLE(tr_T33_63) AND A (G (FIREABLE(tr_T33_94)))))) AND ((A (X (FIREABLE(tr_T33_109))) OR (NOT FIREABLE(tr_T33_86) OR NOT FIREABLE(tr_T33_99) OR NOT FIREABLE(tr_T14_15))) AND E (F (E (G (FIREABLE(tr_T33_44))))))) : A (((FIREABLE(tr_T33_78) AND FIREABLE(tr_T33_119) AND FIREABLE(tr_T37_4) AND (FIREABLE(tr_T33_45) OR FIREABLE(tr_T33_34) OR (FIREABLE(tr_T33_55) AND FIREABLE(tr_T33_92)))) U E (F ((FIREABLE(tr_T33_48) AND FIREABLE(tr_T33_32)))))) : A (F ((E (X (FIREABLE(tr_T33_102))) OR ((FIREABLE(tr_T33_35) AND FIREABLE(tr_T33_30) AND FIREABLE(tr_T14_17)) OR A (F (FIREABLE(tr_T37_2))))))) : NOT(((E (X ((FIREABLE(tr_T33_119) AND FIREABLE(tr_T3_1)))) OR E (F ((FIREABLE(tr_T14_21) AND FIREABLE(tr_T33_81))))) OR FIREABLE(tr_T33_43))) : A (X (A (G (NOT FIREABLE(tr_T33_89))))) : A (G (E (F (FIREABLE(tr_T14_15))))) : E (((E (F (FIREABLE(tr_T33_118))) OR FIREABLE(tr_T27_1)) U FIREABLE(tr_T33_105))) : E ((NOT(E (G (FIREABLE(tr_T33_99)))) U A (F ((FIREABLE(tr_T33_24) AND FIREABLE(tr_T17_1)))))) : NOT(E (F (A (F ((FIREABLE(tr_T33_74) OR FIREABLE(tr_T33_112))))))) : E (F (((E (G (FIREABLE(tr_T4_1))) OR FIREABLE(tr_T33_120)) AND (E (G (FIREABLE(tr_T33_34))) OR FIREABLE(tr_T33_103))))) : (((NOT FIREABLE(tr_T3_1) AND FIREABLE(tr_T33_74) AND (NOT FIREABLE(tr_T14_12) OR FIREABLE(tr_T33_75))) AND A ((NOT FIREABLE(tr_T18_1) U (FIREABLE(tr_T33_43) AND FIREABLE(tr_T37_10))))) OR ((((NOT FIREABLE(tr_T33_44) OR NOT FIREABLE(tr_T36_1)) AND E (X (FIREABLE(tr_T16_1)))) OR E (G (FIREABLE(tr_T33_119)))) OR NOT(E (F ((FIREABLE(tr_T33_68) OR FIREABLE(tr_T33_37)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
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:297
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:455
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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 (X (A (G (NOT FIREABLE(tr_T33_35))))) OR E ((A (X (FIREABLE(tr_T33_88))) U FIREABLE(tr_T14_20))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (EX(NOT(E(TRUE U FIREABLE(tr_T33_35)))) OR E(AX(FIREABLE(tr_T33_88)) U FIREABLE(tr_T14_20)))
lola: processed formula length: 92
lola: 54 rewrites
lola: closed formula file Railroad-PT-010-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: 145 markings, 172 edges
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((E (F (NOT FIREABLE(tr_T33_104))) AND E (X (NOT FIREABLE(tr_T33_78)))) OR (NOT FIREABLE(tr_T33_63) OR E (F (NOT FIREABLE(tr_T33_94))))) AND ((A (X (FIREABLE(tr_T33_109))) OR (NOT FIREABLE(tr_T33_86) OR NOT FIREABLE(tr_T33_99) OR NOT FIREABLE(tr_T14_15))) AND E (F (E (G (FIREABLE(tr_T33_44)))))))
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: (NOT FIREABLE(tr_T33_86) OR NOT FIREABLE(tr_T33_99) OR NOT FIREABLE(tr_T14_15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(tr_T33_86) OR NOT FIREABLE(tr_T33_99) OR NOT FIREABLE(tr_T14_15))
lola: processed formula length: 81
lola: 49 rewrites
lola: closed formula file Railroad-PT-010-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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(tr_T33_63)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(tr_T33_63)
lola: processed formula length: 23
lola: 49 rewrites
lola: closed formula file Railroad-PT-010-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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(tr_T33_44)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(tr_T33_44)
lola: processed formula length: 19
lola: 50 rewrites
lola: closed formula file Railroad-PT-010-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: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-5 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: A (F ((E (X (FIREABLE(tr_T33_102))) OR ((FIREABLE(tr_T33_35) AND FIREABLE(tr_T33_30) AND FIREABLE(tr_T14_17)) OR A (F (FIREABLE(tr_T37_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (EX(FIREABLE(tr_T33_102)) OR ((FIREABLE(tr_T33_35) AND FIREABLE(tr_T33_30) AND FIREABLE(tr_T14_17)) OR A(TRUE U FIREABLE(tr_T37_2)))))
lola: processed formula length: 143
lola: 52 rewrites
lola: closed formula file Railroad-PT-010-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: 31 markings, 84 edges
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-7 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 (X ((NOT FIREABLE(tr_T33_119) OR NOT FIREABLE(tr_T3_1)))) AND (A (G ((NOT FIREABLE(tr_T14_21) OR NOT FIREABLE(tr_T33_81)))) AND NOT FIREABLE(tr_T33_43)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(tr_T33_43)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(tr_T33_43)
lola: processed formula length: 23
lola: 49 rewrites
lola: closed formula file Railroad-PT-010-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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T14_21) OR NOT FIREABLE(tr_T33_81))))
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:695
lola: processed formula: A (G ((NOT FIREABLE(tr_T14_21) OR NOT FIREABLE(tr_T33_81))))
lola: processed formula length: 61
lola: 51 rewrites
lola: closed formula file Railroad-PT-010-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:695
lola: formula 0: (FIREABLE(tr_T14_21) AND FIREABLE(tr_T33_81))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-010-CTLFireability-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: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(tr_T33_119) OR NOT FIREABLE(tr_T3_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((NOT FIREABLE(tr_T33_119) OR NOT FIREABLE(tr_T3_1)))
lola: processed formula length: 56
lola: 50 rewrites
lola: closed formula file Railroad-PT-010-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-8 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 (X (A (G (NOT FIREABLE(tr_T33_89)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: FIREABLE(tr_T33_89)
lola: processed formula length: 19
lola: 51 rewrites
lola: closed formula file Railroad-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--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 /EXEF
lola: The predicate is not invariant from successors.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((NOT FIREABLE(tr_T3_1) AND FIREABLE(tr_T33_74) AND (NOT FIREABLE(tr_T14_12) OR FIREABLE(tr_T33_75))) AND A ((NOT FIREABLE(tr_T18_1) U (FIREABLE(tr_T33_43) AND FIREABLE(tr_T37_10))))) OR (((NOT FIREABLE(tr_T33_44) OR NOT FIREABLE(tr_T36_1)) AND E (X (FIREABLE(tr_T16_1)))) OR (E (G (FIREABLE(tr_T33_119))) OR A (G ((NOT FIREABLE(tr_T33_68) AND NOT FIREABLE(tr_T33_37)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no no unknown no yes no unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 14472 KB
lola: time consumption: 325 seconds
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown no no unknown no yes no unknown unknown unknown unknown unknown unknown
lola: memory consumption: 14472 KB
lola: time consumption: 326 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T33_74) AND NOT FIREABLE(tr_T33_112))))
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:695
lola: processed formula: A (G ((NOT FIREABLE(tr_T33_74) AND NOT FIREABLE(tr_T33_112))))
lola: processed formula length: 62
lola: 51 rewrites
lola: closed formula file Railroad-PT-010-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: 18 markings, 17 edges
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T33_48) AND FIREABLE(tr_T33_32))))
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(tr_T33_48) AND FIREABLE(tr_T33_32))))
lola: processed formula length: 53
lola: 50 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_48) AND FIREABLE(tr_T33_32))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-010-CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(tr_T14_15)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(tr_T14_15)
lola: processed formula length: 19
lola: 50 rewrites
lola: closed formula file Railroad-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 432594 markings, 1564162 edges, 86519 markings/sec, 0 secs
lola: 794434 markings, 3163691 edges, 72368 markings/sec, 5 secs
lola: 1126101 markings, 4780078 edges, 66333 markings/sec, 10 secs
lola: 1429397 markings, 6392870 edges, 60659 markings/sec, 15 secs
lola: 1711181 markings, 8019692 edges, 56357 markings/sec, 20 secs
lola: 1969079 markings, 9701590 edges, 51580 markings/sec, 25 secs
lola: 2037881 markings, 11862202 edges, 13760 markings/sec, 30 secs
lola: 2038132 markings, 14204275 edges, 50 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 2038166 markings, 16324552 edges
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((E (F (FIREABLE(tr_T33_118))) OR FIREABLE(tr_T27_1)) U FIREABLE(tr_T33_105)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((E(TRUE U FIREABLE(tr_T33_118)) OR FIREABLE(tr_T27_1)) U FIREABLE(tr_T33_105))
lola: processed formula length: 80
lola: 51 rewrites
lola: closed formula file Railroad-PT-010-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: 118324 markings, 506375 edges

FORMULA Railroad-PT-010-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F (FIREABLE(tr_T33_30))) OR E (G (FIREABLE(tr_T4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U FIREABLE(tr_T33_30))) AND A(TRUE U NOT FIREABLE(tr_T4_1)))))
lola: processed formula length: 87
lola: 55 rewrites
lola: closed formula file Railroad-PT-010-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: 491121 markings, 2842614 edges, 98224 markings/sec, 0 secs
lola: 866542 markings, 5338378 edges, 75084 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1094319 markings, 7638176 edges

FORMULA Railroad-PT-010-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 632 seconds at most (--localtimelimit=0)
lola: lola: ========================================
========================================
lola: ...considering subproblem: E ((A (F (NOT FIREABLE(tr_T33_99))) U A (F ((FIREABLE(tr_T33_24) AND FIREABLE(tr_T17_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(A(TRUE U NOT FIREABLE(tr_T33_99)) U A(TRUE U (FIREABLE(tr_T33_24) AND FIREABLE(tr_T17_1))))
lola: processed formula length: 93
lola: 52 rewrites
lola: closed formula file Railroad-PT-010-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: 475128 markings, 3256653 edges, 95026 markings/sec, 0 secs
lola: 851212 markings, 6084738 edges, 75217 markings/sec, 5 secs
lola: 1086131 markings, 8649540 edges, 46984 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1094319 markings, 8731002 edges

FORMULA Railroad-PT-010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((E (G (FIREABLE(tr_T4_1))) OR FIREABLE(tr_T33_120)) AND (E (G (FIREABLE(tr_T33_34))) OR FIREABLE(tr_T33_103)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
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: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U ((NOT(A(TRUE U NOT FIREABLE(tr_T4_1))) OR FIREABLE(tr_T33_120)) AND (NOT(A(TRUE U NOT FIREABLE(tr_T33_34))) OR FIREABLE(tr_T33_103))))
lola: processed formula length: 143
lola: 54 rewrites
lola: closed formula file Railroad-PT-010-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: 625198 markings, 3116141 edges, 125040 markings/sec, 0 secs
lola: 1115074 markings, 5807576 edges, 97975 markings/sec, 5 secs
lola: 1533315 markings, 8264317 edges, 83648 markings/sec, 10 secs
lola: 1739633 markings, 10492842 edges, 41264 markings/sec, 15 secs
lola: 1775123 markings, 12514812 edges, 7098 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1795705 markings, 14234231 edges

FORMULA Railroad-PT-010-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1039 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((NOT FIREABLE(tr_T33_45) U A (F (FIREABLE(tr_T33_115))))) OR A ((NOT FIREABLE(tr_T33_42) R FIREABLE(tr_T14_22))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:742
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: (E(NOT FIREABLE(tr_T33_45) U A(TRUE U FIREABLE(tr_T33_115))) OR NOT(E(FIREABLE(tr_T33_42) U NOT FIREABLE(tr_T14_22))))
lola: processed formula length: 118
lola: 54 rewrites
lola: closed formula file Railroad-PT-010-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: 239215 markings, 1316193 edges
lola:
========================================
FORMULA Railroad-PT-010-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((NOT FIREABLE(tr_T33_89) OR NOT FIREABLE(tr_T33_80)) AND FIREABLE(tr_T33_112)))) OR (E (F (NOT FIREABLE(tr_T33_26))) AND NOT FIREABLE(tr_T13_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(tr_T13_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(tr_T13_1)
lola: processed formula length: 22
lola: 49 rewrites
lola: closed formula file Railroad-PT-010-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: subprocess 15 will run for 3115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(tr_T33_89) OR NOT FIREABLE(tr_T33_80)) AND FIREABLE(tr_T33_112))))
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(tr_T33_89) OR NOT FIREABLE(tr_T33_80)) AND FIREABLE(tr_T33_112))))
lola: processed formula length: 88
lola: 50 rewrites
lola: closed formula file Railroad-PT-010-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: ((NOT FIREABLE(tr_T33_89) OR NOT FIREABLE(tr_T33_80)) AND FIREABLE(tr_T33_112))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
state equation: write sara problem file to Railroad-PT-010-CTLFireability-15-0.sara

FORMULA Railroad-PT-010-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((E (F (FIREABLE(tr_T38_1))) AND ((FIREABLE(tr_T14_17) OR FIREABLE(tr_T33_28)) AND FIREABLE(tr_T5_1))))) OR E (F (FIREABLE(tr_T33_53))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: lola: subprocess 15 will run for 3115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T33_53)))
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(tr_T33_53)))
lola: processed formula length: 27
lola: 50 rewrites
lola: closed formula file Railroad-PT-010-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(tr_T33_53)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: state equation: write sara problem file to Railroad-PT-010-CTLFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: state equation: calling and running sara
lola: ========================================
========================================
lola: ...considering subproblem: (((NOT FIREABLE(tr_T3_1) AND FIREABLE(tr_T33_74) AND (NOT FIREABLE(tr_T14_12) OR FIREABLE(tr_T33_75))) AND A ((NOT FIREABLE(tr_T18_1) U (FIREABLE(tr_T33_43) AND FIREABLE(tr_T37_10))))) OR (((NOT FIREABLE(tr_T33_44) OR NOT FIREABLE(tr_T36_1)) AND E (X (FIREABLE(tr_T16_1)))) OR (E (G (FIREABLE(tr_T33_119))) OR A (G ((NOT FIREABLE(tr_T33_68) AND NOT FIREABLE(tr_T33_37)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file Railroad-PT-010-CTLFireability-15-0.sara.
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(tr_T33_119)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(tr_T33_119)))
lola: processed formula length: 28
lola: 49 rewrites
lola: closed formula file Railroad-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(tr_T33_44) OR NOT FIREABLE(tr_T36_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(tr_T33_44) OR NOT FIREABLE(tr_T36_1))
lola: processed formula length: 52
lola: 49 rewrites
lola: closed formula file Railroad-PT-010-CTLFireability.task
lola: processed formula with 0 atomic propositionssara:
place or transition ordering is non-deterministic
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: ========================================
lola: ...considering subproblem: (NOT FIREABLE(tr_T3_1) AND FIREABLE(tr_T33_74) AND (NOT FIREABLE(tr_T14_12) OR FIREABLE(tr_T33_75)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(tr_T3_1) AND FIREABLE(tr_T33_74) AND (NOT FIREABLE(tr_T14_12) OR FIREABLE(tr_T33_75)))
lola: processed formula length: 101
lola: 49 rewrites
lola: closed formula file Railroad-PT-010-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: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T33_68) AND NOT FIREABLE(tr_T33_37))))
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:695
lola: processed formula: A (G ((NOT FIREABLE(tr_T33_68) AND NOT FIREABLE(tr_T33_37))))
lola: processed formula length: 61
lola: 51 rewrites
lola: closed formula file Railroad-PT-010-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:695
lola: formula 0: (FIREABLE(tr_T33_68) OR FIREABLE(tr_T33_37))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-010-CTLFireability-19-0.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(tr_T16_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(FIREABLE(tr_T16_1))
lola: processed formula length: 22
lola: 50 rewrites
lola: closed formula file Railroad-PT-010-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Railroad-PT-010-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no yes no yes yes no no no no
lola:
preliminary result: yes yes yes yes no no no no yes no yes yes no no no no
sara: try reading problem file Railroad-PT-010-CTLFireability-19-0.sara.
sara: place or transition ordering is non-deterministic

lola: memory consumption: 14812 KB
lola: time consumption: 452 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="Railroad-PT-010"
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/Railroad-PT-010.tgz
mv Railroad-PT-010 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 Railroad-PT-010, 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 r136-qhx2-152673578900179"
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 ;