fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r208-smll-149581172800266
Last Updated
June 27, 2017

About the Execution of LoLA for RobotManipulation-PT-00500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15927.740 299197.00 299798.00 625.00 FFFFT?FFF?FTFTFF 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 RobotManipulation-PT-00500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172800266
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496344841925


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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00500: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ RobotManipulation-PT-00500 @ 3539 seconds
----- Start make result stdout -----
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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00500-LTLCardinality.task
lola: A ((3 <= p_m)) : A (X (((2 <= moved) U G ((1 <= r_moving))))) : A (F (G (((p_sc <= initialized) U (1 <= p_m))))) : A (F (G ((2 <= r_active)))) : A (F (X (G ((moved <= p_i1))))) : A (X (((2 <= p_rdy) U F ((3 <= p_i1))))) : A (((p_rdy <= p_sc) U (2 <= p_rdy))) : A (F (X (X ((r_moving <= moved))))) : A ((G (F ((2 <= access))) U X (X ((access <= p_rel))))) : A (G ((X ((initialize <= initialized)) U G ((1 <= r_stopped))))) : A ((F (G ((moved <= p_i1))) U F (F ((3 <= move))))) : A (G (X (G (F ((off <= initialized)))))) : A ((((2 <= p_rel) U (2 <= p_i1)) U (p_i2 <= r_stopped))) : A (F (G ((2 <= r_active)))) : A ((F (G ((initialize <= r_active))) U F (G ((3 <= p_sc))))) : A (X ((F ((initialized <= r_active)) U (p_i2 <= off))))
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 <= p_m))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p_m)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= moved) U G ((1 <= r_moving)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((2 <= moved) U G ((1 <= r_moving)))))
lola: processed formula: A (X (((2 <= moved) U G ((1 <= r_moving)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((p_sc <= initialized) U (1 <= p_m)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((p_sc <= initialized) U (1 <= p_m)))))
lola: processed formula: A (F (G (((p_sc <= initialized) U (1 <= p_m)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= r_active))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= r_active))))
lola: processed formula: A (F (G ((2 <= r_active))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 3665410 markings, 4947705 edges, 733082 markings/sec, 0 secs
lola: 7305190 markings, 9867958 edges, 727956 markings/sec, 5 secs
lola: 10856916 markings, 14672061 edges, 710345 markings/sec, 10 secs
lola: 14399119 markings, 19462543 edges, 708441 markings/sec, 15 secs
lola: 17881759 markings, 24173579 edges, 696528 markings/sec, 20 secs
lola: 21366895 markings, 28888379 edges, 697027 markings/sec, 25 secs
lola: 24815379 markings, 33553176 edges, 689697 markings/sec, 30 secs
lola: 28243962 markings, 38191467 edges, 685717 markings/sec, 35 secs
lola: 31588578 markings, 42717237 edges, 668923 markings/sec, 40 secs
lola: 34968818 markings, 47290239 edges, 676048 markings/sec, 45 secs
lola: 38295742 markings, 51793001 edges, 665385 markings/sec, 50 secs
lola: 41655069 markings, 56337258 edges, 671865 markings/sec, 55 secs
lola: 44998290 markings, 60860746 edges, 668644 markings/sec, 60 secs
lola: 48282815 markings, 65306714 edges, 656905 markings/sec, 65 secs
lola: 51583246 markings, 69774785 edges, 660086 markings/sec, 70 secs
lola: 54836839 markings, 74178187 edges, 650719 markings/sec, 75 secs
lola: 58201020 markings, 78727776 edges, 672836 markings/sec, 80 secs
lola: 61498001 markings, 83190386 edges, 659396 markings/sec, 85 secs
lola: 64770184 markings, 87617998 edges, 654437 markings/sec, 90 secs
lola: 68034638 markings, 92036408 edges, 652891 markings/sec, 95 secs
lola: 71321277 markings, 96484371 edges, 657328 markings/sec, 100 secs
lola: 74612154 markings, 100937275 edges, 658175 markings/sec, 105 secs
lola: 77922809 markings, 105416237 edges, 662131 markings/sec, 110 secs
lola: 81183190 markings, 109829491 edges, 652076 markings/sec, 115 secs
lola: 84429773 markings, 114224625 edges, 649317 markings/sec, 120 secs
lola: 87690428 markings, 118637747 edges, 652131 markings/sec, 125 secs
lola: 90947798 markings, 123046425 edges, 651474 markings/sec, 130 secs
lola: 94205751 markings, 127455768 edges, 651591 markings/sec, 135 secs
lola: 97456751 markings, 131856784 edges, 650200 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G ((moved <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (G ((moved <= p_i1)))))
lola: processed formula: A (F (X (G ((moved <= p_i1)))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p_rdy) U F ((3 <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((2 <= p_rdy) U F ((3 <= p_i1)))))
lola: processed formula: A (X (((2 <= p_rdy) U F ((3 <= p_i1)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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 6 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p_rdy <= p_sc) U (2 <= p_rdy)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p_rdy <= p_sc) U (2 <= p_rdy)))
lola: processed formula: A (((p_rdy <= p_sc) U (2 <= p_rdy)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X ((r_moving <= moved)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X ((r_moving <= moved)))))
lola: processed formula: A (F (X (X ((r_moving <= moved)))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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 8 will run for 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((2 <= access))) U X (X ((access <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((2 <= access))) U X (X ((access <= p_rel)))))
lola: processed formula: A ((G (F ((2 <= access))) U X (X ((access <= p_rel)))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 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 9 will run for 484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((initialize <= initialized)) U G ((1 <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((initialize <= initialized)) U G ((1 <= r_stopped)))))
lola: processed formula: A (G ((X ((initialize <= initialized)) U G ((1 <= r_stopped)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 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 10 will run for 565 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((moved <= p_i1))) U F (F ((3 <= move)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((moved <= p_i1))) U F ((3 <= move))))
lola: processed formula: A ((F (G ((moved <= p_i1))) U F ((3 <= move))))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 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 11 will run for 678 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (F ((off <= initialized))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (F ((off <= initialized))))))
lola: processed formula: A (G (X (G (F ((off <= initialized))))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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 847 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p_rel) U (2 <= p_i1)) U (p_i2 <= r_stopped)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p_rel) U (2 <= p_i1)) U (p_i2 <= r_stopped)))
lola: processed formula: A ((((2 <= p_rel) U (2 <= p_i1)) U (p_i2 <= r_stopped)))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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 1130 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= r_active))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= r_active))))
lola: processed formula: A (F (G ((2 <= r_active))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 3797112 markings, 5125769 edges, 759422 markings/sec, 0 secs
lola: 7346204 markings, 9923407 edges, 709818 markings/sec, 5 secs
lola: 10815769 markings, 14616451 edges, 693913 markings/sec, 10 secs
lola: 14281908 markings, 19303857 edges, 693228 markings/sec, 15 secs
lola: 17677641 markings, 23897609 edges, 679147 markings/sec, 20 secs
lola: 21082572 markings, 28503981 edges, 680986 markings/sec, 25 secs
lola: 24471728 markings, 33088051 edges, 677831 markings/sec, 30 secs
lola: 27820236 markings, 37618429 edges, 669702 markings/sec, 35 secs
lola: 31126434 markings, 42092292 edges, 661240 markings/sec, 40 secs
lola: 34453216 markings, 46592281 edges, 665356 markings/sec, 45 secs
lola: 37706301 markings, 50995560 edges, 650617 markings/sec, 50 secs
lola: 41002458 markings, 55453779 edges, 659231 markings/sec, 55 secs
lola: 44265779 markings, 59869595 edges, 652664 markings/sec, 60 secs
lola: 47512724 markings, 64263887 edges, 649389 markings/sec, 65 secs
lola: 50747390 markings, 68642844 edges, 646933 markings/sec, 70 secs
lola: 53950316 markings, 72978000 edges, 640585 markings/sec, 75 secs
lola: 57226780 markings, 77410205 edges, 655293 markings/sec, 80 secs
lola: 60466210 markings, 81793974 edges, 647886 markings/sec, 85 secs
lola: 63691454 markings, 86158551 edges, 645049 markings/sec, 90 secs
lola: 66903561 markings, 90504854 edges, 642421 markings/sec, 95 secs
lola: 70122759 markings, 94862880 edges, 643840 markings/sec, 100 secs
lola: 73355407 markings, 99237078 edges, 646530 markings/sec, 105 secs
lola: 76583697 markings, 103605483 edges, 645658 markings/sec, 110 secs
lola: 79826786 markings, 107992568 edges, 648618 markings/sec, 115 secs
lola: 83016674 markings, 112312042 edges, 637978 markings/sec, 120 secs
lola: 86183365 markings, 116598877 edges, 633338 markings/sec, 125 secs
lola: 89386135 markings, 120932914 edges, 640554 markings/sec, 130 secs
lola: 92565261 markings, 125236103 edges, 635825 markings/sec, 135 secs
lola: 95779277 markings, 129585805 edges, 642803 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1620 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((initialize <= r_active))) U F (G ((3 <= p_sc)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((initialize <= r_active))) U F (G ((3 <= p_sc)))))
lola: processed formula: A ((F (G ((initialize <= r_active))) U F (G ((3 <= p_sc)))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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 15 will run for 3241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((initialized <= r_active)) U (p_i2 <= off))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((initialized <= r_active)) U (p_i2 <= off))))
lola: processed formula: A (X ((F ((initialized <= r_active)) U (p_i2 <= off))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: ========================================
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: no no no unknown no yes no yes no no no no yes unknown no no
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496345141122

--------------------
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="RobotManipulation-PT-00500"
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/RobotManipulation-PT-00500.tgz
mv RobotManipulation-PT-00500 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 RobotManipulation-PT-00500, 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 r208-smll-149581172800266"
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 ;