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

About the Execution of LoLA for S_CircadianClock-PT-010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15936.720 350295.00 351413.00 285.20 ?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 S_CircadianClock-PT-010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074700599
=====================================================================


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


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


checking for too many tokens
===========================================================================================
S_CircadianClock-PT-010000: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_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: 3227070 markings, 6441045 edges, 645414 markings/sec, 0 secs
lola: 6543528 markings, 13070253 edges, 663292 markings/sec, 5 secs
lola: 9892657 markings, 19774139 edges, 669826 markings/sec, 10 secs
lola: 13323136 markings, 26628738 edges, 686096 markings/sec, 15 secs
lola: 16951576 markings, 33893875 edges, 725688 markings/sec, 20 secs
lola: 20410286 markings, 40809834 edges, 691742 markings/sec, 25 secs
lola: 23830603 markings, 47650612 edges, 684063 markings/sec, 30 secs
lola: 27344091 markings, 54670902 edges, 702698 markings/sec, 35 secs
lola: 30882043 markings, 61746672 edges, 707590 markings/sec, 40 secs
lola: 34446247 markings, 68877013 edges, 712841 markings/sec, 45 secs
lola: 38056085 markings, 76101790 edges, 721968 markings/sec, 50 secs
lola: 41557011 markings, 83103242 edges, 700185 markings/sec, 55 secs
lola: 45113410 markings, 90217970 edges, 711280 markings/sec, 60 secs
lola: 48795925 markings, 97583241 edges, 736503 markings/sec, 65 secs
lola: 52146858 markings, 104277963 edges, 670187 markings/sec, 70 secs
lola: 55471020 markings, 110930282 edges, 664832 markings/sec, 75 secs
lola: 58888979 markings, 117763987 edges, 683592 markings/sec, 80 secs
lola: 62219401 markings, 124428730 edges, 666084 markings/sec, 85 secs
lola: 65570353 markings, 131127776 edges, 670190 markings/sec, 90 secs
lola: 69119848 markings, 138230212 edges, 709899 markings/sec, 95 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: 5579802 markings, 8360080 edges, 1115960 markings/sec, 0 secs
lola: 10655448 markings, 15975980 edges, 1015129 markings/sec, 5 secs
lola: 16081157 markings, 24121508 edges, 1085142 markings/sec, 10 secs
lola: 21559344 markings, 32337610 edges, 1095637 markings/sec, 15 secs
lola: 27146552 markings, 40711746 edges, 1117442 markings/sec, 20 secs
lola: 32526298 markings, 48787924 edges, 1075949 markings/sec, 25 secs
lola: 37712786 markings, 56563686 edges, 1037298 markings/sec, 30 secs
lola: 42931711 markings, 64393857 edges, 1043785 markings/sec, 35 secs
lola: 48217570 markings, 72319980 edges, 1057172 markings/sec, 40 secs
lola: 53446345 markings, 80169016 edges, 1045755 markings/sec, 45 secs
lola: 58390140 markings, 87577357 edges, 988759 markings/sec, 50 secs
lola: 63530637 markings, 95293813 edges, 1028099 markings/sec, 55 secs
lola: 68805452 markings, 103207464 edges, 1054963 markings/sec, 60 secs
lola: 73723010 markings, 110582331 edges, 983512 markings/sec, 65 secs
lola: 78323712 markings, 117483505 edges, 920140 markings/sec, 70 secs
lola: 82816348 markings, 124220488 edges, 898527 markings/sec, 75 secs
lola: 87992069 markings, 131979736 edges, 1035144 markings/sec, 80 secs
lola: 92779512 markings, 139164150 edges, 957489 markings/sec, 85 secs
lola: 97151032 markings, 145717203 edges, 874304 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 278 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 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= da_a))
lola: ========================================
lola: SUBTASK
lola: ========================================
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: 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 334 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 371 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 417 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 477 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 556 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 668 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 835 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 1113 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 1670 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: 4053744 markings, 8058946 edges, 810749 markings/sec, 0 secs
lola: 8101678 markings, 16162728 edges, 809587 markings/sec, 5 secs
lola: 12016715 markings, 23991704 edges, 783007 markings/sec, 10 secs
lola: 15823664 markings, 31597050 edges, 761390 markings/sec, 15 secs
lola: 19423043 markings, 38795382 edges, 719876 markings/sec, 20 secs
lola: 23031200 markings, 46013465 edges, 721631 markings/sec, 25 secs
lola: 26752446 markings, 53461106 edges, 744249 markings/sec, 30 secs
lola: 30210088 markings, 60371893 edges, 691528 markings/sec, 35 secs
lola: 33455332 markings, 66866983 edges, 649049 markings/sec, 40 secs
lola: 36857224 markings, 73664217 edges, 680378 markings/sec, 45 secs
lola: 40070906 markings, 80091527 edges, 642736 markings/sec, 50 secs
lola: 43612606 markings, 87180088 edges, 708340 markings/sec, 55 secs
lola: 47356236 markings, 94662974 edges, 748726 markings/sec, 60 secs
lola: 51134539 markings, 102223875 edges, 755661 markings/sec, 65 secs
lola: 54971352 markings, 109896415 edges, 767363 markings/sec, 70 secs
lola: 58537978 markings, 117024993 edges, 713325 markings/sec, 75 secs
lola: 61672989 markings, 123294593 edges, 627002 markings/sec, 80 secs
lola: 65143785 markings, 130243627 edges, 694159 markings/sec, 85 secs
lola: 68661920 markings, 137279165 edges, 703627 markings/sec, 90 secs
lola: 71785663 markings, 143527353 edges, 624749 markings/sec, 95 secs
lola: 74799971 markings, 149549319 edges, 602862 markings/sec, 100 secs
lola: 77658276 markings, 155265039 edges, 571661 markings/sec, 105 secs
lola: 80700175 markings, 161348285 edges, 608380 markings/sec, 110 secs
lola: 84081264 markings, 168111534 edges, 676218 markings/sec, 115 secs
lola: 87589658 markings, 175125155 edges, 701679 markings/sec, 120 secs
lola: 91055511 markings, 182063067 edges, 693171 markings/sec, 125 secs
lola: 94646404 markings, 189242304 edges, 718179 markings/sec, 130 secs
lola: 98177999 markings, 196308131 edges, 706319 markings/sec, 135 secs
lola: 101564064 markings, 203079570 edges, 677213 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3190 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:
SUMMARY: unknown yes yes unknown no no no no yes yes yes no yes no unknown no
lola: ========================================
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 1496356597635

--------------------
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="S_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/S_CircadianClock-PT-010000.tgz
mv S_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 S_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 r088-csrt-149441074700599"
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 ;