About the Execution of LoLA for FlexibleBarrier-PT-14a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2764.180 | 340696.00 | 350826.00 | 49.50 | FFFFTTFFFFFTFFFF | normal |
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 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 26 09:26 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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r244-blw7-152732546600049
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-14a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527879345626
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 LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ 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-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (2 <= p163)
lola: LP says that atomic proposition is always false: (3 <= p84)
lola: LP says that atomic proposition is always false: (3 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p123)
lola: LP says that atomic proposition is always false: (2 <= p118)
lola: LP says that atomic proposition is always false: (3 <= p12)
lola: LP says that atomic proposition is always false: (2 <= p95)
lola: A (G (FALSE)) : A (X (F (F (FALSE)))) : A (F (F ((1 <= p61)))) : A (X ((X (FALSE) U F ((p132 <= p2))))) : A ((p84 <= p55)) : A (X (X (((p22 <= p21) U (p33 <= p87))))) : A (F (FALSE)) : A (X ((1 <= p116))) : A (G ((p96 <= p75))) : A (G ((F ((1 <= p136)) U G ((p148 <= p130))))) : A (G ((p26 <= p22))) : A (X (X ((FALSE U (p52 <= p5))))) : A (FALSE) : A ((1 <= p109)) : A (F (F (((p48 <= p25) U FALSE)))) : A (((FALSE U (p6 <= p104)) U G (F ((p94 <= p41)))))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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-LTLCardinality-0 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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-LTLCardinality-1 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: (p84 <= p55)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p84 <= p55)
lola: processed formula length: 12
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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-LTLCardinality-6 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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-LTLCardinality-12 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: (1 <= p109)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p109)
lola: processed formula length: 11
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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-LTLCardinality-14 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: A (X (X ((p52 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p52 <= p5))))
lola: processed formula length: 23
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 16 markings, 16 edges
lola: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-11 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 (X (X (((p22 <= p21) U (p33 <= p87)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((p22 <= p21) U (p33 <= p87)))))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 16 markings, 16 edges
lola: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p132 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p132 <= p2))))
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-3 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: A (X ((1 <= p116)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= p116)))
lola: processed formula length: 19
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-7 FALSE 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 ((p96 <= p75)))
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 ((p96 <= p75)))
lola: processed formula length: 20
lola: 34 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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: (p75 + 1 <= p96)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-14a-LTLCardinality-11-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: 2 markings, 1 edges
lola: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p26 <= p22)))
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 ((p26 <= p22)))
lola: processed formula length: 20
lola: 34 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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: (p22 + 1 <= p26)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 10 edges
lola: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p61)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p61 <= 0)
lola: processed formula length: 10
lola: 34 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.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 does not eventually occur.
lola: 4 markings, 4 edges
lola: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p94 <= p41))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p94 <= p41))))
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 844 markings, 1321 edges
lola: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((p148 <= p130)))) AND A (G ((F ((1 <= p136)) OR G ((p148 <= p130))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p148 <= p130))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p148 <= p130))))
lola: processed formula length: 26
lola: 32 rewrites
lola: closed formula file FlexibleBarrier-PT-14a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 194249 markings, 306153 edges, 38850 markings/sec, 0 secs
lola: 392321 markings, 615269 edges, 39614 markings/sec, 5 secs
lola: 591719 markings, 928342 edges, 39880 markings/sec, 10 secs
lola: 789508 markings, 1242850 edges, 39558 markings/sec, 15 secs
lola: 997896 markings, 1564101 edges, 41678 markings/sec, 20 secs
lola: 1200239 markings, 1885293 edges, 40469 markings/sec, 25 secs
lola: 1401267 markings, 2214288 edges, 40206 markings/sec, 30 secs
lola: 1597287 markings, 2528595 edges, 39204 markings/sec, 35 secs
lola: 1789446 markings, 2836495 edges, 38432 markings/sec, 40 secs
lola: 1986975 markings, 3150906 edges, 39506 markings/sec, 45 secs
lola: 2178519 markings, 3457925 edges, 38309 markings/sec, 50 secs
lola: 2371995 markings, 3768201 edges, 38695 markings/sec, 55 secs
lola: 2565633 markings, 4081065 edges, 38728 markings/sec, 60 secs
lola: 2758602 markings, 4384521 edges, 38594 markings/sec, 65 secs
lola: 2949913 markings, 4688576 edges, 38262 markings/sec, 70 secs
lola: 3138374 markings, 4991032 edges, 37692 markings/sec, 75 secs
lola: 3332661 markings, 5304239 edges, 38857 markings/sec, 80 secs
lola: 3526484 markings, 5614418 edges, 38765 markings/sec, 85 secs
lola: 3716254 markings, 5920818 edges, 37954 markings/sec, 90 secs
lola: 3902042 markings, 6221553 edges, 37158 markings/sec, 95 secs
lola: 4094603 markings, 6529782 edges, 38512 markings/sec, 100 secs
lola: 4283789 markings, 6831907 edges, 37837 markings/sec, 105 secs
lola: 4469342 markings, 7133723 edges, 37111 markings/sec, 110 secs
lola: 4657293 markings, 7433137 edges, 37590 markings/sec, 115 secs
lola: 4841204 markings, 7734564 edges, 36782 markings/sec, 120 secs
lola: 5029329 markings, 8035691 edges, 37625 markings/sec, 125 secs
lola: 5228682 markings, 8351693 edges, 39871 markings/sec, 130 secs
lola: 5422342 markings, 8659500 edges, 38732 markings/sec, 135 secs
lola: 5616477 markings, 8967343 edges, 38827 markings/sec, 140 secs
lola: 5810470 markings, 9278061 edges, 38799 markings/sec, 145 secs
lola: 5999764 markings, 9580320 edges, 37859 markings/sec, 150 secs
lola: 6193888 markings, 9896228 edges, 38825 markings/sec, 155 secs
lola: 6387440 markings, 10206260 edges, 38710 markings/sec, 160 secs
lola: 6576794 markings, 10510959 edges, 37871 markings/sec, 165 secs
lola: 6772553 markings, 10825483 edges, 39152 markings/sec, 170 secs
lola: 6965071 markings, 11137144 edges, 38504 markings/sec, 175 secs
lola: 7159422 markings, 11445902 edges, 38870 markings/sec, 180 secs
lola: 7352034 markings, 11752024 edges, 38522 markings/sec, 185 secs
lola: 7538741 markings, 12054609 edges, 37341 markings/sec, 190 secs
lola: 7733943 markings, 12371948 edges, 39040 markings/sec, 195 secs
lola: 7933368 markings, 12700663 edges, 39885 markings/sec, 200 secs
lola: 8133965 markings, 13018494 edges, 40119 markings/sec, 205 secs
lola: 8334385 markings, 13337341 edges, 40084 markings/sec, 210 secs
lola: 8530642 markings, 13648419 edges, 39251 markings/sec, 215 secs
lola: 8731325 markings, 13966149 edges, 40137 markings/sec, 220 secs
lola: 8921848 markings, 14274409 edges, 38105 markings/sec, 225 secs
lola: 9116660 markings, 14588063 edges, 38962 markings/sec, 230 secs
lola: 9311641 markings, 14894732 edges, 38996 markings/sec, 235 secs
lola: 9505605 markings, 15203286 edges, 38793 markings/sec, 240 secs
lola: 9697287 markings, 15509675 edges, 38336 markings/sec, 245 secs
lola: 9885676 markings, 15811802 edges, 37678 markings/sec, 250 secs
lola: 10077270 markings, 16131381 edges, 38319 markings/sec, 255 secs
lola: 10266842 markings, 16434126 edges, 37914 markings/sec, 260 secs
lola: 10451888 markings, 16732018 edges, 37009 markings/sec, 265 secs
lola: 10648134 markings, 17044297 edges, 39249 markings/sec, 270 secs
lola: 10840401 markings, 17353276 edges, 38453 markings/sec, 275 secs
lola: 11040221 markings, 17667112 edges, 39964 markings/sec, 280 secs
lola: 11234305 markings, 17983145 edges, 38817 markings/sec, 285 secs
lola: 11433167 markings, 18305241 edges, 39772 markings/sec, 290 secs
lola: 11627839 markings, 18613445 edges, 38934 markings/sec, 295 secs
lola: 11830352 markings, 18937365 edges, 40503 markings/sec, 300 secs
lola: 12026232 markings, 19254532 edges, 39176 markings/sec, 305 secs
lola: 12229114 markings, 19579802 edges, 40576 markings/sec, 310 secs
lola: 12423068 markings, 19901082 edges, 38791 markings/sec, 315 secs
lola: 12614119 markings, 20221118 edges, 38210 markings/sec, 320 secs
lola: 12811365 markings, 20545613 edges, 39449 markings/sec, 325 secs
lola: 13010439 markings, 20866344 edges, 39815 markings/sec, 330 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13171666 markings, 21139565 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes no no no no no yes no no no no
lola:
preliminary result: no no no no yes yes no no no no no yes no no no no
lola: memory consumption: 20428 KB
lola: time consumption: 341 seconds
BK_STOP 1527879686322
--------------------
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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r244-blw7-152732546600049"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
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 ;