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

About the Execution of M4M.struct for GPPP-PT-C0100N0000010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.260 690536.00 655840.00 2055.10 FFF?TTTTTTFFFF?F 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 200K
-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 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 mcc4mcc-structural
Input is GPPP-PT-C0100N0000010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-blw7-152732553000093
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528024407044


BK_STOP 1528025097580

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-C0100N0000010000 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 455273, 'Memory': 1103.43, 'Tool': 'itstools'}, {'Time': 455571, 'Memory': 1134.53, 'Tool': 'itstools'}, {'Time': 727134, 'Memory': 15950.97, 'Tool': 'lola'}, {'Time': 731209, 'Memory': 15951.76, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.5971384202445567x far from the best tool itstools.
LTLCardinality lola GPPP-PT-C0100N0000010000...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
GPPP-PT-C0100N0000010000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000010000: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ GPPP-PT-C0100N0000010000 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 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: 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-C0100N0000010000-LTLCardinality.task
lola: A ((3 <= GAP)) : A (G (G (G (F ((_1_3_BPG <= Lac)))))) : A (G (G (F (X ((2 <= b2)))))) : A (G ((G ((a2 <= GSSG)) U G ((DHAP <= PEP))))) : A (F (((2 <= Gluc) U (1 <= ATP)))) : A ((3 <= GSSG)) : A ((a1 <= ATP)) : A (F (((ADP <= PEP) U F ((GAP <= ADP))))) : A (X ((FBP <= Lac))) : A ((S7P <= F6P)) : A (X ((X ((1 <= _1_3_BPG)) U X ((c1 <= R5P))))) : A (((b2 <= a2) U (2 <= NADH))) : A ((1 <= _2PG)) : A (X (F ((NADPplus <= Xu5P)))) : A (F (G (X ((2 <= ATP))))) : A ((NADplus <= E4P))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= GAP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= GAP)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (F ((_1_3_BPG <= Lac))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (F ((_1_3_BPG <= Lac))))))
lola: processed formula: A (G (G (G (F ((_1_3_BPG <= Lac))))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
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: 2813 markings, 2815 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (X ((2 <= b2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F (X ((2 <= b2))))))
lola: processed formula: A (G (G (F (X ((2 <= b2))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
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: 6977 markings, 8173 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((a2 <= GSSG)) U G ((DHAP <= PEP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((a2 <= GSSG)) U G ((DHAP <= PEP)))))
lola: processed formula: A (G ((G ((a2 <= GSSG)) U G ((DHAP <= PEP)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3005196 markings, 8278987 edges, 601039 markings/sec, 0 secs
lola: 5353122 markings, 15471349 edges, 469585 markings/sec, 5 secs
lola: 7534910 markings, 22203418 edges, 436358 markings/sec, 10 secs
lola: 10021080 markings, 30182548 edges, 497234 markings/sec, 15 secs
lola: 12181332 markings, 37375032 edges, 432050 markings/sec, 20 secs
lola: 14033663 markings, 43829882 edges, 370466 markings/sec, 25 secs
lola: 15786405 markings, 49889383 edges, 350548 markings/sec, 30 secs
lola: 17982411 markings, 56929617 edges, 439201 markings/sec, 35 secs
lola: 19855779 markings, 63276373 edges, 374674 markings/sec, 40 secs
lola: 21558495 markings, 69218872 edges, 340543 markings/sec, 45 secs
lola: 23122193 markings, 74718806 edges, 312740 markings/sec, 50 secs
lola: 25486109 markings, 82300869 edges, 472783 markings/sec, 55 secs
lola: 27478072 markings, 89025484 edges, 398393 markings/sec, 60 secs
lola: 29278540 markings, 95316900 edges, 360094 markings/sec, 65 secs
lola: 30923721 markings, 101248908 edges, 329036 markings/sec, 70 secs
lola: 32803241 markings, 108088899 edges, 375904 markings/sec, 75 secs
lola: 34488893 markings, 114390437 edges, 337130 markings/sec, 80 secs
lola: 35935811 markings, 120000787 edges, 289384 markings/sec, 85 secs
lola: 37298385 markings, 125441170 edges, 272515 markings/sec, 90 secs
lola: 38929944 markings, 131218060 edges, 326312 markings/sec, 95 secs
lola: 41210529 markings, 138430737 edges, 456117 markings/sec, 100 secs
lola: 42905712 markings, 144364438 edges, 339037 markings/sec, 105 secs
lola: 44640824 markings, 150431057 edges, 347022 markings/sec, 110 secs
lola: 46430935 markings, 156517972 edges, 358022 markings/sec, 115 secs
lola: 48848970 markings, 164216808 edges, 483607 markings/sec, 120 secs
lola: 50663622 markings, 170578027 edges, 362930 markings/sec, 125 secs
lola: 52419220 markings, 176750110 edges, 351120 markings/sec, 130 secs
lola: 54111769 markings, 182868842 edges, 338510 markings/sec, 135 secs
lola: 56014804 markings, 189702760 edges, 380607 markings/sec, 140 secs
lola: 57553604 markings, 195591761 edges, 307760 markings/sec, 145 secs
lola: 58946352 markings, 201010407 edges, 278550 markings/sec, 150 secs
lola: 60232159 markings, 206207772 edges, 257161 markings/sec, 155 secs
lola: 61784667 markings, 211992667 edges, 310502 markings/sec, 160 secs
lola: 63740465 markings, 219022417 edges, 391160 markings/sec, 165 secs
lola: 65296337 markings, 225014189 edges, 311174 markings/sec, 170 secs
lola: 66744848 markings, 230676393 edges, 289702 markings/sec, 175 secs
lola: 68024301 markings, 235859676 edges, 255891 markings/sec, 180 secs
lola: 69866299 markings, 242072645 edges, 368400 markings/sec, 185 secs
lola: 72016416 markings, 248934262 edges, 430023 markings/sec, 190 secs
lola: 73642009 markings, 254627915 edges, 325119 markings/sec, 195 secs
lola: 75244345 markings, 260288979 edges, 320467 markings/sec, 200 secs
lola: 77157100 markings, 266658547 edges, 382551 markings/sec, 205 secs
lola: 79489312 markings, 274177362 edges, 466442 markings/sec, 210 secs
lola: 81283553 markings, 280455555 edges, 358848 markings/sec, 215 secs
lola: 83007631 markings, 286591484 edges, 344816 markings/sec, 220 secs
lola: 84776476 markings, 292840219 edges, 353769 markings/sec, 225 secs
lola: 86689132 markings, 299738713 edges, 382531 markings/sec, 230 secs
lola: 88149199 markings, 305412241 edges, 292013 markings/sec, 235 secs
lola: 89546909 markings, 310886619 edges, 279542 markings/sec, 240 secs
lola: 90778424 markings, 315893587 edges, 246303 markings/sec, 245 secs
lola: 92376330 markings, 321730850 edges, 319581 markings/sec, 250 secs
lola: 94275823 markings, 328583950 edges, 379899 markings/sec, 255 secs
lola: 95741657 markings, 334277260 edges, 293167 markings/sec, 260 secs
lola: 96878369 markings, 338724671 edges, 227342 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= Gluc) U (1 <= ATP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= Gluc) U (1 <= ATP))))
lola: processed formula: A (F (((2 <= Gluc) U (1 <= ATP))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
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: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= GSSG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= GSSG)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-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: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((a1 <= ATP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a1 <= ATP)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-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: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((ADP <= PEP) U F ((GAP <= ADP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((ADP <= PEP) U F ((GAP <= ADP)))))
lola: processed formula: A (F (((ADP <= PEP) U F ((GAP <= ADP)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
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: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FBP <= Lac)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FBP <= Lac)))
lola: processed formula: A (X ((FBP <= Lac)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((S7P <= F6P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (S7P <= F6P)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-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: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((1 <= _1_3_BPG)) U X ((c1 <= R5P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((1 <= _1_3_BPG) U (c1 <= R5P)))))
lola: processed formula: A (X (X (((1 <= _1_3_BPG) U (c1 <= R5P)))))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((b2 <= a2) U (2 <= NADH)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((b2 <= a2) U (2 <= NADH)))
lola: processed formula: A (((b2 <= a2) U (2 <= NADH)))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
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: 407 markings, 407 edges
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= _2PG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= _2PG)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-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: ========================================
lola: subprocess 13 will run for 1088 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((NADPplus <= Xu5P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((NADPplus <= Xu5P))))
lola: processed formula: A (X (F ((NADPplus <= Xu5P))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 14 will run for 1632 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X ((2 <= ATP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((2 <= ATP)))))
lola: processed formula: A (F (G (X ((2 <= ATP)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2008853 markings, 11395589 edges, 401771 markings/sec, 0 secs
lola: 3978717 markings, 22634460 edges, 393973 markings/sec, 5 secs
lola: 5918339 markings, 33705730 edges, 387924 markings/sec, 10 secs
lola: 7821403 markings, 44674452 edges, 380613 markings/sec, 15 secs
lola: 9426780 markings, 55108294 edges, 321075 markings/sec, 20 secs
lola: 10999315 markings, 65336328 edges, 314507 markings/sec, 25 secs
lola: 12690856 markings, 75796431 edges, 338308 markings/sec, 30 secs
lola: 14710292 markings, 86906066 edges, 403887 markings/sec, 35 secs
lola: 16680339 markings, 97741872 edges, 394009 markings/sec, 40 secs
lola: 18300622 markings, 107846147 edges, 324057 markings/sec, 45 secs
lola: 19784306 markings, 117526135 edges, 296737 markings/sec, 50 secs
lola: 21211599 markings, 126913357 edges, 285459 markings/sec, 55 secs
lola: 22816295 markings, 136752439 edges, 320939 markings/sec, 60 secs
lola: 24358197 markings, 146418852 edges, 308380 markings/sec, 65 secs
lola: 25668443 markings, 155472902 edges, 262049 markings/sec, 70 secs
lola: 27214481 markings, 164939750 edges, 309208 markings/sec, 75 secs
lola: 28808359 markings, 174651391 edges, 318776 markings/sec, 80 secs
lola: 30369042 markings, 183978544 edges, 312137 markings/sec, 85 secs
lola: 31805631 markings, 192791017 edges, 287318 markings/sec, 90 secs
lola: 33068010 markings, 201182611 edges, 252476 markings/sec, 95 secs
lola: 34613685 markings, 210190186 edges, 309135 markings/sec, 100 secs
lola: 36138128 markings, 220208237 edges, 304889 markings/sec, 105 secs
lola: 37692732 markings, 230635101 edges, 310921 markings/sec, 110 secs
lola: 39229583 markings, 240936673 edges, 307370 markings/sec, 115 secs
lola: 40771545 markings, 251286442 edges, 308392 markings/sec, 120 secs
lola: 42302571 markings, 261548137 edges, 306205 markings/sec, 125 secs
lola: 43674666 markings, 271523324 edges, 274419 markings/sec, 130 secs
lola: 44959379 markings, 281162910 edges, 256943 markings/sec, 135 secs
lola: 46236761 markings, 290744841 edges, 255476 markings/sec, 140 secs
lola: 47599307 markings, 300538374 edges, 272509 markings/sec, 145 secs
lola: 49193664 markings, 310900120 edges, 318871 markings/sec, 150 secs
lola: 50757707 markings, 321068853 edges, 312809 markings/sec, 155 secs
lola: 52208472 markings, 330839835 edges, 290153 markings/sec, 160 secs
lola: 53447801 markings, 339850408 edges, 247866 markings/sec, 165 secs
lola: 54622667 markings, 348639400 edges, 234973 markings/sec, 170 secs
lola: 55662067 markings, 356914003 edges, 207880 markings/sec, 175 secs
lola: 56931485 markings, 365800447 edges, 253884 markings/sec, 180 secs
lola: 58172612 markings, 374789484 edges, 248225 markings/sec, 185 secs
lola: 59394239 markings, 383670428 edges, 244325 markings/sec, 190 secs
lola: 60462668 markings, 392115782 edges, 213686 markings/sec, 195 secs
lola: 61646409 markings, 400813461 edges, 236748 markings/sec, 200 secs
lola: 62931017 markings, 409799605 edges, 256922 markings/sec, 205 secs
lola: 64134153 markings, 418593921 edges, 240627 markings/sec, 210 secs
lola: 65415029 markings, 427296633 edges, 256175 markings/sec, 215 secs
lola: 66553904 markings, 435285259 edges, 227775 markings/sec, 220 secs
lola: 67538355 markings, 442954959 edges, 196890 markings/sec, 225 secs
lola: 68685921 markings, 451038136 edges, 229513 markings/sec, 230 secs
lola: 69855462 markings, 459265241 edges, 233908 markings/sec, 235 secs
lola: 71282480 markings, 468832330 edges, 285404 markings/sec, 240 secs
lola: 72729591 markings, 478537157 edges, 289422 markings/sec, 245 secs
lola: 74161079 markings, 488137693 edges, 286298 markings/sec, 250 secs
lola: 75589960 markings, 497729325 edges, 285776 markings/sec, 255 secs
lola: 77017272 markings, 507299737 edges, 285462 markings/sec, 260 secs
lola: 78345675 markings, 516704152 edges, 265681 markings/sec, 265 secs
lola: 79562742 markings, 525836893 edges, 243413 markings/sec, 270 secs
lola: 80763190 markings, 534838207 edges, 240090 markings/sec, 275 secs
lola: 81964470 markings, 543854059 edges, 240256 markings/sec, 280 secs
lola: 83410101 markings, 553471553 edges, 289126 markings/sec, 285 secs
lola: 84898743 markings, 563148506 edges, 297728 markings/sec, 290 secs
lola: 86356434 markings, 572621589 edges, 291538 markings/sec, 295 secs
lola: 87623360 markings, 581508665 edges, 253385 markings/sec, 300 secs
lola: 88783490 markings, 589943142 edges, 232026 markings/sec, 305 secs
lola: 89838372 markings, 598007015 edges, 210976 markings/sec, 310 secs
lola: 90854814 markings, 605919617 edges, 203288 markings/sec, 315 secs
lola: 92062185 markings, 614372143 edges, 241474 markings/sec, 320 secs
lola: 93230246 markings, 622862831 edges, 233612 markings/sec, 325 secs
lola: 94386083 markings, 631264549 edges, 231167 markings/sec, 330 secs
lola: 95394341 markings, 639210442 edges, 201652 markings/sec, 335 secs
lola: 96488544 markings, 647365444 edges, 218841 markings/sec, 340 secs
lola: 97693278 markings, 655791399 edges, 240947 markings/sec, 345 secs
lola: 98871472 markings, 664218123 edges, 235639 markings/sec, 350 secs
lola: 100039011 markings, 672438598 edges, 233508 markings/sec, 355 secs
lola: 101154461 markings, 680036282 edges, 223090 markings/sec, 360 secs
lola: 101883445 markings, 685468679 edges, 145797 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2893 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NADplus <= E4P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NADplus <= E4P)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000010000-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: lola: RESULT
========================================lola:

SUMMARY: no no no unknown yes yes yes yes yes yes no no no no unknown no
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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-C0100N0000010000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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-C0100N0000010000.tgz
mv GPPP-PT-C0100N0000010000 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 mcc4mcc-structural"
echo " Input is GPPP-PT-C0100N0000010000, 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 r251-blw7-152732553000093"
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 ;