fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r082-csrt-155246548900067
Last Updated
Apr 15, 2019

About the Execution of LoLA for FMS-PT-00500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15910.960 1068006.00 1087087.00 813.90 FTTF?TF?TFT?TTFT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246548900067.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is FMS-PT-00500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246548900067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.2K Feb 10 23:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 10 23:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 6 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 20:59 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 99 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 337 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 23:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 23:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 3 08:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 3 08:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 31 01:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 31 01:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-00500-CTLCardinality-00
FORMULA_NAME FMS-PT-00500-CTLCardinality-01
FORMULA_NAME FMS-PT-00500-CTLCardinality-02
FORMULA_NAME FMS-PT-00500-CTLCardinality-03
FORMULA_NAME FMS-PT-00500-CTLCardinality-04
FORMULA_NAME FMS-PT-00500-CTLCardinality-05
FORMULA_NAME FMS-PT-00500-CTLCardinality-06
FORMULA_NAME FMS-PT-00500-CTLCardinality-07
FORMULA_NAME FMS-PT-00500-CTLCardinality-08
FORMULA_NAME FMS-PT-00500-CTLCardinality-09
FORMULA_NAME FMS-PT-00500-CTLCardinality-10
FORMULA_NAME FMS-PT-00500-CTLCardinality-11
FORMULA_NAME FMS-PT-00500-CTLCardinality-12
FORMULA_NAME FMS-PT-00500-CTLCardinality-13
FORMULA_NAME FMS-PT-00500-CTLCardinality-14
FORMULA_NAME FMS-PT-00500-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552654479549

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ FMS-PT-00500 @ 3570 seconds

