Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r077-smll-155234766400047.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is ERK-PT-001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r077-smll-155234766400047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.6K Feb 10 23:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 10 23:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 6 20:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 6 20:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 3 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 3 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jan 31 00:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 31 00:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 6.7K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552420184888

info: Time: 3600 - MCC
===========================================================================================
prep: translating ERK-PT-001000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ERK-PT-001000 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ ERK-PT-001000 @ 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: 22/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from ERK-PT-001000-LTLCardinality.task
lola: LP says that atomic proposition is always true: (Raf1Star_RKIP_ERKPP <= MEKPP)
lola: A (G (G ((1 <= RP)))) : A (G ((3 <= Raf1Star_RKIP))) : A ((G (F ((3 <= Raf1Star))) U ((1 <= RKIP) U (3 <= Raf1Star_RKIP)))) : A (G ((G ((2 <= ERKPP)) U X ((MEKPP_ERK <= RKIPP))))) : A (F ((MEKPP <= RKIP))) : A (F (X ((2 <= ERKPP)))) : A (X (F (((MEKPP_ERK <= RP) U (2 <= RKIP))))) : A (X (F ((2 <= MEKPP)))) : A (F (F ((Raf1Star <= Raf1Star_RKIP)))) : A ((X (X ((2 <= MEKPP))) U ((1 <= MEKPP) U (1 <= Raf1Star_RKIP)))) : A (G ((X ((RKIPP_RP <= RKIPP)) U X ((2 <= ERKPP))))) : A (X (G ((MEKPP_ERK <= Raf1Star_RKIP_ERKPP)))) : A (((TRUE U (2 <= ERKPP)) U X (G ((3 <= RKIP))))) : A (G (G ((2 <= ERK)))) : A (F (F ((Raf1Star_RKIP <= MEKPP_ERK)))) : A (G ((2 <= RKIPP)))
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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: A (G ((X ((MEKPP_ERK <= RKIPP)) OR (G ((2 <= ERKPP)) AND X (F ((MEKPP_ERK <= RKIPP)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((MEKPP_ERK <= RKIPP)) OR (G ((2 <= ERKPP)) AND X (F ((MEKPP_ERK <= RKIPP)))))))
lola: processed formula length: 89
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: 2005 markings, 2005 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= ERKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= ERKPP))))
lola: processed formula length: 24
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-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: 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: 5 markings, 5 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= RKIP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= RKIP))))
lola: processed formula length: 23
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-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: 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: 3 markings, 2 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-6 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: A (X (F ((2 <= MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= MEKPP))))
lola: processed formula length: 24
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-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: 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: 3 markings, 2 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-7 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: A ((X (X ((2 <= MEKPP))) U ((1 <= MEKPP) U (1 <= Raf1Star_RKIP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((2 <= MEKPP))) U ((1 <= MEKPP) U (1 <= Raf1Star_RKIP))))
lola: processed formula length: 66
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: 9002 markings, 10002 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((2 <= ERKPP)) AND ((RKIPP_RP <= RKIPP) OR (2 <= ERKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((2 <= ERKPP)) AND ((RKIPP_RP <= RKIPP) OR (2 <= ERKPP))))))
lola: processed formula length: 72
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-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: 5 markings, 5 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((MEKPP_ERK <= Raf1Star_RKIP_ERKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((MEKPP_ERK <= Raf1Star_RKIP_ERKPP))))
lola: processed formula length: 46
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 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: 2005 markings, 2005 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= ERKPP)) U X (G ((3 <= RKIP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= ERKPP)) U X (G ((3 <= RKIP)))))
lola: processed formula length: 44
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 3083490 markings, 8003127 edges, 616698 markings/sec, 0 secs
lola: 5896797 markings, 16039413 edges, 562661 markings/sec, 5 secs
lola: 8900512 markings, 24063119 edges, 600743 markings/sec, 10 secs
lola: 11589585 markings, 31930292 edges, 537815 markings/sec, 15 secs
lola: 14332702 markings, 39782652 edges, 548623 markings/sec, 20 secs
lola: 17239718 markings, 47716088 edges, 581403 markings/sec, 25 secs
lola: 19842495 markings, 55456033 edges, 520555 markings/sec, 30 secs
lola: 22505410 markings, 63403213 edges, 532583 markings/sec, 35 secs
lola: 25010213 markings, 71083753 edges, 500961 markings/sec, 40 secs
lola: 27483358 markings, 78778591 edges, 494629 markings/sec, 45 secs
lola: 29886788 markings, 86334423 edges, 480686 markings/sec, 50 secs
lola: 32565017 markings, 93740395 edges, 535646 markings/sec, 55 secs
lola: 35141959 markings, 101329601 edges, 515388 markings/sec, 60 secs
lola: 37904509 markings, 109124084 edges, 552510 markings/sec, 65 secs
lola: 40663731 markings, 116766383 edges, 551844 markings/sec, 70 secs
lola: 43040318 markings, 124119078 edges, 475317 markings/sec, 75 secs
lola: 45712341 markings, 131514322 edges, 534405 markings/sec, 80 secs
lola: 48256695 markings, 139139477 edges, 508871 markings/sec, 85 secs
lola: 50682055 markings, 146386641 edges, 485072 markings/sec, 90 secs
lola: 53182946 markings, 153945246 edges, 500178 markings/sec, 95 secs
lola: 55643057 markings, 161233957 edges, 492022 markings/sec, 100 secs
lola: 58248178 markings, 168371773 edges, 521024 markings/sec, 105 secs
lola: 60764872 markings, 175486386 edges, 503339 markings/sec, 110 secs
lola: 63148509 markings, 182846962 edges, 476727 markings/sec, 115 secs
lola: 65715625 markings, 190311198 edges, 513423 markings/sec, 120 secs
lola: 68368213 markings, 197866292 edges, 530518 markings/sec, 125 secs
lola: 70678133 markings, 205160930 edges, 461984 markings/sec, 130 secs
lola: 73242470 markings, 212436535 edges, 512867 markings/sec, 135 secs
lola: 75839533 markings, 219720844 edges, 519413 markings/sec, 140 secs
lola: 77923226 markings, 226932857 edges, 416739 markings/sec, 145 secs
lola: 80139276 markings, 234164227 edges, 443210 markings/sec, 150 secs
lola: 82657014 markings, 241315293 edges, 503548 markings/sec, 155 secs
lola: 84905729 markings, 248305776 edges, 449743 markings/sec, 160 secs
lola: 86061340 markings, 251574902 edges, 231122 markings/sec, 165 secs
lola: 86064000 markings, 251581114 edges, 532 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= RP)))
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 <= RP)))
lola: processed formula length: 17
lola: 18 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.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: (RP <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ERK-PT-001000-LTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8998 markings, 15990 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Raf1Star_RKIP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= Raf1Star_RKIP)))
lola: processed formula length: 28
lola: 18 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Raf1Star_RKIP <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ERK-PT-001000-LTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= ERK)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= ERK)))
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.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: (ERK <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ERK-PT-001000-LTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1000 markings, 999 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= RKIPP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= RKIPP)))
lola: processed formula length: 20
lola: 18 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.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: (RKIPP <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ERK-PT-001000-LTLCardinality-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 847 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((MEKPP <= RKIP)))
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: (RKIP + 1 <= MEKPP)
lola: processed formula length: 19
lola: 18 rewrites
lola: closed formula file ERK-PT-001000-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: ========================================
sara: try reading problem file ERK-PT-001000-LTLCardinality-9-0.sara.

