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 180K
-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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306600500
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526616711220

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 CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ 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-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= da_a)
lola: LP says that atomic proposition is always false: (3 <= dr_a)
lola: LP says that atomic proposition is always false: (2 <= dr)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= da)
lola: A (G (((r <= ma_cap) OR E (G ((c_cap <= da)))))) : A (G (A (G ((c <= 2))))) : (A (((a <= mr_cap) U ((2 <= r) OR (1 <= ma)))) OR E (X (A (G ((2 <= a_cap)))))) : A (((3 <= mr) U E (F (FALSE)))) : ((da_a <= a_cap) AND E (F (E (X ((r_cap <= r)))))) : (A (F (A (X ((3 <= mr))))) OR E (F (E (X ((c_cap <= dr_a)))))) : (E (F (FALSE)) OR E (X (E (X (FALSE))))) : A (G ((ma + 1 <= c_cap))) : ((E (F ((r_cap <= a))) AND E (F ((a_cap + 1 <= c)))) AND (ma <= 2)) : NOT(NOT((A (G (TRUE)) OR A (G ((dr <= a_cap)))))) : A (G (A (G (((3 <= a_cap) OR (2 <= ma_cap)))))) : A ((((ma_cap + 1 <= mr)) U A (G ((da_a <= mr_cap))))) : A (G (A (G ((r + 1 <= ma_cap))))) : A (G (A (F ((1 <= mr_cap))))) : NOT(A (G (E (X ((3 <= ma_cap)))))) : (((ma <= da) OR (da_a <= r_cap)) AND A (G (((r_cap <= c) OR ((2 <= r_cap) AND (ma <= a_cap))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: 29 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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-CTLCardinality-3 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: 29 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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-CTLCardinality-6 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 29 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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 CircadianClock-PT-001000-CTLCardinality-9 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: (A (F (A (X ((3 <= mr))))) OR E (X (E (F ((c_cap <= dr_a))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= mr)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX((3 <= mr)))
lola: processed formula length: 23
lola: 31 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1002 markings, 1002 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((c_cap <= dr_a)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (c_cap <= dr_a)
lola: processed formula length: 15
lola: 30 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 4999 markings, 7994 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA CircadianClock-PT-001000-CTLCardinality-5 TRUE 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 (((a <= mr_cap) U ((2 <= r) OR (1 <= ma)))) OR E (X (A (G ((2 <= a_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((a <= mr_cap) U ((2 <= r) OR (1 <= ma))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((a <= mr_cap) U ((2 <= r) OR (1 <= ma))))
lola: processed formula length: 46
lola: 33 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((2 <= a_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U (a_cap <= 1))))
lola: processed formula length: 31
lola: 32 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1004000 markings, 1504499 edges
lola: SUBRESULT
lola: result: no
lola: lola: ========================================
The Boolean predicate is false.

FORMULA CircadianClock-PT-001000-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((da_a <= a_cap) AND E (X (E (F ((r_cap <= r))))))
lola: ========================================
lola: lola: ========================================
SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (da_a <= a_cap)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (da_a <= a_cap)
lola: processed formula length: 15
lola: 29 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((r_cap <= r)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (r_cap <= r)
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 501 markings, 500 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA CircadianClock-PT-001000-CTLCardinality-4 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: E (F (A (X ((ma_cap <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((ma_cap <= 2)))
lola: processed formula length: 27
lola: 31 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2061015 markings, 3619100 edges, 412203 markings/sec, 0 secs
lola: 3775293 markings, 7047525 edges, 342856 markings/sec, 5 secs
lola: 5455193 markings, 10405735 edges, 335980 markings/sec, 10 secs
lola: 7136923 markings, 13767612 edges, 336346 markings/sec, 15 secs
lola: 8772078 markings, 17038350 edges, 327031 markings/sec, 20 secs
lola: 10378527 markings, 20250094 edges, 321290 markings/sec, 25 secs
lola: 11981523 markings, 23456483 edges, 320599 markings/sec, 30 secs
lola: 13555914 markings, 26604006 edges, 314878 markings/sec, 35 secs
lola: 15217867 markings, 29926350 edges, 332391 markings/sec, 40 secs
lola: 16836235 markings, 33162876 edges, 323674 markings/sec, 45 secs
lola: 18435274 markings, 36359898 edges, 319808 markings/sec, 50 secs
lola: 20049857 markings, 39586896 edges, 322917 markings/sec, 55 secs
lola: 21595352 markings, 42678345 edges, 309099 markings/sec, 60 secs
lola: 23194974 markings, 45875727 edges, 319924 markings/sec, 65 secs
lola: 24750698 markings, 48988099 edges, 311145 markings/sec, 70 secs
lola: 26299615 markings, 52084021 edges, 309783 markings/sec, 75 secs
lola: 27854885 markings, 55194624 edges, 311054 markings/sec, 80 secs
lola: 29391078 markings, 58265179 edges, 307239 markings/sec, 85 secs
lola: 30990820 markings, 61465798 edges, 319948 markings/sec, 90 secs
lola: 32550327 markings, 64582649 edges, 311901 markings/sec, 95 secs
lola: 34106725 markings, 67694166 edges, 311280 markings/sec, 100 secs
lola: 35579780 markings, 70640538 edges, 294611 markings/sec, 105 secs
lola: 37081531 markings, 73642031 edges, 300350 markings/sec, 110 secs
lola: 38526150 markings, 76531053 edges, 288924 markings/sec, 115 secs
lola: 40084909 markings, 79647653 edges, 311752 markings/sec, 120 secs
lola: 41561673 markings, 82601161 edges, 295353 markings/sec, 125 secs
lola: 43093451 markings, 85662779 edges, 306356 markings/sec, 130 secs
lola: 44555715 markings, 88587478 edges, 292453 markings/sec, 135 secs
lola: 46033556 markings, 91543498 edges, 295568 markings/sec, 140 secs
lola: 47591084 markings, 94656410 edges, 311506 markings/sec, 145 secs
lola: 49135618 markings, 97744313 edges, 308907 markings/sec, 150 secs
lola: 50616352 markings, 100705737 edges, 296147 markings/sec, 155 secs
lola: 52120449 markings, 103712272 edges, 300819 markings/sec, 160 secs
lola: 53566461 markings, 106604727 edges, 289202 markings/sec, 165 secs
lola: 55088352 markings, 109648423 edges, 304378 markings/sec, 170 secs
lola: 56558445 markings, 112586898 edges, 294019 markings/sec, 175 secs
lola: 58022978 markings, 115515924 edges, 292907 markings/sec, 180 secs
lola: 59500143 markings, 118469301 edges, 295433 markings/sec, 185 secs
lola: 60950948 markings, 121370975 edges, 290161 markings/sec, 190 secs
lola: 62409421 markings, 124285938 edges, 291695 markings/sec, 195 secs
lola: 63967897 markings, 127403335 edges, 311695 markings/sec, 200 secs
lola: 65482708 markings, 130430830 edges, 302962 markings/sec, 205 secs
lola: 66996528 markings, 133458757 edges, 302764 markings/sec, 210 secs
lola: 68482977 markings, 136430324 edges, 297290 markings/sec, 215 secs
lola: 69926360 markings, 139317143 edges, 288677 markings/sec, 220 secs
lola: 71423397 markings, 142308981 edges, 299407 markings/sec, 225 secs
lola: 72855250 markings, 145173423 edges, 286371 markings/sec, 230 secs
lola: 74274493 markings, 148009531 edges, 283849 markings/sec, 235 secs
lola: 75700939 markings, 150862375 edges, 285289 markings/sec, 240 secs
lola: 77130606 markings, 153720182 edges, 285933 markings/sec, 245 secs
lola: 78526213 markings, 156511047 edges, 279121 markings/sec, 250 secs
lola: 80005967 markings, 159471520 edges, 295951 markings/sec, 255 secs
lola: 81212584 markings, 161882278 edges, 241323 markings/sec, 260 secs
lola: 81230488 markings, 161918209 edges, 3581 markings/sec, 265 secs
lola: 81234938 markings, 161926666 edges, 890 markings/sec, 270 secs
lola: 81238133 markings, 161933860 edges, 639 markings/sec, 275 secs
lola: 81238549 markings, 161934283 edges, 83 markings/sec, 280 secs
lola: 81240347 markings, 161938083 edges, 360 markings/sec, 285 secs
lola: 81253545 markings, 161964120 edges, 2640 markings/sec, 290 secs
lola: 81258821 markings, 161974585 edges, 1055 markings/sec, 295 secs
lola: 81258885 markings, 161974648 edges, 13 markings/sec, 300 secs
lola: 81258931 markings, 161974694 edges, 9 markings/sec, 305 secs
lola: 81258983 markings, 161974747 edges, 10 markings/sec, 310 secs
lola: 81262075 markings, 161981722 edges, 618 markings/sec, 315 secs
lola: 81273521 markings, 162004078 edges, 2289 markings/sec, 320 secs
lola: 81277098 markings, 162010906 edges, 715 markings/sec, 325 secs
lola: 81288086 markings, 162033794 edges, 2198 markings/sec, 330 secs
lola: 81290204 markings, 162038016 edges, 424 markings/sec, 335 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((c <= 2)))
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 ((c <= 2)))
lola: processed formula length: 16
lola: 31 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: (3 <= c)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 13 edges

lola: ========================================
FORMULA CircadianClock-PT-001000-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= a_cap) OR (2 <= ma_cap))))
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 (((3 <= a_cap) OR (2 <= ma_cap))))
lola: processed formula length: 40
lola: 31 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: ((a_cap <= 2) AND (ma_cap <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1998 markings, 1997 edges

FORMULA CircadianClock-PT-001000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((r + 1 <= ma_cap)))
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 ((r + 1 <= ma_cap)))
lola: processed formula length: 25
lola: 31 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: (ma_cap <= r)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1001 markings, 1000 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ma + 1 <= c_cap)))
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 ((ma + 1 <= c_cap)))
lola: processed formula length: 25
lola: 31 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: (c_cap <= ma)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1001 markings, 1000 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= mr_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (mr_cap <= 0)
lola: processed formula length: 13
lola: 31 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 3003 markings, 3003 edges
lola: ========================================

FORMULA CircadianClock-PT-001000-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((ma_cap + 1 <= mr)) U A (G ((da_a <= mr_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(((ma_cap + 1 <= mr)) U NOT(E(TRUE U (mr_cap + 1 <= da_a))))
lola: processed formula length: 61
lola: 32 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2320482 markings, 4137915 edges, 464096 markings/sec, 0 secs
lola: 4331970 markings, 8159457 edges, 402298 markings/sec, 5 secs
lola: 6246402 markings, 11987542 edges, 382886 markings/sec, 10 secs
lola: 8180638 markings, 15855144 edges, 386847 markings/sec, 15 secs
lola: 10030393 markings, 19553173 edges, 369951 markings/sec, 20 secs
lola: 11837176 markings, 23167228 edges, 361357 markings/sec, 25 secs
lola: 13607970 markings, 26708254 edges, 354159 markings/sec, 30 secs
lola: 15455842 markings, 30402633 edges, 369574 markings/sec, 35 secs
lola: 17239725 markings, 33968950 edges, 356777 markings/sec, 40 secs
lola: 19030647 markings, 37551396 edges, 358184 markings/sec, 45 secs
lola: 20714436 markings, 40917282 edges, 336758 markings/sec, 50 secs
lola: 22444209 markings, 44375181 edges, 345955 markings/sec, 55 secs
lola: 24210412 markings, 47906433 edges, 353241 markings/sec, 60 secs
lola: 25853071 markings, 51191868 edges, 328532 markings/sec, 65 secs
lola: 27557228 markings, 54598885 edges, 340831 markings/sec, 70 secs
lola: 29219510 markings, 57922215 edges, 332456 markings/sec, 75 secs
lola: 30934548 markings, 61352897 edges, 343008 markings/sec, 80 secs
lola: 32688760 markings, 64860157 edges, 350842 markings/sec, 85 secs
lola: 34388537 markings, 68258025 edges, 339955 markings/sec, 90 secs
lola: 36062169 markings, 71603425 edges, 334726 markings/sec, 95 secs
lola: 37675934 markings, 74832133 edges, 322753 markings/sec, 100 secs
lola: 39363289 markings, 78204722 edges, 337471 markings/sec, 105 secs
lola: 41012871 markings, 81504933 edges, 329916 markings/sec, 110 secs
lola: 42611396 markings, 84700249 edges, 319705 markings/sec, 115 secs
lola: 44246544 markings, 87968788 edges, 327030 markings/sec, 120 secs
lola: 45816957 markings, 91109613 edges, 314083 markings/sec, 125 secs
lola: 47505343 markings, 94485056 edges, 337677 markings/sec, 130 secs
lola: 49187853 markings, 97849100 edges, 336502 markings/sec, 135 secs
lola: 50796577 markings, 101066683 edges, 321745 markings/sec, 140 secs
lola: 52441422 markings, 104355002 edges, 328969 markings/sec, 145 secs
lola: 54027985 markings, 107528737 edges, 317313 markings/sec, 150 secs
lola: 55684349 markings, 110839788 edges, 331273 markings/sec, 155 secs
lola: 57294850 markings, 114058704 edges, 322100 markings/sec, 160 secs
lola: 58850456 markings, 117170358 edges, 311121 markings/sec, 165 secs
lola: 60426751 markings, 120321600 edges, 315259 markings/sec, 170 secs
lola: 61954038 markings, 123376743 edges, 305457 markings/sec, 175 secs
lola: 63660190 markings, 126787585 edges, 341230 markings/sec, 180 secs
lola: 65335343 markings, 130135717 edges, 335031 markings/sec, 185 secs
lola: 66980544 markings, 133426782 edges, 329040 markings/sec, 190 secs
lola: 68586918 markings, 136638304 edges, 321275 markings/sec, 195 secs
lola: 70184199 markings, 139830529 edges, 319456 markings/sec, 200 secs
lola: 71780996 markings, 143024557 edges, 319359 markings/sec, 205 secs
lola: 73373287 markings, 146207565 edges, 318458 markings/sec, 210 secs
lola: 74940330 markings, 149342042 edges, 313409 markings/sec, 215 secs
lola: 76504798 markings, 152469778 edges, 312894 markings/sec, 220 secs
lola: 78039286 markings, 155538541 edges, 306898 markings/sec, 225 secs
lola: 79691211 markings, 158840783 edges, 330385 markings/sec, 230 secs
lola: 81300686 markings, 162058514 edges, 321895 markings/sec, 235 secs
lola: 82859507 markings, 165176669 edges, 311764 markings/sec, 240 secs
lola: 84410517 markings, 168276758 edges, 310202 markings/sec, 245 secs
lola: 85917838 markings, 171291974 edges, 301464 markings/sec, 250 secs
lola: 87502759 markings, 174459881 edges, 316984 markings/sec, 255 secs
lola: 89050831 markings, 177556639 edges, 309614 markings/sec, 260 secs
lola: 90560109 markings, 180572812 edges, 301856 markings/sec, 265 secs
lola: 92097828 markings, 183649185 edges, 307544 markings/sec, 270 secs
lola: 93579783 markings, 186611267 edges, 296391 markings/sec, 275 secs
lola: 95195694 markings, 189841413 edges, 323182 markings/sec, 280 secs
lola: 96785021 markings, 193020772 edges, 317865 markings/sec, 285 secs
lola: 98364222 markings, 196176737 edges, 315840 markings/sec, 290 secs
lola: 99921361 markings, 199291485 edges, 311428 markings/sec, 295 secs
lola: 101461804 markings, 202371114 edges, 308089 markings/sec, 300 secs
lola: 103006808 markings, 205461437 edges, 309001 markings/sec, 305 secs
lola: 104548917 markings, 208544068 edges, 308422 markings/sec, 310 secs
lola: 106056394 markings, 211559320 edges, 301495 markings/sec, 315 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 966 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((r <= ma_cap) OR E (G ((c_cap <= da))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U ((ma_cap + 1 <= r) AND A(TRUE U (da + 1 <= c_cap)))))
lola: processed formula length: 66
lola: 35 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1002002 markings, 1502502 edges

lola: ========================================
FORMULA CircadianClock-PT-001000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((ma <= da) OR (da_a <= r_cap)) AND A (G (((r_cap <= c) OR ((2 <= r_cap) AND (ma <= a_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ma <= da) OR (da_a <= r_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ma <= da) OR (da_a <= r_cap))
lola: processed formula length: 32
lola: 29 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: subprocess 15 will run for 2896 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((r_cap <= c) OR ((2 <= r_cap) AND (ma <= a_cap)))))
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 (((r_cap <= c) OR ((2 <= r_cap) AND (ma <= a_cap)))))
lola: processed formula length: 59
lola: 31 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: ((c + 1 <= r_cap) AND ((r_cap <= 1) OR (a_cap + 1 <= ma)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1002 markings, 1001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CircadianClock-PT-001000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2896 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((r_cap <= a))) AND (E (F ((a_cap + 1 <= c))) AND (ma <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2896 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ma <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ma <= 2)
lola: processed formula length: 9
lola: 29 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((r_cap <= a)))
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 ((r_cap <= a)))
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: (r_cap <= a)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-17-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1002 markings, 1001 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((ma_cap <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((ma_cap <= 2)))
lola: processed formula length: 27
lola: 31 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2076230 markings, 3648790 edges, 415246 markings/sec, 0 secs
lola: 3870068 markings, 7237867 edges, 358768 markings/sec, 5 secs
lola: 5601256 markings, 10698143 edges, 346238 markings/sec, 10 secs
lola: 7348207 markings, 14191214 edges, 349390 markings/sec, 15 secs
lola: 9065431 markings, 17623844 edges, 343445 markings/sec, 20 secs
lola: 10706844 markings, 20907536 edges, 328283 markings/sec, 25 secs
lola: 12354300 markings, 24200371 edges, 329491 markings/sec, 30 secs
lola: 13967593 markings, 27427662 edges, 322659 markings/sec, 35 secs
lola: 15639439 markings, 30769701 edges, 334369 markings/sec, 40 secs
lola: 17277940 markings, 34045652 edges, 327700 markings/sec, 45 secs
lola: 18876591 markings, 37242996 edges, 319730 markings/sec, 50 secs
lola: 20444430 markings, 40376857 edges, 313568 markings/sec, 55 secs
lola: 21997243 markings, 43482619 edges, 310563 markings/sec, 60 secs
lola: 23587264 markings, 46661059 edges, 318004 markings/sec, 65 secs
lola: 25153598 markings, 49792399 edges, 313267 markings/sec, 70 secs
lola: 26651732 markings, 52788666 edges, 299627 markings/sec, 75 secs
lola: 28175673 markings, 55834889 edges, 304788 markings/sec, 80 secs
lola: 29646645 markings, 58777067 edges, 294194 markings/sec, 85 secs
lola: 31243772 markings, 61970026 edges, 319425 markings/sec, 90 secs
lola: 32806530 markings, 65095642 edges, 312552 markings/sec, 95 secs
lola: 34348435 markings, 68177659 edges, 308381 markings/sec, 100 secs
lola: 35882963 markings, 71246730 edges, 306906 markings/sec, 105 secs
lola: 37389941 markings, 74259724 edges, 301396 markings/sec, 110 secs
lola: 38916029 markings, 77311341 edges, 305218 markings/sec, 115 secs
lola: 40419650 markings, 80317214 edges, 300724 markings/sec, 120 secs
lola: 41879527 markings, 83237199 edges, 291975 markings/sec, 125 secs
lola: 43379300 markings, 86234757 edges, 299955 markings/sec, 130 secs
lola: 44828379 markings, 89133165 edges, 289816 markings/sec, 135 secs
lola: 46274997 markings, 92025174 edges, 289324 markings/sec, 140 secs
lola: 47805488 markings, 95085940 edges, 306098 markings/sec, 145 secs
lola: 49301933 markings, 98077509 edges, 299289 markings/sec, 150 secs
lola: 50760750 markings, 100995147 edges, 291763 markings/sec, 155 secs
lola: 52226558 markings, 103924757 edges, 293162 markings/sec, 160 secs
lola: 53633654 markings, 106739154 edges, 281419 markings/sec, 165 secs
lola: 55123799 markings, 109717812 edges, 298029 markings/sec, 170 secs
lola: 56560109 markings, 112589895 edges, 287262 markings/sec, 175 secs
lola: 57994020 markings, 115458772 edges, 286782 markings/sec, 180 secs
lola: 59459461 markings, 118387284 edges, 293088 markings/sec, 185 secs
lola: 60891788 markings, 121252033 edges, 286465 markings/sec, 190 secs
lola: 62328248 markings, 124122933 edges, 287292 markings/sec, 195 secs
lola: 63873280 markings, 127213343 edges, 309006 markings/sec, 200 secs
lola: 65399528 markings, 130264367 edges, 305250 markings/sec, 205 secs
lola: 66899263 markings, 133264511 edges, 299947 markings/sec, 210 secs
lola: 68370774 markings, 136205547 edges, 294302 markings/sec, 215 secs
lola: 69800237 markings, 139064832 edges, 285893 markings/sec, 220 secs
lola: 71306611 markings, 142075460 edges, 301275 markings/sec, 225 secs
lola: 72742189 markings, 144946328 edges, 287116 markings/sec, 230 secs
lola: 74168534 markings, 147797494 edges, 285269 markings/sec, 235 secs
lola: 75602279 markings, 150665568 edges, 286749 markings/sec, 240 secs
lola: 77031480 markings, 153523908 edges, 285840 markings/sec, 245 secs
lola: 78456542 markings, 156371930 edges, 285012 markings/sec, 250 secs
lola: 79937706 markings, 159334636 edges, 296233 markings/sec, 255 secs
lola: 81198624 markings, 161854392 edges, 252184 markings/sec, 260 secs
lola: 81238925 markings, 161934658 edges, 8060 markings/sec, 265 secs
lola: 81254108 markings, 161965810 edges, 3037 markings/sec, 270 secs
lola: 81270842 markings, 161998624 edges, 3347 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA CircadianClock-PT-001000-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A ((((ma_cap + 1 <= mr)) U A (G ((da_a <= mr_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(((ma_cap + 1 <= mr)) U NOT(E(TRUE U (mr_cap + 1 <= da_a))))
lola: processed formula length: 61
lola: 32 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2159611 markings, 3815847 edges, 431922 markings/sec, 0 secs
lola: 4122982 markings, 7742107 edges, 392674 markings/sec, 5 secs
lola: 5999623 markings, 11495841 edges, 375328 markings/sec, 10 secs
lola: 7881157 markings, 15257255 edges, 376307 markings/sec, 15 secs
lola: 9670529 markings, 18835020 edges, 357874 markings/sec, 20 secs
lola: 11454491 markings, 22401653 edges, 356792 markings/sec, 25 secs
lola: 13199369 markings, 25889838 edges, 348976 markings/sec, 30 secs
lola: 14968222 markings, 29428049 edges, 353771 markings/sec, 35 secs
lola: 16700393 markings, 32891148 edges, 346434 markings/sec, 40 secs
lola: 18390128 markings, 36268879 edges, 337947 markings/sec, 45 secs
lola: 20077759 markings, 39642842 edges, 337526 markings/sec, 50 secs
lola: 21691186 markings, 42869992 edges, 322685 markings/sec, 55 secs
lola: 23379252 markings, 46244712 edges, 337613 markings/sec, 60 secs
lola: 25035025 markings, 49557507 edges, 331155 markings/sec, 65 secs
lola: 26634110 markings, 52753155 edges, 319817 markings/sec, 70 secs
lola: 28264641 markings, 56013181 edges, 326106 markings/sec, 75 secs
lola: 29831404 markings, 59146817 edges, 313353 markings/sec, 80 secs
lola: 31544707 markings, 62571972 edges, 342661 markings/sec, 85 secs
lola: 33229064 markings, 65938873 edges, 336871 markings/sec, 90 secs
lola: 34859346 markings, 69200580 edges, 326056 markings/sec, 95 secs
lola: 36458950 markings, 72398362 edges, 319921 markings/sec, 100 secs
lola: 38031157 markings, 75542334 edges, 314441 markings/sec, 105 secs
lola: 39642078 markings, 78763482 edges, 322184 markings/sec, 110 secs
lola: 41284391 markings, 82046253 edges, 328463 markings/sec, 115 secs
lola: 42899894 markings, 85277178 edges, 323101 markings/sec, 120 secs
lola: 44505277 markings, 88486966 edges, 321077 markings/sec, 125 secs
lola: 46107978 markings, 91690066 edges, 320540 markings/sec, 130 secs
lola: 47801837 markings, 95078982 edges, 338772 markings/sec, 135 secs
lola: 49452698 markings, 98378799 edges, 330172 markings/sec, 140 secs
lola: 51103768 markings, 101679710 edges, 330214 markings/sec, 145 secs
lola: 52683160 markings, 104839103 edges, 315878 markings/sec, 150 secs
lola: 54271411 markings, 108013736 edges, 317650 markings/sec, 155 secs
lola: 55911593 markings, 111294376 edges, 328036 markings/sec, 160 secs
lola: 57506124 markings, 114482297 edges, 318906 markings/sec, 165 secs
lola: 59120042 markings, 117708518 edges, 322784 markings/sec, 170 secs
lola: 60654125 markings, 120776064 edges, 306817 markings/sec, 175 secs
lola: 62219166 markings, 123905399 edges, 313008 markings/sec, 180 secs
lola: 63904675 markings, 127276435 edges, 337102 markings/sec, 185 secs
lola: 65541529 markings, 130548583 edges, 327371 markings/sec, 190 secs
lola: 67186101 markings, 133836753 edges, 328914 markings/sec, 195 secs
lola: 68751758 markings, 136967780 edges, 313131 markings/sec, 200 secs
lola: 70327239 markings, 140117620 edges, 315096 markings/sec, 205 secs
lola: 71938254 markings, 143340052 edges, 322203 markings/sec, 210 secs
lola: 73501294 markings, 146463778 edges, 312608 markings/sec, 215 secs
lola: 75074914 markings, 149611994 edges, 314724 markings/sec, 220 secs
lola: 76599027 markings, 152658608 edges, 304823 markings/sec, 225 secs
lola: 78111618 markings, 155683645 edges, 302518 markings/sec, 230 secs
lola: 79707872 markings, 158874791 edges, 319251 markings/sec, 235 secs
lola: 81277217 markings, 162011173 edges, 313869 markings/sec, 240 secs
lola: 82782786 markings, 165023132 edges, 301114 markings/sec, 245 secs
lola: 84298598 markings, 168052834 edges, 303162 markings/sec, 250 secs
lola: 85758074 markings, 170972444 edges, 291895 markings/sec, 255 secs
lola: 87307467 markings, 174068940 edges, 309879 markings/sec, 260 secs
lola: 88802478 markings, 177059206 edges, 299002 markings/sec, 265 secs
lola: 90284927 markings, 180022770 edges, 296490 markings/sec, 270 secs
lola: 91754601 markings, 182962092 edges, 293935 markings/sec, 275 secs
lola: 93227923 markings, 185907158 edges, 294664 markings/sec, 280 secs
lola: 94697404 markings, 188846305 edges, 293896 markings/sec, 285 secs
lola: 96303119 markings, 192056343 edges, 321143 markings/sec, 290 secs
lola: 97827919 markings, 195106026 edges, 304960 markings/sec, 295 secs
lola: 99381019 markings, 198209940 edges, 310620 markings/sec, 300 secs
lola: 100870189 markings, 201188386 edges, 297834 markings/sec, 305 secs
lola: 102355023 markings, 204157104 edges, 296967 markings/sec, 310 secs
lola: 103871979 markings, 207191243 edges, 303391 markings/sec, 315 secs
lola: 105367423 markings, 210179811 edges, 299089 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA CircadianClock-PT-001000-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (F ((r_cap <= a))) AND (E (F ((a_cap + 1 <= c))) AND (ma <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (ma <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ma <= 2)
lola: processed formula length: 9
lola: 29 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((a_cap + 1 <= c)))
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 ((a_cap + 1 <= c)))
lola: processed formula length: 24
lola: 30 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: (a_cap + 1 <= c)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-19-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: 8020 markings, 13532 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((r_cap <= a)))
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 ((r_cap <= a)))
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.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: (r_cap <= a)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-001000-CTLCardinality-20-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: 1002 markings, 1001 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA CircadianClock-PT-001000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes no no yes yes no unknown no no unknown no
lola:
preliminary result: no no no no yes yes no no yes yes no unknown no no unknown no
lola: memory consumption: 18692 KB
lola: time consumption: 1285 seconds

BK_STOP 1526617996816

--------------------
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="CTLCardinality"
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 CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-ebro-152646306600500"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;