FORMULA FMS-PT-00500-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
Makefile:16: recipe for target 'verify' failed
vrfy: finished
info: timeLeft: 2502
rslt: Output for CTLCardinality @ FMS-PT-00500
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= P2M2)
lola: LP says that atomic proposition is always false: (3 <= M2)
lola: LP says that atomic proposition is always false: (3 <= P2M2)
lola: NOT((E (F ((M3 + 1 <= P12wM3))) AND ((P2wP1 <= 0) OR (P1 + 1 <= P12M3) OR ((P3 + 1 <= M1))))) : NOT(E (F ((3 <= M2)))) : NOT(NOT(E (F (((3 <= P1d) AND (3 <= P1M1)))))) : A (G ((A (G ((1 <= P1))) OR ((P2 <= P2wP1) AND (1 <= P1))))) : E (((P12wM3 <= 2) U A (G ((P2s <= P1d))))) : NOT(E (G (A (G ((P3s <= P3)))))) : (A (((1 <= P12wM3) U (P1d <= P2wM2))) AND A (G ((1 <= M3)))) : E (F (A (X ((P2wP1 + 1 <= P12s))))) : E (F (E (X (((1 <= P12s) AND (2 <= P1)))))) : NOT((E (F ((P3 + 1 <= P3M2))) OR ((P3M2 <= 0) AND (M2 + 1 <= P12) AND (P2 <= 1) AND (1 <= M3)))) : NOT(((P3s <= M2) AND E (((P12 <= P2d) U (3 <= P2M2))))) : E (((1 <= M1) U A (G ((3 <= P1wM1))))) : NOT(A (G (((2 <= M1) OR (3 <= P1) OR ((3 <= P12wM3) AND (P3 <= P1)))))) : (A (F (E (F ((1 <= P12M3))))) OR NOT((((P2wP1 + 1 <= P3) OR ((3 <= P12) AND (P2s <= P2d))) AND E (F ((M1 <= P1wM1)))))) : A (X (A (G ((1 <= M3))))) : E ((E (X ((P12 <= P3))) U ((P3M2 <= P1M1) AND (P2 <= M1) AND ((P2wP1 <= M2) OR (P1wM1 <= P3M2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:282
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 39 rewrites
lola: closed formula file CTLCardinality.xml
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: ========================================
lola: subprocess 1 will run for 237 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: 39 rewrites
lola: closed formula file CTLCardinality.xml
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: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= P12s) AND (2 <= P1))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= P12s) AND (2 <= P1))
lola: processed formula length: 27
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= P12s) AND (2 <= P1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 13 markings, 12 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((P2wP1 + 1 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: lola: state equation: calling and running sara
rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((P2wP1 + 1 <= P12s)))
lola: processed formula length: 27
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file CTLCardinality-2-0.sara.

lola: 3715001 markings, 6477090 edges, 743000 markings/sec, 0 secs
lola: 7056680 markings, 12311783 edges, 668336 markings/sec, 5 secs
lola: 10292575 markings, 17940618 edges, 647179 markings/sec, 10 secs
lola: 13475769 markings, 23480649 edges, 636639 markings/sec, 15 secs
lola: 16736188 markings, 29142984 edges, 652084 markings/sec, 20 secs
lola: 19865202 markings, 34583271 edges, 625803 markings/sec, 25 secs
lola: 23181938 markings, 40341628 edges, 663347 markings/sec, 30 secs
lola: 26219874 markings, 45617939 edges, 607587 markings/sec, 35 secs
lola: 29207727 markings, 50807684 edges, 597571 markings/sec, 40 secs
lola: 32295553 markings, 56166545 edges, 617565 markings/sec, 45 secs
lola: 35592246 markings, 61884981 edges, 659339 markings/sec, 50 secs
lola: 38635479 markings, 67171388 edges, 608647 markings/sec, 55 secs
lola: 41570493 markings, 72259870 edges, 587003 markings/sec, 60 secs
lola: 44605182 markings, 77534429 edges, 606938 markings/sec, 65 secs
lola: 47697403 markings, 82896635 edges, 618444 markings/sec, 70 secs
lola: 50618749 markings, 87965996 edges, 584269 markings/sec, 75 secs
lola: 53565512 markings, 93078648 edges, 589353 markings/sec, 80 secs
lola: 56475173 markings, 98127160 edges, 581932 markings/sec, 85 secs
lola: 59397331 markings, 103202364 edges, 584432 markings/sec, 90 secs
lola: 62278818 markings, 108185457 edges, 576297 markings/sec, 95 secs
lola: 65166108 markings, 113207689 edges, 577458 markings/sec, 100 secs
lola: 68053020 markings, 118212973 edges, 577382 markings/sec, 105 secs
lola: 71087224 markings, 123465600 edges, 606841 markings/sec, 110 secs
lola: 74227793 markings, 128926976 edges, 628114 markings/sec, 115 secs
lola: 77360489 markings, 134350117 edges, 626539 markings/sec, 120 secs
lola: 80517807 markings, 139821446 edges, 631464 markings/sec, 125 secs
lola: 83685987 markings, 145319055 edges, 633636 markings/sec, 130 secs
lola: 86635624 markings, 150444867 edges, 589927 markings/sec, 135 secs
lola: 88567637 markings, 153789541 edges, 386403 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((1 <= M3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (M3 <= 0)
lola: processed formula length: 9
lola: 42 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (M3 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((P12 <= P3))) U ((P3M2 <= P1M1) AND (P2 <= M1) AND ((P2wP1 <= M2) OR (P1wM1 <= P3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((P12 <= P3)) U ((P3M2 <= P1M1) AND (P2 <= M1) AND ((P2wP1 <= M2) OR (P1wM1 <= P3M2))))
lola: processed formula length: 92
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 498497 markings, 912997 edges
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P3 + 1 <= P3s)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((P3 + 1 <= P3s)))
lola: processed formula length: 23
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P3 + 1 <= P3s)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 502 markings, 501 edges
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= P1d) AND (3 <= P1M1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= P1d) AND (3 <= P1M1))))
lola: processed formula length: 36
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= P1d) AND (3 <= P1M1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((M1 <= 1) AND (P1 <= 2) AND ((P12wM3 <= 2) OR (P1 + 1 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((M1 <= 1) AND (P1 <= 2) AND ((P12wM3 <= 2) OR (P1 + 1 <= P3)))))
lola: processed formula length: 72
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((M1 <= 1) AND (P1 <= 2) AND ((P12wM3 <= 2) OR (P1 + 1 <= P3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 501 markings, 500 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= M1) U A (G ((3 <= P1wM1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((1 <= M1) U AG((3 <= P1wM1)))
lola: processed formula length: 31
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file CTLCardinality-8-0.sara.

lola: 2499493 markings, 6946675 edges, 499899 markings/sec, 0 secs
lola: 3492298 markings, 14091414 edges, 198561 markings/sec, 5 secs
lola: 5182549 markings, 21262607 edges, 338050 markings/sec, 10 secs
lola: 6850278 markings, 28426706 edges, 333546 markings/sec, 15 secs
lola: 8468498 markings, 35424549 edges, 323644 markings/sec, 20 secs
lola: 9989909 markings, 42032356 edges, 304282 markings/sec, 25 secs
lola: 11547061 markings, 48688786 edges, 311430 markings/sec, 30 secs
lola: 13039737 markings, 55326197 edges, 298535 markings/sec, 35 secs
lola: 14551409 markings, 61930473 edges, 302334 markings/sec, 40 secs
lola: 16089391 markings, 68473344 edges, 307596 markings/sec, 45 secs
lola: 17580489 markings, 75057446 edges, 298220 markings/sec, 50 secs
lola: 19032257 markings, 81559551 edges, 290354 markings/sec, 55 secs
lola: 20503109 markings, 88012445 edges, 294170 markings/sec, 60 secs
lola: 22042667 markings, 94771291 edges, 307912 markings/sec, 65 secs
lola: 23547091 markings, 101158885 edges, 300885 markings/sec, 70 secs
lola: 24951866 markings, 107563865 edges, 280955 markings/sec, 75 secs
lola: 26400870 markings, 113937354 edges, 289801 markings/sec, 80 secs
lola: 27908267 markings, 120569463 edges, 301479 markings/sec, 85 secs
lola: 29480346 markings, 127484493 edges, 314416 markings/sec, 90 secs
lola: 31043142 markings, 134368825 edges, 312559 markings/sec, 95 secs
lola: 32628031 markings, 141160623 edges, 316978 markings/sec, 100 secs
lola: 34100577 markings, 147837633 edges, 294509 markings/sec, 105 secs
lola: 35545441 markings, 154204612 edges, 288973 markings/sec, 110 secs
lola: 36939585 markings, 160353543 edges, 278829 markings/sec, 115 secs
lola: 38376896 markings, 166600094 edges, 287462 markings/sec, 120 secs
lola: 39876293 markings, 173004465 edges, 299879 markings/sec, 125 secs
lola: 41334903 markings, 179667672 edges, 291722 markings/sec, 130 secs
lola: 42806507 markings, 186235520 edges, 294321 markings/sec, 135 secs
lola: 44349993 markings, 193053167 edges, 308697 markings/sec, 140 secs
lola: 45852199 markings, 199538310 edges, 300441 markings/sec, 145 secs
lola: 47301758 markings, 206090570 edges, 289912 markings/sec, 150 secs
lola: 48733982 markings, 212407532 edges, 286445 markings/sec, 155 secs
lola: 50293610 markings, 219009499 edges, 311926 markings/sec, 160 secs
lola: 51718326 markings, 225604699 edges, 284943 markings/sec, 165 secs
lola: 53197287 markings, 232132871 edges, 295792 markings/sec, 170 secs
lola: 54656695 markings, 238578249 edges, 291882 markings/sec, 175 secs
lola: 56127114 markings, 245077543 edges, 294084 markings/sec, 180 secs
lola: 57605553 markings, 251612780 edges, 295688 markings/sec, 185 secs
lola: 59060409 markings, 258047539 edges, 290971 markings/sec, 190 secs
lola: 60506738 markings, 264409809 edges, 289266 markings/sec, 195 secs
lola: 61965546 markings, 270685439 edges, 291762 markings/sec, 200 secs
lola: 63315274 markings, 276862073 edges, 269946 markings/sec, 205 secs
lola: 64814305 markings, 283501777 edges, 299806 markings/sec, 210 secs
lola: 66287569 markings, 289793191 edges, 294653 markings/sec, 215 secs
lola: 67615850 markings, 295892382 edges, 265656 markings/sec, 220 secs
lola: 69003150 markings, 302015113 edges, 277460 markings/sec, 225 secs
lola: 70435421 markings, 308139951 edges, 286454 markings/sec, 230 secs
lola: 71733535 markings, 314110746 edges, 259623 markings/sec, 235 secs
lola: 73089290 markings, 320101960 edges, 271151 markings/sec, 240 secs
lola: 74621231 markings, 326428729 edges, 306388 markings/sec, 245 secs
lola: 75900265 markings, 332423215 edges, 255807 markings/sec, 250 secs
lola: 77236448 markings, 338472373 edges, 267237 markings/sec, 255 secs
lola: 78657237 markings, 344748298 edges, 284158 markings/sec, 260 secs
lola: 80101713 markings, 351057723 edges, 288895 markings/sec, 265 secs
lola: 81525110 markings, 357121956 edges, 284679 markings/sec, 270 secs
lola: 82896073 markings, 363102006 edges, 274193 markings/sec, 275 secs
lola: 84276390 markings, 369191110 edges, 276063 markings/sec, 280 secs
lola: 85636588 markings, 375165680 edges, 272040 markings/sec, 285 secs
lola: 87009470 markings, 381256045 edges, 274576 markings/sec, 290 secs
lola: 88381372 markings, 387356136 edges, 274380 markings/sec, 295 secs
lola: 89798350 markings, 393651198 edges, 283396 markings/sec, 300 secs
lola: 91094814 markings, 399608188 edges, 259293 markings/sec, 305 secs
lola: 92416719 markings, 405675523 edges, 264381 markings/sec, 310 secs
lola: 93827514 markings, 411927582 edges, 282159 markings/sec, 315 secs
lola: 95192167 markings, 417981001 edges, 272931 markings/sec, 320 secs
lola: 96544793 markings, 423986141 edges, 270525 markings/sec, 325 secs
lola: 97927985 markings, 429913141 edges, 276638 markings/sec, 330 secs
lola: 99402416 markings, 436108490 edges, 294886 markings/sec, 335 secs
lola: 100653464 markings, 442172407 edges, 250210 markings/sec, 340 secs
lola: 102118463 markings, 448666254 edges, 293000 markings/sec, 345 secs
lola: 103514052 markings, 454862206 edges, 279118 markings/sec, 350 secs
lola: 104898825 markings, 460999457 edges, 276955 markings/sec, 355 secs
lola: 106425856 markings, 467282994 edges, 305406 markings/sec, 360 secs
lola: 107735147 markings, 473555765 edges, 261858 markings/sec, 365 secs
lola: 109168050 markings, 479916345 edges, 286581 markings/sec, 370 secs
lola: 110596728 markings, 486265182 edges, 285736 markings/sec, 375 secs
lola: 112108648 markings, 492452468 edges, 302384 markings/sec, 380 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((P12wM3 <= 2) U A (G ((P2s <= P1d)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((P12wM3 <= 2) U AG((P2s <= P1d)))
lola: processed formula length: 35
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2510511 markings, 6927758 edges, 502102 markings/sec, 0 secs
lola: 3222296 markings, 14354049 edges, 142357 markings/sec, 5 secs
lola: 4952113 markings, 22036933 edges, 345963 markings/sec, 10 secs
lola: 6632856 markings, 29458693 edges, 336149 markings/sec, 15 secs
lola: 8271381 markings, 36762895 edges, 327705 markings/sec, 20 secs
lola: 9880594 markings, 43982771 edges, 321843 markings/sec, 25 secs
lola: 11477811 markings, 51094934 edges, 319443 markings/sec, 30 secs
lola: 13095938 markings, 58215988 edges, 323625 markings/sec, 35 secs
lola: 14652565 markings, 65113458 edges, 311325 markings/sec, 40 secs
lola: 16188153 markings, 72085803 edges, 307118 markings/sec, 45 secs
lola: 17779116 markings, 79022656 edges, 318193 markings/sec, 50 secs
lola: 19296762 markings, 85940370 edges, 303529 markings/sec, 55 secs
lola: 20880831 markings, 92851646 edges, 316814 markings/sec, 60 secs
lola: 22410848 markings, 99714131 edges, 306003 markings/sec, 65 secs
lola: 23932771 markings, 106564174 edges, 304385 markings/sec, 70 secs
lola: 25440330 markings, 113338976 edges, 301512 markings/sec, 75 secs
lola: 26950847 markings, 120070227 edges, 302103 markings/sec, 80 secs
lola: 28455318 markings, 126776214 edges, 300894 markings/sec, 85 secs
lola: 29973295 markings, 133550909 edges, 303595 markings/sec, 90 secs
lola: 31541376 markings, 140278469 edges, 313616 markings/sec, 95 secs
lola: 32901076 markings, 146610043 edges, 271940 markings/sec, 100 secs
lola: 34316768 markings, 152918202 edges, 283138 markings/sec, 105 secs
lola: 35728659 markings, 159217299 edges, 282378 markings/sec, 110 secs
lola: 37237172 markings, 165936643 edges, 301703 markings/sec, 115 secs
lola: 38737151 markings, 172624363 edges, 299996 markings/sec, 120 secs
lola: 40228516 markings, 179279667 edges, 298273 markings/sec, 125 secs
lola: 41745068 markings, 185883378 edges, 303310 markings/sec, 130 secs
lola: 43140901 markings, 192253427 edges, 279167 markings/sec, 135 secs
lola: 44621765 markings, 198739315 edges, 296173 markings/sec, 140 secs
lola: 46056682 markings, 205258788 edges, 286983 markings/sec, 145 secs
lola: 47593148 markings, 211864125 edges, 307293 markings/sec, 150 secs
lola: 49045083 markings, 218590201 edges, 290387 markings/sec, 155 secs
lola: 50598036 markings, 225333839 edges, 310591 markings/sec, 160 secs
lola: 52075021 markings, 232102847 edges, 295397 markings/sec, 165 secs
lola: 53567034 markings, 238761805 edges, 298403 markings/sec, 170 secs
lola: 55039889 markings, 245322803 edges, 294571 markings/sec, 175 secs
lola: 56508993 markings, 251876750 edges, 293821 markings/sec, 180 secs
lola: 57983936 markings, 258454876 edges, 294989 markings/sec, 185 secs
lola: 59457205 markings, 265028368 edges, 294654 markings/sec, 190 secs
lola: 60934607 markings, 271624568 edges, 295480 markings/sec, 195 secs
lola: 62432056 markings, 278188816 edges, 299490 markings/sec, 200 secs
lola: 63934138 markings, 284718895 edges, 300416 markings/sec, 205 secs
lola: 65347855 markings, 291290516 edges, 282743 markings/sec, 210 secs
lola: 66815501 markings, 297853270 edges, 293529 markings/sec, 215 secs
lola: 68234491 markings, 304124161 edges, 283798 markings/sec, 220 secs
lola: 69656915 markings, 310528348 edges, 284485 markings/sec, 225 secs
lola: 71132753 markings, 316984710 edges, 295168 markings/sec, 230 secs
lola: 72599560 markings, 323646948 edges, 293361 markings/sec, 235 secs
lola: 74022701 markings, 329974793 edges, 284628 markings/sec, 240 secs
lola: 75476421 markings, 336366038 edges, 290744 markings/sec, 245 secs
lola: 76896329 markings, 342807844 edges, 283982 markings/sec, 250 secs
lola: 78425996 markings, 349339721 edges, 305933 markings/sec, 255 secs
lola: 79869683 markings, 356080373 edges, 288737 markings/sec, 260 secs
lola: 81306603 markings, 362473728 edges, 287384 markings/sec, 265 secs
lola: 82748494 markings, 368873047 edges, 288378 markings/sec, 270 secs
lola: 84276390 markings, 375356236 edges, 305579 markings/sec, 275 secs
lola: 85636588 markings, 381765237 edges, 272040 markings/sec, 280 secs
lola: 87053918 markings, 388127293 edges, 283466 markings/sec, 285 secs
lola: 88487292 markings, 394514302 edges, 286675 markings/sec, 290 secs
lola: 89923025 markings, 400914272 edges, 287147 markings/sec, 295 secs
lola: 91360040 markings, 407320068 edges, 287403 markings/sec, 300 secs
lola: 92784372 markings, 413673336 edges, 284866 markings/sec, 305 secs
lola: 94211200 markings, 420038110 edges, 285366 markings/sec, 310 secs
lola: 95622483 markings, 426338710 edges, 282257 markings/sec, 315 secs
lola: 97028740 markings, 432615947 edges, 281251 markings/sec, 320 secs
lola: 98448030 markings, 438954137 edges, 283858 markings/sec, 325 secs
lola: 99892388 markings, 445054097 edges, 288872 markings/sec, 330 secs
lola: 101227671 markings, 451206370 edges, 267057 markings/sec, 335 secs
lola: 102588381 markings, 457400582 edges, 272142 markings/sec, 340 secs
lola: 104025683 markings, 463820764 edges, 287460 markings/sec, 345 secs
lola: 105446273 markings, 470171824 edges, 284118 markings/sec, 350 secs
lola: 106932365 markings, 476390886 edges, 297218 markings/sec, 355 secs
lola: 108322560 markings, 482825226 edges, 278039 markings/sec, 360 secs
lola: 109697981 markings, 489118153 edges, 275084 markings/sec, 365 secs
lola: 111128739 markings, 495517110 edges, 286152 markings/sec, 370 secs
lola: 112639196 markings, 501787596 edges, 302091 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((1 <= P1))) OR ((P2 <= P2wP1) AND (1 <= P1)))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((1 <= P1)) OR ((P2 <= P2wP1) AND (1 <= P1))))
lola: processed formula length: 52
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
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: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 7496 markings, 8495 edges
lola: ========================================
lola: subprocess 12 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((P3M2 <= P3))) AND ((1 <= P3M2) OR (P12 <= M2) OR (2 <= P2) OR (M3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P3M2 <= P3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((P3M2 <= P3)))
lola: processed formula length: 20
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P3 + 1 <= P3M2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 252 markings, 251 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((1 <= P12wM3) U (P1d <= P2wM2))) AND A (G ((1 <= M3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= M3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= M3)))
lola: processed formula length: 17
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (M3 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((P12wM3 <= M3))) OR ((1 <= P2wP1) AND (P12M3 <= P1) AND ((M1 <= P3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P12wM3 <= M3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((P12wM3 <= M3)))
lola: processed formula length: 22
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 15 will run for 2643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= P2wP1) AND (P12M3 <= P1) AND ((M1 <= P3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= P2wP1) AND (P12M3 <= P1) AND ((M1 <= P3)))
lola: processed formula length: 49
lola: 39 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= P12M3))) OR (((P3 <= P2wP1) AND ((P12 <= 2) OR (P2d + 1 <= P2s))) OR A (G ((P1wM1 + 1 <= M1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= P12M3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= P12M3)))
lola: processed formula length: 20
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((P2wP1 + 1 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((P2wP1 + 1 <= P12s)))
lola: processed formula length: 27
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3602264 markings, 6277837 edges, 720453 markings/sec, 0 secs
lola: 7057924 markings, 12314025 edges, 691132 markings/sec, 5 secs
lola: 10391698 markings, 18115169 edges, 666755 markings/sec, 10 secs
lola: 13701040 markings, 23868945 edges, 661868 markings/sec, 15 secs
lola: 16972317 markings, 29554097 edges, 654255 markings/sec, 20 secs
lola: 20227314 markings, 35211903 edges, 650999 markings/sec, 25 secs
lola: 23455795 markings, 40812797 edges, 645696 markings/sec, 30 secs
lola: 26664395 markings, 46393590 edges, 641720 markings/sec, 35 secs
lola: 29862732 markings, 51939430 edges, 639667 markings/sec, 40 secs
lola: 33030009 markings, 57438616 edges, 633455 markings/sec, 45 secs
lola: 36165417 markings, 62877680 edges, 627082 markings/sec, 50 secs
lola: 39303549 markings, 68334683 edges, 627626 markings/sec, 55 secs
lola: 42425600 markings, 73751891 edges, 624410 markings/sec, 60 secs
lola: 45545045 markings, 79160719 edges, 623889 markings/sec, 65 secs
lola: 48665176 markings, 84579753 edges, 624026 markings/sec, 70 secs
lola: 51782168 markings, 89987015 edges, 623398 markings/sec, 75 secs
lola: 54888927 markings, 95375972 edges, 621352 markings/sec, 80 secs
lola: 57976488 markings, 100729297 edges, 617512 markings/sec, 85 secs
lola: 60964225 markings, 105915803 edges, 597547 markings/sec, 90 secs
lola: 63849975 markings, 110912779 edges, 577150 markings/sec, 95 secs
lola: 66827968 markings, 116089433 edges, 595599 markings/sec, 100 secs
lola: 69878909 markings, 121370364 edges, 610188 markings/sec, 105 secs
lola: 72937889 markings, 126690739 edges, 611796 markings/sec, 110 secs
lola: 75954227 markings, 131920571 edges, 603268 markings/sec, 115 secs
lola: 79040780 markings, 137271344 edges, 617311 markings/sec, 120 secs
lola: 82137887 markings, 142641378 edges, 619421 markings/sec, 125 secs
lola: 85197955 markings, 147953907 edges, 612014 markings/sec, 130 secs
lola: 88223396 markings, 153184253 edges, 605088 markings/sec, 135 secs
Killed
rslt: finished

BK_STOP 1552655547555

--------------------
content from stderr:

make: [verify] Error 137 (ignored)

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="FMS-PT-00500"
export BK_EXAMINATION="CTLCardinality"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is FMS-PT-00500, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-csrt-155246548900067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00500.tgz
mv FMS-PT-00500 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;