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 30M
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K 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 18K 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 4.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 30M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhaseVariation-PT-D30CS100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469800663
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527051235888

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhaseVariation-PT-D30CS100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhaseVariation-PT-D30CS100 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ PhaseVariation-PT-D30CS100 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 33679/65536 symbol table entries, 10484 collisions
lola: preprocessing...
lola: Size of bit vector: 86464
lola: finding significant places
lola: 2702 places, 30977 transitions, 1801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D30CS100-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= pool__11_16_)
lola: LP says that atomic proposition is always false: (2 <= cell___28_9__B_)
lola: LP says that atomic proposition is always false: (3 <= cell___1_26__B_)
lola: LP says that atomic proposition is always false: (2 <= pool__21_17_)
lola: LP says that atomic proposition is always false: (2 <= cell___1_3__A_)
lola: LP says that atomic proposition is always false: (2 <= cell___8_8__B_)
lola: LP says that atomic proposition is always false: (3 <= cell___22_1__B_)
lola: LP says that atomic proposition is always false: (2 <= cell___12_27__A_)
lola: LP says that atomic proposition is always false: (2 <= cell___15_19__B_)
lola: LP says that atomic proposition is always false: (2 <= pool__21_13_)
lola: LP says that atomic proposition is always false: (2 <= cell___29_15__A_)
lola: LP says that atomic proposition is always false: (2 <= pool__20_24_)
lola: LP says that atomic proposition is always false: (3 <= cell___5_23__B_)
lola: LP says that atomic proposition is always false: (2 <= cell___8_27__A_)
lola: E (F (())) : E (F (FALSE)) : E (F (())) : A (G (((cell___16_25__B_ <= pool__5_10_) OR (pool__15_23_ + 1 <= cell___11_1__B_) OR ((cell___28_2__A_ <= pool__6_9_) AND ((cell___9_1__B_ <= cell___15_17__A_)))))) : E (F (())) : E (F (((run_dot <= cell___22_17__A_) AND (1 <= cell___2_27__B_)))) : E (F (FALSE)) : E (F (())) : A (G (((cell___16_11__A_ <= pool__15_18_) OR (pool__11_21_ <= pool__13_12_)))) : A (G ((cell___13_6__A_ <= cell___7_8__B_))) : A (G (((cell___11_26__B_ <= cell___3_25__A_) OR (cell___19_2__A_ + 1 <= pool__21_29_)))) : E (F ((cell___20_5__B_ + 1 <= cell___4_1__B_))) : E (F (())) : A (G (((pool__5_6_ <= 0) OR ((pool__10_2_ <= pool__4_4_) AND (cell___19_22__B_ <= cell___5_15__B_)) OR (pool__12_25_ <= cell___10_26__A_) OR (cell___2_3__B_ <= cell___23_7__A_) OR (1 <= pool__13_1_)))) : A (G ((((cell___18_9__A_ <= pool__30_5_) OR (cell___28_17__A_ <= cell___7_7__A_) OR ((pool__17_3_ <= cell___28_3__B_) AND (1 <= cell___20_20__A_))) AND (cell___2_22__B_ <= pool__9_23_)))) : A (G ((pool__12_18_ <= pool__13_8_)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-ReachabilityCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-ReachabilityCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-ReachabilityCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-ReachabilityCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-ReachabilityCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-ReachabilityCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-ReachabilityCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cell___20_5__B_ + 1 <= cell___4_1__B_)))
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 ((cell___20_5__B_ + 1 <= cell___4_1__B_)))
lola: processed formula length: 47
lola: 22 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-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: (cell___20_5__B_ + 1 <= cell___4_1__B_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cell___13_6__A_ <= cell___7_8__B_)))
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 ((cell___13_6__A_ <= cell___7_8__B_)))
lola: processed formula length: 43
lola: 23 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-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: (cell___7_8__B_ + 1 <= cell___13_6__A_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((pool__12_18_ <= pool__13_8_)))
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 ((pool__12_18_ <= pool__13_8_)))
lola: processed formula length: 37
lola: 23 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-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: (pool__13_8_ + 1 <= pool__12_18_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((run_dot <= cell___22_17__A_) AND (1 <= cell___2_27__B_))))
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 (((run_dot <= cell___22_17__A_) AND (1 <= cell___2_27__B_))))
lola: processed formula length: 66
lola: 22 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-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: ((run_dot <= cell___22_17__A_) AND (1 <= cell___2_27__B_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityCardinality-10-0.sara.
lola: sara is running 0 secs || 422 markings, 421 edges, 84 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 635 markings, 634 edges
lola: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___11_26__B_ <= cell___3_25__A_) OR (cell___19_2__A_ + 1 <= pool__21_29_))))
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 (((cell___11_26__B_ <= cell___3_25__A_) OR (cell___19_2__A_ + 1 <= pool__21_29_))))
lola: processed formula length: 89
lola: 23 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-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: ((cell___3_25__A_ + 1 <= cell___11_26__B_) AND (pool__21_29_ <= cell___19_2__A_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___16_11__A_ <= pool__15_18_) OR (pool__11_21_ <= pool__13_12_))))
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 (((cell___16_11__A_ <= pool__15_18_) OR (pool__11_21_ <= pool__13_12_))))
lola: processed formula length: 79
lola: 23 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-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: ((pool__15_18_ + 1 <= cell___16_11__A_) AND (pool__13_12_ + 1 <= pool__11_21_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1141 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___16_25__B_ <= pool__5_10_) OR (pool__15_23_ + 1 <= cell___11_1__B_) OR ((cell___28_2__A_ <= pool__6_9_) AND ((cell___9_1__B_ <= cell___15_17__A_))))))
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 (((cell___16_25__B_ <= pool__5_10_) OR (pool__15_23_ + 1 <= cell___11_1__B_) OR ((cell___28_2__A_ <= pool__6_9_) AND ((cell___9_1__B_ <= cell___15_17__A_))))))
lola: processed formula length: 166
lola: 23 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-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: ((pool__5_10_ + 1 <= cell___16_25__B_) AND (cell___11_1__B_ <= pool__15_23_) AND ((pool__6_9_ + 1 <= cell___28_2__A_) OR ((cell___15_17__A_ + 1 <= cell___9_1__B_))))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cell___18_9__A_ <= pool__30_5_) OR (cell___28_17__A_ <= cell___7_7__A_) OR ((pool__17_3_ <= cell___28_3__B_) AND (1 <= cell___20_20__A_))) AND (cell___2_22__B_ <= pool__9_23_))))
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 ((((cell___18_9__A_ <= pool__30_5_) OR (cell___28_17__A_ <= cell___7_7__A_) OR ((pool__17_3_ <= cell___28_3__B_) AND (1 <= cell___20_20__A_))) AND (cell___2_22__B_ <= pool__9_23_))))
lola: processed formula length: 189
lola: 23 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-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: (((pool__30_5_ + 1 <= cell___18_9__A_) AND (cell___7_7__A_ + 1 <= cell___28_17__A_) AND ((cell___28_3__B_ + 1 <= pool__17_3_) OR (cell___20_20__A_ <= 0))) OR (pool__9_23_ + 1 <= cell___2_22__B_))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pool__5_6_ <= 0) OR ((pool__10_2_ <= pool__4_4_) AND (cell___19_22__B_ <= cell___5_15__B_)) OR (pool__12_25_ <= cell___10_26__A_) OR (cell___2_3__B_ <= cell___23_7__A_) OR (1 <= pool__13_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 (((pool__5_6_ <= 0) OR ((pool__10_2_ <= pool__4_4_) AND (cell___19_22__B_ <= cell___5_15__B_)) OR (pool__12_25_ <= cell___10_26__A_) OR (cell___2_3__B_ <= cell___23_7__A_) OR (1 <= pool__13_1_))))
lola: processed formula length: 205
lola: 23 rewrites
lola: closed formula file PhaseVariation-PT-D30CS100-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: ((1 <= pool__5_6_) AND ((pool__4_4_ + 1 <= pool__10_2_) OR (cell___5_15__B_ + 1 <= cell___19_22__B_)) AND (cell___10_26__A_ + 1 <= pool__12_25_) AND (cell___23_7__A_ + 1 <= cell___2_3__B_) AND (pool__13_1_ <= 0))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA PhaseVariation-PT-D30CS100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no no no yes no no no no
lola:
preliminary result: no no no no no yes no no no no no yes no no no no
lola: memory consumption: 71292 KB
lola: time consumption: 147 seconds

BK_STOP 1527051384640

--------------------
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="PhaseVariation-PT-D30CS100"
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/PhaseVariation-PT-D30CS100.tgz
mv PhaseVariation-PT-D30CS100 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 PhaseVariation-PT-D30CS100, 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 r112-csrt-152666469800663"
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 ;