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 180K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K 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 9.8K 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.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K 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-00200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685546900054
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526922745549

info: Time: 3600 - MCC
===========================================================================================
prep: translating RobotManipulation-PT-00200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RobotManipulation-PT-00200 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ RobotManipulation-PT-00200 @ 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-00200-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (p_sc <= r_active)
lola: LP says that atomic proposition is always true: (moved <= r_active)
lola: LP says that atomic proposition is always true: (initialize <= p_i2)
lola: A (G (((r_active <= off) OR (2 <= move) OR (p_rel <= 2) OR ((p_rdy + 1 <= r_active) AND (move <= 0))))) : E (F (((initialize <= 1) AND (p_i1 <= 0)))) : A (G (((p_i1 <= 2) OR (initialize + 1 <= p_i1) OR (1 <= moved)))) : A (G (((p_rdy + 1 <= r_stopped) AND ((3 <= access) OR (3 <= moved)) AND (2 <= r_stopped)))) : E (F (((p_i2 <= initialized) AND (off <= 1) AND (p_i1 <= initialize)))) : A (G (((1 <= p_i1) OR ((moved <= 0))))) : A (G ((move <= p_i1))) : A (G (((r_stopped <= move) OR (3 <= off) OR (2 <= move) OR (p_m <= r_stopped)))) : A (G (((p_rel + 1 <= p_i2) OR (p_rdy <= 0) OR (p_i2 <= 1)))) : E (F (((initialize <= 2) AND (r_stopped + 1 <= initialize) AND (1 <= p_rel) AND (2 <= r_stopped)))) : E (F (((access <= p_sc) AND (1 <= off) AND (r_moving <= p_rdy) AND (initialize <= p_sc)))) : A (G (((3 <= move) OR (3 <= p_i1)))) : E (F ((((off + 1 <= move) AND (r_stopped + 1 <= initialize)) OR ((p_i2 <= move) AND (2 <= p_rdy) AND (3 <= moved) AND (p_m <= initialize))))) : A (G (((2 <= access) OR (3 <= moved) OR (move + 1 <= r_stopped) OR ((access <= 1) AND (p_rel + 1 <= access))))) : A (G ((move <= access))) : E (F ((((p_i1 + 1 <= r_moving) AND ((move <= p_rel) OR (1 <= off))))))
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 (((initialize <= 1) AND (p_i1 <= 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 <= 1) AND (p_i1 <= 0))))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: ((initialize <= 1) AND (p_i1 <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 802 markings, 801 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-1 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 (((1 <= p_i1) OR ((moved <= 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:694
lola: processed formula: A (G (((1 <= p_i1) OR ((moved <= 0)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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 <= 0) AND ((1 <= moved)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 408 markings, 407 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-5 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 ((move <= 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 ((move <= p_i1)))
lola: processed formula length: 22
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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 <= move)
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: 406 markings, 405 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-6 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 <= move) OR (3 <= 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 (((3 <= move) OR (3 <= p_i1))))
lola: processed formula length: 37
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: ((move <= 2) AND (p_i1 <= 2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-3-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: 400 markings, 399 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-11 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 ((move <= 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 ((move <= access)))
lola: processed formula length: 24
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: (access + 1 <= move)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-4-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: 1005 markings, 1004 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-14 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: E (F (((initialize <= 2) AND (r_stopped + 1 <= initialize) AND (1 <= p_rel) AND (2 <= r_stopped))))
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 <= 2) AND (r_stopped + 1 <= initialize) AND (1 <= p_rel) AND (2 <= r_stopped))))
lola: processed formula length: 99
lola: 1 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: ((initialize <= 2) AND (r_stopped + 1 <= initialize) AND (1 <= p_rel) AND (2 <= r_stopped))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00200-ReachabilityCardinality-5-0.sara.

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

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-9 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: A (G (((p_i1 <= 2) OR (initialize + 1 <= p_i1) OR (1 <= moved))))
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_i1 <= 2) OR (initialize + 1 <= p_i1) OR (1 <= moved))))
lola: processed formula length: 67
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: 202 markings, 201 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-2 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: A (G (((p_rel + 1 <= p_i2) OR (p_rdy <= 0) OR (p_i2 <= 1))))
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_rel + 1 <= p_i2) OR (p_rdy <= 0) OR (p_i2 <= 1))))
lola: processed formula length: 62
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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_i2 <= p_rel) AND (1 <= p_rdy) AND (2 <= p_i2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-7-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: 1231 markings, 1233 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-8 FALSE 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 (((p_rdy + 1 <= r_stopped) AND ((3 <= access) OR (3 <= moved)) AND (2 <= 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 (((p_rdy + 1 <= r_stopped) AND ((3 <= access) OR (3 <= moved)) AND (2 <= r_stopped))))
lola: processed formula length: 92
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: ((r_stopped <= p_rdy) OR ((access <= 2) AND (moved <= 2)) OR (r_stopped <= 1))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-8-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: 1593 markings, 1592 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((r_stopped <= move) OR (3 <= off) OR (2 <= move) OR (p_m <= 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 (((r_stopped <= move) OR (3 <= off) OR (2 <= move) OR (p_m <= r_stopped))))
lola: processed formula length: 83
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: ((move + 1 <= r_stopped) AND (off <= 2) AND (move <= 1) AND (r_stopped + 1 <= p_m))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00200-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 822 markings, 825 edges

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-7 FALSE 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: E (F (((p_i2 <= initialized) AND (off <= 1) AND (p_i1 <= initialize))))
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_i2 <= initialized) AND (off <= 1) AND (p_i1 <= initialize))))
lola: processed formula length: 71
lola: 1 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: 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_i2 <= initialized) AND (off <= 1) AND (p_i1 <= initialize))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00200-ReachabilityCardinality-10-0.sara.

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

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-4 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: A (G (((2 <= access) OR (3 <= moved) OR (move + 1 <= r_stopped) OR ((access <= 1) AND (p_rel + 1 <= 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 (((2 <= access) OR (3 <= moved) OR (move + 1 <= r_stopped) OR ((access <= 1) AND (p_rel + 1 <= access)))))
lola: processed formula length: 114
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: ((access <= 1) AND (moved <= 2) AND (r_stopped <= move) AND ((2 <= access) OR (access <= p_rel)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-11-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: 1601 markings, 1600 edges

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((r_active <= off) OR (2 <= move) OR (p_rel <= 2) OR ((p_rdy + 1 <= r_active) AND (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:694
lola: processed formula: A (G (((r_active <= off) OR (2 <= move) OR (p_rel <= 2) OR ((p_rdy + 1 <= r_active) AND (move <= 0)))))
lola: processed formula length: 106
lola: 2 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: ((off + 1 <= r_active) AND (move <= 1) AND (3 <= p_rel) AND ((r_active <= p_rdy) OR (1 <= move)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-12-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: 1231 markings, 1235 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-0 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: E (F ((((p_i1 + 1 <= r_moving) AND ((move <= p_rel) OR (1 <= 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 <= r_moving) AND ((move <= p_rel) OR (1 <= off))))))
lola: processed formula length: 71
lola: 1 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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 <= r_moving) AND ((move <= p_rel) OR (1 <= off))))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-13-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: 2005 markings, 2006 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-15 TRUE 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 (((access <= p_sc) AND (1 <= off) AND (r_moving <= p_rdy) AND (initialize <= p_sc))))
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 (((access <= p_sc) AND (1 <= off) AND (r_moving <= p_rdy) AND (initialize <= p_sc))))
lola: processed formula length: 90
lola: 1 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: ((access <= p_sc) AND (1 <= off) AND (r_moving <= p_rdy) AND (initialize <= p_sc))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 805 markings, 804 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-10 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: E (F ((((off + 1 <= move) AND (r_stopped + 1 <= initialize)) OR ((p_i2 <= move) AND (2 <= p_rdy) AND (3 <= moved) AND (p_m <= initialize)))))
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 ((((off + 1 <= move) AND (r_stopped + 1 <= initialize)) OR ((p_i2 <= move) AND (2 <= p_rdy) AND (3 <= moved) AND (p_m <= initialize)))))
lola: processed formula length: 142
lola: 1 rewrites
lola: closed formula file RobotManipulation-PT-00200-ReachabilityCardinality.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: (((off + 1 <= move) AND (r_stopped + 1 <= initialize)) OR ((p_i2 <= move) AND (2 <= p_rdy) AND (3 <= moved) AND (p_m <= initialize)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-ReachabilityCardinality-15-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: 411 markings, 414 edges
lola: ========================================

FORMULA RobotManipulation-PT-00200-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no yes no yes no no yes
lola:
preliminary result: no yes no no no no no no no no yes no yes no no yes
lola: memory consumption: 24824 KB
lola: time consumption: 1 seconds

BK_STOP 1526922746104

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