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 336K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 169K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FlexibleBarrier-PT-14a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998100171
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526665206141

info: Time: 3600 - MCC
===========================================================================================
prep: translating FlexibleBarrier-PT-14a 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 FlexibleBarrier-PT-14a formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ FlexibleBarrier-PT-14a @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 749/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 171
lola: finding significant places
lola: 171 places, 578 transitions, 155 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 438 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-14a-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p86)
lola: LP says that atomic proposition is always false: (3 <= p159)
lola: LP says that atomic proposition is always false: (3 <= p9)
lola: LP says that atomic proposition is always false: (3 <= p11)
lola: LP says that atomic proposition is always false: (3 <= p156)
lola: LP says that atomic proposition is always false: (3 <= p121)
lola: LP says that atomic proposition is always false: (2 <= p111)
lola: LP says that atomic proposition is always false: (3 <= p43)
lola: LP says that atomic proposition is always false: (3 <= p65)
lola: LP says that atomic proposition is always false: (2 <= p150)
lola: LP says that atomic proposition is always false: (3 <= p156)
lola: LP says that atomic proposition is always false: (3 <= p138)
lola: LP says that atomic proposition is always false: (3 <= p96)
lola: LP says that atomic proposition is always false: (3 <= p70)
lola: A (G ((E (F ((1 <= p9))) AND ((p164 <= p39) AND (p125 <= p13) AND ((p17 <= p100) OR (1 <= p9)))))) : NOT((E (X ((p24 + 1 <= p90))) OR E (((p155 <= p77) U (1 <= p53))))) : (NOT(((p102 <= p6) OR E (X ((1 <= p115))))) OR NOT(E (F ((1 <= p113))))) : E (X (A (G (((p15 <= p148)))))) : (FALSE OR A (G (E (F ((1 <= p44)))))) : ((p170 <= p130) AND A (G (((p18 <= p84) OR (p47 <= p28) OR ((1 <= p110) AND (p115 <= p83)))))) : NOT(E (G (A (G ((p89 <= p132)))))) : A (G (A (G (((p90 <= p134) OR (p149 <= p95)))))) : NOT(E (F (A (G (FALSE))))) : E (((p41 <= p155) U E (F (FALSE)))) : E (F (((p129 + 1 <= p49) OR ((p55 + 1 <= p97) AND ((p170 <= p108) OR (p67 <= p66)))))) : E ((A (G ((p140 <= p149))) U ())) : A (G (A (X (TRUE)))) : A (G (A ((FALSE U (p160 <= p18))))) : (E (((p70 + 1 <= p140) U (p68 + 1 <= p39))) OR E ((TRUE U ()))) : ((E ((FALSE U FALSE)) OR (((p164 <= p82)) AND (p76 <= p50) AND (p13 <= p7) AND (p124 <= p107) AND (p55 <= p65))) AND (E (((p98 <= p163) U (p169 <= p72))) AND (E (F ((p73 <= p41))) AND E (F ((1 <= p101))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:545
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: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:318
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:476
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:389
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 55 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 55 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 55 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-11 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 55 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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:
FORMULA FlexibleBarrier-PT-14a-CTLCardinality-12 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: (((p6 + 1 <= p102) AND A (X ((p115 <= 0)))) OR A (G ((p113 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p6 + 1 <= p102)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6 + 1 <= p102)
lola: processed formula length: 16
lola: 55 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.task
lola: processed formula with 1 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p113 <= 0)))
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 ((p113 <= 0)))
lola: processed formula length: 19
lola: 57 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: (1 <= p113)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-14a-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-14a-CTLCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-2 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: E (X (A (G (((p15 <= p148))))))
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:297
lola: processed formula: EX(NOT(E(TRUE U ((p148 + 1 <= p15)))))
lola: processed formula length: 38
lola: 58 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: 179 markings, 927 edges
lola:
FORMULA FlexibleBarrier-PT-14a-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p90 <= p24))) AND A (((p77 + 1 <= p155) R (p53 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p77 + 1 <= p155) R (p53 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((p77 + 1 <= p155) R (p53 <= 0)))
lola: processed formula length: 36
lola: 61 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (1 <= p53)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-14a-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-14a-CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 65772 markings, 154899 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p132 + 1 <= p89)))
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 ((p132 + 1 <= p89)))
lola: processed formula length: 25
lola: 56 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: (p132 + 1 <= p89)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-14a-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 57 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p160 <= p18)))
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 ((p160 <= p18)))
lola: processed formula length: 21
lola: 57 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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, 18 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p90 <= p134) OR (p149 <= p95))))
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 (((p90 <= p134) OR (p149 <= p95))))
lola: processed formula length: 41
lola: 57 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: 157 markings, 194 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p129 + 1 <= p49) OR ((p55 + 1 <= p97) AND ((p170 <= p108) OR (p67 <= p66))))))
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 (((p129 + 1 <= p49) OR ((p55 + 1 <= p97) AND ((p170 <= p108) OR (p67 <= p66))))))
lola: processed formula length: 88
lola: 56 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: ((p129 + 1 <= p49) OR ((p55 + 1 <= p97) AND ((p170 <= p108) OR (p67 <= p66))))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-14a-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (1 <= p44)
lola: processed formula length: 10
lola: 56 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: 775920 markings, 2132966 edges, 155184 markings/sec, 0 secs
lola: 1488335 markings, 4224100 edges, 142483 markings/sec, 5 secs
lola: 2160011 markings, 6239424 edges, 134335 markings/sec, 10 secs
lola: 2806152 markings, 8210828 edges, 129228 markings/sec, 15 secs
lola: 3280633 markings, 9671948 edges, 94896 markings/sec, 20 secs
lola: 3896237 markings, 11581377 edges, 123121 markings/sec, 25 secs
lola: 4501234 markings, 13472877 edges, 120999 markings/sec, 30 secs
lola: 4987923 markings, 15006186 edges, 97338 markings/sec, 35 secs
lola: 5535124 markings, 16736576 edges, 109440 markings/sec, 40 secs
lola: 6119292 markings, 18592950 edges, 116834 markings/sec, 45 secs
lola: 6695370 markings, 20436685 edges, 115216 markings/sec, 50 secs
lola: 7273925 markings, 22286043 edges, 115711 markings/sec, 55 secs
lola: 7838659 markings, 24103933 edges, 112947 markings/sec, 60 secs
lola: 8375503 markings, 25832961 edges, 107369 markings/sec, 65 secs
lola: 8821992 markings, 27275256 edges, 89298 markings/sec, 70 secs
lola: 9380204 markings, 29082774 edges, 111642 markings/sec, 75 secs
lola: 9932682 markings, 30879194 edges, 110496 markings/sec, 80 secs
lola: 10483735 markings, 32671388 edges, 110211 markings/sec, 85 secs
lola: 11027305 markings, 34448040 edges, 108714 markings/sec, 90 secs
lola: 11570118 markings, 36221660 edges, 108563 markings/sec, 95 secs
lola: 11979788 markings, 37559785 edges, 81934 markings/sec, 100 secs
lola: 12514823 markings, 39317744 edges, 107007 markings/sec, 105 secs
lola: 13055948 markings, 41087832 edges, 108225 markings/sec, 110 secs
lola: 13495973 markings, 42534462 edges, 88005 markings/sec, 115 secs
lola: 13951464 markings, 44036073 edges, 91098 markings/sec, 120 secs
lola: 14479008 markings, 45777192 edges, 105509 markings/sec, 125 secs
lola: 15003530 markings, 47513500 edges, 104904 markings/sec, 130 secs
lola: 15509423 markings, 49188503 edges, 101179 markings/sec, 135 secs
lola: 16021743 markings, 50887893 edges, 102464 markings/sec, 140 secs
lola: 16460982 markings, 52347649 edges, 87848 markings/sec, 145 secs
lola: 16875047 markings, 53721598 edges, 82813 markings/sec, 150 secs
lola: 17390341 markings, 55437197 edges, 103059 markings/sec, 155 secs
lola: 17915224 markings, 57183837 edges, 104977 markings/sec, 160 secs
lola: 18378843 markings, 58729821 edges, 92724 markings/sec, 165 secs
lola: 18843950 markings, 60276997 edges, 93021 markings/sec, 170 secs
lola: 19327215 markings, 61893262 edges, 96653 markings/sec, 175 secs
lola: 19782418 markings, 63422743 edges, 91041 markings/sec, 180 secs
lola: 20259384 markings, 65020186 edges, 95393 markings/sec, 185 secs
lola: 20719206 markings, 66545668 edges, 91964 markings/sec, 190 secs
lola: 21231756 markings, 68260049 edges, 102510 markings/sec, 195 secs
lola: 21745571 markings, 69979776 edges, 102763 markings/sec, 200 secs
lola: 22257001 markings, 71697409 edges, 102286 markings/sec, 205 secs
lola: 22714329 markings, 73233062 edges, 91466 markings/sec, 210 secs
lola: 23220689 markings, 74932995 edges, 101272 markings/sec, 215 secs
lola: 23726288 markings, 76639677 edges, 101120 markings/sec, 220 secs
lola: 24233292 markings, 78344022 edges, 101401 markings/sec, 225 secs
lola: 24737231 markings, 80044389 edges, 100788 markings/sec, 230 secs
lola: 25241231 markings, 81746603 edges, 100800 markings/sec, 235 secs
lola: 25744020 markings, 83443718 edges, 100558 markings/sec, 240 secs
lola: 26251293 markings, 85154755 edges, 101455 markings/sec, 245 secs
lola: 26746015 markings, 86826817 edges, 98944 markings/sec, 250 secs
lola: 27219663 markings, 88432534 edges, 94730 markings/sec, 255 secs
lola: 27696531 markings, 90046753 edges, 95374 markings/sec, 260 secs
lola: 28166074 markings, 91631814 edges, 93909 markings/sec, 265 secs
lola: 28607148 markings, 93128136 edges, 88215 markings/sec, 270 secs
lola: 29104304 markings, 94809730 edges, 99431 markings/sec, 275 secs
lola: 29598661 markings, 96489995 edges, 98871 markings/sec, 280 secs
lola: 30092887 markings, 98170072 edges, 98845 markings/sec, 285 secs
lola: 30588616 markings, 99860132 edges, 99146 markings/sec, 290 secs
lola: 31080723 markings, 101537668 edges, 98421 markings/sec, 295 secs
lola: 31572303 markings, 103215777 edges, 98316 markings/sec, 300 secs
lola: 32063479 markings, 104886761 edges, 98235 markings/sec, 305 secs
lola: 32554338 markings, 106556835 edges, 98172 markings/sec, 310 secs
lola: 33043247 markings, 108224665 edges, 97782 markings/sec, 315 secs
lola: 33534056 markings, 109894511 edges, 98162 markings/sec, 320 secs
lola: 34022457 markings, 111560383 edges, 97680 markings/sec, 325 secs
lola: 34512033 markings, 113232453 edges, 97915 markings/sec, 330 secs
lola: 35002040 markings, 114907140 edges, 98001 markings/sec, 335 secs
lola: 35488846 markings, 116568028 edges, 97361 markings/sec, 340 secs
lola: 35973544 markings, 118224852 edges, 96940 markings/sec, 345 secs
lola: 36460787 markings, 119889811 edges, 97449 markings/sec, 350 secs
lola: 36944571 markings, 121546016 edges, 96757 markings/sec, 355 secs
lola: 37427641 markings, 123198636 edges, 96614 markings/sec, 360 secs
lola: 37909630 markings, 124848576 edges, 96398 markings/sec, 365 secs
lola: 38391281 markings, 126498868 edges, 96330 markings/sec, 370 secs
lola: 38871413 markings, 128143903 edges, 96026 markings/sec, 375 secs
lola: 39348192 markings, 129783852 edges, 95356 markings/sec, 380 secs
lola: 39828877 markings, 131430387 edges, 96137 markings/sec, 385 secs
lola: 40305231 markings, 133069644 edges, 95271 markings/sec, 390 secs
lola: 40780977 markings, 134707197 edges, 95149 markings/sec, 395 secs
lola: 41257285 markings, 136348323 edges, 95262 markings/sec, 400 secs
lola: 41731686 markings, 137978390 edges, 94880 markings/sec, 405 secs
lola: 42207116 markings, 139616954 edges, 95086 markings/sec, 410 secs
lola: 42688491 markings, 141264215 edges, 96275 markings/sec, 415 secs
lola: 43163321 markings, 142898099 edges, 94966 markings/sec, 420 secs
lola: 43636766 markings, 144527758 edges, 94689 markings/sec, 425 secs
lola: 44114249 markings, 146172245 edges, 95497 markings/sec, 430 secs
lola: 44587430 markings, 147809398 edges, 94636 markings/sec, 435 secs
lola: 45061558 markings, 149443502 edges, 94826 markings/sec, 440 secs
lola: 45534408 markings, 151077871 edges, 94570 markings/sec, 445 secs
lola: 46009042 markings, 152713862 edges, 94927 markings/sec, 450 secs
lola: 46481871 markings, 154342878 edges, 94566 markings/sec, 455 secs
lola: 46952670 markings, 155967217 edges, 94160 markings/sec, 460 secs
lola: 47422380 markings, 157594386 edges, 93942 markings/sec, 465 secs
lola: 47891751 markings, 159218459 edges, 93874 markings/sec, 470 secs
lola: 48361457 markings, 160841488 edges, 93941 markings/sec, 475 secs
lola: 48827699 markings, 162455170 edges, 93248 markings/sec, 480 secs
lola: 49294782 markings, 164069036 edges, 93417 markings/sec, 485 secs
lola: 49759991 markings, 165683641 edges, 93042 markings/sec, 490 secs
lola: 50231490 markings, 167311332 edges, 94300 markings/sec, 495 secs
lola: 50696914 markings, 168928089 edges, 93085 markings/sec, 500 secs
lola: 51163097 markings, 170544041 edges, 93237 markings/sec, 505 secs
lola: 51631062 markings, 172163204 edges, 93593 markings/sec, 510 secs
lola: 52095742 markings, 173775755 edges, 92936 markings/sec, 515 secs
lola: 52561432 markings, 175390206 edges, 93138 markings/sec, 520 secs
lola: 53025683 markings, 176997672 edges, 92850 markings/sec, 525 secs
lola: 53489782 markings, 178607744 edges, 92820 markings/sec, 530 secs
lola: 53952082 markings, 180217600 edges, 92460 markings/sec, 535 secs
lola: 54415967 markings, 181829397 edges, 92777 markings/sec, 540 secs
lola: 54881761 markings, 183442884 edges, 93159 markings/sec, 545 secs
lola: 55343001 markings, 185045683 edges, 92248 markings/sec, 550 secs
lola: 55805480 markings, 186655209 edges, 92496 markings/sec, 555 secs
lola: 56267264 markings, 188262289 edges, 92357 markings/sec, 560 secs
lola: 56728097 markings, 189866381 edges, 92167 markings/sec, 565 secs
lola: 57188141 markings, 191466210 edges, 92009 markings/sec, 570 secs
lola: 57647162 markings, 193063715 edges, 91804 markings/sec, 575 secs
lola: 58105434 markings, 194661181 edges, 91654 markings/sec, 580 secs
lola: 58564000 markings, 196262600 edges, 91713 markings/sec, 585 secs
lola: 59023124 markings, 197861141 edges, 91825 markings/sec, 590 secs
lola: 59480313 markings, 199452542 edges, 91438 markings/sec, 595 secs
lola: 59935956 markings, 201041266 edges, 91129 markings/sec, 600 secs
lola: 60394034 markings, 202638238 edges, 91616 markings/sec, 605 secs
lola: 60849318 markings, 204222841 edges, 91057 markings/sec, 610 secs
lola: 61305449 markings, 205814884 edges, 91226 markings/sec, 615 secs
lola: 61762145 markings, 207412643 edges, 91339 markings/sec, 620 secs
lola: 62216743 markings, 209005945 edges, 90920 markings/sec, 625 secs
lola: 62670578 markings, 210595824 edges, 90767 markings/sec, 630 secs
lola: 63125735 markings, 212184775 edges, 91031 markings/sec, 635 secs
lola: 63580255 markings, 213771925 edges, 90904 markings/sec, 640 secs
lola: 64034148 markings, 215359221 edges, 90779 markings/sec, 645 secs
lola: 64488083 markings, 216948468 edges, 90787 markings/sec, 650 secs
lola: 64940457 markings, 218533241 edges, 90475 markings/sec, 655 secs
lola: 65397553 markings, 220127557 edges, 91419 markings/sec, 660 secs
lola: 65850662 markings, 221714526 edges, 90622 markings/sec, 665 secs
lola: 66304662 markings, 223304726 edges, 90800 markings/sec, 670 secs
lola: 66783760 markings, 224940270 edges, 95820 markings/sec, 675 secs
lola: 67235343 markings, 226523667 edges, 90317 markings/sec, 680 secs
lola: 67685824 markings, 228100069 edges, 90096 markings/sec, 685 secs
lola: 68135312 markings, 229673273 edges, 89898 markings/sec, 690 secs
lola: 68584993 markings, 231251282 edges, 89936 markings/sec, 695 secs
lola: 69043011 markings, 232848279 edges, 91604 markings/sec, 700 secs
lola: 69493362 markings, 234424213 edges, 90070 markings/sec, 705 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no no unknown unknown yes no yes no yes no yes no unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p70 + 1 <= p140) U (p68 + 1 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((p70 + 1 <= p140) U (p68 + 1 <= p39)))
lola: processed formula length: 42
lola: 58 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (p68 + 1 <= p39)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-14a-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-14a-CTLCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 951 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p170 <= p130) AND A (G (((p18 <= p84) OR (p47 <= p28) OR ((1 <= p110) AND (p115 <= p83))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 951 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p170 <= p130)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p170 <= p130)
lola: processed formula length: 14
lola: 55 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.task
lola: processed formula with 1 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 14 will run for 1427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p18 <= p84) OR (p47 <= p28) OR ((1 <= p110) AND (p115 <= p83)))))
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 (((p18 <= p84) OR (p47 <= p28) OR ((1 <= p110) AND (p115 <= p83)))))
lola: processed formula length: 75
lola: 57 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: ((p84 + 1 <= p18) AND (p28 + 1 <= p47) AND ((p110 <= 0) OR (p83 + 1 <= p115)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-14a-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 35 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((1 <= p9))))) AND A (G (((p164 <= p39) AND (p125 <= p13) AND ((p17 <= p100) OR (1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p164 <= p39) AND (p125 <= p13) AND ((p17 <= p100) OR (1 <= p9)))))
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 (((p164 <= p39) AND (p125 <= p13) AND ((p17 <= p100) OR (1 <= p9)))))
lola: processed formula length: 75
lola: 57 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-CTLCardinality.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: ((p39 + 1 <= p164) OR (p13 + 1 <= p125) OR ((p100 + 1 <= p17) AND (p9 <= 0)))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-14a-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-14a-CTLCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p164 <= p82)) AND (p76 <= p50) AND (p13 <= p7) AND (p124 <= p107) AND (p55 <= p65)) AND (E (((p98 <= p163) U (p169 <= p72))) AND (E (F ((p73 <= p41))) AND E (F ((1 <= p101))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no no no unknown no yes no yes no yes no yes no no unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 26600 KB
lola: time consumption: 3570 seconds
lola: time limit reached - aborting
lola:
preliminary result: no no no no unknown no yes no yes no yes no yes no no unknown
lola:
preliminary result: no no no no unknown no yes no yes no yes no yes no no unknown
lola: memory consumption: 26600 KB
lola: time consumption: 3570 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="FlexibleBarrier-PT-14a"
export BK_EXAMINATION="CTLCardinality"
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/FlexibleBarrier-PT-14a.tgz
mv FlexibleBarrier-PT-14a 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 FlexibleBarrier-PT-14a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-blw7-152649998100171"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;