fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r018-ebro-149436309100302
Last Updated
June 27, 2017

About the Execution of LoLA for DES-PT-40a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2682.640 355044.00 356946.00 132.70 TTFTFTFFFTFF?FFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is DES-PT-40a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309100302
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494630529430


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ DES-PT-40a @ 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: 505/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 274 places, 231 transitions, 215 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 256 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-40a-LTLCardinality.task
lola: A ((((p186 <= p11) U (1 <= p120)) U F (X ((p257 <= p254))))) : A ((p59 <= p239)) : A ((F (X ((p0 <= p29))) U F (F ((3 <= p72))))) : A ((p52 <= p265)) : A ((1 <= p241)) : A ((3 <= p77)) : A (X (G ((p59 <= p180)))) : A (F (G (X (F ((2 <= p234)))))) : A (G ((p78 <= p63))) : A ((p233 <= p272)) : A (F (F (G (F ((p30 <= p241)))))) : A (F ((F ((p105 <= p30)) U (p270 <= p216)))) : A (X (G ((p200 <= p4)))) : A ((((p225 <= p41) U (3 <= p34)) U (p67 <= p9))) : A ((1 <= p143)) : A (G (X (G (G ((2 <= p39))))))
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 ((((p186 <= p11) U (1 <= p120)) U F (X ((p257 <= p254)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p186 <= p11) U (1 <= p120)) U F (X ((p257 <= p254)))))
lola: processed formula: A ((((p186 <= p11) U (1 <= p120)) U F (X ((p257 <= p254)))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p59 <= p239))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p59 <= p239)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-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 ((F (X ((p0 <= p29))) U F (F ((3 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X ((p0 <= p29))) U F ((3 <= p72))))
lola: processed formula: A ((F (X ((p0 <= p29))) U F ((3 <= p72))))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 ((p52 <= p265))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p52 <= p265)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p241))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p241)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p77))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p77)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-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 (X (G ((p59 <= p180))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p59 <= p180))))
lola: processed formula: A (X (G ((p59 <= p180))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 346153 markings, 2332285 edges, 69231 markings/sec, 0 secs
lola: 632404 markings, 4533207 edges, 57250 markings/sec, 5 secs
lola: 895596 markings, 6709879 edges, 52638 markings/sec, 10 secs
lola: 1160081 markings, 8898284 edges, 52897 markings/sec, 15 secs
lola: 1408935 markings, 11073218 edges, 49771 markings/sec, 20 secs
lola: 1644709 markings, 13270267 edges, 47155 markings/sec, 25 secs
lola: 1873377 markings, 15466482 edges, 45734 markings/sec, 30 secs
lola: 2082980 markings, 17712198 edges, 41921 markings/sec, 35 secs
lola: 2323757 markings, 19937138 edges, 48155 markings/sec, 40 secs
lola: 2578593 markings, 22172412 edges, 50967 markings/sec, 45 secs
lola: 2825713 markings, 24402925 edges, 49424 markings/sec, 50 secs
lola: 3105752 markings, 26632008 edges, 56008 markings/sec, 55 secs
lola: 3384167 markings, 28843688 edges, 55683 markings/sec, 60 secs
lola: 3657904 markings, 31043220 edges, 54747 markings/sec, 65 secs
lola: 3905390 markings, 33115188 edges, 49497 markings/sec, 70 secs
lola: 4131211 markings, 35173155 edges, 45164 markings/sec, 75 secs
lola: 4400791 markings, 37204309 edges, 53916 markings/sec, 80 secs
lola: 4654326 markings, 39238934 edges, 50707 markings/sec, 85 secs
lola: 4941967 markings, 41446585 edges, 57528 markings/sec, 90 secs
lola: 5190737 markings, 43589306 edges, 49754 markings/sec, 95 secs
lola: 5417165 markings, 45735012 edges, 45286 markings/sec, 100 secs
lola: 5652555 markings, 47896219 edges, 47078 markings/sec, 105 secs
lola: 5883707 markings, 50025916 edges, 46230 markings/sec, 110 secs
lola: 6095863 markings, 52120202 edges, 42431 markings/sec, 115 secs
lola: 6302965 markings, 54244176 edges, 41420 markings/sec, 120 secs
lola: 6501124 markings, 56334031 edges, 39632 markings/sec, 125 secs
lola: 6691838 markings, 58512960 edges, 38143 markings/sec, 130 secs
lola: 6893148 markings, 60692020 edges, 40262 markings/sec, 135 secs
lola: 7102643 markings, 62812966 edges, 41899 markings/sec, 140 secs
lola: 7325336 markings, 64996474 edges, 44539 markings/sec, 145 secs
lola: 7541721 markings, 67147413 edges, 43277 markings/sec, 150 secs
lola: 7790658 markings, 69308683 edges, 49787 markings/sec, 155 secs
lola: 8032844 markings, 71477372 edges, 48437 markings/sec, 160 secs
lola: 8267288 markings, 73564677 edges, 46889 markings/sec, 165 secs
lola: 8493492 markings, 75657953 edges, 45241 markings/sec, 170 secs
lola: 8696658 markings, 77716056 edges, 40633 markings/sec, 175 secs
lola: 8919187 markings, 79710692 edges, 44506 markings/sec, 180 secs
lola: 9135481 markings, 81674017 edges, 43259 markings/sec, 185 secs
lola: 9363502 markings, 83682740 edges, 45604 markings/sec, 190 secs
lola: 9654929 markings, 85886199 edges, 58285 markings/sec, 195 secs
lola: 9918213 markings, 87997528 edges, 52657 markings/sec, 200 secs
lola: 10135474 markings, 90097548 edges, 43452 markings/sec, 205 secs
lola: 10297724 markings, 92268439 edges, 32450 markings/sec, 210 secs
lola: 10523219 markings, 94368391 edges, 45099 markings/sec, 215 secs
lola: 10757709 markings, 96434685 edges, 46898 markings/sec, 220 secs
lola: 10944449 markings, 98516922 edges, 37348 markings/sec, 225 secs
lola: 11091430 markings, 100638174 edges, 29396 markings/sec, 230 secs
lola: 11267379 markings, 102734561 edges, 35190 markings/sec, 235 secs
lola: 11438745 markings, 104925929 edges, 34273 markings/sec, 240 secs
lola: 11640087 markings, 107022557 edges, 40268 markings/sec, 245 secs
lola: 11855477 markings, 109218726 edges, 43078 markings/sec, 250 secs
lola: 12055906 markings, 111408244 edges, 40086 markings/sec, 255 secs
lola: 12271366 markings, 113487688 edges, 43092 markings/sec, 260 secs
lola: 12522493 markings, 115690109 edges, 50225 markings/sec, 265 secs
lola: 12755639 markings, 117836405 edges, 46629 markings/sec, 270 secs
lola: 12979061 markings, 119929885 edges, 44684 markings/sec, 275 secs
lola: 13191936 markings, 121973756 edges, 42575 markings/sec, 280 secs
lola: 13386528 markings, 124012722 edges, 38918 markings/sec, 285 secs
lola: 13606583 markings, 126034087 edges, 44011 markings/sec, 290 secs
lola: 13804444 markings, 128034260 edges, 39572 markings/sec, 295 secs
lola: 14051119 markings, 130090007 edges, 49335 markings/sec, 300 secs
lola: 14305632 markings, 132325952 edges, 50903 markings/sec, 305 secs
lola: 14543251 markings, 134414828 edges, 47524 markings/sec, 310 secs
lola: 14731099 markings, 136680685 edges, 37570 markings/sec, 315 secs
lola: 14897693 markings, 138969199 edges, 33319 markings/sec, 320 secs
lola: 15055457 markings, 141164120 edges, 31553 markings/sec, 325 secs
lola: 15242915 markings, 143335499 edges, 37492 markings/sec, 330 secs
lola: 15490053 markings, 145542074 edges, 49428 markings/sec, 335 secs
lola: 15727986 markings, 147672723 edges, 47587 markings/sec, 340 secs
lola: 15930786 markings, 149793627 edges, 40560 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 (F (G (X (F ((2 <= p234))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (F ((2 <= p234))))))
lola: processed formula: A (F (G (X (F ((2 <= p234))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 (G ((p78 <= p63)))
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 28 bytes per marking, with 9 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 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p233 <= p272))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p233 <= p272)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (F ((p30 <= p241))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p30 <= p241))))
lola: processed formula: A (G (F ((p30 <= p241))))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 11 will run for 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p105 <= p30)) U (p270 <= p216))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((p105 <= p30)) U (p270 <= p216))))
lola: processed formula: A (F ((F ((p105 <= p30)) U (p270 <= p216))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 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 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p200 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p200 <= p4))))
lola: processed formula: A (X (G ((p200 <= p4))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 13 will run for 1061 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p225 <= p41) U (3 <= p34)) U (p67 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p225 <= p41) U (3 <= p34)) U (p67 <= p9)))
lola: processed formula: A ((((p225 <= p41) U (3 <= p34)) U (p67 <= p9)))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 14 will run for 1592 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p143))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p143)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-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 15 will run for 3185 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (G ((2 <= p39))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (G ((2 <= p39))))))
lola: processed formula: A (G (X (G (G ((2 <= p39))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 274 places; total mentions: 0
lola: closed formula file DES-PT-40a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: RESULT
lola:
SUMMARY: yes yes no yes no no unknown no no yes no yes no yes no no
FORMULA DES-PT-40a-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-40a-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494630884474

--------------------
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="DES-PT-40a"
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/DES-PT-40a.tgz
mv DES-PT-40a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is DES-PT-40a, 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 r018-ebro-149436309100302"
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 ;