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 15M
-rw-r--r-- 1 mcc users 4.2K May 30 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 30 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 15:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.4K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 28 09:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 28 09:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 28 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 28 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.3K May 28 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 28 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:30 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 27 04:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 27 04:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 2 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 15M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RERS17pb113-PT-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169900403
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527794420736

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb113-PT-3 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb113-PT-3 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ RERS17pb113-PT-3 @ 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: 31992/65536 symbol table entries, 6831 collisions
lola: preprocessing...
lola: Size of bit vector: 639
lola: finding significant places
lola: 639 places, 31353 transitions, 614 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 47274 transition conflict sets
lola: TASK
lola: reading formula from RERS17pb113-PT-1-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p285)
lola: LP says that atomic proposition is always false: (2 <= p513)
lola: LP says that atomic proposition is always false: (2 <= p74)
lola: LP says that atomic proposition is always false: (2 <= p446)
lola: LP says that atomic proposition is always false: (2 <= p60)
lola: LP says that atomic proposition is always false: (3 <= p630)
lola: LP says that atomic proposition is always false: (2 <= p185)
lola: LP says that atomic proposition is always false: (3 <= p595)
lola: LP says that atomic proposition is always false: (3 <= p24)
lola: LP says that atomic proposition is always false: (2 <= p318)
lola: LP says that atomic proposition is always false: (3 <= p8)
lola: LP says that atomic proposition is always false: (2 <= p298)
lola: LP says that atomic proposition is always false: (2 <= p213)
lola: LP says that atomic proposition is always false: (3 <= p128)
lola: LP says that atomic proposition is always false: (2 <= p80)
lola: LP says that atomic proposition is always false: (2 <= p302)
lola: LP says that atomic proposition is always false: (3 <= p146)
lola: LP says that atomic proposition is always false: (2 <= p566)
lola: E (F (FALSE)) : E (F (())) : E (F ((1 <= p514))) : E (F ((((p354 + 1 <= p440)) OR (1 <= p204)))) : A (G (())) : E (F ((p594 + 1 <= p76))) : A (G (((((p437 <= p249) AND (p511 <= p306)) OR (p608 + 1 <= p619)) AND (p518 <= p579)))) : E (F (FALSE)) : A (G (((((1 <= p514) AND (p284 <= p539)) OR ((p518 <= p603) AND (p130 <= p101)))))) : A (G (())) : E (F (((p352 + 1 <= p301) AND (p467 <= p608)))) : A (G (())) : E (F (FALSE)) : E (F (())) : E (F ((((p555 + 1 <= p507) AND (p586 <= 0))))) : E (F (()))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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 206 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: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 220 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: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-ReachabilityCardinality.task
lola: processed formula with 0 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 RERS17pb113-PT-1-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 254 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: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-ReachabilityCardinality.task
lola: processed formula with 0 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 RERS17pb113-PT-1-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-ReachabilityCardinality.task
lola: processed formula with 0 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

FORMULA RERS17pb113-PT-1-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 330 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: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: ========================================
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 RERS17pb113-PT-1-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 367 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: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 412 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: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p514)))
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 ((1 <= p514)))
lola: processed formula length: 19
lola: 28 rewrites
lola: closed formula file RERS17pb113-PT-1-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: (1 <= p514)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-ReachabilityCardinality-9-0.sara.
lola: sara is running 0 secs || 917 markings, 916 edges, 183 markings/sec, 0 secs
lola: sara is running 5 secs || 1878 markings, 1877 edges, 192 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2484 markings, 2484 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p594 + 1 <= p76)))
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 ((p594 + 1 <= p76)))
lola: processed formula length: 25
lola: 28 rewrites
lola: closed formula file RERS17pb113-PT-1-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: (p594 + 1 <= p76)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-ReachabilityCardinality-10-0.sara.
lola: sara is running 0 secs || 871 markings, 870 edges, 174 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 944 markings, 943 edges
lola:
========================================
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p555 + 1 <= p507) AND (p586 <= 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 ((((p555 + 1 <= p507) AND (p586 <= 0)))))
lola: processed formula length: 46
lola: 28 rewrites
lola: closed formula file RERS17pb113-PT-1-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: (((p555 + 1 <= p507) AND (p586 <= 0)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 77 markings, 76 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p354 + 1 <= p440)) OR (1 <= p204))))
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 ((((p354 + 1 <= p440)) OR (1 <= p204))))
lola: processed formula length: 46
lola: 28 rewrites
lola: closed formula file RERS17pb113-PT-1-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: (((p354 + 1 <= p440)) OR (1 <= p204))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 150 markings, 149 edges

lola: ========================================
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1094 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p352 + 1 <= p301) AND (p467 <= p608))))
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 (((p352 + 1 <= p301) AND (p467 <= p608))))
lola: processed formula length: 47
lola: 28 rewrites
lola: closed formula file RERS17pb113-PT-1-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: ((p352 + 1 <= p301) AND (p467 <= p608))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 68 markings, 67 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= p514) AND (p284 <= p539)) OR ((p518 <= p603) AND (p130 <= p101))))))
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 <= p514) AND (p284 <= p539)) OR ((p518 <= p603) AND (p130 <= p101))))))
lola: processed formula length: 84
lola: 29 rewrites
lola: closed formula file RERS17pb113-PT-1-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: ((((p514 <= 0) OR (p539 + 1 <= p284)) AND ((p603 + 1 <= p518) OR (p101 + 1 <= p130))))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 366 markings, 365 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p437 <= p249) AND (p511 <= p306)) OR (p608 + 1 <= p619)) AND (p518 <= p579))))
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 (((((p437 <= p249) AND (p511 <= p306)) OR (p608 + 1 <= p619)) AND (p518 <= p579))))
lola: processed formula length: 89
lola: 29 rewrites
lola: closed formula file RERS17pb113-PT-1-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: ((((p249 + 1 <= p437) OR (p306 + 1 <= p511)) AND (p619 <= p608)) OR (p579 + 1 <= p518))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb113-PT-1-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 234 markings, 233 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes no no no yes yes yes no no yes no
lola:
preliminary result: no no yes yes yes yes no no no yes yes yes no no yes no
lola: memory consumption: 99384 KB
lola: time consumption: 291 seconds

BK_STOP 1527794712218

--------------------
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="RERS17pb113-PT-3"
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/RERS17pb113-PT-3.tgz
mv RERS17pb113-PT-3 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 RERS17pb113-PT-3, 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 r280-csrt-152749169900403"
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 ;