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 ResAllocation-PT-R003C050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r068-csrt-149440963100104
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494802335666


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ ResAllocation-PT-R003C050 @ 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: 500/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 300 places, 200 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 350 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C050-LTLCardinality.task
lola: A (F ((X ((1 <= r_31_1)) U G ((2 <= r_47_0))))) : A ((p_37_0 <= p_47_2)) : A (X (X (F (F ((2 <= r_10_0)))))) : A (G (((r_48_1 <= p_40_2) U G ((2 <= p_25_0))))) : A (F ((G ((3 <= p_34_0)) U (p_19_0 <= r_12_0)))) : A ((2 <= r_8_0)) : A (F (F (G (X ((p_12_2 <= p_25_0)))))) : A (((3 <= r_21_2) U X (X ((1 <= r_6_0))))) : A ((2 <= p_2_2)) : A (F (X ((1 <= r_13_1)))) : A ((G (F ((2 <= p_45_2))) U (3 <= r_22_2))) : A ((1 <= r_12_0)) : A (F ((G ((p_8_0 <= p_21_0)) U X ((r_42_2 <= r_23_2))))) : A (G ((1 <= p_30_2))) : A (F (((1 <= p_43_1) U (r_32_2 <= p_11_1)))) : A (X ((3 <= p_48_1)))
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 (F ((X ((1 <= r_31_1)) U G ((2 <= r_47_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((1 <= r_31_1)) U G ((2 <= r_47_0)))))
lola: processed formula: A (F ((X ((1 <= r_31_1)) U G ((2 <= r_47_0)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p_37_0 <= p_47_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_37_0 <= p_47_2)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (F ((2 <= r_10_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((2 <= r_10_0)))))
lola: processed formula: A (X (X (F ((2 <= r_10_0)))))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((r_48_1 <= p_40_2) U G ((2 <= p_25_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((r_48_1 <= p_40_2) U G ((2 <= p_25_0)))))
lola: processed formula: A (G (((r_48_1 <= p_40_2) U G ((2 <= p_25_0)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((3 <= p_34_0)) U (p_19_0 <= r_12_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((3 <= p_34_0)) U (p_19_0 <= r_12_0))))
lola: processed formula: A (F ((G ((3 <= p_34_0)) U (p_19_0 <= r_12_0))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 9 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= r_8_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= r_8_0)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((p_12_2 <= p_25_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((p_12_2 <= p_25_0)))))
lola: processed formula: A (F (G (X ((p_12_2 <= p_25_0)))))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 634855 markings, 4569627 edges, 126971 markings/sec, 0 secs
lola: 1160024 markings, 8946622 edges, 105034 markings/sec, 5 secs
lola: 1719785 markings, 13469677 edges, 111952 markings/sec, 10 secs
lola: 2228607 markings, 17901404 edges, 101764 markings/sec, 15 secs
lola: 2698276 markings, 22295131 edges, 93934 markings/sec, 20 secs
lola: 3199532 markings, 26685026 edges, 100251 markings/sec, 25 secs
lola: 3655734 markings, 30821788 edges, 91240 markings/sec, 30 secs
lola: 4117358 markings, 34987287 edges, 92325 markings/sec, 35 secs
lola: 4555655 markings, 39179665 edges, 87659 markings/sec, 40 secs
lola: 4982491 markings, 43261219 edges, 85367 markings/sec, 45 secs
lola: 5354988 markings, 47276022 edges, 74499 markings/sec, 50 secs
lola: 5914834 markings, 51669329 edges, 111969 markings/sec, 55 secs
lola: 6396640 markings, 55874839 edges, 96361 markings/sec, 60 secs
lola: 6847659 markings, 59844272 edges, 90204 markings/sec, 65 secs
lola: 7280649 markings, 63807049 edges, 86598 markings/sec, 70 secs
lola: 7792495 markings, 68115858 edges, 102369 markings/sec, 75 secs
lola: 8246167 markings, 72361375 edges, 90734 markings/sec, 80 secs
lola: 8669360 markings, 76375545 edges, 84639 markings/sec, 85 secs
lola: 9049015 markings, 80269526 edges, 75931 markings/sec, 90 secs
lola: 9456226 markings, 84203222 edges, 81442 markings/sec, 95 secs
lola: 9800263 markings, 88093429 edges, 68807 markings/sec, 100 secs
lola: 10333231 markings, 92344669 edges, 106594 markings/sec, 105 secs
lola: 10842219 markings, 96612647 edges, 101798 markings/sec, 110 secs
lola: 11292621 markings, 100849003 edges, 90080 markings/sec, 115 secs
lola: 11752989 markings, 105170570 edges, 92074 markings/sec, 120 secs
lola: 12199977 markings, 109442483 edges, 89398 markings/sec, 125 secs
lola: 12713532 markings, 113778106 edges, 102711 markings/sec, 130 secs
lola: 13215983 markings, 118150752 edges, 100490 markings/sec, 135 secs
lola: 13629365 markings, 122303109 edges, 82676 markings/sec, 140 secs
lola: 14051314 markings, 126369132 edges, 84390 markings/sec, 145 secs
lola: 14430626 markings, 130371127 edges, 75862 markings/sec, 150 secs
lola: 14841519 markings, 134351268 edges, 82179 markings/sec, 155 secs
lola: 15198489 markings, 138267564 edges, 71394 markings/sec, 160 secs
lola: 15576881 markings, 142240053 edges, 75678 markings/sec, 165 secs
lola: 15975775 markings, 146220252 edges, 79779 markings/sec, 170 secs
lola: 16275615 markings, 150172009 edges, 59968 markings/sec, 175 secs
lola: 16749971 markings, 154133271 edges, 94871 markings/sec, 180 secs
lola: 17167901 markings, 157940278 edges, 83586 markings/sec, 185 secs
lola: 17584134 markings, 161665002 edges, 83247 markings/sec, 190 secs
lola: 17987255 markings, 165494600 edges, 80624 markings/sec, 195 secs
lola: 18374992 markings, 169223663 edges, 77547 markings/sec, 200 secs
lola: 18745618 markings, 173002516 edges, 74125 markings/sec, 205 secs
lola: 19118219 markings, 176791673 edges, 74520 markings/sec, 210 secs
lola: 19523973 markings, 180651143 edges, 81151 markings/sec, 215 secs
lola: 19888376 markings, 184412262 edges, 72881 markings/sec, 220 secs
lola: 20267913 markings, 188145674 edges, 75907 markings/sec, 225 secs
lola: 20615727 markings, 191756943 edges, 69563 markings/sec, 230 secs
lola: 20942462 markings, 195255216 edges, 65347 markings/sec, 235 secs
lola: 21296939 markings, 199053072 edges, 70895 markings/sec, 240 secs
lola: 21599791 markings, 202666543 edges, 60570 markings/sec, 245 secs
lola: 22054277 markings, 206658075 edges, 90897 markings/sec, 250 secs
lola: 22475634 markings, 210610072 edges, 84271 markings/sec, 255 secs
lola: 22857810 markings, 214460978 edges, 76435 markings/sec, 260 secs
lola: 23229341 markings, 218219253 edges, 74306 markings/sec, 265 secs
lola: 23638433 markings, 222086917 edges, 81818 markings/sec, 270 secs
lola: 24034770 markings, 225911111 edges, 79267 markings/sec, 275 secs
lola: 24398575 markings, 229730438 edges, 72761 markings/sec, 280 secs
lola: 24779291 markings, 233598534 edges, 76143 markings/sec, 285 secs
lola: 25099851 markings, 237295770 edges, 64112 markings/sec, 290 secs
lola: 25444640 markings, 241005169 edges, 68958 markings/sec, 295 secs
lola: 25782722 markings, 244751930 edges, 67616 markings/sec, 300 secs
lola: 26106196 markings, 248425054 edges, 64695 markings/sec, 305 secs
lola: 26543614 markings, 252372723 edges, 87484 markings/sec, 310 secs
lola: 26979996 markings, 256367551 edges, 87276 markings/sec, 315 secs
lola: 27368869 markings, 260329013 edges, 77775 markings/sec, 320 secs
lola: 27731006 markings, 264260928 edges, 72427 markings/sec, 325 secs
lola: 28095965 markings, 268134980 edges, 72992 markings/sec, 330 secs
lola: 28478583 markings, 272007535 edges, 76524 markings/sec, 335 secs
lola: 28893268 markings, 275939809 edges, 82937 markings/sec, 340 secs
lola: 29310253 markings, 279956802 edges, 83397 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= r_21_2) U X (X ((1 <= r_6_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= r_21_2) U X (X ((1 <= r_6_0)))))
lola: processed formula: A (((3 <= r_21_2) U X (X ((1 <= r_6_0)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_2_2)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-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 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((1 <= r_13_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((1 <= r_13_1))))
lola: processed formula: A (F (X ((1 <= r_13_1))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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 10 will run for 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((2 <= p_45_2))) U (3 <= r_22_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((2 <= p_45_2))) U (3 <= r_22_2)))
lola: processed formula: A ((G (F ((2 <= p_45_2))) U (3 <= r_22_2)))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= r_12_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= r_12_0)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-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 12 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p_8_0 <= p_21_0)) U X ((r_42_2 <= r_23_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((p_8_0 <= p_21_0)) U X ((r_42_2 <= r_23_2)))))
lola: processed formula: A (F ((G ((p_8_0 <= p_21_0)) U X ((r_42_2 <= r_23_2)))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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 13 will run for 1062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p_30_2)))
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 20 bytes per marking, with 10 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: ========================================
lola: subprocess 14 will run for 1593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p_43_1) U (r_32_2 <= p_11_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((1 <= p_43_1) U (r_32_2 <= p_11_1))))
lola: processed formula: A (F (((1 <= p_43_1) U (r_32_2 <= p_11_1))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 9 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 15 will run for 3186 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p_48_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p_48_1)))
lola: processed formula: A (X ((3 <= p_48_1)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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: RESULT
lola:
SUMMARY: no yes no no yes no unknown no no yes no yes no no no no
lola: ========================================
FORMULA ResAllocation-PT-R003C050-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494802690038

--------------------
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="ResAllocation-PT-R003C050"
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/ResAllocation-PT-R003C050.tgz
mv ResAllocation-PT-R003C050 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 ResAllocation-PT-R003C050, 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 r068-csrt-149440963100104"
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 ;