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 176K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K 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.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CircadianClock-PT-001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r220-ebro-152732362700143
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527462026313

info: Time: 3600 - MCC
===========================================================================================
prep: translating CircadianClock-PT-001000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CircadianClock-PT-001000 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ CircadianClock-PT-001000 @ 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: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-001000-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= da_a)
lola: LP says that atomic proposition is always false: (3 <= da)
lola: LP says that atomic proposition is always false: (2 <= da)
lola: LP says that atomic proposition is always false: (3 <= dr)
lola: A (FALSE) : A ((F ((r <= dr_a)) U X ((c <= r_cap)))) : A (F (G ((2 <= ma_cap)))) : A (X (X (((a_cap <= da) U (3 <= a))))) : A (X ((a <= mr))) : A (F (X (G (X ((mr_cap <= ma)))))) : A (F (X ((r_cap <= a_cap)))) : A ((((2 <= ma_cap) U (c_cap <= ma_cap)) U F ((c <= da_a)))) : A (((2 <= mr_cap) U F (G ((1 <= c))))) : A (G (FALSE)) : A (F (G (((a_cap <= ma) U (c_cap <= c))))) : A (X (F ((mr <= a_cap)))) : A (FALSE) : A (X (X (X (G (FALSE))))) : A ((((2 <= ma) U (c <= mr)) U (3 <= mr_cap))) : A (X (X (((1 <= r_cap) U (1 <= ma)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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 CircadianClock-PT-001000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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 CircadianClock-PT-001000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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 CircadianClock-PT-001000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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 CircadianClock-PT-001000-LTLCardinality-13 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: A (X (F ((r_cap <= a_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((r_cap <= a_cap))))
lola: processed formula length: 28
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-6 TRUE 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: A ((F ((r <= dr_a)) U X ((c <= r_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((r <= dr_a)) U X ((c <= r_cap))))
lola: processed formula length: 40
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: 3 markings, 2 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((mr <= a_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((mr <= a_cap))))
lola: processed formula length: 25
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-11 TRUE 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 (((a_cap <= da) U (3 <= a)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((a_cap <= da) U (3 <= a)))))
lola: processed formula length: 38
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1002 markings, 1002 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-3 FALSE 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 ((a <= mr)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((a <= mr)))
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((1 <= r_cap) U (1 <= ma)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((1 <= r_cap) U (1 <= ma)))))
lola: processed formula length: 38
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1004 markings, 1004 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((c <= da_a)))
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: (da_a + 1 <= c)
lola: processed formula length: 15
lola: 25 rewrites
lola: closed formula file CircadianClock-PT-001000-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= c))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= c))))
lola: processed formula length: 20
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: add low 7
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: 1005 markings, 1006 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-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 (F (G ((2 <= ma_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= ma_cap))))
lola: processed formula length: 25
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: 1665842 markings, 2663868 edges, 333168 markings/sec, 0 secs
lola: 3181200 markings, 5358031 edges, 303072 markings/sec, 5 secs
lola: 4843472 markings, 8684000 edges, 332454 markings/sec, 10 secs
lola: 6375964 markings, 11746015 edges, 306498 markings/sec, 15 secs
lola: 7886390 markings, 14767708 edges, 302085 markings/sec, 20 secs
lola: 9356049 markings, 17703944 edges, 293932 markings/sec, 25 secs
lola: 10708527 markings, 20409755 edges, 270496 markings/sec, 30 secs
lola: 12161775 markings, 23313099 edges, 290650 markings/sec, 35 secs
lola: 13622582 markings, 26236171 edges, 292161 markings/sec, 40 secs
lola: 15031568 markings, 29054602 edges, 281797 markings/sec, 45 secs
lola: 16497520 markings, 31983138 edges, 293190 markings/sec, 50 secs
lola: 17886048 markings, 34761189 edges, 277706 markings/sec, 55 secs
lola: 19322067 markings, 37630530 edges, 287204 markings/sec, 60 secs
lola: 20667756 markings, 40322230 edges, 269138 markings/sec, 65 secs
lola: 22150587 markings, 43284398 edges, 296566 markings/sec, 70 secs
lola: 23566577 markings, 46117406 edges, 283198 markings/sec, 75 secs
lola: 24984064 markings, 48951877 edges, 283497 markings/sec, 80 secs
lola: 26315294 markings, 51612890 edges, 266246 markings/sec, 85 secs
lola: 27652843 markings, 54285854 edges, 267510 markings/sec, 90 secs
lola: 29044062 markings, 57069986 edges, 278244 markings/sec, 95 secs
lola: 30382593 markings, 59742891 edges, 267706 markings/sec, 100 secs
lola: 31744888 markings, 62468182 edges, 272459 markings/sec, 105 secs
lola: 32995557 markings, 64970311 edges, 250134 markings/sec, 110 secs
lola: 34407355 markings, 67791199 edges, 282360 markings/sec, 115 secs
lola: 35744656 markings, 70465743 edges, 267460 markings/sec, 120 secs
lola: 37123072 markings, 73220102 edges, 275683 markings/sec, 125 secs
lola: 38433913 markings, 75842031 edges, 262168 markings/sec, 130 secs
lola: 39695005 markings, 78362300 edges, 252218 markings/sec, 135 secs
lola: 41052832 markings, 81078874 edges, 271565 markings/sec, 140 secs
lola: 42345919 markings, 83661897 edges, 258617 markings/sec, 145 secs
lola: 43671105 markings, 86312503 edges, 265037 markings/sec, 150 secs
lola: 44929282 markings, 88829178 edges, 251635 markings/sec, 155 secs
lola: 46355547 markings, 91679501 edges, 285253 markings/sec, 160 secs
lola: 47707736 markings, 94384448 edges, 270438 markings/sec, 165 secs
lola: 49106347 markings, 97180462 edges, 279722 markings/sec, 170 secs
lola: 50428507 markings, 99822607 edges, 264432 markings/sec, 175 secs
lola: 51759147 markings, 102482744 edges, 266128 markings/sec, 180 secs
lola: 53125624 markings, 105216589 edges, 273295 markings/sec, 185 secs
lola: 54416889 markings, 107795577 edges, 258253 markings/sec, 190 secs
lola: 55736141 markings, 110435198 edges, 263850 markings/sec, 195 secs
lola: 56979926 markings, 112923091 edges, 248757 markings/sec, 200 secs
lola: 58352356 markings, 115664334 edges, 274486 markings/sec, 205 secs
lola: 59648126 markings, 118257051 edges, 259154 markings/sec, 210 secs
lola: 60938211 markings, 120835776 edges, 258017 markings/sec, 215 secs
lola: 62227999 markings, 123413791 edges, 257958 markings/sec, 220 secs
lola: 63459775 markings, 125875734 edges, 246355 markings/sec, 225 secs
lola: 64770075 markings, 128496911 edges, 262060 markings/sec, 230 secs
lola: 66018219 markings, 130993459 edges, 249629 markings/sec, 235 secs
lola: 67314039 markings, 133582126 edges, 259164 markings/sec, 240 secs
lola: 68526058 markings, 136006210 edges, 242404 markings/sec, 245 secs
lola: 69795937 markings, 138544070 edges, 253976 markings/sec, 250 secs
lola: 71145735 markings, 141244895 edges, 269960 markings/sec, 255 secs
lola: 72430566 markings, 143811428 edges, 256966 markings/sec, 260 secs
lola: 73724101 markings, 146398267 edges, 258707 markings/sec, 265 secs
lola: 74970677 markings, 148892108 edges, 249315 markings/sec, 270 secs
lola: 76305552 markings, 151558446 edges, 266975 markings/sec, 275 secs
lola: 77561585 markings, 154071366 edges, 251207 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1093 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((mr_cap <= ma))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((mr_cap <= ma))))
lola: processed formula length: 26
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: add low 13
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: 1003 markings, 1004 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= ma) U (c <= mr)) U (3 <= mr_cap)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= ma) U (c <= mr)) U (3 <= mr_cap)))
lola: processed formula length: 45
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((c_cap <= c)) AND ((a_cap <= ma) OR (c_cap <= c))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((c_cap <= c)) AND ((a_cap <= ma) OR (c_cap <= c))))))
lola: processed formula length: 66
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 13
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: 1003 markings, 1004 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= ma_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= ma_cap))))
lola: processed formula length: 25
lola: 23 rewrites
lola: closed formula file CircadianClock-PT-001000-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: 1684259 markings, 2696506 edges, 336852 markings/sec, 0 secs
lola: 3206698 markings, 5408997 edges, 304488 markings/sec, 5 secs
lola: 4892344 markings, 8782174 edges, 337129 markings/sec, 10 secs
lola: 6422027 markings, 11838146 edges, 305937 markings/sec, 15 secs
lola: 7965337 markings, 14926365 edges, 308662 markings/sec, 20 secs
lola: 9435614 markings, 17863251 edges, 294055 markings/sec, 25 secs
lola: 11002422 markings, 20998177 edges, 313362 markings/sec, 30 secs
lola: 12451887 markings, 23894159 edges, 289893 markings/sec, 35 secs
lola: 13930169 markings, 26851699 edges, 295656 markings/sec, 40 secs
lola: 15335561 markings, 29659356 edges, 281078 markings/sec, 45 secs
lola: 16816017 markings, 32621422 edges, 296091 markings/sec, 50 secs
lola: 18223105 markings, 35432168 edges, 281418 markings/sec, 55 secs
lola: 19635072 markings, 38256600 edges, 282393 markings/sec, 60 secs
lola: 20923367 markings, 40833704 edges, 257659 markings/sec, 65 secs
lola: 22402632 markings, 43789165 edges, 295853 markings/sec, 70 secs
lola: 23781704 markings, 46548822 edges, 275814 markings/sec, 75 secs
lola: 25194136 markings, 49369619 edges, 282486 markings/sec, 80 secs
lola: 26497496 markings, 51977719 edges, 260672 markings/sec, 85 secs
lola: 27924737 markings, 54830216 edges, 285448 markings/sec, 90 secs
lola: 29337212 markings, 57654693 edges, 282495 markings/sec, 95 secs
lola: 30718146 markings, 60414691 edges, 276187 markings/sec, 100 secs
lola: 32110351 markings, 63198478 edges, 278441 markings/sec, 105 secs
lola: 33429094 markings, 65834705 edges, 263749 markings/sec, 110 secs
lola: 34867728 markings, 68712498 edges, 287727 markings/sec, 115 secs
lola: 36235625 markings, 71444548 edges, 273579 markings/sec, 120 secs
lola: 37610429 markings, 74195393 edges, 274961 markings/sec, 125 secs
lola: 38932813 markings, 76840849 edges, 264477 markings/sec, 130 secs
lola: 40320799 markings, 79613744 edges, 277597 markings/sec, 135 secs
lola: 41636115 markings, 82244477 edges, 263063 markings/sec, 140 secs
lola: 42997010 markings, 84965532 edges, 272179 markings/sec, 145 secs
lola: 44316978 markings, 87603917 edges, 263994 markings/sec, 150 secs
lola: 45650703 markings, 90270212 edges, 266745 markings/sec, 155 secs
lola: 47101102 markings, 93172032 edges, 290080 markings/sec, 160 secs
lola: 48472657 markings, 95911822 edges, 274311 markings/sec, 165 secs
lola: 49860076 markings, 98686819 edges, 277484 markings/sec, 170 secs
lola: 51195456 markings, 101354262 edges, 267076 markings/sec, 175 secs
lola: 52588203 markings, 104140983 edges, 278549 markings/sec, 180 secs
lola: 53911797 markings, 106788120 edges, 264719 markings/sec, 185 secs
lola: 55284409 markings, 109530788 edges, 274522 markings/sec, 190 secs
lola: 56506181 markings, 111974672 edges, 244354 markings/sec, 195 secs
lola: 57841814 markings, 114644024 edges, 267127 markings/sec, 200 secs
lola: 59233602 markings, 117426717 edges, 278358 markings/sec, 205 secs
lola: 60494184 markings, 119946585 edges, 252116 markings/sec, 210 secs
lola: 61756525 markings, 122471763 edges, 252468 markings/sec, 215 secs
lola: 62955193 markings, 124869757 edges, 239734 markings/sec, 220 secs
lola: 64312681 markings, 127581584 edges, 271498 markings/sec, 225 secs
lola: 65590964 markings, 130138624 edges, 255657 markings/sec, 230 secs
lola: 66888480 markings, 132731389 edges, 259503 markings/sec, 235 secs
lola: 68182904 markings, 135320893 edges, 258885 markings/sec, 240 secs
lola: 69416935 markings, 137786037 edges, 246806 markings/sec, 245 secs
lola: 70811580 markings, 140576239 edges, 278929 markings/sec, 250 secs
lola: 72137409 markings, 143228254 edges, 265166 markings/sec, 255 secs
lola: 73479298 markings, 145908956 edges, 268378 markings/sec, 260 secs
lola: 74742372 markings, 148434926 edges, 252615 markings/sec, 265 secs
lola: 76056993 markings, 151062740 edges, 262924 markings/sec, 270 secs
lola: 77361345 markings, 153670825 edges, 260870 markings/sec, 275 secs
lola: 78337748 markings, 155621669 edges, 195281 markings/sec, 280 secs
lola: 78354831 markings, 155654963 edges, 3417 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA CircadianClock-PT-001000-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes unknown no yes no yes yes no no no yes no no yes no
lola:
preliminary result: no yes unknown no yes no yes yes no no no yes no no yes no
lola: memory consumption: 15960 KB
lola: time consumption: 581 seconds

BK_STOP 1527462607073

--------------------
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="CircadianClock-PT-001000"
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/CircadianClock-PT-001000.tgz
mv CircadianClock-PT-001000 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 CircadianClock-PT-001000, 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 r220-ebro-152732362700143"
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 '' LTLCardinality.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 ;