fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r244-blw7-152732546600073
Last Updated
June 26, 2018

About the Execution of LoLA for GPPP-PT-C0001N0000000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15879.750 779564.00 800691.00 154.10 FFFFTFFTTTTTFFTF normal

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 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K 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.8K 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-C0001N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r244-blw7-152732546600073
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527887008882

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0001N0000000100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0001N0000000100 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ GPPP-PT-C0001N0000000100 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 20 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-C0001N0000000100-LTLCardinality.task
lola: LP says that atomic proposition is always true: (R5P <= Pi)
lola: LP says that atomic proposition is always true: (S7P <= c1)
lola: LP says that atomic proposition is always true: (1 <= ATP)
lola: A (F ((a1 <= NADPH))) : A ((G (X ((2 <= a1))) U (GSSG <= _3PG))) : A (X (F ((1 <= FBP)))) : A (X (G (((1 <= start) U (3 <= F6P))))) : A (F (F (X ((1 <= ADP))))) : A ((G (X (TRUE)) U X (G ((2 <= Ru5P))))) : A (G (G ((TRUE U (c1 <= b1))))) : A (F ((G ((3 <= Lac)) U (F6P <= FBP)))) : A (X ((G ((G6P <= GSSG)) U F (TRUE)))) : A (F (G (X (F ((S7P <= GAP)))))) : A (F ((Lac <= _2PG))) : A ((NADPH <= DHAP)) : A (G (F ((Pi <= a1)))) : A (G (X ((PEP <= NADPplus)))) : A (F (X (F ((GAP <= NADPH))))) : A (X (F (X (G ((2 <= E4P))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NADPH <= DHAP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NADPH <= DHAP)
lola: processed formula length: 15
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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

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

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

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

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (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: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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-C0001N0000000100-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= a1))) U (GSSG <= _3PG)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= a1))) U (GSSG <= _3PG)))
lola: processed formula length: 40
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 49 markings, 56 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((PEP <= NADPplus))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((PEP <= NADPplus))))
lola: processed formula length: 29
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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: 1934740 markings, 10948742 edges, 386948 markings/sec, 0 secs
lola: 3476600 markings, 20127551 edges, 308372 markings/sec, 5 secs
lola: 5118418 markings, 29800866 edges, 328364 markings/sec, 10 secs
lola: 6778668 markings, 39671160 edges, 332050 markings/sec, 15 secs
lola: 8421338 markings, 49305339 edges, 328534 markings/sec, 20 secs
lola: 10004856 markings, 58658625 edges, 316704 markings/sec, 25 secs
lola: 11523509 markings, 67581788 edges, 303731 markings/sec, 30 secs
lola: 13066892 markings, 76652981 edges, 308677 markings/sec, 35 secs
lola: 14609395 markings, 85713104 edges, 308501 markings/sec, 40 secs
lola: 16133733 markings, 94648557 edges, 304868 markings/sec, 45 secs
lola: 17630969 markings, 103496617 edges, 299447 markings/sec, 50 secs
lola: 18957913 markings, 111635474 edges, 265389 markings/sec, 55 secs
lola: 20244419 markings, 119545728 edges, 257301 markings/sec, 60 secs
lola: 21513477 markings, 127353400 edges, 253812 markings/sec, 65 secs
lola: 22785658 markings, 135182815 edges, 254436 markings/sec, 70 secs
lola: 24076388 markings, 142946482 edges, 258146 markings/sec, 75 secs
lola: 25373893 markings, 150348832 edges, 259501 markings/sec, 80 secs
lola: 26646301 markings, 158056727 edges, 254482 markings/sec, 85 secs
lola: 27964351 markings, 165852934 edges, 263610 markings/sec, 90 secs
lola: 29380218 markings, 174167582 edges, 283173 markings/sec, 95 secs
lola: 30798082 markings, 182492765 edges, 283573 markings/sec, 100 secs
lola: 32215817 markings, 190812826 edges, 283547 markings/sec, 105 secs
lola: 33652106 markings, 199164332 edges, 287258 markings/sec, 110 secs
lola: 35065711 markings, 207326788 edges, 282721 markings/sec, 115 secs
lola: 36596211 markings, 215531891 edges, 306100 markings/sec, 120 secs
lola: 38031732 markings, 223905152 edges, 287104 markings/sec, 125 secs
lola: 39321998 markings, 231712074 edges, 258053 markings/sec, 130 secs
lola: 40623771 markings, 239579934 edges, 260355 markings/sec, 135 secs
lola: 41952928 markings, 247602699 edges, 265831 markings/sec, 140 secs
lola: 43284754 markings, 255628058 edges, 266365 markings/sec, 145 secs
lola: 44612325 markings, 263633328 edges, 265514 markings/sec, 150 secs
lola: 45960465 markings, 271770078 edges, 269628 markings/sec, 155 secs
lola: 47335941 markings, 280113433 edges, 275095 markings/sec, 160 secs
lola: 48712773 markings, 288453882 edges, 275366 markings/sec, 165 secs
lola: 50067928 markings, 296671691 edges, 271031 markings/sec, 170 secs
lola: 51423821 markings, 304762123 edges, 271179 markings/sec, 175 secs
lola: 52674325 markings, 312255257 edges, 250101 markings/sec, 180 secs
lola: 53931960 markings, 319819990 edges, 251527 markings/sec, 185 secs
lola: 55179721 markings, 327355051 edges, 249552 markings/sec, 190 secs
lola: 56443108 markings, 334989495 edges, 252677 markings/sec, 195 secs
lola: 57735664 markings, 342812248 edges, 258511 markings/sec, 200 secs
lola: 59047312 markings, 350697406 edges, 262330 markings/sec, 205 secs
lola: 60397682 markings, 358736887 edges, 270074 markings/sec, 210 secs
lola: 61668594 markings, 366366167 edges, 254182 markings/sec, 215 secs
lola: 62918563 markings, 373883526 edges, 249994 markings/sec, 220 secs
lola: 64202329 markings, 381595597 edges, 256753 markings/sec, 225 secs
lola: 65522356 markings, 389399835 edges, 264005 markings/sec, 230 secs
lola: 66747990 markings, 396723008 edges, 245127 markings/sec, 235 secs
lola: 67986562 markings, 404167930 edges, 247714 markings/sec, 240 secs
lola: 69284990 markings, 411863622 edges, 259686 markings/sec, 245 secs
lola: 70523962 markings, 419321258 edges, 247794 markings/sec, 250 secs
lola: 71839211 markings, 427072667 edges, 263050 markings/sec, 255 secs
lola: 73144349 markings, 434727935 edges, 261028 markings/sec, 260 secs
lola: 74457913 markings, 442444178 edges, 262713 markings/sec, 265 secs
lola: 75760357 markings, 450069126 edges, 260489 markings/sec, 270 secs
lola: 77077094 markings, 457765929 edges, 263347 markings/sec, 275 secs
lola: 78452110 markings, 465519241 edges, 275003 markings/sec, 280 secs
lola: 79742080 markings, 472965184 edges, 257994 markings/sec, 285 secs
lola: 80829848 markings, 479753694 edges, 217554 markings/sec, 290 secs
lola: 82054124 markings, 487282152 edges, 244855 markings/sec, 295 secs
lola: 83157192 markings, 494004207 edges, 220614 markings/sec, 300 secs
lola: 84287802 markings, 500879811 edges, 226122 markings/sec, 305 secs
lola: 85431588 markings, 507828966 edges, 228757 markings/sec, 310 secs
lola: 86583004 markings, 514670366 edges, 230283 markings/sec, 315 secs
lola: 87784722 markings, 521587159 edges, 240344 markings/sec, 320 secs
lola: 89089542 markings, 529370362 edges, 260964 markings/sec, 325 secs
lola: 90384556 markings, 536950681 edges, 259003 markings/sec, 330 secs
lola: 91706226 markings, 544831322 edges, 264334 markings/sec, 335 secs
lola: 93040402 markings, 552713788 edges, 266835 markings/sec, 340 secs
lola: 94279182 markings, 560073948 edges, 247756 markings/sec, 345 secs
lola: 95500892 markings, 567411113 edges, 244342 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no no yes unknown unknown unknown yes unknown unknown yes unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((GAP <= NADPH))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((GAP <= NADPH))))
lola: processed formula length: 26
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Lac <= _2PG)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (_2PG + 1 <= Lac)
lola: processed formula length: 17
lola: 34 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((a1 <= NADPH)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NADPH + 1 <= a1)
lola: processed formula length: 17
lola: 34 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= Ru5P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= Ru5P))))
lola: processed formula length: 23
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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: add low 9
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: 12 markings, 13 edges
lola:
========================================
FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= E4P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= E4P))))
lola: processed formula length: 22
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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: add low 9
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: 25 markings, 26 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 803 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((c1 <= b1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((c1 <= b1))))
lola: processed formula length: 22
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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: 11 markings, 11 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1070 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((S7P <= GAP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((S7P <= GAP))))
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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: 2057 markings, 3202 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Pi <= a1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Pi <= a1))))
lola: processed formula length: 22
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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: 26 markings, 26 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((F6P <= FBP) OR (G ((3 <= Lac)) AND F ((F6P <= FBP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((F6P <= FBP) OR (G ((3 <= Lac)) AND F ((F6P <= FBP))))))
lola: processed formula length: 63
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (G ((PEP <= NADPplus))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((PEP <= NADPplus))))
lola: processed formula length: 29
lola: 32 rewrites
lola: closed formula file GPPP-PT-C0001N0000000100-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: 1959071 markings, 11093674 edges, 391814 markings/sec, 0 secs
lola: 3670027 markings, 21278078 edges, 342191 markings/sec, 5 secs
lola: 5306040 markings, 30932922 edges, 327203 markings/sec, 10 secs
lola: 6779033 markings, 39673320 edges, 294599 markings/sec, 15 secs
lola: 8372948 markings, 49023319 edges, 318783 markings/sec, 20 secs
lola: 9852473 markings, 57754920 edges, 295905 markings/sec, 25 secs
lola: 11382930 markings, 66767782 edges, 306091 markings/sec, 30 secs
lola: 12880386 markings, 75537969 edges, 299491 markings/sec, 35 secs
lola: 14361539 markings, 84218222 edges, 296231 markings/sec, 40 secs
lola: 15858403 markings, 93020104 edges, 299373 markings/sec, 45 secs
lola: 17360707 markings, 101883133 edges, 300461 markings/sec, 50 secs
lola: 18714551 markings, 110141630 edges, 270769 markings/sec, 55 secs
lola: 19974619 markings, 117886115 edges, 252014 markings/sec, 60 secs
lola: 21211099 markings, 125492759 edges, 247296 markings/sec, 65 secs
lola: 22455301 markings, 133149470 edges, 248840 markings/sec, 70 secs
lola: 23679155 markings, 140627641 edges, 244771 markings/sec, 75 secs
lola: 24952896 markings, 147932856 edges, 254748 markings/sec, 80 secs
lola: 26207952 markings, 155390861 edges, 251011 markings/sec, 85 secs
lola: 27538877 markings, 163351128 edges, 266185 markings/sec, 90 secs
lola: 28932754 markings, 171540586 edges, 278775 markings/sec, 95 secs
lola: 30322950 markings, 179709465 edges, 278039 markings/sec, 100 secs
lola: 31725460 markings, 187934275 edges, 280502 markings/sec, 105 secs
lola: 33138418 markings, 196193731 edges, 282592 markings/sec, 110 secs
lola: 34553519 markings, 204377530 edges, 283020 markings/sec, 115 secs
lola: 35971124 markings, 212378486 edges, 283521 markings/sec, 120 secs
lola: 37499001 markings, 220781630 edges, 305575 markings/sec, 125 secs
lola: 38782882 markings, 228450046 edges, 256776 markings/sec, 130 secs
lola: 40061020 markings, 236182995 edges, 255628 markings/sec, 135 secs
lola: 41379836 markings, 244143129 edges, 263763 markings/sec, 140 secs
lola: 42706979 markings, 252146461 edges, 265429 markings/sec, 145 secs
lola: 44038799 markings, 260173664 edges, 266364 markings/sec, 150 secs
lola: 45379283 markings, 268262569 edges, 268097 markings/sec, 155 secs
lola: 46742416 markings, 276505217 edges, 272627 markings/sec, 160 secs
lola: 48137586 markings, 284978352 edges, 279034 markings/sec, 165 secs
lola: 49494308 markings, 293158338 edges, 271344 markings/sec, 170 secs
lola: 50865808 markings, 301500274 edges, 274300 markings/sec, 175 secs
lola: 52160324 markings, 309172146 edges, 258903 markings/sec, 180 secs
lola: 53424803 markings, 316759822 edges, 252896 markings/sec, 185 secs
lola: 54703189 markings, 324473237 edges, 255677 markings/sec, 190 secs
lola: 56001070 markings, 332321895 edges, 259576 markings/sec, 195 secs
lola: 57312436 markings, 340241492 edges, 262273 markings/sec, 200 secs
lola: 58696184 markings, 348517819 edges, 276750 markings/sec, 205 secs
lola: 60073775 markings, 356781080 edges, 275518 markings/sec, 210 secs
lola: 61442461 markings, 364979434 edges, 273737 markings/sec, 215 secs
lola: 62701669 markings, 372583773 edges, 251842 markings/sec, 220 secs
lola: 63999269 markings, 380375739 edges, 259520 markings/sec, 225 secs
lola: 65343665 markings, 388333193 edges, 268879 markings/sec, 230 secs
lola: 66617021 markings, 395943287 edges, 254671 markings/sec, 235 secs
lola: 67889626 markings, 403571701 edges, 254521 markings/sec, 240 secs
lola: 69199878 markings, 411365882 edges, 262050 markings/sec, 245 secs
lola: 70451018 markings, 418873303 edges, 250228 markings/sec, 250 secs
lola: 71790075 markings, 426785658 edges, 267811 markings/sec, 255 secs
lola: 73123017 markings, 434602583 edges, 266588 markings/sec, 260 secs
lola: 74456641 markings, 442436927 edges, 266725 markings/sec, 265 secs
lola: 75787749 markings, 450229719 edges, 266222 markings/sec, 270 secs
lola: 77112825 markings, 457965251 edges, 265015 markings/sec, 275 secs
lola: 78483476 markings, 465719027 edges, 274130 markings/sec, 280 secs
lola: 79780642 markings, 473207900 edges, 259433 markings/sec, 285 secs
lola: 80885617 markings, 480097301 edges, 220995 markings/sec, 290 secs
lola: 82123712 markings, 487707176 edges, 247619 markings/sec, 295 secs
lola: 83262821 markings, 494646660 edges, 227822 markings/sec, 300 secs
lola: 84418654 markings, 501674071 edges, 231167 markings/sec, 305 secs
lola: 85570251 markings, 508671185 edges, 230319 markings/sec, 310 secs
lola: 86731428 markings, 515515807 edges, 232235 markings/sec, 315 secs
lola: 87984762 markings, 522796079 edges, 250667 markings/sec, 320 secs
lola: 89290578 markings, 530548976 edges, 261163 markings/sec, 325 secs
lola: 90588148 markings, 538167403 edges, 259514 markings/sec, 330 secs
lola: 91935565 markings, 546178747 edges, 269483 markings/sec, 335 secs
lola: 93282463 markings, 554124454 edges, 269380 markings/sec, 340 secs
lola: 94510428 markings, 561460041 edges, 245593 markings/sec, 345 secs
lola: 95750154 markings, 568908611 edges, 247945 markings/sec, 350 secs
lola: 97001404 markings, 576451944 edges, 250250 markings/sec, 355 secs
lola: 98266350 markings, 584084086 edges, 252989 markings/sec, 360 secs
lola: 99508592 markings, 591582184 edges, 248448 markings/sec, 365 secs
lola: 100765898 markings, 599147834 edges, 251461 markings/sec, 370 secs
lola: 102180974 markings, 606446319 edges, 283015 markings/sec, 375 secs
lola: 103519064 markings, 613683265 edges, 267618 markings/sec, 380 secs
lola: 104781379 markings, 621244029 edges, 252463 markings/sec, 385 secs
lola: 106034959 markings, 628724905 edges, 250716 markings/sec, 390 secs
lola: 107302351 markings, 636255853 edges, 253478 markings/sec, 395 secs
lola: 108598209 markings, 643878904 edges, 259172 markings/sec, 400 secs
lola: 109821698 markings, 651235550 edges, 244698 markings/sec, 405 secs
lola: 111095855 markings, 658753806 edges, 254831 markings/sec, 410 secs
lola: 112362324 markings, 666174656 edges, 253294 markings/sec, 415 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: 112664938 markings, 667959764 edges

FORMULA GPPP-PT-C0001N0000000100-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes yes yes yes yes no no yes no
lola:
preliminary result: no no no no yes no no yes yes yes yes yes no no yes no
lola: memory consumption: 19488 KB
lola: time consumption: 778 seconds

BK_STOP 1527887788446

--------------------
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-C0001N0000000100"
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-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 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-C0001N0000000100, 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-152732546600073"
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 ;