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 S_Solitaire-PT-SqrNC5x5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464000113
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496561575178


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


checking for too many tokens
===========================================================================================
S_Solitaire-PT-SqrNC5x5: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_Solitaire-PT-SqrNC5x5 @ 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: 134/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 50 places, 84 transitions, 25 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 168 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: A ((F (X ((F24 <= T65))) U F ((F46 <= F25)))) : A (F (G ((1 <= T22)))) : A (((2 <= T62) U ((F32 <= F44) U (1 <= F64)))) : A (X (F (X ((T42 <= F36))))) : A ((X (G ((T42 <= F65))) U (1 <= T36))) : A (X (F (((2 <= T65) U (F54 <= F22))))) : A ((X ((2 <= F54)) U G (G ((T22 <= T46))))) : A (X (X ((2 <= F33)))) : A (X (X (((T35 <= T32) U (2 <= F66))))) : A (X (F (F (F ((1 <= F66)))))) : A (G (X (X (G ((2 <= F66)))))) : A (F ((2 <= T24))) : A (G ((2 <= T25))) : A (G ((3 <= F54))) : A ((T42 <= F63)) : A (F (X (G (X ((3 <= F33))))))
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 ((F24 <= T65))) U F ((F46 <= F25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X ((F24 <= T65))) U F ((F46 <= F25))))
lola: processed formula: A ((F (X ((F24 <= T65))) U F ((F46 <= F25))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 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 (F (G ((1 <= T22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= T22))))
lola: processed formula: A (F (G ((1 <= T22))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= T62) U ((F32 <= F44) U (1 <= F64))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= T62) U ((F32 <= F44) U (1 <= F64))))
lola: processed formula: A (((2 <= T62) U ((F32 <= F44) U (1 <= F64))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((T42 <= F36)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((T42 <= F36)))))
lola: processed formula: A (X (F (X ((T42 <= F36)))))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 896258 markings, 2276596 edges, 179252 markings/sec, 0 secs
lola: 1594735 markings, 4456761 edges, 139695 markings/sec, 5 secs
lola: 2239015 markings, 6641652 edges, 128856 markings/sec, 10 secs
lola: 2803927 markings, 8835062 edges, 112982 markings/sec, 15 secs
lola: 3358616 markings, 10999746 edges, 110938 markings/sec, 20 secs
lola: 3865470 markings, 13138764 edges, 101371 markings/sec, 25 secs
lola: 4305823 markings, 15229175 edges, 88071 markings/sec, 30 secs
lola: 4810963 markings, 17314588 edges, 101028 markings/sec, 35 secs
lola: 5351798 markings, 19423383 edges, 108167 markings/sec, 40 secs
lola: 5810923 markings, 21499522 edges, 91825 markings/sec, 45 secs
lola: 6219090 markings, 23526615 edges, 81633 markings/sec, 50 secs
lola: 6589532 markings, 25499606 edges, 74088 markings/sec, 55 secs
lola: 7051365 markings, 27600707 edges, 92367 markings/sec, 60 secs
lola: 7461361 markings, 29759037 edges, 81999 markings/sec, 65 secs
lola: 7840994 markings, 31827856 edges, 75927 markings/sec, 70 secs
lola: 8247300 markings, 33932941 edges, 81261 markings/sec, 75 secs
lola: 8672923 markings, 35993934 edges, 85125 markings/sec, 80 secs
lola: 9067536 markings, 38037644 edges, 78923 markings/sec, 85 secs
lola: 9438620 markings, 40096721 edges, 74217 markings/sec, 90 secs
lola: 9758127 markings, 42100276 edges, 63901 markings/sec, 95 secs
lola: 10063580 markings, 44088364 edges, 61091 markings/sec, 100 secs
lola: 10373208 markings, 46151711 edges, 61926 markings/sec, 105 secs
lola: 10674392 markings, 48229245 edges, 60237 markings/sec, 110 secs
lola: 10956854 markings, 50146691 edges, 56492 markings/sec, 115 secs
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 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((T42 <= F65))) U (1 <= T36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((T42 <= F65))) U (1 <= T36)))
lola: processed formula: A ((X (G ((T42 <= F65))) U (1 <= T36)))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((2 <= T65) U (F54 <= F22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((2 <= T65) U (F54 <= F22)))))
lola: processed formula: A (X (F (((2 <= T65) U (F54 <= F22)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((2 <= F54)) U G (G ((T22 <= T46)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((2 <= F54)) U G (G ((T22 <= T46)))))
lola: processed formula: A ((X ((2 <= F54)) U G (G ((T22 <= T46)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 7 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((2 <= F33))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((2 <= F33))))
lola: processed formula: A (X (X ((2 <= F33))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((T35 <= T32) U (2 <= F66)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((T35 <= T32) U (2 <= F66)))))
lola: processed formula: A (X (X (((T35 <= T32) U (2 <= F66)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 9 will run for 488 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (F ((1 <= F66))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= F66))))
lola: processed formula: A (X (F ((1 <= F66))))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 10 will run for 569 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X (G ((2 <= F66))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (X (G ((2 <= F66))))))
lola: processed formula: A (G (X (X (G ((2 <= F66))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 11 will run for 683 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= T24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((2 <= T24)))
lola: processed formula: A (F ((2 <= T24)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 12 will run for 854 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= T25)))
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 100 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 13 will run for 1139 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= F54)))
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 100 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 1709 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((T42 <= F63))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (T42 <= F63)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-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 3419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (X ((3 <= F33))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (G (X ((3 <= F33))))))
lola: processed formula: A (F (X (G (X ((3 <= F33))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: yes no no yes yes no no no no no no no no no no no
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496561696738

--------------------
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_Solitaire-PT-SqrNC5x5"
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_Solitaire-PT-SqrNC5x5.tgz
mv S_Solitaire-PT-SqrNC5x5 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 S_Solitaire-PT-SqrNC5x5, 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 r158-ebro-149443464000113"
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 ;