fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r268-smll-152749145200025
Last Updated
June 26, 2018

About the Execution of LoLA for ASLink-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1825.250 3600000.00 1312528.00 7736.50 FTTFFTTTTFTFFFTF 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 452K
-rw-r--r-- 1 mcc users 3.2K May 29 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 29 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 28 11:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 28 11:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 28 09:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 28 09:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 28 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 27 05:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 27 05:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 26 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 06:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 279K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ASLink-PT-02a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145200025

=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527769886579

info: Time: 3600 - MCC
===========================================================================================
prep: translating ASLink-PT-02a Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating ASLink-PT-02a formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ ASLink-PT-02a @ 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: 1634/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 626
lola: finding significant places
lola: 626 places, 1008 transitions, 508 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1148 transition conflict sets
lola: TASK
lola: reading formula from ASLink-PT-02a-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p583)
lola: LP says that atomic proposition is always false: (3 <= p419)
lola: LP says that atomic proposition is always false: (3 <= p57)
lola: LP says that atomic proposition is always false: (2 <= p83)
lola: LP says that atomic proposition is always false: (3 <= p542)
lola: LP says that atomic proposition is always false: (3 <= p98)
lola: LP says that atomic proposition is always false: (3 <= p106)
lola: LP says that atomic proposition is always false: (2 <= p78)
lola: LP says that atomic proposition is always false: (2 <= p495)
lola: LP says that atomic proposition is always false: (2 <= p623)
lola: LP says that atomic proposition is always false: (3 <= p315)
lola: LP says that atomic proposition is always false: (2 <= p137)
lola: LP says that atomic proposition is always false: (2 <= p28)
lola: LP says that atomic proposition is always false: (2 <= p604)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (3 <= p527)
lola: LP says that atomic proposition is always false: (2 <= p555)
lola: LP says that atomic proposition is always false: (3 <= p211)
lola: A (G (((p504 + 1 <= p52) OR (p303 <= p342)))) : A (G (())) : A (G (())) : A (G ((p77 <= p438))) : E (F (())) : A (G (())) : E (F ((1 <= p575))) : E (F ((((1 <= p477) AND (p544 <= p68) AND ((p57 <= p438) OR (p347 <= p518)))))) : E (F (((p448 + 1 <= p127) AND ((p494 + 1 <= p252) OR (p359 <= 0))))) : E (F (())) : E (F (((p141 + 1 <= p281) AND ((1 <= p73) OR (p364 <= p254) OR ((1 <= p170) AND (p37 <= p618)))))) : A (G ((((p1 <= p601) AND (p309 <= p14) AND (p3 + 1 <= p181)) OR (p306 <= p463)))) : A (G ((p482 <= p206))) : A (G (((p129 <= p523) AND (((p447 <= p152) AND (p611 <= p181)))))) : E (F ((((p295 <= p245) AND (p317 <= p466) AND ((1 <= p199)))))) : A (G (((p14 <= p187) AND (p93 <= p478))))
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: 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 215 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 ASLink-PT-02a-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
check_solution: Constraint R1 = 4.68413936685e-310 is above its upper bound -1
check_solution: Constraint R2 = 4.68413895545e-310 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA ASLink-PT-02a-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 229 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 ASLink-PT-02a-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

FORMULA ASLink-PT-02a-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 246 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 ASLink-PT-02a-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 ASLink-PT-02a-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 264 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 ASLink-PT-02a-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 ASLink-PT-02a-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 287 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 ASLink-PT-02a-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 ASLink-PT-02a-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p575)))
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 <= p575)))
lola: processed formula length: 19
lola: 16 rewrites
lola: closed formula file ASLink-PT-02a-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 <= p575)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-5-0.sara
lola: lola: state equation: calling and running sara
9 markings, 8 edges
lola: ========================================

FORMULA ASLink-PT-02a-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p77 <= p438)))
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 ((p77 <= p438)))
lola: processed formula length: 21
lola: 17 rewrites
lola: closed formula file ASLink-PT-02a-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: (p438 + 1 <= p77)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file ASLink-PT-02a-ReachabilityCardinality-5-0.sara.
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ASLink-PT-02a-ReachabilityCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 135651 markings, 400466 edges, 27130 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 246729 markings, 666703 edges
lola: ========================================

