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_HouseConstruction-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600608
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496401562117


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


checking for too many tokens
===========================================================================================
S_HouseConstruction-PT-050: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_HouseConstruction-PT-050 @ 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: 44/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from HouseConstruction-PT-050-LTLCardinality.task
lola: A (X (X (X (G ((1 <= p25)))))) : A (G (G (F (G ((p10 <= p12)))))) : A ((G (X ((2 <= p6))) U F (G ((3 <= p1))))) : A (F (X (((p1 <= p27) U (p10 <= p4))))) : A (F ((G ((2 <= p6)) U X ((3 <= p1))))) : A ((p18 <= p1)) : A (F (X (((1 <= p8) U (p26 <= p27))))) : A ((X (X ((p23 <= p25))) U G (X ((1 <= p26))))) : A (F ((p5 <= p19))) : A (X (G (F ((p1 <= p9))))) : A ((G (G ((3 <= p8))) U ((1 <= p20) U (p20 <= p15)))) : A (X ((p19 <= p10))) : A ((p15 <= p12)) : A ((3 <= p16)) : A (((p10 <= p23) U ((3 <= p25) U (p5 <= p2)))) : A (X (F (X ((2 <= p7)))))
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 (X (X (X (G ((1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((1 <= p25))))))
lola: processed formula: A (X (X (X (G ((1 <= p25))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G ((p10 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p10 <= p12))))
lola: processed formula: A (F (G ((p10 <= p12))))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((2 <= p6))) U F (G ((3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((2 <= p6))) U F (G ((3 <= p1)))))
lola: processed formula: A ((G (X ((2 <= p6))) U F (G ((3 <= p1)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 (F (X (((p1 <= p27) U (p10 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((p1 <= p27) U (p10 <= p4)))))
lola: processed formula: A (F (X (((p1 <= p27) U (p10 <= p4)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= p6)) U X ((3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((2 <= p6)) U X ((3 <= p1)))))
lola: processed formula: A (F ((G ((2 <= p6)) U X ((3 <= p1)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p18 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 <= p1)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((1 <= p8) U (p26 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((1 <= p8) U (p26 <= p27)))))
lola: processed formula: A (F (X (((1 <= p8) U (p26 <= p27)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p23 <= p25))) U G (X ((1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((p23 <= p25))) U G (X ((1 <= p26)))))
lola: processed formula: A ((X (X ((p23 <= p25))) U G (X ((1 <= p26)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p5 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p5 <= p19)))
lola: processed formula: A (F ((p5 <= p19)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F ((p1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (F ((p1 <= p9)))))
lola: processed formula: A (X (G (F ((p1 <= p9)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 2370706 markings, 5260597 edges, 474141 markings/sec, 0 secs
lola: 4103715 markings, 9467925 edges, 346602 markings/sec, 5 secs
lola: 5492014 markings, 12979895 edges, 277660 markings/sec, 10 secs
lola: 7287533 markings, 17422581 edges, 359104 markings/sec, 15 secs
lola: 8884086 markings, 21434391 edges, 319311 markings/sec, 20 secs
lola: 10631598 markings, 25716067 edges, 349502 markings/sec, 25 secs
lola: 12082138 markings, 29578716 edges, 290108 markings/sec, 30 secs
lola: 13494262 markings, 33516193 edges, 282425 markings/sec, 35 secs
lola: 14892961 markings, 37528043 edges, 279740 markings/sec, 40 secs
lola: 16276435 markings, 41097063 edges, 276695 markings/sec, 45 secs
lola: 17536975 markings, 44342158 edges, 252108 markings/sec, 50 secs
lola: 19294270 markings, 48750636 edges, 351459 markings/sec, 55 secs
lola: 20898736 markings, 53038426 edges, 320893 markings/sec, 60 secs
lola: 22353937 markings, 57024013 edges, 291040 markings/sec, 65 secs
lola: 23987634 markings, 61168400 edges, 326739 markings/sec, 70 secs
lola: 25730620 markings, 65413288 edges, 348597 markings/sec, 75 secs
lola: 27146611 markings, 69174935 edges, 283198 markings/sec, 80 secs
lola: 28373824 markings, 72442901 edges, 245443 markings/sec, 85 secs
lola: 29671498 markings, 76141401 edges, 259535 markings/sec, 90 secs
lola: 30779121 markings, 79313336 edges, 221525 markings/sec, 95 secs
lola: 31930988 markings, 82393855 edges, 230373 markings/sec, 100 secs
lola: 32879659 markings, 85112857 edges, 189734 markings/sec, 105 secs
lola: 33777229 markings, 87777159 edges, 179514 markings/sec, 110 secs
lola: 35317948 markings, 92096664 edges, 308144 markings/sec, 115 secs
lola: 36342310 markings, 95200203 edges, 204872 markings/sec, 120 secs
lola: 37567279 markings, 98926831 edges, 244994 markings/sec, 125 secs
lola: 38732320 markings, 102448774 edges, 233008 markings/sec, 130 secs
lola: 40003365 markings, 106061123 edges, 254209 markings/sec, 135 secs
lola: 41335035 markings, 109549210 edges, 266334 markings/sec, 140 secs
lola: 42526100 markings, 112613236 edges, 238213 markings/sec, 145 secs
lola: 43815811 markings, 116001833 edges, 257942 markings/sec, 150 secs
lola: 44970079 markings, 119222317 edges, 230854 markings/sec, 155 secs
lola: 46771911 markings, 123698075 edges, 360366 markings/sec, 160 secs
lola: 48240083 markings, 127677342 edges, 293634 markings/sec, 165 secs
lola: 49690930 markings, 131657890 edges, 290169 markings/sec, 170 secs
lola: 51121573 markings, 135637915 edges, 286129 markings/sec, 175 secs
lola: 52418482 markings, 139264528 edges, 259382 markings/sec, 180 secs
lola: 53794417 markings, 143118866 edges, 275187 markings/sec, 185 secs
lola: 55131122 markings, 146780511 edges, 267341 markings/sec, 190 secs
lola: 56517391 markings, 150337862 edges, 277254 markings/sec, 195 secs
lola: 57959699 markings, 154187683 edges, 288462 markings/sec, 200 secs
lola: 59720830 markings, 158443415 edges, 352226 markings/sec, 205 secs
lola: 60983284 markings, 161762522 edges, 252491 markings/sec, 210 secs
lola: 62244103 markings, 165235592 edges, 252164 markings/sec, 215 secs
lola: 63269770 markings, 168256070 edges, 205133 markings/sec, 220 secs
lola: 64377586 markings, 171355266 edges, 221563 markings/sec, 225 secs
lola: 65477818 markings, 174312756 edges, 220046 markings/sec, 230 secs
lola: 66382805 markings, 176958114 edges, 180997 markings/sec, 235 secs
lola: 67553880 markings, 180236523 edges, 234215 markings/sec, 240 secs
lola: 68755222 markings, 183709953 edges, 240268 markings/sec, 245 secs
lola: 69693233 markings, 186571215 edges, 187602 markings/sec, 250 secs
lola: 70622356 markings, 189381193 edges, 185825 markings/sec, 255 secs
lola: 71535188 markings, 192265535 edges, 182566 markings/sec, 260 secs
lola: 72679783 markings, 195480173 edges, 228919 markings/sec, 265 secs
lola: 73706029 markings, 198521963 edges, 205249 markings/sec, 270 secs
lola: 74845996 markings, 201546802 edges, 227993 markings/sec, 275 secs
lola: 75765271 markings, 204240979 edges, 183855 markings/sec, 280 secs
lola: 76705684 markings, 206953825 edges, 188083 markings/sec, 285 secs
lola: 77523272 markings, 209560442 edges, 163518 markings/sec, 290 secs
lola: 78396233 markings, 212207458 edges, 174592 markings/sec, 295 secs
lola: 79806646 markings, 216183005 edges, 282083 markings/sec, 300 secs
lola: 81061132 markings, 219874797 edges, 250897 markings/sec, 305 secs
lola: 82189978 markings, 223314042 edges, 225769 markings/sec, 310 secs
lola: 83215596 markings, 226558831 edges, 205124 markings/sec, 315 secs
lola: 84290731 markings, 229874219 edges, 215027 markings/sec, 320 secs
lola: 85210861 markings, 232887281 edges, 184026 markings/sec, 325 secs
lola: 86322142 markings, 236200862 edges, 222256 markings/sec, 330 secs
lola: 87246259 markings, 239177295 edges, 184823 markings/sec, 335 secs
lola: 88307026 markings, 242416505 edges, 212153 markings/sec, 340 secs
lola: 89515360 markings, 245862714 edges, 241667 markings/sec, 345 secs
lola: 90582198 markings, 249021025 edges, 213368 markings/sec, 350 secs
lola: 91653183 markings, 252106271 edges, 214197 markings/sec, 355 secs
lola: 92766292 markings, 254771741 edges, 222622 markings/sec, 360 secs
lola: 93729882 markings, 257340985 edges, 192718 markings/sec, 365 secs
lola: 94806682 markings, 260201956 edges, 215360 markings/sec, 370 secs
lola: 95765131 markings, 262846103 edges, 191690 markings/sec, 375 secs
lola: 96943176 markings, 265957444 edges, 235609 markings/sec, 380 secs
lola: 97954465 markings, 268892945 edges, 202258 markings/sec, 385 secs
lola: 99002980 markings, 271839120 edges, 209703 markings/sec, 390 secs
lola: 100397749 markings, 275402862 edges, 278954 markings/sec, 395 secs
lola: 101897968 markings, 279327739 edges, 300044 markings/sec, 400 secs
lola: 101900062 markings, 279333266 edges, 419 markings/sec, 405 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 521 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((3 <= p8))) U ((1 <= p20) U (p20 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((3 <= p8))) U ((1 <= p20) U (p20 <= p15))))
lola: processed formula: A ((G (G ((3 <= p8))) U ((1 <= p20) U (p20 <= p15))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: subprocess 11 will run for 625 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p19 <= p10)))
lola: ========================================
lola: lola: SUBTASK
========================================
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p19 <= p10)))
lola: processed formula: A (X ((p19 <= p10)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 12 will run for 782 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p15 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 <= p12)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-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 13 will run for 1042 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p16)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1564 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p10 <= p23) U ((3 <= p25) U (p5 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p10 <= p23) U ((3 <= p25) U (p5 <= p2))))
lola: processed formula: A (((p10 <= p23) U ((3 <= p25) U (p5 <= p2))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 15 will run for 3128 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((2 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((2 <= p7)))))
lola: processed formula: A (X (F (X ((2 <= p7)))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 yes yes yes yes no yes unknown yes yes yes no yes no
FORMULA HouseConstruction-PT-050-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496401974830

--------------------
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_HouseConstruction-PT-050"
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_HouseConstruction-PT-050.tgz
mv S_HouseConstruction-PT-050 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_HouseConstruction-PT-050, 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 r108-blw3-149441612600608"
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 ;