Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r165-oct2-158972938900009.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is RefineWMG-PT-007007, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-oct2-158972938900009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.1K Apr 12 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 11:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 18K Mar 24 05:38 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 RefineWMG-PT-007007-00
FORMULA_NAME RefineWMG-PT-007007-01
FORMULA_NAME RefineWMG-PT-007007-02
FORMULA_NAME RefineWMG-PT-007007-03
FORMULA_NAME RefineWMG-PT-007007-04
FORMULA_NAME RefineWMG-PT-007007-05
FORMULA_NAME RefineWMG-PT-007007-06
FORMULA_NAME RefineWMG-PT-007007-07
FORMULA_NAME RefineWMG-PT-007007-08
FORMULA_NAME RefineWMG-PT-007007-09
FORMULA_NAME RefineWMG-PT-007007-10
FORMULA_NAME RefineWMG-PT-007007-11
FORMULA_NAME RefineWMG-PT-007007-12
FORMULA_NAME RefineWMG-PT-007007-13
FORMULA_NAME RefineWMG-PT-007007-14
FORMULA_NAME RefineWMG-PT-007007-15

=== Now, execution of the tool begins

BK_START 1590263473027

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-007007 @ 3570 seconds

FORMULA RefineWMG-PT-007007-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-007007-04 FALSE 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: 3106
rslt: Output for LTLCardinality @ RefineWMG-PT-007007
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: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 31 transitions, 23 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 LTLCardinality.xml
lola: A (G (F ((G ((p25 <= 2)) OR X (X (G ((p17 <= p20)))))))) : A (X (F (G (F (X ((((p11 <= p28) AND X ((psecond <= p10))) U G ((p5 <= p28))))))))) : A (G (F (((((2 <= p4) U X ((2 <= p4))) OR NOT(X ((p11 <= pprime)))) OR G ((p6 <= p33)))))) : A (G (F (NOT((X (X ((0 <= p20))) OR X (X (F (G (F (G ((0 <= p20)))))))))))) : A (((G ((3 <= p19)) AND F ((p21 <= p16))) AND (F ((3 <= p12)) U (2 <= p15)))) : A (((p23 <= 1) OR (((p35 + 1 <= p4) AND (p34 <= 2)) U G ((p4 <= p35))))) : A (NOT((((1 <= p6) AND (p28 + 1 <= p7)) U F (G ((G ((p7 <= p28)) U (2 <= p2))))))) : A (G (X (X ((p30 <= p24))))) : A (NOT(G (NOT(((3 <= p21) U (p21 <= 2)))))) : A (NOT(F ((p25 <= p8)))) : A ((((((p33 <= p22) AND X (NOT(X ((p14 <= p30))))) U G ((1 <= p18))) U G ((p14 <= p30))) U F ((1 <= p26)))) : A (((3 <= p14) OR NOT((G ((p17 <= p33)) U (0 <= p26))))) : A (X (G ((G (F (NOT(X (((p14 <= p6) U G ((p32 <= p10))))))) U (p32 <= p10))))) : A ((F (G (NOT(X (X (F ((p22 <= p8))))))) U G ((2 <= p32)))) : A (NOT(G ((3 <= p2)))) : A (G ((p33 <= p11)))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
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: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p14)
lola: processed formula length: 10
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((G ((p25 <= 2)) OR X (X (G ((p17 <= p20))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G ((p25 <= 2)) OR X (X (G ((p17 <= p20))))))))
lola: processed formula length: 56
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5376403 markings, 8448589 edges, 1075281 markings/sec, 0 secs
lola: 9693205 markings, 17904271 edges, 863360 markings/sec, 5 secs
lola: 13887509 markings, 27785314 edges, 838861 markings/sec, 10 secs
lola: 18081813 markings, 37426176 edges, 838861 markings/sec, 15 secs
lola: 22276117 markings, 46692026 edges, 838861 markings/sec, 20 secs
lola: 26881150 markings, 55255327 edges, 921007 markings/sec, 25 secs
lola: 32114982 markings, 63479918 edges, 1046766 markings/sec, 30 secs
lola: 37187801 markings, 71451488 edges, 1014564 markings/sec, 35 secs
lola: 42271773 markings, 79440590 edges, 1016794 markings/sec, 40 secs
lola: 47280965 markings, 87312172 edges, 1001838 markings/sec, 45 secs
lola: 52300339 markings, 95199759 edges, 1003875 markings/sec, 50 secs
lola: 57506949 markings, 103381579 edges, 1041322 markings/sec, 55 secs
lola: 62580049 markings, 111353572 edges, 1014620 markings/sec, 60 secs
lola: 66504127 markings, 120122697 edges, 784816 markings/sec, 65 secs
lola: 70451712 markings, 128928759 edges, 789517 markings/sec, 70 secs
lola: 74354020 markings, 137663679 edges, 780462 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((p30 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((p30 <= p24)))))
lola: processed formula length: 28
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
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: 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: 72 markings, 105 edges
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((((2 <= p4) U X ((2 <= p4))) OR (X ((pprime + 1 <= p11)) OR G ((p6 <= p33)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((((2 <= p4) U X ((2 <= p4))) OR (X ((pprime + 1 <= p11)) OR G ((p6 <= p33)))))))
lola: processed formula length: 89
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5207177 markings, 8182638 edges, 1041435 markings/sec, 0 secs
lola: 10310446 markings, 16202068 edges, 1020654 markings/sec, 5 secs
lola: 13408772 markings, 26276294 edges, 619665 markings/sec, 10 secs
lola: 16323266 markings, 36061627 edges, 582899 markings/sec, 15 secs
lola: 18423634 markings, 45835162 edges, 420074 markings/sec, 20 secs
lola: 19557666 markings, 56286600 edges, 226806 markings/sec, 25 secs
lola: 21889981 markings, 65515814 edges, 466463 markings/sec, 30 secs
lola: 22958495 markings, 75091443 edges, 213703 markings/sec, 35 secs
lola: 25085310 markings, 84305986 edges, 425363 markings/sec, 40 secs
lola: 26241355 markings, 93666691 edges, 231209 markings/sec, 45 secs
lola: 27824938 markings, 102823846 edges, 316717 markings/sec, 50 secs
lola: 29532038 markings, 111898706 edges, 341420 markings/sec, 55 secs
lola: 30516042 markings, 120843591 edges, 196801 markings/sec, 60 secs
lola: 32558816 markings, 129734826 edges, 408555 markings/sec, 65 secs
lola: 33629340 markings, 138526402 edges, 214105 markings/sec, 70 secs
lola: 34458462 markings, 147474304 edges, 165824 markings/sec, 75 secs
lola: 36566057 markings, 156111716 edges, 421519 markings/sec, 80 secs
lola: 37621128 markings, 165087648 edges, 211014 markings/sec, 85 secs
lola: 39838246 markings, 173182507 edges, 443424 markings/sec, 90 secs
lola: 40757657 markings, 180923513 edges, 183882 markings/sec, 95 secs
lola: 41535751 markings, 188352714 edges, 155619 markings/sec, 100 secs
lola: 43583523 markings, 195938193 edges, 409554 markings/sec, 105 secs
lola: 44391731 markings, 203518072 edges, 161642 markings/sec, 110 secs
lola: 45100424 markings, 210921560 edges, 141739 markings/sec, 115 secs
lola: 46620609 markings, 218574830 edges, 304037 markings/sec, 120 secs
lola: 47986461 markings, 226440995 edges, 273170 markings/sec, 125 secs
lola: 48703874 markings, 233750127 edges, 143483 markings/sec, 130 secs
lola: 49555919 markings, 241301851 edges, 170409 markings/sec, 135 secs
lola: 51538125 markings, 249143435 edges, 396441 markings/sec, 140 secs
lola: 52382985 markings, 256923346 edges, 168972 markings/sec, 145 secs
lola: 53149386 markings, 264938263 edges, 153280 markings/sec, 150 secs
lola: 55057745 markings, 272153697 edges, 381672 markings/sec, 155 secs
lola: 55876841 markings, 278796223 edges, 163819 markings/sec, 160 secs
lola: 56451956 markings, 285526647 edges, 115023 markings/sec, 165 secs
lola: 57940979 markings, 292481756 edges, 297805 markings/sec, 170 secs
lola: 59111113 markings, 299660931 edges, 234027 markings/sec, 175 secs
lola: 59839002 markings, 306478712 edges, 145578 markings/sec, 180 secs
lola: 60529903 markings, 313345492 edges, 138180 markings/sec, 185 secs
lola: 62649022 markings, 321835597 edges, 423824 markings/sec, 190 secs
lola: 63721155 markings, 331137681 edges, 214427 markings/sec, 195 secs
lola: 65960603 markings, 339923109 edges, 447890 markings/sec, 200 secs
lola: 66955786 markings, 348895373 edges, 199037 markings/sec, 205 secs
lola: 67885758 markings, 358012362 edges, 185994 markings/sec, 210 secs
lola: 69762328 markings, 366785014 edges, 375314 markings/sec, 215 secs
lola: 70833959 markings, 375514989 edges, 214326 markings/sec, 220 secs
lola: 71812716 markings, 384334056 edges, 195751 markings/sec, 225 secs
lola: 73867292 markings, 392121096 edges, 410915 markings/sec, 230 secs
lola: 74790713 markings, 399649638 edges, 184684 markings/sec, 235 secs
lola: 75549583 markings, 407041465 edges, 151774 markings/sec, 240 secs
lola: 77504952 markings, 414274015 edges, 391074 markings/sec, 245 secs
lola: 78354680 markings, 420808863 edges, 169946 markings/sec, 250 secs
lola: 79018210 markings, 427893256 edges, 132706 markings/sec, 255 secs
lola: 80978794 markings, 435446801 edges, 392117 markings/sec, 260 secs
lola: 81823687 markings, 442938768 edges, 168979 markings/sec, 265 secs
lola: 82455206 markings, 449672923 edges, 126304 markings/sec, 270 secs
lola: 83456645 markings, 456439592 edges, 200288 markings/sec, 275 secs
lola: 85185093 markings, 464126641 edges, 345690 markings/sec, 280 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown no unknown unknown unknown yes unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p32 <= p10) OR (G (F (((p6 + 1 <= p14) R F ((p10 + 1 <= p32))))) AND F ((p32 <= p10)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p32 <= p10) OR (G (F (((p6 + 1 <= p14) R F ((p10 + 1 <= p32))))) AND F ((p32 <= p10)))))))
lola: processed formula length: 101
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 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: 32794 markings, 51524 edges
lola: ========================================
lola: subprocess 6 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p8 + 1 <= p25)))
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 ((p8 + 1 <= p25)))
lola: processed formula length: 23
lola: 87 rewrites
lola: closed formula file LTLCardinality.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: (p25 <= p8)
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: 0 markings, 0 edges
lola: state equation: write sara problem file to LTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LTLCardinality-6-0.sara.