FORMULA ERK-PT-001000-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Raf1Star_RKIP <= MEKPP_ERK)))
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: (MEKPP_ERK + 1 <= Raf1Star_RKIP)
lola: processed formula length: 32
lola: 18 rewrites
lola: closed formula file ERK-PT-001000-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 ERK-PT-001000-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Raf1Star <= Raf1Star_RKIP)))
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: (Raf1Star_RKIP + 1 <= Raf1Star)
lola: processed formula length: 31
lola: 18 rewrites
lola: closed formula file ERK-PT-001000-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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2002 markings, 2002 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= RKIP) U (3 <= Raf1Star_RKIP)) OR (G (F ((3 <= Raf1Star))) AND F ((3 <= Raf1Star_RKIP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= RKIP) U (3 <= Raf1Star_RKIP)) OR (G (F ((3 <= Raf1Star))) AND F ((3 <= Raf1Star_RKIP)))))
lola: processed formula length: 100
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.task

lola: the resulting Büchi automaton has 7 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: 2007 markings, 2007 edges
lola: ========================================

FORMULA ERK-PT-001000-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= ERKPP)) U X (G ((3 <= RKIP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= ERKPP)) U X (G ((3 <= RKIP)))))
lola: processed formula length: 44
lola: 16 rewrites
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 3083490 markings, 8012732 edges, 616698 markings/sec, 0 secs
lola: 5898661 markings, 16043793 edges, 563034 markings/sec, 5 secs
lola: 8906493 markings, 24078588 edges, 601566 markings/sec, 10 secs
lola: 11594551 markings, 31941878 edges, 537612 markings/sec, 15 secs
lola: 14340857 markings, 39813029 edges, 549261 markings/sec, 20 secs
lola: 17266268 markings, 47776774 edges, 585082 markings/sec, 25 secs
lola: 19875967 markings, 55537228 edges, 521940 markings/sec, 30 secs
lola: 22546699 markings, 63522168 edges, 534146 markings/sec, 35 secs
lola: 25068496 markings, 71221600 edges, 504359 markings/sec, 40 secs
lola: 27541208 markings, 78950085 edges, 494542 markings/sec, 45 secs
lola: 29939527 markings, 86513363 edges, 479664 markings/sec, 50 secs
lola: 32620547 markings, 93975835 edges, 536204 markings/sec, 55 secs
lola: 35228527 markings, 101590454 edges, 521596 markings/sec, 60 secs
lola: 38013851 markings, 109413186 edges, 557065 markings/sec, 65 secs
lola: 40752796 markings, 117087594 edges, 547789 markings/sec, 70 secs
lola: 43200349 markings, 124504430 edges, 489511 markings/sec, 75 secs
lola: 45875383 markings, 132041049 edges, 535007 markings/sec, 80 secs
lola: 48303584 markings, 139251592 edges, 485640 markings/sec, 85 secs
lola: 50591922 markings, 146166559 edges, 457668 markings/sec, 90 secs
lola: 52939046 markings, 153362081 edges, 469425 markings/sec, 95 secs
lola: 55316526 markings, 160293276 edges, 475496 markings/sec, 100 secs
lola: 57766838 markings, 167153830 edges, 490062 markings/sec, 105 secs
lola: 60271768 markings, 173895898 edges, 500986 markings/sec, 110 secs
lola: 62554136 markings, 180859818 edges, 456474 markings/sec, 115 secs
lola: 64972871 markings, 188324447 edges, 483747 markings/sec, 120 secs
lola: 67819104 markings, 195983662 edges, 569247 markings/sec, 125 secs
lola: 70157715 markings, 203317298 edges, 467722 markings/sec, 130 secs
lola: 72709723 markings, 210681462 edges, 510402 markings/sec, 135 secs
lola: 75196004 markings, 217984210 edges, 497256 markings/sec, 140 secs
lola: 77499944 markings, 225266138 edges, 460788 markings/sec, 145 secs
lola: 79662823 markings, 232499066 edges, 432576 markings/sec, 150 secs
lola: 82036989 markings, 239677599 edges, 474833 markings/sec, 155 secs
lola: 84379549 markings, 246714468 edges, 468512 markings/sec, 160 secs
lola: 86049755 markings, 251547357 edges, 334041 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA ERK-PT-001000-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes no yes yes no no no no unknown no yes no
lola:
preliminary result: no no no no yes no yes yes no no no no unknown no yes no
lola: memory consumption: 17464 KB
lola: time consumption: 351 seconds

BK_STOP 1552420536731

--------------------
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="ERK-PT-001000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is ERK-PT-001000, 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 r077-smll-155234766400047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-001000.tgz
mv ERK-PT-001000 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;