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 184K
-rw-r--r-- 1 mcc users 4.1K 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 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.2K 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 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RobotManipulation-PT-00010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685546900024
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526903975335

info: Time: 3600 - MCC
===========================================================================================
prep: translating RobotManipulation-PT-00010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RobotManipulation-PT-00010 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ RobotManipulation-PT-00010 @ 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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00010-CTLCardinality.task
lola: always true
lola: A (G ((2 <= p_i1))) : NOT(E (F (((p_i1 + 1 <= p_rdy) AND (r_stopped <= 2))))) : E (F (((p_i1 + 1 <= p_i2) AND (p_i2 <= 1) AND (p_m <= off)))) : E (F (A (G (((1 <= access) AND (moved <= r_moving)))))) : (E (G (((r_active <= p_rdy) OR (2 <= off) OR (1 <= move)))) AND TRUE) : (A (X (E (G ((initialized <= p_rdy))))) AND ((p_rel <= 0) AND (initialize <= 1))) : A (G ((((off <= 0) AND (r_stopped + 1 <= moved)) OR E (F ((3 <= p_rdy)))))) : A (G ((p_m <= access))) : A (G ((E (G ((r_moving <= r_stopped))) OR ((p_rel + 1 <= r_stopped) AND (move + 1 <= off))))) : ((E (F ((initialize <= 0))) OR NOT(E (F ((1 <= initialized))))) AND ((A (X ((2 <= initialized))) OR ((p_rdy <= p_rel) AND (2 <= p_rdy) AND (access <= initialized))) OR E (G ((r_active <= p_m))))) : (((moved <= p_i2) AND ((p_i2 <= 0) OR (p_sc + 1 <= p_rdy) OR ((1 <= initialize) AND (r_active <= p_sc)) OR ((1 <= access) AND (3 <= r_active)))) AND (E (((move <= p_rdy) U (initialized <= moved))) AND A (G ((2 <= p_i1))))) : A (G ((A (F ((moved <= r_stopped))) AND ((p_m <= p_i1) OR (r_stopped <= p_i1) OR (r_active <= 2))))) : NOT((E (F (((2 <= p_rel) AND (1 <= move)))) AND E (F (((2 <= off) OR (initialized <= p_rel)))))) : A (G ((3 <= r_stopped))) : A ((((1 <= r_stopped) AND (access <= r_moving) AND ((2 <= r_moving) OR (p_m <= p_sc))) U A (F ((initialized <= p_sc))))) : E ((((3 <= p_sc) OR (3 <= p_sc) OR ((3 <= p_rel) AND (1 <= r_stopped))) U (off <= moved)))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:470
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 (X (E (G ((initialized <= p_rdy))))) AND ((p_rel <= 0) AND (initialize <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_rel <= 0) AND (initialize <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_rel <= 0) AND (initialize <= 1))
lola: processed formula length: 36
lola: 18 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((initialized <= p_rdy)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (p_rdy + 1 <= initialized))))
lola: processed formula length: 45
lola: 21 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 42 markings, 41 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-5 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 ((initialize <= 0))) OR A (G ((initialized <= 0)))) AND (A (X ((2 <= initialized))) OR (((p_rdy <= p_rel) AND (2 <= p_rdy) AND (access <= initialized)) OR E (G ((r_active <= p_m))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((r_active <= p_m)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((r_active <= p_m)))
lola: processed formula length: 25
lola: 18 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((initialized <= 0)))
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:695
lola: processed formula: A (G ((initialized <= 0)))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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:695
lola: formula 0: (1 <= initialized)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to RobotManipulation-PT-00010-CTLCardinality-2-0.sara
lola: 3 markings, 2 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((initialize <= 0)))
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 ((initialize <= 0)))
lola: processed formula length: 25
lola: 19 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (initialize <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_rdy <= p_rel) AND (2 <= p_rdy) AND (access <= initialized))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_rdy <= p_rel) AND (2 <= p_rdy) AND (access <= initialized))
lola: processed formula length: 63
lola: 18 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= initialized)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((2 <= initialized))
lola: processed formula length: 22
lola: 19 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-9 FALSE 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 ((2 <= p_i1)))
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 ((2 <= p_i1)))
lola: processed formula length: 19
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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: (p_i1 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-0 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: A (G ((3 <= r_stopped)))
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 ((3 <= r_stopped)))
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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
sara: try reading problem file RobotManipulation-PT-00010-CTLCardinality-2-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (r_stopped <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to RobotManipulation-PT-00010-CTLCardinality-3-0.sara
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-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: A (G ((p_m <= access)))
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 ((p_m <= access)))
lola: processed formula length: 23
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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 equation: calling and running sara
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: (access + 1 <= p_m)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00010-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00010-CTLCardinality-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-7 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 (((p_rdy <= p_i1) OR (3 <= r_stopped))))
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:695
lola: processed formula: A (G (((p_rdy <= p_i1) OR (3 <= r_stopped))))
lola: processed formula length: 46
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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:695
lola: formula 0: ((p_i1 + 1 <= p_rdy) AND (r_stopped <= 2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 40 edges
lola: state equation: write sara problem file to RobotManipulation-PT-00010-CTLCardinality-5-0.sara

FORMULA RobotManipulation-PT-00010-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p_i1 + 1 <= p_i2) AND (p_i2 <= 1) AND (p_m <= off))))
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 (((p_i1 + 1 <= p_i2) AND (p_i2 <= 1) AND (p_m <= off))))
lola: processed formula length: 61
lola: 19 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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: ((p_i1 + 1 <= p_i2) AND (p_i2 <= 1) AND (p_m <= off))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00010-CTLCardinality-6-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-2 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: A (F ((initialized <= p_sc)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p_sc + 1 <= initialized)
lola: processed formula length: 25
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-14 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 (A (G (((1 <= access) AND (moved <= r_moving))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((access <= 0) OR (r_moving + 1 <= moved))
lola: processed formula length: 43
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task

lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2644441 markings, 5484804 edges, 528888 markings/sec, 0 secs
lola: 4468415 markings, 10541910 edges, 364795 markings/sec, 5 secs
lola: 5590874 markings, 14784907 edges, 224492 markings/sec, 10 secs
lola: 6605192 markings, 18825775 edges, 202864 markings/sec, 15 secs
lola: 7566329 markings, 22774116 edges, 192227 markings/sec, 20 secs
lola: 8490394 markings, 26631955 edges, 184813 markings/sec, 25 secs
lola: 9393730 markings, 30388734 edges, 180667 markings/sec, 30 secs
lola: 10312232 markings, 34227022 edges, 183700 markings/sec, 35 secs
lola: 11250690 markings, 38162067 edges, 187692 markings/sec, 40 secs
lola: 12248396 markings, 42289401 edges, 199541 markings/sec, 45 secs
lola: 13162391 markings, 46953186 edges, 182799 markings/sec, 50 secs
lola: 13355380 markings, 50554391 edges, 38598 markings/sec, 55 secs
lola: 13473501 markings, 53974491 edges, 23624 markings/sec, 60 secs
lola: 13562739 markings, 57329786 edges, 17848 markings/sec, 65 secs
lola: 13635922 markings, 60678944 edges, 14637 markings/sec, 70 secs
lola: 13711787 markings, 64060483 edges, 15173 markings/sec, 75 secs
lola: 13799556 markings, 67542471 edges, 17554 markings/sec, 80 secs
lola: 13935251 markings, 71570128 edges, 27139 markings/sec, 85 secs
lola: 14133804 markings, 76312295 edges, 39711 markings/sec, 90 secs
lola: 14313395 markings, 81293305 edges, 35918 markings/sec, 95 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 14397598 markings, 83830720 edges

FORMULA RobotManipulation-PT-00010-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((r_active <= p_rdy) OR (2 <= off) OR (1 <= move))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((r_active <= p_rdy) OR (2 <= off) OR (1 <= move))))
lola: processed formula length: 60
lola: 18 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((off <= 0) AND (r_stopped + 1 <= moved)) OR E (F ((3 <= p_rdy))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (((1 <= off) OR (moved <= r_stopped)) AND NOT(E(TRUE U (3 <= p_rdy))))))
lola: processed formula length: 86
lola: 22 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1074459 markings, 4975197 edges, 214892 markings/sec, 0 secs
lola: 1886725 markings, 9083866 edges, 162453 markings/sec, 5 secs
lola: 2617370 markings, 12886558 edges, 146129 markings/sec, 10 secs
lola: 3320261 markings, 16608155 edges, 140578 markings/sec, 15 secs
lola: 3976602 markings, 20143578 edges, 131268 markings/sec, 20 secs
lola: 4601235 markings, 23538006 edges, 124927 markings/sec, 25 secs
lola: 5201026 markings, 26834481 edges, 119958 markings/sec, 30 secs
lola: 5785004 markings, 30063753 edges, 116796 markings/sec, 35 secs
lola: 6356246 markings, 33254472 edges, 114248 markings/sec, 40 secs
lola: 6922818 markings, 36441327 edges, 113314 markings/sec, 45 secs
lola: 7509027 markings, 39896260 edges, 117242 markings/sec, 50 secs
lola: 7809860 markings, 42870524 edges, 60167 markings/sec, 55 secs
lola: 8106585 markings, 45652402 edges, 59345 markings/sec, 60 secs
lola: 8409391 markings, 48414839 edges, 60561 markings/sec, 65 secs
lola: 8721022 markings, 51197601 edges, 62326 markings/sec, 70 secs
lola: 9046660 markings, 54040730 edges, 65128 markings/sec, 75 secs
lola: 9389237 markings, 56983673 edges, 68515 markings/sec, 80 secs
lola: 9749209 markings, 60016153 edges, 71994 markings/sec, 85 secs
lola: 10175068 markings, 63529051 edges, 85172 markings/sec, 90 secs
lola: 10656360 markings, 67363259 edges, 96258 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10656360 markings, 67363259 edges
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((r_moving <= r_stopped))) OR ((p_rel + 1 <= r_stopped) AND (move + 1 <= off)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (A(TRUE U (r_stopped + 1 <= r_moving)) AND ((r_stopped <= p_rel) OR (off <= move)))))
lola: processed formula length: 99
lola: 24 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 107 markings, 308 edges
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p_sc) OR (3 <= p_sc) OR ((3 <= p_rel) AND (1 <= r_stopped))) U (off <= moved)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((3 <= p_sc) OR (3 <= p_sc) OR ((3 <= p_rel) AND (1 <= r_stopped))) U (off <= moved)))
lola: processed formula length: 92
lola: 21 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p_rel <= 1) OR (move <= 0)))) OR A (G (((off <= 1) AND (p_rel + 1 <= initialized)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p_rel <= 1) OR (move <= 0))))
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:695
lola: processed formula: A (G (((p_rel <= 1) OR (move <= 0))))
lola: processed formula length: 38
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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: 716 markings, 1049 edges
lola: ========================================
lola: subprocess 14 will run for 1683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((off <= 1) AND (p_rel + 1 <= initialized))))
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:695
lola: processed formula: A (G (((off <= 1) AND (p_rel + 1 <= initialized))))
lola: processed formula length: 51
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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:695
lola: formula 0: ((2 <= off) OR (initialized <= p_rel))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00010-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00010-CTLCardinality-14-0.sara.

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

