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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.090 703051.00 657061.00 2362.20 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-full
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 r250-blw7-152732552300093
=====================================================================


--------------------
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 1528013439939


BK_STOP 1528014142990

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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 stderr -----
----- Start make result stdout -----
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: 2950932 markings, 8137974 edges, 590186 markings/sec, 0 secs
lola: 5274806 markings, 15231406 edges, 464775 markings/sec, 5 secs
lola: 7477022 markings, 22023169 edges, 440443 markings/sec, 10 secs
lola: 9934010 markings, 29920776 edges, 491398 markings/sec, 15 secs
lola: 12128990 markings, 37187693 edges, 438996 markings/sec, 20 secs
lola: 13988013 markings, 43654484 edges, 371805 markings/sec, 25 secs
lola: 15758879 markings, 49809172 edges, 354173 markings/sec, 30 secs
lola: 18036920 markings, 57093506 edges, 455608 markings/sec, 35 secs
lola: 19897123 markings, 63450503 edges, 372041 markings/sec, 40 secs
lola: 21622754 markings, 69437325 edges, 345126 markings/sec, 45 secs
lola: 23300507 markings, 75276532 edges, 335551 markings/sec, 50 secs
lola: 25674350 markings, 82866790 edges, 474769 markings/sec, 55 secs
lola: 27573646 markings, 89352975 edges, 379859 markings/sec, 60 secs
lola: 29319652 markings, 95451127 edges, 349201 markings/sec, 65 secs
lola: 30960178 markings, 101367433 edges, 328105 markings/sec, 70 secs
lola: 32832377 markings, 108188396 edges, 374440 markings/sec, 75 secs
lola: 34507090 markings, 114457115 edges, 334943 markings/sec, 80 secs
lola: 35947043 markings, 120043142 edges, 287991 markings/sec, 85 secs
lola: 37301945 markings, 125455943 edges, 270980 markings/sec, 90 secs
lola: 38956350 markings, 131296179 edges, 330881 markings/sec, 95 secs
lola: 41259614 markings, 138602897 edges, 460653 markings/sec, 100 secs
lola: 42981853 markings, 144654121 edges, 344448 markings/sec, 105 secs
lola: 44695589 markings, 150625562 edges, 342747 markings/sec, 110 secs
lola: 46561986 markings, 156973915 edges, 373279 markings/sec, 115 secs
lola: 48974879 markings, 164656441 edges, 482579 markings/sec, 120 secs
lola: 50781053 markings, 170973552 edges, 361235 markings/sec, 125 secs
lola: 52507725 markings, 177122506 edges, 345334 markings/sec, 130 secs
lola: 54251957 markings, 183325380 edges, 348846 markings/sec, 135 secs
lola: 56154696 markings, 190180357 edges, 380548 markings/sec, 140 secs
lola: 57660492 markings, 195994838 edges, 301159 markings/sec, 145 secs
lola: 59053102 markings, 201428574 edges, 278522 markings/sec, 150 secs
lola: 60311229 markings, 206555268 edges, 251625 markings/sec, 155 secs
lola: 61928388 markings, 212470448 edges, 323432 markings/sec, 160 secs
lola: 63884518 markings, 219514281 edges, 391226 markings/sec, 165 secs
lola: 65382851 markings, 225355354 edges, 299667 markings/sec, 170 secs
lola: 66849138 markings, 231088052 edges, 293257 markings/sec, 175 secs
lola: 68095962 markings, 236141543 edges, 249365 markings/sec, 180 secs
lola: 69991487 markings, 242448577 edges, 379105 markings/sec, 185 secs
lola: 72090037 markings, 249214748 edges, 419710 markings/sec, 190 secs
lola: 73705905 markings, 254904825 edges, 323174 markings/sec, 195 secs
lola: 75294207 markings, 260508749 edges, 317660 markings/sec, 200 secs
lola: 77246093 markings, 266935345 edges, 390377 markings/sec, 205 secs
lola: 79569938 markings, 274440153 edges, 464769 markings/sec, 210 secs
lola: 81338279 markings, 280698664 edges, 353668 markings/sec, 215 secs
lola: 83062450 markings, 286802932 edges, 344834 markings/sec, 220 secs
lola: 84845395 markings, 293081165 edges, 356589 markings/sec, 225 secs
lola: 86768197 markings, 300008793 edges, 384560 markings/sec, 230 secs
lola: 88205707 markings, 305641956 edges, 287502 markings/sec, 235 secs
lola: 89621893 markings, 311183641 edges, 283237 markings/sec, 240 secs
lola: 90853919 markings, 316180102 edges, 246405 markings/sec, 245 secs
lola: 92503923 markings, 322188046 edges, 330001 markings/sec, 250 secs
lola: 94427598 markings, 329101872 edges, 384735 markings/sec, 255 secs
lola: 95855359 markings, 334705060 edges, 285552 markings/sec, 260 secs
lola: 96874053 markings, 338708686 edges, 203739 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 1633 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: 1967159 markings, 11156779 edges, 393432 markings/sec, 0 secs
lola: 3942053 markings, 22425965 edges, 394979 markings/sec, 5 secs
lola: 5897857 markings, 33591556 edges, 391161 markings/sec, 10 secs
lola: 7827944 markings, 44712177 edges, 386017 markings/sec, 15 secs
lola: 9448981 markings, 55253352 edges, 324207 markings/sec, 20 secs
lola: 10986994 markings, 65252476 edges, 307603 markings/sec, 25 secs
lola: 12686397 markings, 75770172 edges, 339881 markings/sec, 30 secs
lola: 14700774 markings, 86850156 edges, 402875 markings/sec, 35 secs
lola: 16667858 markings, 97669295 edges, 393417 markings/sec, 40 secs
lola: 18286241 markings, 107755647 edges, 323677 markings/sec, 45 secs
lola: 19725619 markings, 117116307 edges, 287876 markings/sec, 50 secs
lola: 21130075 markings, 126424444 edges, 280891 markings/sec, 55 secs
lola: 22684976 markings, 135928602 edges, 310980 markings/sec, 60 secs
lola: 24234497 markings, 145640912 edges, 309904 markings/sec, 65 secs
lola: 25567376 markings, 154765626 edges, 266576 markings/sec, 70 secs
lola: 27087568 markings, 164176960 edges, 304038 markings/sec, 75 secs
lola: 28654110 markings, 173618165 edges, 313308 markings/sec, 80 secs
lola: 30139464 markings, 182670168 edges, 297071 markings/sec, 85 secs
lola: 31615497 markings, 191517897 edges, 295207 markings/sec, 90 secs
lola: 32884825 markings, 199989142 edges, 253866 markings/sec, 95 secs
lola: 34397605 markings, 208859148 edges, 302556 markings/sec, 100 secs
lola: 35914621 markings, 218709232 edges, 303403 markings/sec, 105 secs
lola: 37483922 markings, 229229661 edges, 313860 markings/sec, 110 secs
lola: 39041304 markings, 239675851 edges, 311476 markings/sec, 115 secs
lola: 40599402 markings, 250127680 edges, 311620 markings/sec, 120 secs
lola: 42151383 markings, 260535748 edges, 310396 markings/sec, 125 secs
lola: 43556713 markings, 270637966 edges, 281066 markings/sec, 130 secs
lola: 44820136 markings, 280117493 edges, 252685 markings/sec, 135 secs
lola: 46116352 markings, 289839342 edges, 259243 markings/sec, 140 secs
lola: 47461667 markings, 299643467 edges, 269063 markings/sec, 145 secs
lola: 49060823 markings, 310038242 edges, 319831 markings/sec, 150 secs
lola: 50633798 markings, 320260990 edges, 314595 markings/sec, 155 secs
lola: 52072117 markings, 329849846 edges, 287664 markings/sec, 160 secs
lola: 53313264 markings, 338870860 edges, 248229 markings/sec, 165 secs
lola: 54511772 markings, 347751362 edges, 239702 markings/sec, 170 secs
lola: 55545112 markings, 356021456 edges, 206668 markings/sec, 175 secs
lola: 56801375 markings, 364889918 edges, 251253 markings/sec, 180 secs
lola: 58045436 markings, 373865485 edges, 248812 markings/sec, 185 secs
lola: 59278079 markings, 382825553 edges, 246529 markings/sec, 190 secs
lola: 60360628 markings, 391299163 edges, 216510 markings/sec, 195 secs
lola: 61514599 markings, 399891195 edges, 230794 markings/sec, 200 secs
lola: 62750535 markings, 408536191 edges, 247187 markings/sec, 205 secs
lola: 63980099 markings, 417407994 edges, 245913 markings/sec, 210 secs
lola: 65239231 markings, 426118736 edges, 251826 markings/sec, 215 secs
lola: 66406020 markings, 434146578 edges, 233358 markings/sec, 220 secs
lola: 67386033 markings, 441837863 edges, 196003 markings/sec, 225 secs
lola: 68501847 markings, 449804782 edges, 223163 markings/sec, 230 secs
lola: 69710785 markings, 458147952 edges, 241788 markings/sec, 235 secs
lola: 71097669 markings, 467591703 edges, 277377 markings/sec, 240 secs
lola: 72564677 markings, 477432906 edges, 293402 markings/sec, 245 secs
lola: 74021423 markings, 487204703 edges, 291349 markings/sec, 250 secs
lola: 75468935 markings, 496917281 edges, 289502 markings/sec, 255 secs
lola: 76926213 markings, 506684020 edges, 291456 markings/sec, 260 secs
lola: 78282796 markings, 516235073 edges, 271317 markings/sec, 265 secs
lola: 79507379 markings, 525418064 edges, 244917 markings/sec, 270 secs
lola: 80721228 markings, 534524691 edges, 242770 markings/sec, 275 secs
lola: 81940078 markings, 543671082 edges, 243770 markings/sec, 280 secs
lola: 83397898 markings, 553388612 edges, 291564 markings/sec, 285 secs
lola: 84894058 markings, 563116306 edges, 299232 markings/sec, 290 secs
lola: 86366204 markings, 572687976 edges, 294429 markings/sec, 295 secs
lola: 87645661 markings, 581671484 edges, 255891 markings/sec, 300 secs
lola: 88818568 markings, 590196976 edges, 234581 markings/sec, 305 secs
lola: 89877046 markings, 598317385 edges, 211696 markings/sec, 310 secs
lola: 90897882 markings, 606221732 edges, 204167 markings/sec, 315 secs
lola: 92100610 markings, 614651375 edges, 240546 markings/sec, 320 secs
lola: 93274931 markings, 623185349 edges, 234864 markings/sec, 325 secs
lola: 94442839 markings, 631674900 edges, 233582 markings/sec, 330 secs
lola: 95447875 markings, 639639421 edges, 201007 markings/sec, 335 secs
lola: 96557335 markings, 647847053 edges, 221892 markings/sec, 340 secs
lola: 97768844 markings, 656320779 edges, 242302 markings/sec, 345 secs
lola: 98937518 markings, 664727002 edges, 233735 markings/sec, 350 secs
lola: 100114642 markings, 672945284 edges, 235425 markings/sec, 355 secs
lola: 101247297 markings, 680624429 edges, 226531 markings/sec, 360 secs
lola: 101877883 markings, 685425664 edges, 126117 markings/sec, 365 secs
lola: 101877918 markings, 685425867 edges, 7 markings/sec, 370 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2881 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 stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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-C0100N0000010000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
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-full"
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 r250-blw7-152732552300093"
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 ;