About the Execution of LoLA for DLCflexbar-PT-6b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1014.920 | 3541156.00 | 4193982.00 | 7970.70 | TFTFFFFTFTTFTTFF | 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 9.8M
-rw-r--r-- 1 mcc users 4.1K May 30 00:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 30 00:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 28 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 28 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 28 09:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 28 09:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4K May 28 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.4K May 27 12:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 27 12:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K May 26 14:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 14:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 9.6M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCflexbar-PT-6b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145800448
=====================================================================
--------------------
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 DLCflexbar-PT-6b-ReachabilityCardinality-00
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-01
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-02
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-03
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-04
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-05
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-06
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-07
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-08
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-09
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-10
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-11
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-12
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-13
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-14
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1528140090574
info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCflexbar-PT-6b 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 DLCflexbar-PT-6b formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ DLCflexbar-PT-6b @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 64216/65536 symbol table entries, 36135 collisions
lola: preprocessing...
lola: Size of bit vector: 25104
lola: finding significant places
lola: 25104 places, 39112 transitions, 23612 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 56275 transition conflict sets
lola: TASK
lola: reading formula from DLCflexbar-PT-6b-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p7864)
lola: LP says that atomic proposition is always false: (3 <= p5290)
lola: LP says that atomic proposition is always false: (2 <= p7758)
lola: LP says that atomic proposition is always false: (2 <= p18850)
lola: LP says that atomic proposition is always false: (2 <= p20258)
lola: LP says that atomic proposition is always false: (3 <= p8644)
lola: LP says that atomic proposition is always false: (2 <= p21406)
lola: LP says that atomic proposition is always false: (3 <= p18259)
lola: LP says that atomic proposition is always false: (2 <= p22027)
lola: LP says that atomic proposition is always false: (3 <= p8650)
lola: LP says that atomic proposition is always false: (2 <= p7233)
lola: LP says that atomic proposition is always false: (3 <= p7968)
lola: LP says that atomic proposition is always false: (3 <= p21037)
lola: LP says that atomic proposition is always false: (2 <= p1280)
lola: LP says that atomic proposition is always false: (2 <= p17712)
lola: A (G (((p16173 <= 0) OR (p7562 + 1 <= p3873) OR (p22904 + 1 <= p5651) OR (p15052 <= 1)))) : E (F (())) : E (F ((p7260 + 1 <= p17947))) : A (G ((p11867 <= p9584))) : E (F (FALSE)) : A (G ((p1693 <= p3012))) : A (G ((p22744 <= p18369))) : E (F ((1 <= p5229))) : A (G (((p24571 <= 0)))) : E (F ((((p7227 <= p22607) OR (p22892 <= p11437)) AND ((1 <= p605))))) : A (G (())) : A (G (((p7487 <= 0) OR (p13182 + 1 <= p10061) OR (p14472 + 1 <= p10076) OR (p15472 <= 0)))) : E (F ((((1 <= p12733)) AND ((p15267 <= p329))))) : A (G (())) : A (G ((p4096 <= 0))) : E (F (()))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 40 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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 DLCflexbar-PT-6b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 42 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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 DLCflexbar-PT-6b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 46 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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 DLCflexbar-PT-6b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 49 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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 DLCflexbar-PT-6b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 53 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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 DLCflexbar-PT-6b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 58 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p24571 <= 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:694
lola: processed formula: A (G (((p24571 <= 0))))
lola: processed formula length: 23
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: ((1 <= p24571))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-5-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: 60 markings, 59 edges
lola: ========================================
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 64 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p4096 <= 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:694
lola: processed formula: A (G ((p4096 <= 0)))
lola: processed formula length: 20
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: (1 <= p4096)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2391 markings, 2630 edges
lola: ========================================
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 71 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p5229)))
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 ((1 <= p5229)))
lola: processed formula length: 20
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: (1 <= p5229)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1760 markings, 1911 edges
lola: ========================================
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 80 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p1693 <= p3012)))
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 ((p1693 <= p3012)))
lola: processed formula length: 24
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: (p3012 + 1 <= p1693)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 415 markings, 414 edges
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 91 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p22744 <= p18369)))
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 ((p22744 <= p18369)))
lola: processed formula length: 26
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: (p18369 + 1 <= p22744)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3595 markings, 3984 edges
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 10 will run for 106 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p11867 <= p9584)))
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 ((p11867 <= p9584)))
lola: processed formula length: 25
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: (p9584 + 1 <= p11867)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4800 markings, 5339 edges
lola: ========================================
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 126 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p7260 + 1 <= p17947)))
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 ((p7260 + 1 <= p17947)))
lola: processed formula length: 29
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: (p7260 + 1 <= p17947)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-11-0.sara.
lola: sara is running 0 secs || 3067 markings, 3382 edges, 613 markings/sec, 0 secs
lola: sara is running 5 secs || 5947 markings, 6859 edges, 576 markings/sec, 5 secs
lola: sara is running 10 secs || 8478 markings, 9982 edges, 506 markings/sec, 10 secs
lola: sara is running 15 secs || 10786 markings, 12844 edges, 462 markings/sec, 15 secs
lola: sara is running 20 secs || 13071 markings, 15686 edges, 457 markings/sec, 20 secs
lola: sara is running 25 secs || 15529 markings, 18740 edges, 492 markings/sec, 25 secs
lola: sara is running 30 secs || 18080 markings, 21934 edges, 510 markings/sec, 30 secs
lola: sara is running 35 secs || 20727 markings, 25238 edges, 529 markings/sec, 35 secs
lola: sara is running 40 secs || 23452 markings, 28674 edges, 545 markings/sec, 40 secs
lola: sara is running 45 secs || 26253 markings, 31976 edges, 560 markings/sec, 45 secs
lola: sara is running 50 secs || 29070 markings, 35111 edges, 563 markings/sec, 50 secs
lola: sara is running 55 secs || 31607 markings, 37900 edges, 507 markings/sec, 55 secs
lola: sara is running 60 secs || 34296 markings, 40849 edges, 538 markings/sec, 60 secs
lola: sara is running 65 secs || 37258 markings, 44102 edges, 592 markings/sec, 65 secs
lola: sara is running 70 secs || 39909 markings, 46989 edges, 530 markings/sec, 70 secs
lola: sara is running 75 secs || 42886 markings, 50266 edges, 595 markings/sec, 75 secs
lola: sara is running 80 secs || 45777 markings, 53418 edges, 578 markings/sec, 80 secs
lola: sara is running 85 secs || 48717 markings, 56623 edges, 588 markings/sec, 85 secs
lola: sara is running 90 secs || 51550 markings, 59712 edges, 567 markings/sec, 90 secs
lola: sara is running 95 secs || 54186 markings, 62586 edges, 527 markings/sec, 95 secs
lola: sara is running 100 secs || 57023 markings, 65711 edges, 567 markings/sec, 100 secs
lola: sara is running 105 secs || 59990 markings, 68981 edges, 593 markings/sec, 105 secs
lola: sara is running 110 secs || 62854 markings, 72104 edges, 573 markings/sec, 110 secs
lola: sara is running 115 secs || 66054 markings, 75584 edges, 640 markings/sec, 115 secs
lola: sara is running 120 secs || 69402 markings, 79268 edges, 670 markings/sec, 120 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown no no no no yes no unknown yes unknown unknown yes no no
lola: memory consumption: 190932 KB
lola: time consumption: 3061 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p12733)) AND ((p15267 <= p329)))))
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 ((((1 <= p12733)) AND ((p15267 <= p329)))))
lola: processed formula length: 48
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: (((1 <= p12733)) AND ((p15267 <= p329)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1242 markings, 1241 edges
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 169 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p7227 <= p22607) OR (p22892 <= p11437)) AND ((1 <= p605)))))
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 ((((p7227 <= p22607) OR (p22892 <= p11437)) AND ((1 <= p605)))))
lola: processed formula length: 70
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: (((p7227 <= p22607) OR (p22892 <= p11437)) AND ((1 <= p605)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 94 markings, 93 edges
lola: ========================================
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p16173 <= 0) OR (p7562 + 1 <= p3873) OR (p22904 + 1 <= p5651) OR (p15052 <= 1))))
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 (((p16173 <= 0) OR (p7562 + 1 <= p3873) OR (p22904 + 1 <= p5651) OR (p15052 <= 1))))
lola: processed formula length: 92
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: ((1 <= p16173) AND (p3873 <= p7562) AND (p5651 <= p22904) AND (2 <= p15052))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1012 markings, 1011 edges
lola: ========================================
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p7487 <= 0) OR (p13182 + 1 <= p10061) OR (p14472 + 1 <= p10076) OR (p15472 <= 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:694
lola: processed formula: A (G (((p7487 <= 0) OR (p13182 + 1 <= p10061) OR (p14472 + 1 <= p10076) OR (p15472 <= 0))))
lola: processed formula length: 94
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: ((1 <= p7487) AND (p10061 <= p13182) AND (p10076 <= p14472) AND (1 <= p15472))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2066 markings, 2199 edges
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((p7260 + 1 <= p17947)))
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 ((p7260 + 1 <= p17947)))
lola: processed formula length: 29
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-6b-ReachabilityCardinality.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: (p7260 + 1 <= p17947)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6b-ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6b-ReachabilityCardinality-16-0.sara.
lola: sara is running 0 secs || 3188 markings, 3527 edges, 638 markings/sec, 0 secs
lola: sara is running 5 secs || 6730 markings, 7803 edges, 708 markings/sec, 5 secs
lola: sara is running 10 secs || 10235 markings, 12165 edges, 701 markings/sec, 10 secs
lola: sara is running 15 secs || 13708 markings, 16475 edges, 695 markings/sec, 15 secs
lola: sara is running 20 secs || 17090 markings, 20747 edges, 676 markings/sec, 20 secs
lola: sara is running 25 secs || 20463 markings, 24912 edges, 675 markings/sec, 25 secs
lola: sara is running 30 secs || 23844 markings, 29150 edges, 676 markings/sec, 30 secs
lola: sara is running 35 secs || 27171 markings, 32979 edges, 665 markings/sec, 35 secs
lola: sara is running 40 secs || 30412 markings, 36597 edges, 648 markings/sec, 40 secs
lola: sara is running 45 secs || 33517 markings, 39974 edges, 621 markings/sec, 45 secs
lola: sara is running 50 secs || 36689 markings, 43485 edges, 634 markings/sec, 50 secs
lola: sara is running 55 secs || 39795 markings, 46865 edges, 621 markings/sec, 55 secs
lola: sara is running 60 secs || 43011 markings, 50402 edges, 643 markings/sec, 60 secs
lola: sara is running 65 secs || 46252 markings, 53942 edges, 648 markings/sec, 65 secs
lola: sara is running 70 secs || 49547 markings, 57525 edges, 659 markings/sec, 70 secs
lola: sara is running 75 secs || 52891 markings, 61174 edges, 669 markings/sec, 75 secs
lola: sara is running 80 secs || 56113 markings, 64704 edges, 644 markings/sec, 80 secs
lola: sara is running 85 secs || 59457 markings, 68402 edges, 669 markings/sec, 85 secs
lola: sara is running 90 secs || 62685 markings, 71921 edges, 646 markings/sec, 90 secs
lola: sara is running 95 secs || 65968 markings, 75492 edges, 657 markings/sec, 95 secs
lola: sara is running 100 secs || 69362 markings, 79221 edges, 679 markings/sec, 100 secs
lola: sara is running 105 secs || 72732 markings, 82899 edges, 674 markings/sec, 105 secs
lola: sara is running 110 secs || 75994 markings, 86485 edges, 652 markings/sec, 110 secs
lola: sara is running 115 secs || 79043 markings, 89849 edges, 610 markings/sec, 115 secs
lola: sara is running 120 secs || 82193 markings, 93320 edges, 630 markings/sec, 120 secs
lola: sara is running 125 secs || 85230 markings, 96643 edges, 607 markings/sec, 125 secs
lola: sara is running 130 secs || 88410 markings, 100122 edges, 636 markings/sec, 130 secs
lola: sara is running 135 secs || 91652 markings, 103661 edges, 648 markings/sec, 135 secs
lola: sara is running 140 secs || 94590 markings, 106904 edges, 588 markings/sec, 140 secs
lola: sara is running 145 secs || 97381 markings, 110008 edges, 558 markings/sec, 145 secs
lola: sara is running 150 secs || 100375 markings, 113318 edges, 599 markings/sec, 150 secs
lola: sara is running 155 secs || 103526 markings, 116776 edges, 630 markings/sec, 155 secs
lola: sara is running 160 secs || 106567 markings, 120176 edges, 608 markings/sec, 160 secs
lola: sara is running 165 secs || 109785 markings, 123694 edges, 644 markings/sec, 165 secs
lola: sara is running 170 secs || 113007 markings, 127270 edges, 644 markings/sec, 170 secs
lola: sara is running 175 secs || 116077 markings, 130639 edges, 614 markings/sec, 175 secs
lola: sara is running 180 secs || 119235 markings, 134101 edges, 632 markings/sec, 180 secs
lola: sara is running 185 secs || 122435 markings, 137632 edges, 640 markings/sec, 185 secs
lola: sara is running 190 secs || 125709 markings, 141222 edges, 655 markings/sec, 190 secs
lola: sara is running 195 secs || 128880 markings, 144751 edges, 634 markings/sec, 195 secs
lola: sara is running 200 secs || 132087 markings, 148275 edges, 641 markings/sec, 200 secs
lola: sara is running 205 secs || 135389 markings, 151917 edges, 660 markings/sec, 205 secs
lola: sara is running 210 secs || 138319 markings, 155126 edges, 586 markings/sec, 210 secs
lola: sara is running 215 secs || 141605 markings, 158723 edges, 657 markings/sec, 215 secs
lola: sara is running 220 secs || 144923 markings, 162400 edges, 664 markings/sec, 220 secs
lola: sara is running 225 secs || 148215 markings, 166052 edges, 658 markings/sec, 225 secs
lola: sara is running 230 secs || 151549 markings, 169716 edges, 667 markings/sec, 230 secs
lola: sara is running 235 secs || 154803 markings, 173290 edges, 651 markings/sec, 235 secs
lola: sara is running 240 secs || 158062 markings, 176849 edges, 652 markings/sec, 240 secs
lola: sara is running 245 secs || 161380 markings, 180504 edges, 664 markings/sec, 245 secs
lola: sara is running 250 secs || 164609 markings, 184035 edges, 646 markings/sec, 250 secs
lola: sara is running 255 secs || 167924 markings, 187707 edges, 663 markings/sec, 255 secs
lola: sara is running 260 secs || 171184 markings, 191306 edges, 652 markings/sec, 260 secs
lola: sara is running 265 secs || 174050 markings, 194471 edges, 573 markings/sec, 265 secs
lola: sara is running 270 secs || 177021 markings, 197725 edges, 594 markings/sec, 270 secs
lola: sara is running 275 secs || 179827 markings, 200814 edges, 561 markings/sec, 275 secs
lola: sara is running 280 secs || 182520 markings, 203765 edges, 539 markings/sec, 280 secs
lola: sara is running 285 secs || 185490 markings, 207020 edges, 594 markings/sec, 285 secs
lola: sara is running 290 secs || 188082 markings, 209875 edges, 518 markings/sec, 290 secs
lola: sara is running 295 secs || 190515 markings, 212538 edges, 487 markings/sec, 295 secs
lola: sara is running 300 secs || 193177 markings, 215438 edges, 532 markings/sec, 300 secs
lola: sara is running 305 secs || 195881 markings, 218407 edges, 541 markings/sec, 305 secs
lola: sara is running 310 secs || 198588 markings, 221394 edges, 541 markings/sec, 310 secs
lola: sara is running 315 secs || 201012 markings, 224022 edges, 485 markings/sec, 315 secs
lola: sara is running 320 secs || 203173 markings, 226374 edges, 432 markings/sec, 320 secs
lola: sara is running 325 secs || 205400 markings, 228806 edges, 445 markings/sec, 325 secs
lola: sara is running 330 secs || 208762 markings, 232459 edges, 672 markings/sec, 330 secs
lola: sara is running 335 secs || 210947 markings, 234835 edges, 437 markings/sec, 335 secs
lola: sara is running 340 secs || 213495 markings, 237638 edges, 510 markings/sec, 340 secs
lola: sara is running 345 secs || 216063 markings, 240456 edges, 514 markings/sec, 345 secs
lola: sara is running 350 secs || 218157 markings, 242735 edges, 419 markings/sec, 350 secs
lola: sara is running 355 secs || 220599 markings, 245483 edges, 488 markings/sec, 355 secs
lola: sara is running 360 secs || 223542 markings, 248723 edges, 589 markings/sec, 360 secs
lola: sara is running 365 secs || 226681 markings, 252159 edges, 628 markings/sec, 365 secs
lola: sara is running 370 secs || 229948 markings, 255729 edges, 653 markings/sec, 370 secs
lola: sara is running 375 secs || 232761 markings, 258796 edges, 563 markings/sec, 375 secs
lola: sara is running 380 secs || 236015 markings, 262356 edges, 651 markings/sec, 380 secs
lola: sara is running 385 secs || 238706 markings, 265278 edges, 538 markings/sec, 385 secs
lola: sara is running 390 secs || 241381 markings, 268224 edges, 535 markings/sec, 390 secs
lola: sara is running 395 secs || 244498 markings, 271631 edges, 623 markings/sec, 395 secs
lola: sara is running 400 secs || 247461 markings, 274845 edges, 593 markings/sec, 400 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 405 secs || 250617 markings, 278301 edges, 631 markings/sec, 405 secs
lola: sara is running 410 secs || 253189 markings, 281124 edges, 514 markings/sec, 410 secs
lola: sara is running 415 secs || 255917 markings, 284104 edges, 546 markings/sec, 415 secs
lola: sara is running 420 secs || 259085 markings, 287565 edges, 634 markings/sec, 420 secs
lola: sara is running 425 secs || 262511 markings, 291360 edges, 685 markings/sec, 425 secs
lola: sara is running 430 secs || 265767 markings, 294902 edges, 651 markings/sec, 430 secs
lola: sara is running 435 secs || 269131 markings, 298567 edges, 673 markings/sec, 435 secs
lola: sara is running 440 secs || 272230 markings, 301977 edges, 620 markings/sec, 440 secs
lola: sara is running 445 secs || 274695 markings, 304666 edges, 493 markings/sec, 445 secs
lola: sara is running 450 secs || 277647 markings, 307869 edges, 590 markings/sec, 450 secs
lola: sara is running 455 secs || 280873 markings, 311388 edges, 645 markings/sec, 455 secs
lola: sara is running 460 secs || 283856 markings, 314655 edges, 597 markings/sec, 460 secs
lola: sara is running 465 secs || 286906 markings, 317981 edges, 610 markings/sec, 465 secs
lola: sara is running 470 secs || 289930 markings, 321313 edges, 605 markings/sec, 470 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no no yes no yes yes no yes yes no no
lola:
preliminary result: yes no yes no no no no yes no yes yes no yes yes no no
lola: memory consumption: 81756 KB
lola: time consumption: 3540 seconds
BK_STOP 1528143631730
--------------------
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="DLCflexbar-PT-6b"
export BK_EXAMINATION="ReachabilityCardinality"
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/DLCflexbar-PT-6b.tgz
mv DLCflexbar-PT-6b 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 DLCflexbar-PT-6b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-152749145800448"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;