FORMULA RobotManipulation-PT-00010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((moved <= r_stopped))))) AND A (G (((p_m <= p_i1) OR (r_stopped <= p_i1) OR (r_active <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((moved <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (r_stopped + 1 <= moved)
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate does not eventually occur from all states.
lola: 112 markings, 114 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RobotManipulation-PT-00010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((moved <= p_i2) AND ((p_i2 <= 0) OR (p_sc + 1 <= p_rdy) OR ((1 <= initialize) AND (r_active <= p_sc)) OR ((1 <= access) AND (3 <= r_active)))) AND (E (((move <= p_rdy) U (initialized <= moved))) AND A (G ((2 <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p_i1)))
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 ((2 <= p_i1)))
lola: processed formula length: 19
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00010-CTLCardinality.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: (p_i1 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
state equation: write sara problem file to RobotManipulation-PT-00010-CTLCardinality-15-0.sara

FORMULA RobotManipulation-PT-00010-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no no yes no no no no no no no yes yes
lola:
preliminary result: no no yes no no no yes no no no no no no no yes yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00010-CTLCardinality-15-0.sara.

lola: memory consumption: 24800 KB
lola: time consumption: 203 seconds

BK_STOP 1526904178197

--------------------
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="RobotManipulation-PT-00010"
export BK_EXAMINATION="CTLCardinality"
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/RobotManipulation-PT-00010.tgz
mv RobotManipulation-PT-00010 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 RobotManipulation-PT-00010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r148-smll-152685546900024"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;