FORMULA ASLink-PT-02a-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p482 <= p206)))
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 ((p482 <= p206)))
lola: processed formula length: 22
lola: 17 rewrites
lola: closed formula file ASLink-PT-02a-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: (p206 + 1 <= p482)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-7-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
state equation: calling and running sara
lola: ========================================

FORMULA ASLink-PT-02a-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p504 + 1 <= p52) OR (p303 <= p342))))
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 (((p504 + 1 <= p52) OR (p303 <= p342))))
lola: processed formula length: 46
lola: 17 rewrites
lola: closed formula file ASLink-PT-02a-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)
sara: try reading problem file ASLink-PT-02a-ReachabilityCardinality-7-0.sara.
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: ((p52 <= p504) AND (p342 + 1 <= p303))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42 markings, 41 edges
lola:
FORMULA ASLink-PT-02a-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-8-0.sara
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p14 <= p187) AND (p93 <= p478))))
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 (((p14 <= p187) AND (p93 <= p478))))
lola: processed formula length: 41
lola: 17 rewrites
lola: closed formula file ASLink-PT-02a-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: ========================================
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: ((p187 + 1 <= p14) OR (p478 + 1 <= p93))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ASLink-PT-02a-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 154163 markings, 394460 edges, 30833 markings/sec, 0 secs
lola: sara is running 5 secs || 298718 markings, 856782 edges, 28911 markings/sec, 5 secs
lola: sara is running 10 secs || 455037 markings, 1356730 edges, 31264 markings/sec, 10 secs
lola: sara is running 15 secs || 612038 markings, 1850708 edges, 31400 markings/sec, 15 secs
lola: sara is running 20 secs || 768249 markings, 2353034 edges, 31242 markings/sec, 20 secs
lola: sara is running 25 secs || 924030 markings, 2851356 edges, 31156 markings/sec, 25 secs
lola: sara is running 30 secs || 1080050 markings, 3349919 edges, 31204 markings/sec, 30 secs
lola: sara is running 35 secs || 1236250 markings, 3851248 edges, 31240 markings/sec, 35 secs
lola: sara is running 40 secs || 1390166 markings, 4355781 edges, 30783 markings/sec, 40 secs
lola: sara is running 45 secs || 1545573 markings, 4852027 edges, 31081 markings/sec, 45 secs
lola: sara is running 50 secs || 1702271 markings, 5348562 edges, 31340 markings/sec, 50 secs
lola: sara is running 55 secs || 1856462 markings, 5854125 edges, 30838 markings/sec, 55 secs
lola: sara is running 60 secs || 2011659 markings, 6352474 edges, 31039 markings/sec, 60 secs
lola: sara is running 65 secs || 2168743 markings, 6842163 edges, 31417 markings/sec, 65 secs
lola: sara is running 70 secs || 2321003 markings, 7347019 edges, 30452 markings/sec, 70 secs
lola: sara is running 75 secs || 2478505 markings, 7839661 edges, 31500 markings/sec, 75 secs
lola: sara is running 80 secs || 2630718 markings, 8348185 edges, 30443 markings/sec, 80 secs
lola: sara is running 85 secs || 2788958 markings, 8839278 edges, 31648 markings/sec, 85 secs
lola: sara is running 90 secs || 2940354 markings, 9346016 edges, 30279 markings/sec, 90 secs
lola: sara is running 95 secs || 3098786 markings, 9831449 edges, 31686 markings/sec, 95 secs
lola: sara is running 100 secs || 3250973 markings, 10335885 edges, 30437 markings/sec, 100 secs
lola: sara is running 105 secs || 3408933 markings, 10829151 edges, 31592 markings/sec, 105 secs
lola: sara is running 110 secs || 3575854 markings, 11354220 edges, 33384 markings/sec, 110 secs
lola: sara is running 115 secs || 3742212 markings, 11885910 edges, 33272 markings/sec, 115 secs
lola: sara is running 120 secs || 3907917 markings, 12416356 edges, 33141 markings/sec, 120 secs
lola: sara is running 125 secs || 4074441 markings, 12951179 edges, 33305 markings/sec, 125 secs
lola: sara is running 130 secs || 4241724 markings, 13479223 edges, 33457 markings/sec, 130 secs
lola: sara is running 135 secs || 4407574 markings, 14011035 edges, 33170 markings/sec, 135 secs
lola: sara is running 140 secs || 4573489 markings, 14542194 edges, 33183 markings/sec, 140 secs
lola: sara is running 145 secs || 4736872 markings, 15080385 edges, 32677 markings/sec, 145 secs
lola: sara is running 150 secs || 4901799 markings, 15609611 edges, 32985 markings/sec, 150 secs
lola: sara is running 155 secs || 5068671 markings, 16141331 edges, 33374 markings/sec, 155 secs
lola: sara is running 160 secs || 5235658 markings, 16669364 edges, 33397 markings/sec, 160 secs
lola: sara is running 165 secs || 5397709 markings, 17208884 edges, 32410 markings/sec, 165 secs
lola: sara is running 170 secs || 5564961 markings, 17733976 edges, 33450 markings/sec, 170 secs
lola: sara is running 175 secs || 5730131 markings, 18263307 edges, 33034 markings/sec, 175 secs
lola: sara is running 180 secs || 5895658 markings, 18804160 edges, 33105 markings/sec, 180 secs
lola: sara is running 185 secs || 6064442 markings, 19333225 edges, 33757 markings/sec, 185 secs
lola: sara is running 190 secs || 6227250 markings, 19875896 edges, 32562 markings/sec, 190 secs
lola: sara is running 195 secs || 6396566 markings, 20398378 edges, 33863 markings/sec, 195 secs
lola: sara is running 200 secs || 6559452 markings, 20939622 edges, 32577 markings/sec, 200 secs
lola: sara is running 205 secs || 6728612 markings, 21463634 edges, 33832 markings/sec, 205 secs
lola: sara is running 210 secs || 6899203 markings, 21908361 edges, 34118 markings/sec, 210 secs
lola: sara is running 215 secs || 7061119 markings, 22416455 edges, 32383 markings/sec, 215 secs
lola: sara is running 220 secs || 7219065 markings, 22927664 edges, 31589 markings/sec, 220 secs
lola: sara is running 225 secs || 7378218 markings, 23458526 edges, 31831 markings/sec, 225 secs
lola: sara is running 230 secs || 7547201 markings, 23978941 edges, 33797 markings/sec, 230 secs
lola: sara is running 235 secs || 7725895 markings, 24424091 edges, 35739 markings/sec, 235 secs
lola: sara is running 240 secs || 7909583 markings, 24879679 edges, 36738 markings/sec, 240 secs
lola: sara is running 245 secs || 8077957 markings, 25381007 edges, 33675 markings/sec, 245 secs
lola: sara is running 250 secs || 8230962 markings, 25848938 edges, 30601 markings/sec, 250 secs
lola: sara is running 255 secs || 8389733 markings, 26330467 edges, 31754 markings/sec, 255 secs
lola: sara is running 260 secs || 8545190 markings, 26815741 edges, 31091 markings/sec, 260 secs
lola: sara is running 265 secs || 8700338 markings, 27300857 edges, 31030 markings/sec, 265 secs
lola: sara is running 270 secs || 8847824 markings, 27785968 edges, 29497 markings/sec, 270 secs
lola: sara is running 275 secs || 8999199 markings, 28268086 edges, 30275 markings/sec, 275 secs
lola: sara is running 280 secs || 9149180 markings, 28756676 edges, 29996 markings/sec, 280 secs
lola: sara is running 285 secs || 9300030 markings, 29241325 edges, 30170 markings/sec, 285 secs
lola: sara is running 290 secs || 9448956 markings, 29732117 edges, 29785 markings/sec, 290 secs
lola: sara is running 295 secs || 9598551 markings, 30218893 edges, 29919 markings/sec, 295 secs
lola: sara is running 300 secs || 9749117 markings, 30706286 edges, 30113 markings/sec, 300 secs
lola: sara is running 305 secs || 9898899 markings, 31194767 edges, 29956 markings/sec, 305 secs
lola: sara is running 310 secs || 10048083 markings, 31681311 edges, 29837 markings/sec, 310 secs
lola: sara is running 315 secs || 10198443 markings, 32169227 edges, 30072 markings/sec, 315 secs
lola: sara is running 320 secs || 10349019 markings, 32654743 edges, 30115 markings/sec, 320 secs
lola: sara is running 325 secs || 10499923 markings, 33137385 edges, 30181 markings/sec, 325 secs
lola: sara is running 330 secs || 10646813 markings, 33630316 edges, 29378 markings/sec, 330 secs
lola: sara is running 335 secs || 10797540 markings, 34112718 edges, 30145 markings/sec, 335 secs
lola: sara is running 340 secs || 10951865 markings, 34599020 edges, 30865 markings/sec, 340 secs
lola: sara is running 345 secs || 11096429 markings, 35082380 edges, 28913 markings/sec, 345 secs
lola: sara is running 350 secs || 11251150 markings, 35566569 edges, 30944 markings/sec, 350 secs
lola: sara is running 355 secs || 11395889 markings, 36045403 edges, 28948 markings/sec, 355 secs
lola: sara is running 360 secs || 11561346 markings, 36478215 edges, 33091 markings/sec, 360 secs
lola: sara is running 365 secs || 11741575 markings, 36924722 edges, 36046 markings/sec, 365 secs
lola: sara is running 370 secs || 11919896 markings, 37368934 edges, 35664 markings/sec, 370 secs
lola: sara is running 375 secs || 12084400 markings, 37831378 edges, 32901 markings/sec, 375 secs
lola: sara is running 380 secs || 12248532 markings, 38340269 edges, 32826 markings/sec, 380 secs
lola: sara is running 385 secs || 12404506 markings, 38862613 edges, 31195 markings/sec, 385 secs
lola: sara is running 390 secs || 12561982 markings, 39354408 edges, 31495 markings/sec, 390 secs
lola: sara is running 395 secs || 12719093 markings, 39878771 edges, 31422 markings/sec, 395 secs
lola: sara is running 400 secs || 12871583 markings, 40376139 edges, 30498 markings/sec, 400 secs
lola: sara is running 405 secs || 13025411 markings, 40735065 edges, 30766 markings/sec, 405 secs
lola: sara is running 410 secs || 13175823 markings, 41182459 edges, 30082 markings/sec, 410 secs
lola: sara is running 415 secs || 13335470 markings, 41674258 edges, 31929 markings/sec, 415 secs
lola: sara is running 420 secs || 13493348 markings, 42163480 edges, 31576 markings/sec, 420 secs
lola: sara is running 425 secs || 13650197 markings, 42658093 edges, 31370 markings/sec, 425 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13774504 markings, 43051296 edges
lola: ========================================

