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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464000114
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496561617333


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 LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLFireability @ 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-LTLFireability.task
lola: A (X (G (F ((FIREABLE(right65) U FIREABLE(down54)))))) : A (FIREABLE(right23)) : A ((F (G (G (FIREABLE(down44)))) U (F (FIREABLE(up43)) U X (FIREABLE(left45))))) : A (G (FIREABLE(right24))) : A (G (X ((G (FIREABLE(left36)) U X (FIREABLE(down63)))))) : A (X (F (FIREABLE(up46)))) : A ((G (F (G (FIREABLE(right36)))) U (FIREABLE(left56) U FIREABLE(down36)))) : A (FIREABLE(up64)) : A (X (FIREABLE(right65))) : A (FIREABLE(right43)) : A (F (G ((X (FIREABLE(left34)) U X (FIREABLE(right46)))))) : A ((X (FIREABLE(down56)) U (FIREABLE(right45) U G (FIREABLE(up42))))) : A (FIREABLE(up45)) : A (X (X ((FIREABLE(up55) U X (FIREABLE(left24)))))) : A (((FIREABLE(down52) U F (FIREABLE(left24))) U FIREABLE(right36))) : A (FIREABLE(down44))
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 (G (F ((FIREABLE(right65) U FIREABLE(down54))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (F ((FIREABLE(right65) U FIREABLE(down54))))))
lola: processed formula: A (X (G (F ((FIREABLE(right65) U FIREABLE(down54))))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.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: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(right23))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(right23)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.task
lola: processed formula with 0 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G (G (FIREABLE(down44)))) U (F (FIREABLE(up43)) U X (FIREABLE(left45)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G (G (FIREABLE(down44)))) U (F (FIREABLE(up43)) U X (FIREABLE(left45)))))
lola: processed formula: A ((F (G (G (FIREABLE(down44)))) U (F (FIREABLE(up43)) U X (FIREABLE(left45)))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(right24)))
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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((G (FIREABLE(left36)) U X (FIREABLE(down63))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((G (FIREABLE(left36)) U X (FIREABLE(down63))))))
lola: processed formula: A (G (X ((G (FIREABLE(left36)) U X (FIREABLE(down63))))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.task
lola: the resulting Büchi automaton has 7 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(up46))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(up46))))
lola: processed formula: A (X (F (FIREABLE(up46))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F (G (FIREABLE(right36)))) U (FIREABLE(left56) U FIREABLE(down36))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G (FIREABLE(right36))) U (FIREABLE(left56) U FIREABLE(down36))))
lola: processed formula: A ((F (G (FIREABLE(right36))) U (FIREABLE(left56) U FIREABLE(down36))))
lola: processed formula length: 71
lola: 1 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.task
lola: the resulting Büchi automaton has 5 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: 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(up64))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(up64)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.task
lola: processed formula with 0 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(right65)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(right65)))
lola: processed formula: A (X (FIREABLE(right65)))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.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: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(right43))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(right43)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.task
lola: processed formula with 0 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((X (FIREABLE(left34)) U X (FIREABLE(right46))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((FIREABLE(left34) U FIREABLE(right46))))))
lola: processed formula: A (F (G (X ((FIREABLE(left34) U FIREABLE(right46))))))
lola: processed formula length: 54
lola: 1 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (FIREABLE(down56)) U (FIREABLE(right45) U G (FIREABLE(up42)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (FIREABLE(down56)) U (FIREABLE(right45) U G (FIREABLE(up42)))))
lola: processed formula: A ((X (FIREABLE(down56)) U (FIREABLE(right45) U G (FIREABLE(up42)))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.task
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(up45))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(up45)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.task
lola: processed formula with 0 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 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((FIREABLE(up55) U X (FIREABLE(left24))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((FIREABLE(up55) U X (FIREABLE(left24))))))
lola: processed formula: A (X (X ((FIREABLE(up55) U X (FIREABLE(left24))))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(down52) U F (FIREABLE(left24))) U FIREABLE(right36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(down52) U F (FIREABLE(left24))) U FIREABLE(right36)))
lola: processed formula: A (((FIREABLE(down52) U F (FIREABLE(left24))) U FIREABLE(right36)))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(down44))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(down44)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-LTLFireability.task
lola: processed formula with 0 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: RESULT
lola:
SUMMARY: no no no no no no no yes no no no no no no no no
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496561617784

--------------------
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="LTLFireability"
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 LTLFireability"
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-149443464000114"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;