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

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


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


checking for too many tokens
===========================================================================================
S_ResAllocation-PT-R003C050: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_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 604 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 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 604 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 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 604 bytes per marking, with 29 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 604 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
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 604 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: 533475 markings, 3831744 edges, 106695 markings/sec, 0 secs
lola: 1003443 markings, 7651104 edges, 93994 markings/sec, 5 secs
lola: 1477305 markings, 11420572 edges, 94772 markings/sec, 10 secs
lola: 1887941 markings, 15002957 edges, 82127 markings/sec, 15 secs
lola: 2306645 markings, 18519419 edges, 83741 markings/sec, 20 secs
lola: 2627437 markings, 21702904 edges, 64158 markings/sec, 25 secs
lola: 3013434 markings, 25097755 edges, 77199 markings/sec, 30 secs
lola: 3411064 markings, 28459886 edges, 79526 markings/sec, 35 secs
lola: 3758282 markings, 31807896 edges, 69444 markings/sec, 40 secs
lola: 4156778 markings, 35318547 edges, 79699 markings/sec, 45 secs
lola: 4512394 markings, 38800344 edges, 71123 markings/sec, 50 secs
lola: 4871901 markings, 42202634 edges, 71901 markings/sec, 55 secs
lola: 5199542 markings, 45499600 edges, 65528 markings/sec, 60 secs
lola: 5541075 markings, 48823803 edges, 68307 markings/sec, 65 secs
lola: 5994667 markings, 52352186 edges, 90718 markings/sec, 70 secs
lola: 6365599 markings, 55581185 edges, 74186 markings/sec, 75 secs
lola: 6709479 markings, 58633789 edges, 68776 markings/sec, 80 secs
lola: 7047941 markings, 61825576 edges, 67692 markings/sec, 85 secs
lola: 7458767 markings, 65154242 edges, 82165 markings/sec, 90 secs
lola: 7822986 markings, 68365873 edges, 72844 markings/sec, 95 secs
lola: 8163355 markings, 71525731 edges, 68074 markings/sec, 100 secs
lola: 8507509 markings, 74753972 edges, 68831 markings/sec, 105 secs
lola: 8807433 markings, 77823132 edges, 59985 markings/sec, 110 secs
lola: 9099378 markings, 80781371 edges, 58389 markings/sec, 115 secs
lola: 9432129 markings, 83954325 edges, 66550 markings/sec, 120 secs
lola: 9709319 markings, 86928925 edges, 55438 markings/sec, 125 secs
lola: 10069708 markings, 90226862 edges, 72078 markings/sec, 130 secs
lola: 10498415 markings, 93726153 edges, 85741 markings/sec, 135 secs
lola: 10889366 markings, 96995705 edges, 78190 markings/sec, 140 secs
lola: 11232505 markings, 100179205 edges, 68628 markings/sec, 145 secs
lola: 11565263 markings, 103380249 edges, 66552 markings/sec, 150 secs
lola: 11877417 markings, 106551426 edges, 62431 markings/sec, 155 secs
lola: 12222561 markings, 109621704 edges, 69029 markings/sec, 160 secs
lola: 12597843 markings, 112747208 edges, 75056 markings/sec, 165 secs
lola: 12969003 markings, 115974684 edges, 74232 markings/sec, 170 secs
lola: 13323006 markings, 119090628 edges, 70801 markings/sec, 175 secs
lola: 13612480 markings, 122143676 edges, 57895 markings/sec, 180 secs
lola: 13930922 markings, 125238283 edges, 63688 markings/sec, 185 secs
lola: 14292088 markings, 128207191 edges, 72233 markings/sec, 190 secs
lola: 14540331 markings, 131408872 edges, 49649 markings/sec, 195 secs
lola: 14855151 markings, 134498560 edges, 62964 markings/sec, 200 secs
lola: 15132952 markings, 137497141 edges, 55560 markings/sec, 205 secs
lola: 15426058 markings, 140715495 edges, 58621 markings/sec, 210 secs
lola: 15728733 markings, 143820485 edges, 60535 markings/sec, 215 secs
lola: 16055789 markings, 146931800 edges, 65411 markings/sec, 220 secs
lola: 16243416 markings, 149946191 edges, 37525 markings/sec, 225 secs
lola: 16639862 markings, 153208784 edges, 79289 markings/sec, 230 secs
lola: 17002068 markings, 156315051 edges, 72441 markings/sec, 235 secs
lola: 17302142 markings, 159277470 edges, 60015 markings/sec, 240 secs
lola: 17675381 markings, 162501453 edges, 74648 markings/sec, 245 secs
lola: 17988326 markings, 165498270 edges, 62589 markings/sec, 250 secs
lola: 18303944 markings, 168510522 edges, 63124 markings/sec, 255 secs
lola: 18610401 markings, 171492362 edges, 61291 markings/sec, 260 secs
lola: 18863286 markings, 174340445 edges, 50577 markings/sec, 265 secs
lola: 19187970 markings, 177472630 edges, 64937 markings/sec, 270 secs
lola: 19512278 markings, 180530451 edges, 64862 markings/sec, 275 secs
lola: 19808236 markings, 183527263 edges, 59192 markings/sec, 280 secs
lola: 20090135 markings, 186452483 edges, 56380 markings/sec, 285 secs
lola: 20408257 markings, 189576947 edges, 63624 markings/sec, 290 secs
lola: 20699423 markings, 192681537 edges, 58233 markings/sec, 295 secs
lola: 20990883 markings, 195754639 edges, 58292 markings/sec, 300 secs
lola: 21279440 markings, 198777840 edges, 57711 markings/sec, 305 secs
lola: 21520960 markings, 201727824 edges, 48304 markings/sec, 310 secs
lola: 21852209 markings, 204939167 edges, 66250 markings/sec, 315 secs
lola: 22218029 markings, 208179001 edges, 73164 markings/sec, 320 secs
lola: 22558032 markings, 211453785 edges, 68001 markings/sec, 325 secs
lola: 22877348 markings, 214638018 edges, 63863 markings/sec, 330 secs
lola: 23188311 markings, 217774504 edges, 62193 markings/sec, 335 secs
lola: 23495665 markings, 220838523 edges, 61471 markings/sec, 340 secs
lola: 23842815 markings, 224022064 edges, 69430 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 353 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 604 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 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 604 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 10 will run for 530 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 604 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 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 604 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 13 will run for 1061 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 600 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1592 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 604 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 15 will run for 3185 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 604 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: RESULT
lola:
SUMMARY: no yes no no yes no unknown no no yes no yes no no no no
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 1496440842127

--------------------
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_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/S_ResAllocation-PT-R003C050.tgz
mv S_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 S_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 r148-csrt-149443432800104"
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 ;