fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r210-smll-152732260600259
Last Updated
June 26, 2018

About the Execution of Irma.full for DNAwalker-PT-17redondantChoiceL

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1596.540 438907.00 402305.00 2283.50 FFFTFFF?FTFFFTFF 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 380K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.6K 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 9.9K 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 9.2K 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 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 19 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 211K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DNAwalker-PT-17redondantChoiceL, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732260600259
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527403083589


BK_STOP 1527403522496

--------------------
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 DNAwalker-PT-17redondantChoiceL as instance name.
Using DNAwalker 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': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 869408, 'Memory': 15951.41, 'Tool': 'lola'}, {'Time': 874481, 'Memory': 15947.69, 'Tool': 'lola'}, {'Time': 3507858, 'Memory': 11484.22, 'Tool': 'itstools'}, {'Time': 3508080, 'Memory': 11521.44, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DNAwalker-PT-17redondantChoiceL...

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-17redondantChoiceL: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ DNAwalker-PT-17redondantChoiceL @ 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: 533/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: finding significant places
lola: 43 places, 490 transitions, 43 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 284 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: A (X (X ((A24 <= A26)))) : A (F ((3 <= A31))) : A (F (G (X ((1 <= A11))))) : A (((A23 <= B21) U F (F ((B18 <= A28))))) : A (X ((3 <= A12))) : A (X (((B9 <= A5) U X ((3 <= A5))))) : A (X (X (F (F ((A6 <= A26)))))) : A (G (G (((A24 <= A11) U (B18 <= A31))))) : A (F (G ((A19 <= B19)))) : A ((1 <= A14)) : A (G (F (X (X ((1 <= A8)))))) : A ((1 <= A21)) : A (G (X (((3 <= A27) U (2 <= A8))))) : A ((A8 <= A12)) : A ((X ((A20 <= A29)) U X (G ((A32 <= A22))))) : A (F (G ((1 <= A7))))
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 (X (X ((A24 <= A26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((A24 <= A26))))
lola: processed formula: A (X (X ((A24 <= A26))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= A31)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= A31)))
lola: processed formula: A (F ((3 <= A31)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X ((1 <= A11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((1 <= A11)))))
lola: processed formula: A (F (G (X ((1 <= A11)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 69 markings, 96 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A23 <= B21) U F (F ((B18 <= A28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((A23 <= B21) U F ((B18 <= A28))))
lola: processed formula: A (((A23 <= B21) U F ((B18 <= A28))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= A12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= A12)))
lola: processed formula: A (X ((3 <= A12)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((B9 <= A5) U X ((3 <= A5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((B9 <= A5) U X ((3 <= A5)))))
lola: processed formula: A (X (((B9 <= A5) U X ((3 <= A5)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (F ((A6 <= A26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F ((A6 <= A26)))))
lola: processed formula: A (X (X (F ((A6 <= A26)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((A24 <= A11) U (B18 <= A31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (((A24 <= A11) U (B18 <= A31)))))
lola: processed formula: A (G (G (((A24 <= A11) U (B18 <= A31)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 113379 markings, 280774 edges, 22676 markings/sec, 0 secs
lola: 238092 markings, 590207 edges, 24943 markings/sec, 5 secs
lola: 358474 markings, 909119 edges, 24076 markings/sec, 10 secs
lola: 468849 markings, 1229839 edges, 22075 markings/sec, 15 secs
lola: 572179 markings, 1546414 edges, 20666 markings/sec, 20 secs
lola: 675936 markings, 1863911 edges, 20751 markings/sec, 25 secs
lola: 778040 markings, 2178658 edges, 20421 markings/sec, 30 secs
lola: 885025 markings, 2486466 edges, 21397 markings/sec, 35 secs
lola: 994071 markings, 2790997 edges, 21809 markings/sec, 40 secs
lola: 1084144 markings, 3114779 edges, 18015 markings/sec, 45 secs
lola: 1166038 markings, 3404981 edges, 16379 markings/sec, 50 secs
lola: 1250545 markings, 3700819 edges, 16901 markings/sec, 55 secs
lola: 1343241 markings, 4025361 edges, 18539 markings/sec, 60 secs
lola: 1428900 markings, 4347194 edges, 17132 markings/sec, 65 secs
lola: 1512682 markings, 4676073 edges, 16756 markings/sec, 70 secs
lola: 1606585 markings, 5020280 edges, 18781 markings/sec, 75 secs
lola: 1688429 markings, 5344226 edges, 16369 markings/sec, 80 secs
lola: 1776389 markings, 5679739 edges, 17592 markings/sec, 85 secs
lola: 1857865 markings, 6002611 edges, 16295 markings/sec, 90 secs
lola: 1938104 markings, 6325797 edges, 16048 markings/sec, 95 secs
lola: 2017919 markings, 6643041 edges, 15963 markings/sec, 100 secs
lola: 2088977 markings, 6937888 edges, 14212 markings/sec, 105 secs
lola: 2176534 markings, 7262108 edges, 17511 markings/sec, 110 secs
lola: 2289634 markings, 7580524 edges, 22620 markings/sec, 115 secs
lola: 2398441 markings, 7925110 edges, 21761 markings/sec, 120 secs
lola: 2497797 markings, 8256894 edges, 19871 markings/sec, 125 secs
lola: 2594622 markings, 8596379 edges, 19365 markings/sec, 130 secs
lola: 2693177 markings, 8925422 edges, 19711 markings/sec, 135 secs
lola: 2795920 markings, 9249445 edges, 20549 markings/sec, 140 secs
lola: 2896648 markings, 9568614 edges, 20146 markings/sec, 145 secs
lola: 2995372 markings, 9884607 edges, 19745 markings/sec, 150 secs
lola: 3087366 markings, 10208297 edges, 18399 markings/sec, 155 secs
lola: 3177023 markings, 10529328 edges, 17931 markings/sec, 160 secs
lola: 3263390 markings, 10856634 edges, 17273 markings/sec, 165 secs
lola: 3343363 markings, 11214239 edges, 15995 markings/sec, 170 secs
lola: 3422442 markings, 11513726 edges, 15816 markings/sec, 175 secs
lola: 3501520 markings, 11825733 edges, 15816 markings/sec, 180 secs
lola: 3581896 markings, 12174396 edges, 16075 markings/sec, 185 secs
lola: 3664773 markings, 12500965 edges, 16575 markings/sec, 190 secs
lola: 3750212 markings, 12822739 edges, 17088 markings/sec, 195 secs
lola: 3833036 markings, 13142262 edges, 16565 markings/sec, 200 secs
lola: 3916699 markings, 13462401 edges, 16733 markings/sec, 205 secs
lola: 3997685 markings, 13786408 edges, 16197 markings/sec, 210 secs
lola: 4083602 markings, 14110511 edges, 17183 markings/sec, 215 secs
lola: 4166543 markings, 14435096 edges, 16588 markings/sec, 220 secs
lola: 4248865 markings, 14763891 edges, 16464 markings/sec, 225 secs
lola: 4329999 markings, 15115003 edges, 16227 markings/sec, 230 secs
lola: 4414558 markings, 15438106 edges, 16912 markings/sec, 235 secs
lola: 4492735 markings, 15754211 edges, 15635 markings/sec, 240 secs
lola: 4581562 markings, 16095913 edges, 17765 markings/sec, 245 secs
lola: 4659043 markings, 16408617 edges, 15496 markings/sec, 250 secs
lola: 4737891 markings, 16727792 edges, 15770 markings/sec, 255 secs
lola: 4819268 markings, 17043153 edges, 16275 markings/sec, 260 secs
lola: 4896261 markings, 17359769 edges, 15399 markings/sec, 265 secs
lola: 4973061 markings, 17672509 edges, 15360 markings/sec, 270 secs
lola: 5046920 markings, 17979900 edges, 14772 markings/sec, 275 secs
lola: 5131144 markings, 18304385 edges, 16845 markings/sec, 280 secs
lola: 5214230 markings, 18619311 edges, 16617 markings/sec, 285 secs
lola: 5294532 markings, 18924122 edges, 16060 markings/sec, 290 secs
lola: 5376897 markings, 19233433 edges, 16473 markings/sec, 295 secs
lola: 5455779 markings, 19538370 edges, 15776 markings/sec, 300 secs
lola: 5537210 markings, 19859359 edges, 16286 markings/sec, 305 secs
lola: 5617859 markings, 20159626 edges, 16130 markings/sec, 310 secs
lola: 5699072 markings, 20473669 edges, 16243 markings/sec, 315 secs
lola: 5778774 markings, 20778288 edges, 15940 markings/sec, 320 secs
lola: 5855236 markings, 21079200 edges, 15292 markings/sec, 325 secs
lola: 5940734 markings, 21405129 edges, 17100 markings/sec, 330 secs
lola: 6024926 markings, 21712580 edges, 16838 markings/sec, 335 secs
lola: 6107609 markings, 22022070 edges, 16537 markings/sec, 340 secs
lola: 6197059 markings, 22318939 edges, 17890 markings/sec, 345 secs
lola: 6279686 markings, 22663436 edges, 16525 markings/sec, 350 secs
lola: 6363016 markings, 23021438 edges, 16666 markings/sec, 355 secs
lola: 6444403 markings, 23379383 edges, 16277 markings/sec, 360 secs
lola: 6526513 markings, 23746666 edges, 16422 markings/sec, 365 secs
lola: 6608085 markings, 24118511 edges, 16314 markings/sec, 370 secs
lola: 6688463 markings, 24481916 edges, 16076 markings/sec, 375 secs
lola: 6765712 markings, 24812159 edges, 15450 markings/sec, 380 secs
lola: 6846880 markings, 25122155 edges, 16234 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((A19 <= B19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((A19 <= B19))))
lola: processed formula: A (F (G ((A19 <= B19))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 16 markings, 17 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= A14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= A14)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-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 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (X ((1 <= A8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X (X ((1 <= A8))))))
lola: processed formula: A (G (F (X (X ((1 <= A8))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 47 markings, 47 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= A21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= A21)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-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 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((3 <= A27) U (2 <= A8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((3 <= A27) U (2 <= A8)))))
lola: processed formula: A (G (X (((3 <= A27) U (2 <= A8)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 13 will run for 1049 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A8 <= A12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A8 <= A12)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-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 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((A20 <= A29)) U X (G ((A32 <= A22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((A20 <= A29) U G ((A32 <= A22)))))
lola: processed formula: A (X (((A20 <= A29) U G ((A32 <= A22)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 16 markings, 17 edges
lola: ========================================
lola: subprocess 15 will run for 3147 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= A7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((1 <= A7))))
lola: processed formula: A (F (G ((1 <= A7))))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 17 markings, 18 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no unknown no yes no no no yes no no
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-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 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="DNAwalker-PT-17redondantChoiceL"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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/DNAwalker-PT-17redondantChoiceL.tgz
mv DNAwalker-PT-17redondantChoiceL 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 irma4mcc-full"
echo " Input is DNAwalker-PT-17redondantChoiceL, 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 r210-smll-152732260600259"
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 ;