Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
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 r226-ebro-152732380200143
=====================================================================

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


BK_STOP 1527641944322

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using CircadianClock-PT-001000 as instance name.
Using CircadianClock as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 2065, 'Memory': 433.44, 'Tool': 'lola'}, {'Time': 2345, 'Memory': 402.83, 'Tool': 'lola'}, {'Time': 3509248, 'Memory': 7351.6, 'Tool': 'itstools'}, {'Time': 3509404, 'Memory': 7359.66, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola CircadianClock-PT-001000...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
CircadianClock-PT-001000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
CircadianClock-PT-001000: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ CircadianClock-PT-001000 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 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: 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: A ((3 <= da_a)) : A ((F ((r <= dr_a)) U X ((c <= r_cap)))) : A (F (G ((2 <= ma_cap)))) : A (X (X (((a_cap <= da) U (3 <= a))))) : A (X ((a <= mr))) : A (F (X (G (X ((mr_cap <= ma)))))) : A (F (X ((r_cap <= a_cap)))) : A ((((2 <= ma_cap) U (c_cap <= ma_cap)) U F ((c <= da_a)))) : A (((2 <= mr_cap) U F (G ((1 <= c))))) : A (G ((3 <= da))) : A (F (G (((a_cap <= ma) U (c_cap <= c))))) : A (X (F ((mr <= a_cap)))) : A ((2 <= da)) : A (X (X (X (G ((3 <= dr)))))) : A ((((2 <= ma) U (c <= mr)) U (3 <= mr_cap))) : A (X (X (((1 <= r_cap) U (1 <= ma)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= da_a))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= da_a)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((r <= dr_a)) U X ((c <= r_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((r <= dr_a)) U X ((c <= r_cap))))
lola: processed formula: A ((F ((r <= dr_a)) U X ((c <= r_cap))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 29 unused bits
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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= ma_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((2 <= ma_cap))))
lola: processed formula: A (F (G ((2 <= ma_cap))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1989614 markings, 3230358 edges, 397923 markings/sec, 0 secs
lola: 3790147 markings, 6577321 edges, 360107 markings/sec, 5 secs
lola: 5572279 markings, 10141237 edges, 356426 markings/sec, 10 secs
lola: 7318705 markings, 13631170 edges, 349285 markings/sec, 15 secs
lola: 9044095 markings, 17079301 edges, 345078 markings/sec, 20 secs
lola: 10714864 markings, 20422784 edges, 334154 markings/sec, 25 secs
lola: 12317514 markings, 23624707 edges, 320530 markings/sec, 30 secs
lola: 14061422 markings, 27112781 edges, 348782 markings/sec, 35 secs
lola: 15621754 markings, 30232648 edges, 312066 markings/sec, 40 secs
lola: 17206894 markings, 33402027 edges, 317028 markings/sec, 45 secs
lola: 18781173 markings, 36549770 edges, 314856 markings/sec, 50 secs
lola: 20416740 markings, 39819846 edges, 327113 markings/sec, 55 secs
lola: 21917908 markings, 42820781 edges, 300234 markings/sec, 60 secs
lola: 23324439 markings, 45632905 edges, 281306 markings/sec, 65 secs
lola: 24865615 markings, 48714234 edges, 308235 markings/sec, 70 secs
lola: 26494839 markings, 51971973 edges, 325845 markings/sec, 75 secs
lola: 28063876 markings, 55109444 edges, 313807 markings/sec, 80 secs
lola: 29633969 markings, 58248176 edges, 314019 markings/sec, 85 secs
lola: 31219454 markings, 61416564 edges, 317097 markings/sec, 90 secs
lola: 32775613 markings, 64529928 edges, 311232 markings/sec, 95 secs
lola: 34325476 markings, 67627358 edges, 309973 markings/sec, 100 secs
lola: 35819354 markings, 70615725 edges, 298776 markings/sec, 105 secs
lola: 37414249 markings, 73802363 edges, 318979 markings/sec, 110 secs
lola: 38944397 markings, 76863630 edges, 306030 markings/sec, 115 secs
lola: 40469590 markings, 79910990 edges, 305039 markings/sec, 120 secs
lola: 41954643 markings, 82882858 edges, 297011 markings/sec, 125 secs
lola: 43486295 markings, 85942985 edges, 306330 markings/sec, 130 secs
lola: 44970715 markings, 88912635 edges, 296884 markings/sec, 135 secs
lola: 46466023 markings, 91900181 edges, 299062 markings/sec, 140 secs
lola: 47886227 markings, 94741517 edges, 284041 markings/sec, 145 secs
lola: 49532142 markings, 98030195 edges, 329183 markings/sec, 150 secs
lola: 51154136 markings, 101274271 edges, 324399 markings/sec, 155 secs
lola: 52793897 markings, 104552580 edges, 327952 markings/sec, 160 secs
lola: 54388978 markings, 107739775 edges, 319016 markings/sec, 165 secs
lola: 56033569 markings, 111030656 edges, 328918 markings/sec, 170 secs
lola: 57640779 markings, 114242271 edges, 321442 markings/sec, 175 secs
lola: 59159049 markings, 117279874 edges, 303654 markings/sec, 180 secs
lola: 60669511 markings, 120297006 edges, 302092 markings/sec, 185 secs
lola: 62332763 markings, 123622913 edges, 332650 markings/sec, 190 secs
lola: 63924706 markings, 126806036 edges, 318389 markings/sec, 195 secs
lola: 65466455 markings, 129888787 edges, 308350 markings/sec, 200 secs
lola: 67029529 markings, 133014516 edges, 312615 markings/sec, 205 secs
lola: 68594173 markings, 136142725 edges, 312929 markings/sec, 210 secs
lola: 70141494 markings, 139236145 edges, 309464 markings/sec, 215 secs
lola: 71633545 markings, 142219403 edges, 298410 markings/sec, 220 secs
lola: 73209964 markings, 145371569 edges, 315284 markings/sec, 225 secs
lola: 73587132 markings, 146124952 edges, 75434 markings/sec, 230 secs
lola: 73589440 markings, 146129263 edges, 462 markings/sec, 235 secs
lola: local time limit reached - aborting
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((a_cap <= da) U (3 <= a)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((a_cap <= da) U (3 <= a)))))
lola: processed formula: A (X (X (((a_cap <= da) U (3 <= a)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 29 unused bits
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: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((a <= mr)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((a <= mr)))
lola: processed formula: A (X ((a <= mr)))
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 30 unused bitslola:
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: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (X ((mr_cap <= ma))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (X ((mr_cap <= ma))))))
lola: processed formula: A (F (X (G (X ((mr_cap <= ma))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((r_cap <= a_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((r_cap <= a_cap))))
lola: processed formula: A (F (X ((r_cap <= a_cap))))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= ma_cap) U (c_cap <= ma_cap)) U F ((c <= da_a))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= ma_cap) U (c_cap <= ma_cap)) U F ((c <= da_a))))
lola: processed formula: A ((((2 <= ma_cap) U (c_cap <= ma_cap)) U F ((c <= da_a))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= mr_cap) U F (G ((1 <= c)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= mr_cap) U F (G ((1 <= c)))))
lola: processed formula: A (((2 <= mr_cap) U F (G ((1 <= c)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 30 unused bits
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: 1003 markings, 1004 edges
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= da)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((a_cap <= ma) U (c_cap <= c)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((a_cap <= ma) U (c_cap <= c)))))
lola: processed formula: A (F (G (((a_cap <= ma) U (c_cap <= c)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 30 unused bits
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: 1003 markings, 1004 edges
lola: ========================================
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((mr <= a_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((mr <= a_cap))))
lola: processed formula: A (X (F ((mr <= a_cap))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= da))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= da)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
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: ========================================
lola: subprocess 13 will run for 1094 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((3 <= dr))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (G ((3 <= dr))))))
lola: processed formula: A (X (X (X (G ((3 <= dr))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 29 unused bits
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: ========================================
lola: subprocess 14 will run for 1642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= ma) U (c <= mr)) U (3 <= mr_cap)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= ma) U (c <= mr)) U (3 <= mr_cap)))
lola: processed formula: A ((((2 <= ma) U (c <= mr)) U (3 <= mr_cap)))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((1 <= r_cap) U (1 <= ma)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((1 <= r_cap) U (1 <= ma)))))
lola: processed formula: A (X (X (((1 <= r_cap) U (1 <= ma)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1004 markings, 1004 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown no yes no yes yes no no no yes no no yes no
FORMULA CircadianClock-PT-001000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-001000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="mcc4mcc-full"
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 mcc4mcc-full"
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 r226-ebro-152732380200143"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;