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 204K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.4K 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 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 34K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-COL-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700014
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526905546230

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-02 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityFireability @ QuasiCertifProtocol-COL-02 @ 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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2752
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 71 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-02-ReachabilityFireability.task
lola: E (F ((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17)))) : A (G ((FIREABLE(t16) OR (NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49) AND NOT FIREABLE(t54)) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t55)))) : E (F ((FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6)))) : A (G ((FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46)))) : A (G ((NOT FIREABLE(t44) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND ((NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46)) OR NOT FIREABLE(t36)))))) : E (F (((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR (FIREABLE(t26) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46)) AND FIREABLE(t45) AND FIREABLE(t44)))))) : A (G ((NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t55)))) : E (F ((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37)))) : E (F (((NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46)) OR (FIREABLE(t55) AND FIREABLE(t16))))) : E (F ((NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17)) AND FIREABLE(t53) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR (FIREABLE(t43) AND (FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40))))))) : A (G ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t12) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t26) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR (NOT FIREABLE(t39) AND NOT FIREABLE(t38) AND NOT FIREABLE(t37))))) : A (G ((NOT FIREABLE(t53) OR (NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49)) OR FIREABLE(t26) OR (NOT FIREABLE(t42) AND NOT FIREABLE(t41) AND NOT FIREABLE(t40) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND (FIREABLE(t54) OR FIREABLE(t16) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46))))))) : E (F (FIREABLE(t12))) : E (F ((NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49)))) : A (G ((FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46)))) : E (F ((FIREABLE(t26) AND (FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND (FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND (FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49)))))
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 (FIREABLE(t12)))
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(t12)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t12)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-0.sara
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-12 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: E (F ((FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6))))
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(t8) OR FIREABLE(t7) OR FIREABLE(t6))))
lola: processed formula length: 56
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t8) OR FIREABLE(t7) OR FIREABLE(t6))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46))))
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(t48) OR FIREABLE(t47) OR FIREABLE(t46))))
lola: processed formula length: 59
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: (NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46))
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-3 FALSE 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: E (F ((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37))))
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(t39) OR FIREABLE(t38) OR FIREABLE(t37))))
lola: processed formula length: 59
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t39) OR FIREABLE(t38) OR FIREABLE(t37))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-7 TRUE 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(t19) OR FIREABLE(t18) OR FIREABLE(t17))))
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(t19) OR FIREABLE(t18) OR FIREABLE(t17))))
lola: processed formula length: 59
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t19) OR FIREABLE(t18) OR FIREABLE(t17))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-4-0.sara
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-0 TRUE 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: E (F ((NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49))))
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(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49))))
lola: processed formula length: 71
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 192 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-5-0.sara
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46))))
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(t48) OR FIREABLE(t47) OR FIREABLE(t46))))
lola: processed formula length: 59
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-6-0.sara
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-14 FALSE 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(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46)) OR (FIREABLE(t55) AND FIREABLE(t16)))))
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(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46)) OR (FIREABLE(t55) AND FIREABLE(t16)))))
lola: processed formula length: 111
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46)) OR (FIREABLE(t55) AND FIREABLE(t16)))
lola: state equation: Generated DNF with 26 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-7-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: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-8 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: A (G ((NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t55))))
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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t55))))
lola: processed formula length: 225
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t55))
lola: state equation: Generated DNF with 16 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-6 FALSE 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: A (G ((NOT FIREABLE(t44) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND ((NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46)) OR NOT FIREABLE(t36))))))
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(t44) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND ((NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46)) OR NOT FIREABLE(t36))))))
lola: processed formula length: 187
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t44) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR ((FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46)) AND FIREABLE(t36))))
lola: state equation: Generated DNF with 48 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 41 markings, 56 edges

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-ReachabilityFireability-9-0.sara
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t16) OR (NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49) AND NOT FIREABLE(t54)) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t55))))
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(t16) OR (NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49) AND NOT FIREABLE(t54)) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t55))))
lola: processed formula length: 185
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t16) AND (FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t54)) AND NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t55))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR (FIREABLE(t26) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46)) AND FIREABLE(t45) AND FIREABLE(t44))))))
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(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR (FIREABLE(t26) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46)) AND FIREABLE(t45) AND FIREABLE(t44))))))
lola: processed formula length: 229
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR (FIREABLE(t26) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46)) AND FIREABLE(t45) AND FIREABLE(t44))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 33 markings, 48 edges
lola: state equation: Generated DNF with 126 literals and 18 conjunctive subformulas
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-5 FALSE 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: E (F ((FIREABLE(t26) AND (FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND (FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND (FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49)))))
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(t26) AND (FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND (FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND (FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49)))))
lola: processed formula length: 305
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t26) AND (FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND (FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND (FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 41 markings, 56 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17)) AND FIREABLE(t53) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR (FIREABLE(t43) AND (FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40)))))))
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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17)) AND FIREABLE(t53) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR (FIREABLE(t43) AND (FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40)))))))
lola: processed formula length: 277
lola: 1 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17)) AND FIREABLE(t53) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR (FIREABLE(t43) AND (FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40)))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: state equation: Generated DNF with 180 literals and 18 conjunctive subformulas
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t53) OR (NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49)) OR FIREABLE(t26) OR (NOT FIREABLE(t42) AND NOT FIREABLE(t41) AND NOT FIREABLE(t40) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND (FIREABLE(t54) OR FIREABLE(t16) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46)))))))
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(t53) OR (NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49)) OR FIREABLE(t26) OR (NOT FIREABLE(t42) AND NOT FIREABLE(t41) AND NOT FIREABLE(t40) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND (FIREABLE(t54) OR FIREABLE(t16) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46)))))))
lola: processed formula length: 353
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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(t53) AND (FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49)) AND NOT FIREABLE(t26) AND (FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR (NOT FIREABLE(t54) AND NOT FIREABLE(t16) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46)))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 18 markings, 20 edges
lola: state equation: Generated DNF with 234 literals and 27 conjunctive subformulas
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t12) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t26) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR (NOT FIREABLE(t39) AND NOT FIREABLE(t38) AND NOT FIREABLE(t37)))))
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) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t12) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t26) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR (NOT FIREABLE(t39) AND NOT FIREABLE(t38) AND NOT FIREABLE(t37)))))
lola: processed formula length: 379
lola: 2 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t12) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23) AND NOT FIREABLE(t26) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46) AND NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND (FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 395 markings, 666 edges
lola:
========================================
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no yes no no yes yes no yes yes yes yes no no
lola:
preliminary result: yes no yes no yes no no yes yes no yes yes yes yes no no
lola: memory consumption: 14752 KB
lola: time consumption: 1 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="QuasiCertifProtocol-COL-02"
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/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 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 QuasiCertifProtocol-COL-02, 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 r136-qhx2-152673578700014"
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 ;