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.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 16K 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 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.1K 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-00100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257800477
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528113504151

info: Time: 3600 - MCC
===========================================================================================
prep: translating RobotManipulation-PT-00100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RobotManipulation-PT-00100 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RobotManipulation-PT-00100 @ 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-00100-LTLCardinality.task
lola: A (F ((F ((access <= p_i2)) U F ((1 <= initialize))))) : A (X (G (G (X ((2 <= p_i1)))))) : A ((p_i2 <= initialize)) : A (X ((G ((3 <= p_m)) U G ((p_sc <= initialize))))) : A (F ((initialized <= moved))) : A (F (G (X (X ((r_moving <= r_active)))))) : A (X (X (X (F ((off <= initialized)))))) : A (X (G (X (F ((2 <= initialized)))))) : A ((p_rel <= p_m)) : A (F ((off <= r_stopped))) : A ((3 <= r_stopped)) : A ((p_rel <= p_i1)) : A (F (G (X (G ((2 <= off)))))) : A (G (G (F (X ((r_stopped <= moved)))))) : A ((1 <= r_moving)) : A (F (F (((access <= r_stopped) U (1 <= r_stopped)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_i2 <= initialize)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_i2 <= initialize)
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: processed formula with 1 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: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-2 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: (p_rel <= p_m)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_rel <= p_m)
lola: processed formula length: 14
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: processed formula with 1 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:
FORMULA RobotManipulation-PT-00100-LTLCardinality-8 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: (3 <= r_stopped)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= r_stopped)
lola: processed formula length: 16
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: processed formula with 1 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: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_rel <= p_i1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_rel <= p_i1)
lola: processed formula length: 15
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: processed formula with 1 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: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-11 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: (1 <= r_moving)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= r_moving)
lola: processed formula length: 15
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: processed formula with 1 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

FORMULA RobotManipulation-PT-00100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p_sc <= initialize)) OR (G ((3 <= p_m)) AND F (G ((p_sc <= initialize)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((p_sc <= initialize)) OR (G ((3 <= p_m)) AND F (G ((p_sc <= initialize)))))))
lola: processed formula length: 87
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1031 markings, 1039 edges
lola: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((off <= initialized))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((off <= initialized))))))
lola: processed formula length: 40
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 7 edges
lola: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-6 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 (X (X (G ((2 <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((2 <= p_i1)))))
lola: processed formula length: 27
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1005 markings, 1005 edges
lola: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-1 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 (F ((1 <= initialize)))
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: (initialize <= 0)
lola: processed formula length: 17
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.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-00100-LTLCardinality-0 TRUE 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 (F ((1 <= r_stopped)))
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: (r_stopped <= 0)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.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-00100-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((initialized <= moved)))
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: (moved + 1 <= initialized)
lola: processed formula length: 26
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.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-00100-LTLCardinality-4 TRUE 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 (F ((off <= r_stopped)))
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: (r_stopped + 1 <= off)
lola: processed formula length: 22
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.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-00100-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= initialized))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= initialized))))
lola: processed formula length: 30
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1204 markings, 1204 edges
lola: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= off))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= off))))
lola: processed formula length: 22
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1006 markings, 1007 edges
lola: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((r_moving <= r_active))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((r_moving <= r_active))))
lola: processed formula length: 34
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3915713 markings, 5290671 edges, 783143 markings/sec, 0 secs
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 1
lola: add low 9
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 4
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: add low 2
lola: add low 6
lola: add low 7
lola: add low 8
lola: add low 10
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5284464 markings, 7143430 edges
lola: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((r_stopped <= moved))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((r_stopped <= moved))))
lola: processed formula length: 32
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1599 markings, 1599 edges
lola: ========================================

FORMULA RobotManipulation-PT-00100-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no yes no yes no yes yes yes yes no no no yes
lola:
preliminary result: yes no yes no yes no yes no yes yes yes yes no no no yes
lola: memory consumption: 18640 KB
lola: time consumption: 7 seconds

BK_STOP 1528113511462

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