FORMULA ASLink-PT-02a-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p295 <= p245) AND (p317 <= p466) AND ((1 <= p199))))))
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 ((((p295 <= p245) AND (p317 <= p466) AND ((1 <= p199))))))
lola: processed formula length: 63
lola: 16 rewrites
lola: closed formula file ASLink-PT-02a-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: (((p295 <= p245) AND (p317 <= p466) AND ((1 <= p199))))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-10-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges

FORMULA ASLink-PT-02a-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p448 + 1 <= p127) AND ((p494 + 1 <= p252) OR (p359 <= 0)))))
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 (((p448 + 1 <= p127) AND ((p494 + 1 <= p252) OR (p359 <= 0)))))
lola: processed formula length: 69
lola: 16 rewrites
lola: closed formula file ASLink-PT-02a-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: ((p448 + 1 <= p127) AND ((p494 + 1 <= p252) OR (p359 <= 0)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ASLink-PT-02a-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 195703 markings, 416590 edges, 39141 markings/sec, 0 secs
lola: sara is running 5 secs || 414636 markings, 882252 edges, 43787 markings/sec, 5 secs
lola: sara is running 10 secs || 660171 markings, 1317529 edges, 49107 markings/sec, 10 secs
lola: sara is running 15 secs || 883635 markings, 1786964 edges, 44693 markings/sec, 15 secs
lola: sara is running 20 secs || 1124785 markings, 2267278 edges, 48230 markings/sec, 20 secs
lola: sara is running 25 secs || 1346340 markings, 2746695 edges, 44311 markings/sec, 25 secs
lola: sara is running 30 secs || 1609426 markings, 3219300 edges, 52617 markings/sec, 30 secs
lola: sara is running 35 secs || 1801483 markings, 3699267 edges, 38411 markings/sec, 35 secs
lola: sara is running 40 secs || 2058955 markings, 4189018 edges, 51494 markings/sec, 40 secs
lola: sara is running 45 secs || 2326910 markings, 4673972 edges, 53591 markings/sec, 45 secs
lola: sara is running 50 secs || 2571777 markings, 5160984 edges, 48973 markings/sec, 50 secs
lola: sara is running 55 secs || 2733809 markings, 5630837 edges, 32406 markings/sec, 55 secs
lola: sara is running 60 secs || 2952256 markings, 6139739 edges, 43689 markings/sec, 60 secs
lola: sara is running 65 secs || 3182298 markings, 6617357 edges, 46008 markings/sec, 65 secs
lola: sara is running 70 secs || 3422829 markings, 7089434 edges, 48106 markings/sec, 70 secs
lola: sara is running 75 secs || 3636969 markings, 7523838 edges, 42828 markings/sec, 75 secs
lola: sara is running 80 secs || 3858234 markings, 8012435 edges, 44253 markings/sec, 80 secs
lola: sara is running 85 secs || 4091553 markings, 8494371 edges, 46664 markings/sec, 85 secs
lola: sara is running 90 secs || 4321610 markings, 8966759 edges, 46011 markings/sec, 90 secs
lola: sara is running 95 secs || 4551222 markings, 9430235 edges, 45922 markings/sec, 95 secs
lola: sara is running 100 secs || 4767257 markings, 9895844 edges, 43207 markings/sec, 100 secs
lola: sara is running 105 secs || 4996551 markings, 10356925 edges, 45859 markings/sec, 105 secs
lola: sara is running 110 secs || 5195315 markings, 10799296 edges, 39753 markings/sec, 110 secs
lola: sara is running 115 secs || 5423048 markings, 11279189 edges, 45547 markings/sec, 115 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5631305 markings, 11713505 edges
lola: ========================================

FORMULA ASLink-PT-02a-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 719 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p129 <= p523) AND (((p447 <= p152) AND (p611 <= p181))))))
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 (((p129 <= p523) AND (((p447 <= p152) AND (p611 <= p181))))))
lola: processed formula length: 66
lola: 17 rewrites
lola: closed formula file ASLink-PT-02a-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: ((p523 + 1 <= p129) OR (((p152 + 1 <= p447) OR (p181 + 1 <= p611))))
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA ASLink-PT-02a-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 959 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p477) AND (p544 <= p68) AND ((p57 <= p438) OR (p347 <= p518))))))
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 <= p477) AND (p544 <= p68) AND ((p57 <= p438) OR (p347 <= p518))))))
lola: processed formula length: 80
lola: 16 rewrites
lola: closed formula file ASLink-PT-02a-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 <= p477) AND (p544 <= p68) AND ((p57 <= p438) OR (p347 <= p518))))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-13-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: 288 markings, 382 edges
lola: ========================================

