fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r033-smll-155225133600047
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for CircadianClock-PT-001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.990 3600000.00 331636.00 12956.40 FF?FFTFTTTF?TF?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r033-smll-155225133600047.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
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 r033-smll-155225133600047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 2.9K Feb 9 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 9 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 07:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 5 07:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K Feb 4 23:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 2 01:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 2 01:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jan 29 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 29 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:18 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 11K Mar 10 17:31 model.pnml

--------------------
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 1552298781872

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 @ 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: 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 <= dr)
lola: A ((a_cap <= da_a)) : A ((1 <= a)) : A (G (((da <= da_a) U (r <= da_a)))) : A (G (F (X (X ((3 <= c)))))) : A ((F (G ((1 <= da))) U G (G ((1 <= mr_cap))))) : A (X ((c <= a))) : A ((((1 <= da_a) U (1 <= r)) U X ((ma <= dr_a)))) : A ((a_cap <= ma_cap)) : A (F ((ma <= r))) : A (X (X ((2 <= c_cap)))) : A (X ((r_cap <= dr_a))) : A (G (X (G (G ((da_a <= ma_cap)))))) : A (F ((mr <= r_cap))) : A (G (X (((da <= c_cap) U (mr <= mr_cap))))) : A (F (G (F ((r <= c_cap))))) : A (F (FALSE))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:545
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (a_cap <= da_a)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a_cap <= da_a)
lola: processed formula length: 15
lola: 24 rewrites
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= a)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= a)
lola: processed formula length: 8
lola: 24 rewrites
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (a_cap <= ma_cap)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a_cap <= ma_cap)
lola: processed formula length: 17
lola: 24 rewrites
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 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-15 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 ((c <= a)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((c <= a)))
lola: processed formula length: 16
lola: 24 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-5 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 (X (X ((2 <= c_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((2 <= c_cap))))
lola: processed formula length: 24
lola: 24 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: 9 markings, 10 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((r_cap <= dr_a)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((r_cap <= dr_a)))
lola: processed formula length: 23
lola: 24 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: 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-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((da_a <= ma_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((da_a <= ma_cap))))
lola: processed formula length: 28
lola: 24 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: 3571507 markings, 6639860 edges, 714301 markings/sec, 0 secs
lola: 7168939 markings, 13831676 edges, 719486 markings/sec, 5 secs
lola: 10616284 markings, 20725723 edges, 689469 markings/sec, 10 secs
lola: 13948477 markings, 27389375 edges, 666439 markings/sec, 15 secs
lola: 17327756 markings, 34145175 edges, 675856 markings/sec, 20 secs
lola: 20582166 markings, 40652271 edges, 650882 markings/sec, 25 secs
lola: 23791963 markings, 47071463 edges, 641959 markings/sec, 30 secs
lola: 26915616 markings, 53316946 edges, 624731 markings/sec, 35 secs
lola: 29934164 markings, 59353018 edges, 603710 markings/sec, 40 secs
lola: 33206273 markings, 65894030 edges, 654422 markings/sec, 45 secs
lola: 36345716 markings, 72171178 edges, 627889 markings/sec, 50 secs
lola: 39429081 markings, 78336195 edges, 616673 markings/sec, 55 secs
lola: 42451046 markings, 84379608 edges, 604393 markings/sec, 60 secs
lola: 45363634 markings, 90202726 edges, 582518 markings/sec, 65 secs
lola: 48394642 markings, 96263283 edges, 606202 markings/sec, 70 secs
lola: 51367434 markings, 102207102 edges, 594558 markings/sec, 75 secs
lola: 54145058 markings, 107761127 edges, 555525 markings/sec, 80 secs
lola: 57062600 markings, 113596120 edges, 583508 markings/sec, 85 secs
lola: 59804182 markings, 119077796 edges, 548316 markings/sec, 90 secs
lola: 62570388 markings, 124607716 edges, 553241 markings/sec, 95 secs
lola: 65660955 markings, 130787344 edges, 618113 markings/sec, 100 secs
lola: 68635449 markings, 136735296 edges, 594899 markings/sec, 105 secs
lola: 71526292 markings, 142515471 edges, 578169 markings/sec, 110 secs
lola: 74337873 markings, 148136264 edges, 562316 markings/sec, 115 secs
lola: 77087529 markings, 153636040 edges, 549931 markings/sec, 120 secs
lola: 79935066 markings, 159328844 edges, 569507 markings/sec, 125 secs
lola: 82613272 markings, 164684064 edges, 535641 markings/sec, 130 secs
lola: 84460210 markings, 168375911 edges, 369388 markings/sec, 135 secs
lola: 84505037 markings, 168466459 edges, 8965 markings/sec, 140 secs
lola: 84535412 markings, 168527087 edges, 6075 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((mr <= mr_cap)) AND ((da <= c_cap) OR (mr <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((mr <= mr_cap)) AND ((da <= c_cap) OR (mr <= mr_cap))))))
lola: processed formula length: 70
lola: 24 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: 501502 markings, 751752 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 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= da_a) U (1 <= r)) U X ((ma <= dr_a))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= da_a) U (1 <= r)) U X ((ma <= dr_a))))
lola: processed formula length: 49
lola: 24 rewrites
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 6 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: 1005 markings, 1005 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((ma <= r)))
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: (r + 1 <= ma)
lola: processed formula length: 13
lola: 26 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-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((mr <= r_cap)))
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: (r_cap + 1 <= mr)
lola: processed formula length: 17
lola: 26 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-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= c))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= c))))
lola: processed formula length: 20
lola: 24 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: 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-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((r <= c_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((r <= c_cap))))
lola: processed formula length: 24
lola: 24 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: 2847059 markings, 5689423 edges, 569412 markings/sec, 0 secs
lola: 5939765 markings, 11873659 edges, 618541 markings/sec, 5 secs
lola: 8935315 markings, 17863295 edges, 599110 markings/sec, 10 secs
lola: 11858334 markings, 23707717 edges, 584604 markings/sec, 15 secs
lola: 14777659 markings, 29545057 edges, 583865 markings/sec, 20 secs
lola: 17652183 markings, 35291926 edges, 574905 markings/sec, 25 secs
lola: 20455425 markings, 40896841 edges, 560648 markings/sec, 30 secs
lola: 23274152 markings, 46532240 edges, 563745 markings/sec, 35 secs
lola: 26012738 markings, 52010095 edges, 547717 markings/sec, 40 secs
lola: 28559971 markings, 57102598 edges, 509447 markings/sec, 45 secs
lola: 31342562 markings, 62665530 edges, 556518 markings/sec, 50 secs
lola: 34136061 markings, 68251205 edges, 558700 markings/sec, 55 secs
lola: 36816995 markings, 73612159 edges, 536187 markings/sec, 60 secs
lola: 39554757 markings, 79086396 edges, 547552 markings/sec, 65 secs
lola: 42215770 markings, 84406410 edges, 532203 markings/sec, 70 secs
lola: 44732104 markings, 89439127 edges, 503267 markings/sec, 75 secs
lola: 47440846 markings, 94854453 edges, 541748 markings/sec, 80 secs
lola: 50093594 markings, 100157663 edges, 530550 markings/sec, 85 secs
lola: 52571239 markings, 105112303 edges, 495529 markings/sec, 90 secs
lola: 54913729 markings, 109797280 edges, 468498 markings/sec, 95 secs
lola: 57082769 markings, 114134301 edges, 433808 markings/sec, 100 secs
lola: 59548280 markings, 119062860 edges, 493102 markings/sec, 105 secs
lola: 62111808 markings, 124188273 edges, 512706 markings/sec, 110 secs
lola: 64785309 markings, 129534774 edges, 534700 markings/sec, 115 secs
lola: 67420583 markings, 134803536 edges, 527055 markings/sec, 120 secs
lola: 69967002 markings, 139896601 edges, 509284 markings/sec, 125 secs
lola: 72487198 markings, 144933957 edges, 504039 markings/sec, 130 secs
lola: 74947966 markings, 149855942 edges, 492154 markings/sec, 135 secs
lola: 77360875 markings, 154679275 edges, 482582 markings/sec, 140 secs
lola: 79943773 markings, 159844559 edges, 516580 markings/sec, 145 secs
lola: 82409562 markings, 164773884 edges, 493158 markings/sec, 150 secs
lola: 84392217 markings, 168738671 edges, 396531 markings/sec, 155 secs
lola: 84415982 markings, 168786145 edges, 4753 markings/sec, 160 secs
lola: 84435544 markings, 168824858 edges, 3912 markings/sec, 165 secs
lola: 84460199 markings, 168874755 edges, 4931 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((1 <= mr_cap)) OR (F (G ((1 <= mr_cap))) AND F (G ((1 <= da))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((1 <= mr_cap)) OR (F (G ((1 <= mr_cap))) AND F (G ((1 <= da))))))
lola: processed formula length: 72
lola: 24 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1000004 markings, 1499504 edges

lola: ========================================
FORMULA CircadianClock-PT-001000-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((r <= da_a)))) AND A (G (((da <= da_a) OR (r <= da_a)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: time limit reached - aborting
lola:
preliminary result: no no unknown no no yes no yes yes yes no unknown yes no unknown no
lola:
preliminary result: no no unknown no no yes no yes yes yes no unknown yes no unknown no
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no no unknown no no yes no yes yes yes no unknown yes no unknown no
lola: memory consumption: 16212 KB
lola: time consumption: 3569 seconds
lola: memory consumption: 16212 KB
lola: time consumption: 3569 seconds
lola: caught signal User defined signal 1 - aborting LoLA

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="CircadianClock-PT-001000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
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 r033-smll-155225133600047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-001000.tgz
mv CircadianClock-PT-001000 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;