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 304K
-rw-r--r-- 1 mcc users 3.2K 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.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 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 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 126K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Eratosthenes-PT-100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998000028
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526602327991

info: Time: 3600 - MCC
===========================================================================================
prep: translating Eratosthenes-PT-100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Eratosthenes-PT-100 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Eratosthenes-PT-100 @ 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: 382/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 99
lola: finding significant places
lola: 99 places, 283 transitions, 74 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 332 transition conflict sets
lola: TASK
lola: reading formula from Eratosthenes-PT-100-ReachabilityFireability.task
lola: A (G (((FIREABLE(t64.2) AND FIREABLE(t35.5)) OR NOT FIREABLE(t10.5) OR FIREABLE(t60.15) OR NOT FIREABLE(t14.7) OR NOT FIREABLE(t48.4) OR FIREABLE(t84.21)))) : E (F (((NOT FIREABLE(t90.6) OR NOT FIREABLE(t48.6)) AND NOT FIREABLE(t32.2) AND NOT FIREABLE(t90.2) AND NOT FIREABLE(t65.13) AND (FIREABLE(t30.6) OR NOT FIREABLE(t70.7))))) : A (G ((FIREABLE(t15.3) OR FIREABLE(t40.8) OR NOT FIREABLE(t12.4) OR FIREABLE(t82.2) OR FIREABLE(t45.3)))) : A (G (((FIREABLE(t60.6) AND FIREABLE(t16.2) AND FIREABLE(t88.2)) OR FIREABLE(t78.39) OR ((FIREABLE(t64.8) OR FIREABLE(t78.6) OR (FIREABLE(t84.28) AND FIREABLE(t70.14))) AND FIREABLE(t42.3))))) : A (G ((FIREABLE(t9.3) OR FIREABLE(t78.3) OR (FIREABLE(t60.30) AND FIREABLE(t75.3))))) : E (F ((NOT FIREABLE(t22.2) AND NOT FIREABLE(t96.4) AND (NOT FIREABLE(t10.2) OR NOT FIREABLE(t70.2)) AND (NOT FIREABLE(t63.7) OR NOT FIREABLE(t28.4) OR FIREABLE(t70.10))))) : A (G ((NOT FIREABLE(t96.12) OR FIREABLE(t14.7) OR FIREABLE(t63.7) OR FIREABLE(t66.2)))) : E (F ((NOT FIREABLE(t54.2) AND NOT FIREABLE(t90.3) AND NOT FIREABLE(t84.42) AND NOT FIREABLE(t48.12)))) : A (G (((FIREABLE(t80.5) AND (FIREABLE(t58.2) OR FIREABLE(t64.4))) OR FIREABLE(t56.28) OR (FIREABLE(t68.2) AND FIREABLE(t48.2) AND FIREABLE(t46.2))))) : A (G (((FIREABLE(t92.46) AND FIREABLE(t64.4)) OR NOT FIREABLE(t80.8) OR FIREABLE(t78.39) OR FIREABLE(t30.15) OR FIREABLE(t90.45) OR FIREABLE(t60.20)))) : A (G ((((FIREABLE(t84.3) OR NOT FIREABLE(t84.6)) AND (FIREABLE(t35.7) OR FIREABLE(t81.3) OR FIREABLE(t46.2))) OR NOT FIREABLE(t54.3)))) : E (F ((NOT FIREABLE(t30.2) AND NOT FIREABLE(t100.25) AND NOT FIREABLE(t51.17)))) : E (F ((NOT FIREABLE(t45.3) AND NOT FIREABLE(t4.2) AND NOT FIREABLE(t48.24) AND NOT FIREABLE(t24.2) AND NOT FIREABLE(t92.2) AND NOT FIREABLE(t72.2)))) : E (F ((FIREABLE(t66.22) AND FIREABLE(t88.11) AND NOT FIREABLE(t93.31) AND FIREABLE(t32.4) AND NOT FIREABLE(t66.6) AND FIREABLE(t10.2)))) : E (F (((FIREABLE(t85.17) OR FIREABLE(t72.2)) AND NOT FIREABLE(t90.3) AND FIREABLE(t99.9) AND FIREABLE(t39.3) AND FIREABLE(t66.2) AND FIREABLE(t99.3) AND NOT FIREABLE(t84.28) AND NOT FIREABLE(t42.7) AND FIREABLE(t72.12) AND FIREABLE(t30.2) AND NOT FIREABLE(t51.3)))) : A (G (((FIREABLE(t35.7) OR FIREABLE(t16.4) OR FIREABLE(t84.42) OR (NOT FIREABLE(t85.17) AND NOT FIREABLE(t84.7))) AND ((FIREABLE(t88.44) AND FIREABLE(t72.9) AND FIREABLE(t93.3)) OR ((FIREABLE(t99.3) OR FIREABLE(t66.33)) AND (FIREABLE(t84.14) OR FIREABLE(t90.2)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t30.2) AND NOT FIREABLE(t100.25) AND NOT FIREABLE(t51.17))))
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(t30.2) AND NOT FIREABLE(t100.25) AND NOT FIREABLE(t51.17))))
lola: processed formula length: 80
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t30.2) AND NOT FIREABLE(t100.25) AND NOT FIREABLE(t51.17))
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Eratosthenes-PT-100-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-11 TRUE 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: A (G ((NOT FIREABLE(t96.12) OR FIREABLE(t14.7) OR FIREABLE(t63.7) OR FIREABLE(t66.2))))
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(t96.12) OR FIREABLE(t14.7) OR FIREABLE(t63.7) OR FIREABLE(t66.2))))
lola: processed formula length: 90
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t96.12) AND NOT FIREABLE(t14.7) AND NOT FIREABLE(t63.7) AND NOT FIREABLE(t66.2))
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges

FORMULA Eratosthenes-PT-100-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t54.2) AND NOT FIREABLE(t90.3) AND NOT FIREABLE(t84.42) AND NOT FIREABLE(t48.12))))
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(t54.2) AND NOT FIREABLE(t90.3) AND NOT FIREABLE(t84.42) AND NOT FIREABLE(t48.12))))
lola: processed formula length: 103
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t54.2) AND NOT FIREABLE(t90.3) AND NOT FIREABLE(t84.42) AND NOT FIREABLE(t48.12))
lola: state equation: Generated DNF with 64 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-7 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 ((FIREABLE(t9.3) OR FIREABLE(t78.3) OR (FIREABLE(t60.30) AND FIREABLE(t75.3)))))
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(t9.3) OR FIREABLE(t78.3) OR (FIREABLE(t60.30) AND FIREABLE(t75.3)))))
lola: processed formula length: 87
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t9.3) AND NOT FIREABLE(t78.3) AND (NOT FIREABLE(t60.30) OR NOT FIREABLE(t75.3)))
lola: state equation: Generated DNF with 48 literals and 16 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-3-0.sara
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-4 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: A (G ((FIREABLE(t15.3) OR FIREABLE(t40.8) OR NOT FIREABLE(t12.4) OR FIREABLE(t82.2) OR FIREABLE(t45.3))))
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(t15.3) OR FIREABLE(t40.8) OR NOT FIREABLE(t12.4) OR FIREABLE(t82.2) OR FIREABLE(t45.3))))
lola: processed formula length: 109
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t15.3) AND NOT FIREABLE(t40.8) AND FIREABLE(t12.4) AND NOT FIREABLE(t82.2) AND NOT FIREABLE(t45.3))
lola: state equation: Generated DNF with 96 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 73 markings, 72 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t84.3) OR NOT FIREABLE(t84.6)) AND (FIREABLE(t35.7) OR FIREABLE(t81.3) OR FIREABLE(t46.2))) OR NOT FIREABLE(t54.3))))
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(t84.3) OR NOT FIREABLE(t84.6)) AND (FIREABLE(t35.7) OR FIREABLE(t81.3) OR FIREABLE(t46.2))) OR NOT FIREABLE(t54.3))))
lola: processed formula length: 139
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t84.3) AND FIREABLE(t84.6)) OR (NOT FIREABLE(t35.7) AND NOT FIREABLE(t81.3) AND NOT FIREABLE(t46.2))) AND FIREABLE(t54.3))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50 markings, 49 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-10 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(t45.3) AND NOT FIREABLE(t4.2) AND NOT FIREABLE(t48.24) AND NOT FIREABLE(t24.2) AND NOT FIREABLE(t92.2) AND NOT FIREABLE(t72.2))))
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(t45.3) AND NOT FIREABLE(t4.2) AND NOT FIREABLE(t48.24) AND NOT FIREABLE(t24.2) AND NOT FIREABLE(t92.2) AND NOT FIREABLE(t72.2))))
lola: processed formula length: 149
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t45.3) AND NOT FIREABLE(t4.2) AND NOT FIREABLE(t48.24) AND NOT FIREABLE(t24.2) AND NOT FIREABLE(t92.2) AND NOT FIREABLE(t72.2))
lola: state equation: Generated DNF with 384 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 51 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-12 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 ((FIREABLE(t66.22) AND FIREABLE(t88.11) AND NOT FIREABLE(t93.31) AND FIREABLE(t32.4) AND NOT FIREABLE(t66.6) AND FIREABLE(t10.2))))
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(t66.22) AND FIREABLE(t88.11) AND NOT FIREABLE(t93.31) AND FIREABLE(t32.4) AND NOT FIREABLE(t66.6) AND FIREABLE(t10.2))))
lola: processed formula length: 136
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t66.22) AND FIREABLE(t88.11) AND NOT FIREABLE(t93.31) AND FIREABLE(t32.4) AND NOT FIREABLE(t66.6) AND FIREABLE(t10.2))
lola: state equation: Generated DNF with 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 37 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t92.46) AND FIREABLE(t64.4)) OR NOT FIREABLE(t80.8) OR FIREABLE(t78.39) OR FIREABLE(t30.15) OR FIREABLE(t90.45) OR FIREABLE(t60.20))))
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(t92.46) AND FIREABLE(t64.4)) OR NOT FIREABLE(t80.8) OR FIREABLE(t78.39) OR FIREABLE(t30.15) OR FIREABLE(t90.45) OR FIREABLE(t60.20))))
lola: processed formula length: 156
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t92.46) OR NOT FIREABLE(t64.4)) AND FIREABLE(t80.8) AND NOT FIREABLE(t78.39) AND NOT FIREABLE(t30.15) AND NOT FIREABLE(t90.45) AND NOT FIREABLE(t60.20))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file Eratosthenes-PT-100-ReachabilityFireability-7-0.sara.
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t22.2) AND NOT FIREABLE(t96.4) AND (NOT FIREABLE(t10.2) OR NOT FIREABLE(t70.2)) AND (NOT FIREABLE(t63.7) OR NOT FIREABLE(t28.4) OR FIREABLE(t70.10)))))
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(t22.2) AND NOT FIREABLE(t96.4) AND (NOT FIREABLE(t10.2) OR NOT FIREABLE(t70.2)) AND (NOT FIREABLE(t63.7) OR NOT FIREABLE(t28.4) OR FIREABLE(t70.10)))))
lola: processed formula length: 174
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t22.2) AND NOT FIREABLE(t96.4) AND (NOT FIREABLE(t10.2) OR NOT FIREABLE(t70.2)) AND (NOT FIREABLE(t63.7) OR NOT FIREABLE(t28.4) OR FIREABLE(t70.10)))
lola: state equation: Generated DNF with 296 literals and 72 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t64.2) AND FIREABLE(t35.5)) OR NOT FIREABLE(t10.5) OR FIREABLE(t60.15) OR NOT FIREABLE(t14.7) OR NOT FIREABLE(t48.4) OR FIREABLE(t84.21))))
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(t64.2) AND FIREABLE(t35.5)) OR NOT FIREABLE(t10.5) OR FIREABLE(t60.15) OR NOT FIREABLE(t14.7) OR NOT FIREABLE(t48.4) OR FIREABLE(t84.21))))
lola: processed formula length: 161
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t64.2) OR NOT FIREABLE(t35.5)) AND FIREABLE(t10.5) AND NOT FIREABLE(t60.15) AND FIREABLE(t14.7) AND FIREABLE(t48.4) AND NOT FIREABLE(t84.21))
lola: state equation: Generated DNF with 108 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t90.6) OR NOT FIREABLE(t48.6)) AND NOT FIREABLE(t32.2) AND NOT FIREABLE(t90.2) AND NOT FIREABLE(t65.13) AND (FIREABLE(t30.6) OR NOT FIREABLE(t70.7)))))
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(t90.6) OR NOT FIREABLE(t48.6)) AND NOT FIREABLE(t32.2) AND NOT FIREABLE(t90.2) AND NOT FIREABLE(t65.13) AND (FIREABLE(t30.6) OR NOT FIREABLE(t70.7)))))
lola: processed formula length: 174
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t90.6) OR NOT FIREABLE(t48.6)) AND NOT FIREABLE(t32.2) AND NOT FIREABLE(t90.2) AND NOT FIREABLE(t65.13) AND (FIREABLE(t30.6) OR NOT FIREABLE(t70.7)))
lola: state equation: Generated DNF with 416 literals and 80 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t80.5) AND (FIREABLE(t58.2) OR FIREABLE(t64.4))) OR FIREABLE(t56.28) OR (FIREABLE(t68.2) AND FIREABLE(t48.2) AND FIREABLE(t46.2)))))
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(t80.5) AND (FIREABLE(t58.2) OR FIREABLE(t64.4))) OR FIREABLE(t56.28) OR (FIREABLE(t68.2) AND FIREABLE(t48.2) AND FIREABLE(t46.2)))))
lola: processed formula length: 152
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t80.5) OR (NOT FIREABLE(t58.2) AND NOT FIREABLE(t64.4))) AND NOT FIREABLE(t56.28) AND (NOT FIREABLE(t68.2) OR NOT FIREABLE(t48.2) OR NOT FIREABLE(t46.2)))
lola: state equation: Generated DNF with 264 literals and 72 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t60.6) AND FIREABLE(t16.2) AND FIREABLE(t88.2)) OR FIREABLE(t78.39) OR ((FIREABLE(t64.8) OR FIREABLE(t78.6) OR (FIREABLE(t84.28) AND FIREABLE(t70.14))) AND FIREABLE(t42.3)))))
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(t60.6) AND FIREABLE(t16.2) AND FIREABLE(t88.2)) OR FIREABLE(t78.39) OR ((FIREABLE(t64.8) OR FIREABLE(t78.6) OR (FIREABLE(t84.28) AND FIREABLE(t70.14))) AND FIREABLE(t42.3)))))
lola: processed formula length: 196
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t60.6) OR NOT FIREABLE(t16.2) OR NOT FIREABLE(t88.2)) AND NOT FIREABLE(t78.39) AND ((NOT FIREABLE(t64.8) AND NOT FIREABLE(t78.6) AND (NOT FIREABLE(t84.28) OR NOT FIREABLE(t70.14))) OR NOT FIREABLE(t42.3)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1032 literals and 216 conjunctive subformulas
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-13-0.sara
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t85.17) OR FIREABLE(t72.2)) AND NOT FIREABLE(t90.3) AND FIREABLE(t99.9) AND FIREABLE(t39.3) AND FIREABLE(t66.2) AND FIREABLE(t99.3) AND NOT FIREABLE(t84.28) AND NOT FIREABLE(t42.7) AND FIREABLE(t72.12) AND FIREABLE(t30.2) AND NOT FIREABLE(t51.3))))
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(t85.17) OR FIREABLE(t72.2)) AND NOT FIREABLE(t90.3) AND FIREABLE(t99.9) AND FIREABLE(t39.3) AND FIREABLE(t66.2) AND FIREABLE(t99.3) AND NOT FIREABLE(t84.28) AND NOT FIREABLE(t42.7) AND FIREABLE(t72.12) AND FIREABLE(t30.2) AND NOT FIREABLE(t51.3))))
lola: processed formula length: 266
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t85.17) OR FIREABLE(t72.2)) AND NOT FIREABLE(t90.3) AND FIREABLE(t99.9) AND FIREABLE(t39.3) AND FIREABLE(t66.2) AND FIREABLE(t99.3) AND NOT FIREABLE(t84.28) AND NOT FIREABLE(t42.7) AND FIREABLE(t72.12) AND FIREABLE(t30.2) AND NOT FIREABLE(t51.3))
lola: state equation: Generated DNF with 144 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t35.7) OR FIREABLE(t16.4) OR FIREABLE(t84.42) OR (NOT FIREABLE(t85.17) AND NOT FIREABLE(t84.7))) AND ((FIREABLE(t88.44) AND FIREABLE(t72.9) AND FIREABLE(t93.3)) OR ((FIREABLE(t99.3) OR FIREABLE(t66.33)) AND (FIREABLE(t84.14) OR FIREABLE(t90.2)))))))
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(t35.7) OR FIREABLE(t16.4) OR FIREABLE(t84.42) OR (NOT FIREABLE(t85.17) AND NOT FIREABLE(t84.7))) AND ((FIREABLE(t88.44) AND FIREABLE(t72.9) AND FIREABLE(t93.3)) OR ((FIREABLE(t99.3) OR FIREABLE(t66.33)) AND (FIREABLE(t84.14) OR FIREABLE(t90.2)))))))
lola: processed formula length: 272
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-100-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(t35.7) AND NOT FIREABLE(t16.4) AND NOT FIREABLE(t84.42) AND (FIREABLE(t85.17) OR FIREABLE(t84.7))) OR ((NOT FIREABLE(t88.44) OR NOT FIREABLE(t72.9) OR NOT FIREABLE(t93.3)) AND ((NOT FIREABLE(t99.3) AND NOT FIREABLE(t66.33)) OR (NOT FIREABLE(t84.14) AND NOT FIREABLE(t90.2)))))
lola: state equation: Generated DNF with 194 literals and 58 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-100-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA Eratosthenes-PT-100-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no yes no yes no no no yes yes yes yes no
lola:
preliminary result: no yes no no no yes no yes no no no yes yes yes yes no
sara: place or transition ordering is non-deterministic
lola: memory consumption: 14920 KB
lola: time consumption: 0 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="Eratosthenes-PT-100"
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/Eratosthenes-PT-100.tgz
mv Eratosthenes-PT-100 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 Eratosthenes-PT-100, 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 r088-blw7-152649998000028"
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 ;