Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GPPP-PT-C0100N0000100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r244-blw7-152732546700095
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527888916572

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0100N0000100000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0100N0000100000 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ GPPP-PT-C0100N0000100000 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: LP says that atomic proposition is always true: (c2 <= NADplus)
lola: LP says that atomic proposition is always true: (3 <= NADplus)
lola: LP says that atomic proposition is always false: (3 <= E4P)
lola: LP says that atomic proposition is always true: (3 <= NADPplus)
lola: A ((G (X ((R5P <= Gluc))) U X (G ((Lac <= E4P))))) : A (X ((X ((3 <= b2)) U F (TRUE)))) : A (G (F (X (G (TRUE))))) : A ((((1 <= c2) U (_1_3_BPG <= b2)) U ((GAP <= start) U (1 <= b2)))) : A (((a2 <= _3PG) U G (X ((NADPH <= Xu5P))))) : A (((2 <= Lac) U (2 <= c2))) : A (G (FALSE)) : A ((G (X ((2 <= NADH))) U G (G ((GSH <= Ru5P))))) : A (X (X (X (F (TRUE))))) : A (((2 <= Ru5P) U G (G ((2 <= _2PG))))) : A (G (G (F (G ((3 <= ADP)))))) : A ((a1 <= Ru5P)) : A ((GSH <= E4P)) : A (X (G (F (X ((2 <= Xu5P)))))) : A ((3 <= GAP)) : A ((2 <= _1_3_BPG))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 213 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: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (a1 <= Ru5P)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a1 <= Ru5P)
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (GSH <= E4P)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (GSH <= E4P)
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
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: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= GAP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= GAP)
lola: processed formula length: 10
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= _1_3_BPG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= _1_3_BPG)
lola: processed formula length: 15
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= NADH))) U G ((GSH <= Ru5P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= NADH))) U G ((GSH <= Ru5P))))
lola: processed formula length: 45
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
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: 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: 412 markings, 413 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((a2 <= _3PG) U X (G ((NADPH <= Xu5P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((a2 <= _3PG) U X (G ((NADPH <= Xu5P)))))
lola: processed formula length: 44
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1775771 markings, 10090385 edges, 355154 markings/sec, 0 secs
lola: 3426715 markings, 19513971 edges, 330189 markings/sec, 5 secs
lola: 5016773 markings, 29517514 edges, 318012 markings/sec, 10 secs
lola: 6549069 markings, 39009578 edges, 306459 markings/sec, 15 secs
lola: 8229246 markings, 48252392 edges, 336035 markings/sec, 20 secs
lola: 9744251 markings, 57716770 edges, 303001 markings/sec, 25 secs
lola: 11147222 markings, 66730995 edges, 280594 markings/sec, 30 secs
lola: 12559433 markings, 75801400 edges, 282442 markings/sec, 35 secs
lola: 13969824 markings, 84632958 edges, 282078 markings/sec, 40 secs
lola: 15425635 markings, 93426095 edges, 291162 markings/sec, 45 secs
lola: 16757958 markings, 101863007 edges, 266465 markings/sec, 50 secs
lola: 17963064 markings, 111466244 edges, 241021 markings/sec, 55 secs
lola: 18859093 markings, 121694206 edges, 179206 markings/sec, 60 secs
lola: 19721817 markings, 131547635 edges, 172545 markings/sec, 65 secs
lola: 20567271 markings, 141192072 edges, 169091 markings/sec, 70 secs
lola: 21404760 markings, 150826508 edges, 167498 markings/sec, 75 secs
lola: 22175702 markings, 160853325 edges, 154188 markings/sec, 80 secs
lola: 22898452 markings, 170248825 edges, 144550 markings/sec, 85 secs
lola: 23615152 markings, 179430894 edges, 143340 markings/sec, 90 secs
lola: 24487452 markings, 188979132 edges, 174460 markings/sec, 95 secs
lola: 25330717 markings, 198254110 edges, 168653 markings/sec, 100 secs
lola: 26146659 markings, 207632400 edges, 163188 markings/sec, 105 secs
lola: 26879684 markings, 216824201 edges, 146605 markings/sec, 110 secs
lola: 27544592 markings, 225748057 edges, 132982 markings/sec, 115 secs
lola: 28227051 markings, 234434977 edges, 136492 markings/sec, 120 secs
lola: 28975570 markings, 243657124 edges, 149704 markings/sec, 125 secs
lola: 29692007 markings, 252638307 edges, 143287 markings/sec, 130 secs
lola: 30332305 markings, 261490713 edges, 128060 markings/sec, 135 secs
lola: 31039654 markings, 270153999 edges, 141470 markings/sec, 140 secs
lola: 31820940 markings, 279546850 edges, 156257 markings/sec, 145 secs
lola: 32559760 markings, 288568775 edges, 147764 markings/sec, 150 secs
lola: 33291921 markings, 297292152 edges, 146432 markings/sec, 155 secs
lola: 33926924 markings, 305768296 edges, 127001 markings/sec, 160 secs
lola: 34677644 markings, 314627773 edges, 150144 markings/sec, 165 secs
lola: 35848690 markings, 324380099 edges, 234209 markings/sec, 170 secs
lola: 37294138 markings, 334074618 edges, 289090 markings/sec, 175 secs
lola: 38697543 markings, 343485732 edges, 280681 markings/sec, 180 secs
lola: 40022378 markings, 353295531 edges, 264967 markings/sec, 185 secs
lola: 41274557 markings, 362509670 edges, 250436 markings/sec, 190 secs
lola: 42697193 markings, 371755386 edges, 284527 markings/sec, 195 secs
lola: 44008421 markings, 380755289 edges, 262246 markings/sec, 200 secs
lola: 45134443 markings, 389294960 edges, 225204 markings/sec, 205 secs
lola: 46313925 markings, 397811407 edges, 235896 markings/sec, 210 secs
lola: 47472678 markings, 406376950 edges, 231751 markings/sec, 215 secs
lola: 48581667 markings, 414615812 edges, 221798 markings/sec, 220 secs
lola: 49796018 markings, 423299026 edges, 242870 markings/sec, 225 secs
lola: 50915299 markings, 431098834 edges, 223856 markings/sec, 230 secs
lola: 51984701 markings, 438908453 edges, 213880 markings/sec, 235 secs
lola: 52943313 markings, 448247111 edges, 191722 markings/sec, 240 secs
lola: 53675546 markings, 458068585 edges, 146447 markings/sec, 245 secs
lola: 54383870 markings, 467573238 edges, 141665 markings/sec, 250 secs
lola: 55081785 markings, 476934512 edges, 139583 markings/sec, 255 secs
lola: 55769574 markings, 486164994 edges, 137558 markings/sec, 260 secs
lola: 56455134 markings, 495486415 edges, 137112 markings/sec, 265 secs
lola: 57099016 markings, 505146717 edges, 128776 markings/sec, 270 secs
lola: 57700657 markings, 514174115 edges, 120328 markings/sec, 275 secs
lola: 58296147 markings, 523110019 edges, 119098 markings/sec, 280 secs
lola: 58953321 markings, 532108492 edges, 131435 markings/sec, 285 secs
lola: 59661260 markings, 541312240 edges, 141588 markings/sec, 290 secs
lola: 60349085 markings, 550255046 edges, 137565 markings/sec, 295 secs
lola: 61028682 markings, 559287208 edges, 135919 markings/sec, 300 secs
lola: 61630610 markings, 568037544 edges, 120386 markings/sec, 305 secs
lola: 62209309 markings, 576523429 edges, 115740 markings/sec, 310 secs
lola: 62723838 markings, 584760682 edges, 102906 markings/sec, 315 secs
lola: 63302032 markings, 593016187 edges, 115639 markings/sec, 320 secs
lola: 63917432 markings, 601829911 edges, 123080 markings/sec, 325 secs
lola: 64508241 markings, 610419470 edges, 118162 markings/sec, 330 secs
lola: 65069136 markings, 618988600 edges, 112179 markings/sec, 335 secs
lola: 65605639 markings, 627226397 edges, 107301 markings/sec, 340 secs
lola: 66210753 markings, 635686969 edges, 121023 markings/sec, 345 secs
lola: 66846117 markings, 644625494 edges, 127073 markings/sec, 350 secs
lola: 67441882 markings, 653195327 edges, 119153 markings/sec, 355 secs
lola: 68044983 markings, 661412355 edges, 120620 markings/sec, 360 secs
lola: 68580644 markings, 669478252 edges, 107132 markings/sec, 365 secs
lola: 69116493 markings, 677428299 edges, 107170 markings/sec, 370 secs
lola: 69749831 markings, 685992671 edges, 126668 markings/sec, 375 secs
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: 70033418 markings, 690140003 edges

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((Lac <= E4P)) OR (G ((R5P <= Gluc)) AND F (G ((Lac <= E4P)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: ========================================
lola: processed formula: A (X ((G ((Lac <= E4P)) OR (G ((R5P <= Gluc)) AND F (G ((Lac <= E4P)))))))
lola: processed formula length: 74
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4944 markings, 5993 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 608 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= ADP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= ADP))))
lola: processed formula length: 22
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 876301 markings, 1138178 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= Xu5P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= Xu5P))))
lola: processed formula length: 23
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2405 markings, 2405 edges
lola:
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1013 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= Ru5P) U G ((2 <= _2PG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= Ru5P) U G ((2 <= _2PG))))
lola: processed formula length: 35
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola:
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= c2) U (_1_3_BPG <= b2)) U ((GAP <= start) U (1 <= b2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= c2) U (_1_3_BPG <= b2)) U ((GAP <= start) U (1 <= b2))))
lola: processed formula length: 67
lola: 33 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 802 markings, 801 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= Lac) U (2 <= c2)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((2 <= Lac) U (2 <= c2)))
lola: processed formula length: 28
lola: 37 rewrites
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes no no no no yes no yes no yes no no no
lola:
preliminary result: no yes yes yes no no no no yes no yes no yes no no no
lola: memory consumption: 20088 KB
lola: time consumption: 530 seconds

BK_STOP 1527889446938

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000100000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is GPPP-PT-C0100N0000100000, 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 r244-blw7-152732546700095"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;