FORMULA ASLink-PT-02a-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p141 + 1 <= p281) AND ((1 <= p73) OR (p364 <= p254) OR ((1 <= p170) AND (p37 <= p618))))))
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 (((p141 + 1 <= p281) AND ((1 <= p73) OR (p364 <= p254) OR ((1 <= p170) AND (p37 <= p618))))))
lola: processed formula length: 100
lola: 16 rewrites
lola: closed formula file ASLink-PT-02a-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: ((p141 + 1 <= p281) AND ((1 <= p73) OR (p364 <= p254) OR ((1 <= p170) AND (p37 <= p618))))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-14-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: 35 markings, 34 edges

FORMULA ASLink-PT-02a-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 2877 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1 <= p601) AND (p309 <= p14) AND (p3 + 1 <= p181)) OR (p306 <= p463))))
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 ((((p1 <= p601) AND (p309 <= p14) AND (p3 + 1 <= p181)) OR (p306 <= p463))))
lola: processed formula length: 82
lola: 17 rewrites
lola: closed formula file ASLink-PT-02a-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: (((p601 + 1 <= p1) OR (p14 + 1 <= p309) OR (p181 <= p3)) AND (p463 + 1 <= p306))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-02a-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ASLink-PT-02a-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 565 markings, 573 edges
lola: ========================================

FORMULA ASLink-PT-02a-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes yes yes no yes no no no yes no
lola:
preliminary result: no yes yes no no yes yes yes yes no yes no no no yes no
lola: memory consumption: 27600 KB
lola: time consumption: 693 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="ASLink-PT-02a"
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/ASLink-PT-02a.tgz
mv ASLink-PT-02a execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is ASLink-PT-02a, 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-152749145200025"
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 '' ReachabilityCardinality.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 ;