lola: ========================================
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p33 <= p11)))
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 ((p33 <= p11)))
lola: processed formula length: 20
lola: 87 rewrites
lola: closed formula file LTLCardinality.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: (p11 + 1 <= p33)
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 LTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p26 <= 0)
lola: processed formula length: 10
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= p2)
lola: processed formula length: 9
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
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: ========================================
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p21 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (3 <= p21)
lola: processed formula length: 10
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
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: subprocess 11 will run for 638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p5 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p5 <= p28))))
lola: processed formula length: 23
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 20
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: 457 markings, 750 edges
lola: ========================================
lola: subprocess 12 will run for 797 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p2 <= 1) AND (F ((p28 + 1 <= p7)) OR G ((p2 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p2 <= 1) AND (F ((p28 + 1 <= p7)) OR G ((p2 <= 1)))))))
lola: processed formula length: 66
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1785 markings, 2854 edges
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1063 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((2 <= p32)) OR (F (G ((2 <= p32))) AND F (G ((p8 + 1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((2 <= p32)) OR (F (G ((2 <= p32))) AND F (G ((p8 + 1 <= p22))))))
lola: processed formula length: 72
lola: 85 rewrites
lola: closed formula file LTLCardinality.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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 14 will run for 1595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p23 <= 1) OR (((p35 + 1 <= p4) AND (p34 <= 2)) U G ((p4 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p23 <= 1) OR (((p35 + 1 <= p4) AND (p34 <= 2)) U G ((p4 <= p35)))))
lola: processed formula length: 72
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: subprocess 15 will run for 3191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((3 <= p19))) AND (A (F ((p21 <= p16))) AND A ((F ((3 <= p12)) U (2 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p19)))
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 ((3 <= p19)))
lola: processed formula length: 18
lola: 87 rewrites
lola: closed formula file LTLCardinality.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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (F ((G ((p25 <= 2)) OR X (X (G ((p17 <= p20))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G ((p25 <= 2)) OR X (X (G ((p17 <= p20))))))))
lola: processed formula length: 56
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: 5242861 markings, 8238741 edges, 1048572 markings/sec, 0 secs
lola: 9303655 markings, 17222710 edges, 812159 markings/sec, 5 secs
lola: 13514034 markings, 26441730 edges, 842076 markings/sec, 10 secs
lola: 17557347 markings, 35398222 edges, 808663 markings/sec, 15 secs
lola: 21651265 markings, 44434239 edges, 818784 markings/sec, 20 secs
lola: 25556459 markings, 53175134 edges, 781039 markings/sec, 25 secs
lola: 30670809 markings, 61210503 edges, 1022870 markings/sec, 30 secs
lola: 35861430 markings, 69367191 edges, 1038124 markings/sec, 35 secs
lola: 41172313 markings, 77712865 edges, 1062177 markings/sec, 40 secs
lola: 46394910 markings, 85919797 edges, 1044519 markings/sec, 45 secs
lola: 51515881 markings, 93967041 edges, 1024194 markings/sec, 50 secs
lola: 56912512 markings, 102447462 edges, 1079326 markings/sec, 55 secs
lola: 62086616 markings, 110578177 edges, 1034821 markings/sec, 60 secs
lola: 66021366 markings, 119364074 edges, 786950 markings/sec, 65 secs
lola: 70014828 markings, 128242225 edges, 798692 markings/sec, 70 secs
lola: 73958652 markings, 137042384 edges, 788765 markings/sec, 75 secs
Killed
rslt: finished

BK_STOP 1590263937229

--------------------
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="RefineWMG-PT-007007"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is RefineWMG-PT-007007, 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 r165-oct2-158972938900009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-007007.tgz
mv RefineWMG-PT-007007 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;