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)
....................
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 92K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Solitaire-PT-FrnCT7x7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512500154
=====================================================================

--------------------
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-FrnCT7x7-ReachabilityFireability-00
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-01
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-02
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-03
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-04
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-05
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-06
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-07
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-08
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-09
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-10
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-11
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-12
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-13
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-14
FORMULA_NAME Solitaire-PT-FrnCT7x7-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527261399676

info: Time: 3600 - MCC
===========================================================================================
prep: translating Solitaire-PT-FrnCT7x7 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Solitaire-PT-FrnCT7x7 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Solitaire-PT-FrnCT7x7 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 167/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2400
lola: finding significant places
lola: 75 places, 92 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 93 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(right25) AND NOT FIREABLE(right34) AND NOT FIREABLE(left45) AND FIREABLE(right63) AND FIREABLE(left23)))) : A (G ((FIREABLE(right44) OR (NOT FIREABLE(left63) AND NOT FIREABLE(right33)) OR FIREABLE(up36) OR FIREABLE(down41) OR NOT FIREABLE(down54) OR NOT FIREABLE(right54) OR NOT FIREABLE(right23)))) : E (F ((FIREABLE(down32) AND FIREABLE(left45) AND (FIREABLE(up42) OR FIREABLE(left25))))) : E (F ((FIREABLE(left35) AND FIREABLE(down23) AND FIREABLE(left14) AND FIREABLE(up65)))) : E (F ((NOT FIREABLE(left64) AND NOT FIREABLE(right63) AND FIREABLE(up53) AND FIREABLE(up63) AND FIREABLE(up56) AND FIREABLE(down53) AND (NOT FIREABLE(right74) OR NOT FIREABLE(left53) OR (FIREABLE(left14) AND NOT FIREABLE(right34)))))) : E (F ((FIREABLE(right44) AND FIREABLE(down32) AND FIREABLE(right64) AND FIREABLE(down45) AND NOT FIREABLE(down52) AND (NOT FIREABLE(left33) OR NOT FIREABLE(up41) OR (FIREABLE(left65) AND FIREABLE(up23) AND (FIREABLE(up23) OR FIREABLE(left23))))))) : E (F ((FIREABLE(up64) AND FIREABLE(right54) AND (NOT FIREABLE(down24) OR NOT FIREABLE(down65)) AND FIREABLE(up47) AND FIREABLE(up25)))) : A (G ((FIREABLE(left52) OR FIREABLE(up56) OR NOT FIREABLE(right36) OR (FIREABLE(down45) AND FIREABLE(up53) AND FIREABLE(down52) AND FIREABLE(down41)) OR FIREABLE(down45) OR (FIREABLE(down63) AND FIREABLE(left52)) OR (NOT FIREABLE(down47) AND NOT FIREABLE(up47))))) : A (G (((NOT FIREABLE(up23) OR NOT FIREABLE(right65)) AND FIREABLE(left53) AND (NOT FIREABLE(right32) OR NOT FIREABLE(up64) OR NOT FIREABLE(down34) OR (FIREABLE(down32) AND FIREABLE(left14)))))) : A (G (FIREABLE(up45))) : E (F (FIREABLE(up44))) : E (F ((((FIREABLE(down33) OR FIREABLE(down32) OR FIREABLE(right43) OR FIREABLE(left14)) AND (NOT FIREABLE(up34) OR NOT FIREABLE(right74))) OR FIREABLE(right23)))) : E (F (FIREABLE(down36))) : A (G ((NOT FIREABLE(left64) OR NOT FIREABLE(down41)))) : E (F (((NOT FIREABLE(right56) AND NOT FIREABLE(right45) AND ((FIREABLE(up52) AND FIREABLE(left53)) OR (FIREABLE(right53) AND FIREABLE(down24)))) OR (FIREABLE(down54) AND FIREABLE(left55) AND FIREABLE(right42) AND FIREABLE(up45) AND (FIREABLE(down36) OR FIREABLE(down35) OR (FIREABLE(left56) AND FIREABLE(down46))))))) : E (F ((NOT FIREABLE(left56) AND NOT FIREABLE(down24) AND (NOT FIREABLE(down23) OR NOT FIREABLE(up25)) AND NOT FIREABLE(left63))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(up45)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(up45)))
lola: processed formula length: 22
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(up45)
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(up44)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(up44)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(up44)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-0.sara
lola: The predicate is reachable.
lola: 2 markings, 1 edges

