fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r188-blw3-149581034400149
Last Updated
June 27, 2017

About the Execution of LoLA for FlexibleBarrier-PT-20a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4187.770 105731.00 105229.00 82.60 FTFFFFFTFTTTTFFT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is FlexibleBarrier-PT-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034400149
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496497014924


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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-20a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ FlexibleBarrier-PT-20a @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1307/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 243 places, 1064 transitions, 221 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 744 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-20a-LTLCardinality.task
lola: A (X ((1 <= p2))) : A ((((p3 <= p218) U (3 <= p233)) U ((2 <= p188) U (p109 <= p119)))) : A (G ((X ((p36 <= p152)) U G ((2 <= p109))))) : A (F (F ((p116 <= p236)))) : A ((((3 <= p234) U (p74 <= p186)) U F ((p71 <= p192)))) : A ((F (X ((1 <= p100))) U ((3 <= p197) U (p78 <= p121)))) : A (F (X (X (F ((p19 <= p99)))))) : A (X (G (X (F ((2 <= p111)))))) : A (G (F (X ((p15 <= p73))))) : A (X (F (F (X ((p125 <= p222)))))) : A (G ((p76 <= p189))) : A (F (F (F ((1 <= p18))))) : A ((3 <= p93)) : A (F (((2 <= p83) U G ((2 <= p147))))) : A (G (F (X (G ((p16 <= p104)))))) : A ((p2 <= p205))
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 ((1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= p2)))
lola: processed formula: A (X ((1 <= p2)))
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 1 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 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p3 <= p218) U (3 <= p233)) U ((2 <= p188) U (p109 <= p119))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p3 <= p218) U (3 <= p233)) U ((2 <= p188) U (p109 <= p119))))
lola: processed formula: A ((((p3 <= p218) U (3 <= p233)) U ((2 <= p188) U (p109 <= p119))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 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 ((p36 <= p152)) U G ((2 <= p109)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((p36 <= p152)) U G ((2 <= p109)))))
lola: processed formula: A (G ((X ((p36 <= p152)) U G ((2 <= p109)))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 31 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 (F ((p116 <= p236))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p116 <= p236)))
lola: processed formula: A (F ((p116 <= p236)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 2 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p234) U (p74 <= p186)) U F ((p71 <= p192))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= p234) U (p74 <= p186)) U F ((p71 <= p192))))
lola: processed formula: A ((((3 <= p234) U (p74 <= p186)) U F ((p71 <= p192))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 2 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 ((F (X ((1 <= p100))) U ((3 <= p197) U (p78 <= p121))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X ((1 <= p100))) U ((3 <= p197) U (p78 <= p121))))
lola: processed formula: A ((F (X ((1 <= p100))) U ((3 <= p197) U (p78 <= p121))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (F ((p19 <= p99))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (F ((p19 <= p99))))))
lola: processed formula: A (F (X (X (F ((p19 <= p99))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 1 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 (G (X (F ((2 <= p111))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (X (F ((2 <= p111))))))
lola: processed formula: A (X (G (X (F ((2 <= p111))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 1 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 (G (F (X ((p15 <= p73)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X ((p15 <= p73)))))
lola: processed formula: A (G (F (X ((p15 <= p73)))))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (X ((p125 <= p222))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((p125 <= p222)))))
lola: processed formula: A (X (F (X ((p125 <= p222)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 1 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 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p76 <= p189)))
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 3 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F ((1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= p18)))
lola: processed formula: A (F ((1 <= p18)))
lola: processed formula length: 18
lola: 2 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 2 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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p93))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p93)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p83) U G ((2 <= p147)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= p83) U G ((2 <= p147)))))
lola: processed formula: A (F (((2 <= p83) U G ((2 <= p147)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-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 1 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (G ((p16 <= p104))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (G ((p16 <= p104))))))
lola: processed formula: A (G (F (X (G ((p16 <= p104))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 894800 markings, 2405736 edges, 178960 markings/sec, 0 secs
lola: 1687108 markings, 4637817 edges, 158462 markings/sec, 5 secs
lola: 2482037 markings, 6892994 edges, 158986 markings/sec, 10 secs
lola: 3374399 markings, 9318517 edges, 178472 markings/sec, 15 secs
lola: 4043174 markings, 11350263 edges, 133755 markings/sec, 20 secs
lola: 4731359 markings, 13428810 edges, 137637 markings/sec, 25 secs
lola: 5370119 markings, 15404173 edges, 127752 markings/sec, 30 secs
lola: 5952257 markings, 17254920 edges, 116428 markings/sec, 35 secs
lola: 6512655 markings, 19066956 edges, 112080 markings/sec, 40 secs
lola: 7096686 markings, 20921436 edges, 116806 markings/sec, 45 secs
lola: 7724694 markings, 22859611 edges, 125602 markings/sec, 50 secs
lola: 8289127 markings, 24718410 edges, 112887 markings/sec, 55 secs
lola: 8827209 markings, 26482165 edges, 107616 markings/sec, 60 secs
lola: 9390046 markings, 28231521 edges, 112567 markings/sec, 65 secs
lola: 9990989 markings, 30105486 edges, 120189 markings/sec, 70 secs
lola: 10568352 markings, 31957896 edges, 115473 markings/sec, 75 secs
lola: 11104684 markings, 33719944 edges, 107266 markings/sec, 80 secs
lola: 11686197 markings, 35589244 edges, 116303 markings/sec, 85 secs
lola: 12223093 markings, 37381601 edges, 107379 markings/sec, 90 secs
lola: 12786704 markings, 39216533 edges, 112722 markings/sec, 95 secs
lola: 13287968 markings, 40894451 edges, 100253 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: subprocess 15 will run for 3434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p2 <= p205))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 <= p205)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: RESULT
lola:
SUMMARY: no yes no yes yes yes yes no no yes no no no no no yes
lola: ========================================
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496497120655

--------------------
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="FlexibleBarrier-PT-20a"
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/FlexibleBarrier-PT-20a.tgz
mv FlexibleBarrier-PT-20a 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 FlexibleBarrier-PT-20a, 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 r188-blw3-149581034400149"
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 ;