fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r008-csrt-149436126500599
Last Updated
June 27, 2017

About the Execution of LoLA for CircadianClock-PT-010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15940.470 377528.00 369040.00 2229.80 ?TTFTF?FT?FFFFTT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is CircadianClock-PT-010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500599
=====================================================================


--------------------
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-010000-LTLCardinality-0
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-1
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-10
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-11
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-12
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-13
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-14
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-15
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-2
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-3
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-4
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-5
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-6
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-7
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-8
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494621771805


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ CircadianClock-PT-010000 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 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-010000-LTLCardinality.task
lola: A (G (G (G (F ((1 <= mr_cap)))))) : A ((3 <= a_cap)) : A ((3 <= c_cap)) : A ((X (G ((dr_a <= da_a))) U G (X ((da <= ma_cap))))) : A (G (F (G (F ((c_cap <= da_a)))))) : A ((1 <= da_a)) : A ((3 <= dr_a)) : A (X (X (F (G ((1 <= r)))))) : A ((2 <= c_cap)) : A ((mr <= mr_cap)) : A (F (X ((c <= mr)))) : A (G (X (G (F ((1 <= a)))))) : A ((F (F ((3 <= ma_cap))) U ((r <= ma_cap) U (1 <= dr)))) : A ((ma_cap <= ma)) : A (G (X (X ((mr <= mr_cap))))) : A (F (G (G (G ((ma_cap <= r))))))
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 (G (G (G (F ((1 <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (G (F ((1 <= mr_cap))))))
lola: processed formula: A (G (G (G (F ((1 <= mr_cap))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: the resulting Büchi 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: 3249326 markings, 6487811 edges, 649865 markings/sec, 0 secs
lola: 6437304 markings, 12858266 edges, 637596 markings/sec, 5 secs
lola: 10021202 markings, 20023101 edges, 716780 markings/sec, 10 secs
lola: 13430465 markings, 26850719 edges, 681853 markings/sec, 15 secs
lola: 16845344 markings, 33675185 edges, 682976 markings/sec, 20 secs
lola: 20141938 markings, 40264956 edges, 659319 markings/sec, 25 secs
lola: 23505325 markings, 46994795 edges, 672677 markings/sec, 30 secs
lola: 27019937 markings, 54023987 edges, 702922 markings/sec, 35 secs
lola: 30569763 markings, 61127757 edges, 709965 markings/sec, 40 secs
lola: 34148616 markings, 68284135 edges, 715771 markings/sec, 45 secs
lola: 37724921 markings, 75432873 edges, 715261 markings/sec, 50 secs
lola: 41196481 markings, 82382657 edges, 694312 markings/sec, 55 secs
lola: 44574431 markings, 89141061 edges, 675590 markings/sec, 60 secs
lola: 48061065 markings, 96108270 edges, 697327 markings/sec, 65 secs
lola: 51631467 markings, 103251814 edges, 714080 markings/sec, 70 secs
lola: 55212130 markings, 110413624 edges, 716133 markings/sec, 75 secs
lola: 58866006 markings, 117715070 edges, 730775 markings/sec, 80 secs
lola: 62372177 markings, 124733407 edges, 701234 markings/sec, 85 secs
lola: 65926016 markings, 131835901 edges, 710768 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= a_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= a_cap)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= c_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= c_cap)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((dr_a <= da_a))) U G (X ((da <= ma_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((dr_a <= da_a))) U G (X ((da <= ma_cap)))))
lola: processed formula: A ((X (G ((dr_a <= da_a))) U G (X ((da <= ma_cap)))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5378543 markings, 8058810 edges, 1075709 markings/sec, 0 secs
lola: 10825915 markings, 16231286 edges, 1089474 markings/sec, 5 secs
lola: 16073460 markings, 24106116 edges, 1049509 markings/sec, 10 secs
lola: 21286230 markings, 31927294 edges, 1042554 markings/sec, 15 secs
lola: 26557065 markings, 39832801 edges, 1054167 markings/sec, 20 secs
lola: 31511108 markings, 47260637 edges, 990809 markings/sec, 25 secs
lola: 36704500 markings, 55047164 edges, 1038678 markings/sec, 30 secs
lola: 41807355 markings, 62709445 edges, 1020571 markings/sec, 35 secs
lola: 46532725 markings, 69795051 edges, 945074 markings/sec, 40 secs
lola: 51073944 markings, 76605332 edges, 908244 markings/sec, 45 secs
lola: 55549432 markings, 83316083 edges, 895098 markings/sec, 50 secs
lola: 59754183 markings, 89625376 edges, 840950 markings/sec, 55 secs
lola: 64531044 markings, 96794270 edges, 955372 markings/sec, 60 secs
lola: 69312181 markings, 103960894 edges, 956227 markings/sec, 65 secs
lola: 74361483 markings, 111539247 edges, 1009860 markings/sec, 70 secs
lola: 79254410 markings, 118878372 edges, 978585 markings/sec, 75 secs
lola: 84237421 markings, 126350629 edges, 996602 markings/sec, 80 secs
lola: 89149304 markings, 133714150 edges, 982377 markings/sec, 85 secs
lola: 93806617 markings, 140708543 edges, 931463 markings/sec, 90 secs
lola: 98413049 markings, 147617969 edges, 921286 markings/sec, 95 secs
lola: 98818902 markings, 148223842 edges, 81171 markings/sec, 100 secs
lola: 98819156 markings, 148224096 edges, 51 markings/sec, 105 secs
lola: 98830864 markings, 148236783 edges, 2342 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (F ((c_cap <= da_a))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (F ((c_cap <= da_a)))))
lola: processed formula: A (G (G (F ((c_cap <= da_a)))))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: the resulting Büchi 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: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= da_a))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= 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-010000-LTLCardinality.task
lola: ========================================
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: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= dr_a))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= dr_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-010000-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: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (G ((1 <= r))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (G ((1 <= r))))))
lola: processed formula: A (X (X (F (G ((1 <= r))))))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: the resulting Büchi 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: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= c_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= c_cap)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((mr <= mr_cap))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (mr <= mr_cap)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((c <= mr))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((c <= mr))))
lola: processed formula: A (F (X ((c <= mr))))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: the resulting Büchi 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: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (F ((1 <= a))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (F ((1 <= a))))))
lola: processed formula: A (G (X (G (F ((1 <= a))))))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: the resulting Büchi 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: ========================================
lola: subprocess 12 will run for 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((3 <= ma_cap))) U ((r <= ma_cap) U (1 <= dr))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= ma_cap)) U ((r <= ma_cap) U (1 <= dr))))
lola: processed formula: A ((F ((3 <= ma_cap)) U ((r <= ma_cap) U (1 <= dr))))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: the resulting Büchi 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: ========================================
lola: subprocess 13 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((ma_cap <= ma))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ma_cap <= ma)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-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: ========================================
lola: subprocess 14 will run for 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X ((mr <= mr_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (X ((mr <= mr_cap)))))
lola: processed formula: A (G (X (X ((mr <= mr_cap)))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: the resulting Büchi 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: 4155123 markings, 8263709 edges, 831025 markings/sec, 0 secs
lola: 8248637 markings, 16453810 edges, 818703 markings/sec, 5 secs
lola: 12163322 markings, 24281556 edges, 782937 markings/sec, 10 secs
lola: 15919095 markings, 31791765 edges, 751155 markings/sec, 15 secs
lola: 19611973 markings, 39180464 edges, 738576 markings/sec, 20 secs
lola: 23488596 markings, 46929451 edges, 775325 markings/sec, 25 secs
lola: 27130536 markings, 54216666 edges, 728388 markings/sec, 30 secs
lola: 30568469 markings, 61091758 edges, 687587 markings/sec, 35 secs
lola: 34062812 markings, 68074065 edges, 698869 markings/sec, 40 secs
lola: 37525416 markings, 75004366 edges, 692521 markings/sec, 45 secs
lola: 40859949 markings, 81668886 edges, 666907 markings/sec, 50 secs
lola: 44652814 markings, 89260478 edges, 758573 markings/sec, 55 secs
lola: 48314819 markings, 96579712 edges, 732401 markings/sec, 60 secs
lola: 51802080 markings, 103557340 edges, 697452 markings/sec, 65 secs
lola: 55335974 markings, 110621567 edges, 706779 markings/sec, 70 secs
lola: 58592800 markings, 117140930 edges, 651365 markings/sec, 75 secs
lola: 61926937 markings, 123805959 edges, 666827 markings/sec, 80 secs
lola: 65421341 markings, 130790708 edges, 698881 markings/sec, 85 secs
lola: 68812051 markings, 137576947 edges, 678142 markings/sec, 90 secs
lola: 72031469 markings, 144018266 edges, 643884 markings/sec, 95 secs
lola: 75264712 markings, 150476360 edges, 646649 markings/sec, 100 secs
lola: 78229629 markings, 156405792 edges, 592983 markings/sec, 105 secs
lola: 81038331 markings, 162025161 edges, 561740 markings/sec, 110 secs
lola: 84289360 markings, 168529268 edges, 650206 markings/sec, 115 secs
lola: 87508712 markings, 174963054 edges, 643870 markings/sec, 120 secs
lola: 90691302 markings, 181332507 edges, 636518 markings/sec, 125 secs
lola: 93885952 markings, 187723066 edges, 638930 markings/sec, 130 secs
lola: 97016050 markings, 193980657 edges, 626020 markings/sec, 135 secs
lola: 99986526 markings, 199918917 edges, 594095 markings/sec, 140 secs
lola: 103014484 markings, 205977769 edges, 605592 markings/sec, 145 secs
lola: 103774899 markings, 207500734 edges, 152083 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3162 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (G ((ma_cap <= r))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (G ((ma_cap <= r))))))
lola: processed formula: A (F (G (G (G ((ma_cap <= r))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: the resulting Büchi 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: RESULT
lola: lola: ========================================
SUMMARY: unknown yes yes unknown no no no no yes yes yes no yes no unknown no

FORMULA CircadianClock-PT-010000-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494622149333

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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-010000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-010000.tgz
mv CircadianClock-PT-010000 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is CircadianClock-PT-010000, 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 r008-csrt-149436126500599"
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 ;