lola: ========================================
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(down36)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(down36)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(down36)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(left64) OR NOT FIREABLE(down41))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(left64) OR NOT FIREABLE(down41))))
lola: processed formula length: 55
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(left64) AND FIREABLE(down41))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(down32) AND FIREABLE(left45) AND (FIREABLE(up42) OR FIREABLE(left25)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(down32) AND FIREABLE(left45) AND (FIREABLE(up42) OR FIREABLE(left25)))))
lola: processed formula length: 89
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(down32) AND FIREABLE(left45) AND (FIREABLE(up42) OR FIREABLE(left25)))
lola: state equation: Generated DNF with 24 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-0.sara.
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left35) AND FIREABLE(down23) AND FIREABLE(left14) AND FIREABLE(up65))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(left35) AND FIREABLE(down23) AND FIREABLE(left14) AND FIREABLE(up65))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(left35) AND FIREABLE(down23) AND FIREABLE(left14) AND FIREABLE(up65))
lola: state equation: Generated DNF with 16 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara

sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(right25) AND NOT FIREABLE(right34) AND NOT FIREABLE(left45) AND FIREABLE(right63) AND FIREABLE(left23))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(right25) AND NOT FIREABLE(right34) AND NOT FIREABLE(left45) AND FIREABLE(right63) AND FIREABLE(left23))))
lola: processed formula length: 125
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(right25) AND NOT FIREABLE(right34) AND NOT FIREABLE(left45) AND FIREABLE(right63) AND FIREABLE(left23))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(left56) AND NOT FIREABLE(down24) AND (NOT FIREABLE(down23) OR NOT FIREABLE(up25)) AND NOT FIREABLE(left63))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(left56) AND NOT FIREABLE(down24) AND (NOT FIREABLE(down23) OR NOT FIREABLE(up25)) AND NOT FIREABLE(left63))))
lola: processed formula length: 130
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(left56) AND NOT FIREABLE(down24) AND (NOT FIREABLE(down23) OR NOT FIREABLE(up25)) AND NOT FIREABLE(left63))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(up64) AND FIREABLE(right54) AND (NOT FIREABLE(down24) OR NOT FIREABLE(down65)) AND FIREABLE(up47) AND FIREABLE(up25))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(up64) AND FIREABLE(right54) AND (NOT FIREABLE(down24) OR NOT FIREABLE(down65)) AND FIREABLE(up47) AND FIREABLE(up25))))
lola: processed formula length: 136
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(up64) AND FIREABLE(right54) AND (NOT FIREABLE(down24) OR NOT FIREABLE(down65)) AND FIREABLE(up47) AND FIREABLE(up25))
lola: state equation: Generated DNF with 102 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23129 markings, 73671 edges
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(down33) OR FIREABLE(down32) OR FIREABLE(right43) OR FIREABLE(left14)) AND (NOT FIREABLE(up34) OR NOT FIREABLE(right74))) OR FIREABLE(right23))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((FIREABLE(down33) OR FIREABLE(down32) OR FIREABLE(right43) OR FIREABLE(left14)) AND (NOT FIREABLE(up34) OR NOT FIREABLE(right74))) OR FIREABLE(right23))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((FIREABLE(down33) OR FIREABLE(down32) OR FIREABLE(right43) OR FIREABLE(left14)) AND (NOT FIREABLE(up34) OR NOT FIREABLE(right74))) OR FIREABLE(right23))
lola: state equation: Generated DNF with 124 literals and 25 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(right44) OR (NOT FIREABLE(left63) AND NOT FIREABLE(right33)) OR FIREABLE(up36) OR FIREABLE(down41) OR NOT FIREABLE(down54) OR NOT FIREABLE(right54) OR NOT FIREABLE(right23))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(right44) OR (NOT FIREABLE(left63) AND NOT FIREABLE(right33)) OR FIREABLE(up36) OR FIREABLE(down41) OR NOT FIREABLE(down54) OR NOT FIREABLE(right54) OR NOT FIREABLE(right23))))
lola: processed formula length: 197
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(right44) AND (FIREABLE(left63) OR FIREABLE(right33)) AND NOT FIREABLE(up36) AND NOT FIREABLE(down41) AND FIREABLE(down54) AND FIREABLE(right54) AND FIREABLE(right23))
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-9-0.sara.
lola: state equation: Generated DNF with 1026 literals and 54 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 553060 markings, 2070779 edges, 110612 markings/sec, 0 secs

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(up23) OR NOT FIREABLE(right65)) AND FIREABLE(left53) AND (NOT FIREABLE(right32) OR NOT FIREABLE(up64) OR NOT FIREABLE(down34) OR (FIREABLE(down32) AND FIREABLE(left14))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(up23) OR NOT FIREABLE(right65)) AND FIREABLE(left53) AND (NOT FIREABLE(right32) OR NOT FIREABLE(up64) OR NOT FIREABLE(down34) OR (FIREABLE(down32) AND FIREABLE(left14))))))
lola: processed formula length: 197
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola:
rewrite Frontend/Parser/formula_rewrite.k:694FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: formula 0: ((FIREABLE(up23) AND FIREABLE(right65)) OR NOT FIREABLE(left53) OR (FIREABLE(right32) AND FIREABLE(up64) AND FIREABLE(down34) AND (NOT FIREABLE(down32) OR NOT FIREABLE(left14))))
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(left64) AND NOT FIREABLE(right63) AND FIREABLE(up53) AND FIREABLE(up63) AND FIREABLE(up56) AND FIREABLE(down53) AND (NOT FIREABLE(right74) OR NOT FIREABLE(left53) OR (FIREABLE(left14) AND NOT FIREABLE(right34))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(left64) AND NOT FIREABLE(right63) AND FIREABLE(up53) AND FIREABLE(up63) AND FIREABLE(up56) AND FIREABLE(down53) AND (NOT FIREABLE(right74) OR NOT FIREABLE(left53) OR (FIREABLE(left14) AND NOT FIREABLE(right34))))))
lola: processed formula length: 236
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(left64) AND NOT FIREABLE(right63) AND FIREABLE(up53) AND FIREABLE(up63) AND FIREABLE(up56) AND FIREABLE(down53) AND (NOT FIREABLE(right74) OR NOT FIREABLE(left53) OR (FIREABLE(left14) AND NOT FIREABLE(right34))))
lola: state equation: Generated DNF with 580 literals and 28 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(left52) OR FIREABLE(up56) OR NOT FIREABLE(right36) OR (FIREABLE(down45) AND FIREABLE(up53) AND FIREABLE(down52) AND FIREABLE(down41)) OR FIREABLE(down45) OR (FIREABLE(down63) AND FIREABLE(left52)) OR (NOT FIREABLE(down47) AND NOT FIREABLE(up47)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(left52) OR FIREABLE(up56) OR NOT FIREABLE(right36) OR (FIREABLE(down45) AND FIREABLE(up53) AND FIREABLE(down52) AND FIREABLE(down41)) OR FIREABLE(down45) OR (FIREABLE(down63) AND FIREABLE(left52)) OR (NOT FIREABLE(down47) AND NOT FIREABLE(up47)))))
lola: processed formula length: 270
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(left52) AND NOT FIREABLE(up56) AND FIREABLE(right36) AND (NOT FIREABLE(down45) OR NOT FIREABLE(up53) OR NOT FIREABLE(down52) OR NOT FIREABLE(down41)) AND NOT FIREABLE(down45) AND (NOT FIREABLE(down63) OR NOT FIREABLE(left52)) AND (FIREABLE(down47) OR FIREABLE(up47)))
lola: state equation: Generated DNF with 30888 literals and 2376 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 536814 markings, 2318277 edges, 107363 markings/sec, 0 secs
lola: sara is running 5 secs || 1054401 markings, 4736447 edges, 103517 markings/sec, 5 secs
sara: warning, failure of lp_solve (at job 7)
lola: sara is running 10 secs || 1544119 markings, 7135826 edges, 97944 markings/sec, 10 secs
lola: sara is running 15 secs || 1997774 markings, 9642400 edges, 90731 markings/sec, 15 secs
lola: sara is running 20 secs || 2501715 markings, 12035708 edges, 100788 markings/sec, 20 secs
lola: sara is running 25 secs || 2978774 markings, 14457257 edges, 95412 markings/sec, 25 secs
lola: sara is running 30 secs || 3399830 markings, 16629075 edges, 84211 markings/sec, 30 secs
lola: sara is running 35 secs || 3846729 markings, 19087002 edges, 89380 markings/sec, 35 secs
lola: sara is running 40 secs || 4277014 markings, 21515642 edges, 86057 markings/sec, 40 secs
lola: sara is running 45 secs || 4755507 markings, 23928087 edges, 95699 markings/sec, 45 secs
lola: sara is running 50 secs || 5195173 markings, 26320437 edges, 87933 markings/sec, 50 secs
lola: sara is running 55 secs || 5630586 markings, 28825367 edges, 87083 markings/sec, 55 secs
lola: sara is running 60 secs || 6068699 markings, 31269677 edges, 87623 markings/sec, 60 secs
lola: sara is running 65 secs || 6516531 markings, 33635840 edges, 89566 markings/sec, 65 secs
lola: sara is running 70 secs || 6997802 markings, 35984032 edges, 96254 markings/sec, 70 secs
lola: sara is running 75 secs || 7473169 markings, 38378290 edges, 95073 markings/sec, 75 secs
lola: sara is running 80 secs || 7936612 markings, 40866736 edges, 92689 markings/sec, 80 secs
lola: sara is running 85 secs || 8382134 markings, 43320489 edges, 89104 markings/sec, 85 secs
lola: sara is running 90 secs || 8804145 markings, 45753908 edges, 84402 markings/sec, 90 secs
lola: sara is running 95 secs || 9245895 markings, 48274534 edges, 88350 markings/sec, 95 secs
lola: sara is running 100 secs || 9675195 markings, 50768937 edges, 85860 markings/sec, 100 secs
lola: sara is running 105 secs || 10112564 markings, 53196232 edges, 87474 markings/sec, 105 secs
lola: sara is running 110 secs || 10537938 markings, 55619927 edges, 85075 markings/sec, 110 secs
lola: sara is running 115 secs || 10958339 markings, 58006822 edges, 84080 markings/sec, 115 secs
lola: sara is running 120 secs || 11339545 markings, 60420015 edges, 76241 markings/sec, 120 secs
lola: sara is running 125 secs || 11784699 markings, 62884564 edges, 89031 markings/sec, 125 secs
lola: sara is running 130 secs || 12245497 markings, 65373885 edges, 92160 markings/sec, 130 secs

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(right44) AND FIREABLE(down32) AND FIREABLE(right64) AND FIREABLE(down45) AND NOT FIREABLE(down52) AND (NOT FIREABLE(left33) OR NOT FIREABLE(up41) OR (FIREABLE(left65) AND FIREABLE(up23) AND (FIREABLE(up23) OR FIREABLE(left23)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(right44) AND FIREABLE(down32) AND FIREABLE(right64) AND FIREABLE(down45) AND NOT FIREABLE(down52) AND (NOT FIREABLE(left33) OR NOT FIREABLE(up41) OR (FIREABLE(left65) AND FIREABLE(up23) AND (FIREABLE(up23) OR FIREABLE(left23)))))))
lola: processed formula length: 250
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(right44) AND FIREABLE(down32) AND FIREABLE(right64) AND FIREABLE(down45) AND NOT FIREABLE(down52) AND (NOT FIREABLE(left33) OR NOT FIREABLE(up41) OR (FIREABLE(left65) AND FIREABLE(up23) AND (FIREABLE(up23) OR FIREABLE(left23)))))
lola: ========================================

FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(right56) AND NOT FIREABLE(right45) AND ((FIREABLE(up52) AND FIREABLE(left53)) OR (FIREABLE(right53) AND FIREABLE(down24)))) OR (FIREABLE(down54) AND FIREABLE(left55) AND FIREABLE(right42) AND FIREABLE(up45) AND (FIREABLE(down36) OR FIREABLE(down35) OR (FIREABLE(left56) AND FIREABLE(down46)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(right56) AND NOT FIREABLE(right45) AND ((FIREABLE(up52) AND FIREABLE(left53)) OR (FIREABLE(right53) AND FIREABLE(down24)))) OR (FIREABLE(down54) AND FIREABLE(left55) AND FIREABLE(right42) AND FIREABLE(up45) AND (FIREABLE(down36) OR FIREABLE(down35) OR (FIREABLE(left56) AND FIREABLE(down46)))))))
lola: processed formula length: 321
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((NOT FIREABLE(right56) AND NOT FIREABLE(right45) AND ((FIREABLE(up52) AND FIREABLE(left53)) OR (FIREABLE(right53) AND FIREABLE(down24)))) OR (FIREABLE(down54) AND FIREABLE(left55) AND FIREABLE(right42) AND FIREABLE(up45) AND (FIREABLE(down36) OR FIREABLE(down35) OR (FIREABLE(left56) AND FIREABLE(down46)))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola:
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes no no no yes yes yes no yes yes
lola:
preliminary result: yes no yes no no yes yes no no no yes yes yes no yes yes
state equation: Generated DNF with 244 literals and 21 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-15-0.sara
lola: ========================================
lola: memory consumption: 14804 KB
lola: time consumption: 142 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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="Solitaire-PT-FrnCT7x7"
export BK_EXAMINATION="ReachabilityFireability"
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/Solitaire-PT-FrnCT7x7.tgz
mv Solitaire-PT-FrnCT7x7 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is Solitaire-PT-FrnCT7x7, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r160-smll-152705512500154"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;