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

About the Execution of M4M.struct for DNAwalker-PT-17redondantChoiceL

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1581.150 439013.00 399353.00 2309.40 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 mcc4mcc-structural
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 r215-smll-152732266500259
=====================================================================


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


BK_STOP 1527461781741

--------------------
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 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 stdout -----
----- Start make result stderr -----
LTLCardinality @ DNAwalker-PT-17redondantChoiceL @ 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: 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: 115958 markings, 287211 edges, 23192 markings/sec, 0 secs
lola: 240541 markings, 596365 edges, 24917 markings/sec, 5 secs
lola: 360593 markings, 915315 edges, 24010 markings/sec, 10 secs
lola: 474049 markings, 1245257 edges, 22691 markings/sec, 15 secs
lola: 578266 markings, 1564863 edges, 20843 markings/sec, 20 secs
lola: 683188 markings, 1883852 edges, 20984 markings/sec, 25 secs
lola: 779937 markings, 2184794 edges, 19350 markings/sec, 30 secs
lola: 886896 markings, 2491203 edges, 21392 markings/sec, 35 secs
lola: 995422 markings, 2795489 edges, 21705 markings/sec, 40 secs
lola: 1085199 markings, 3119137 edges, 17955 markings/sec, 45 secs
lola: 1161936 markings, 3389780 edges, 15347 markings/sec, 50 secs
lola: 1235720 markings, 3649412 edges, 14757 markings/sec, 55 secs
lola: 1322618 markings, 3952512 edges, 17380 markings/sec, 60 secs
lola: 1412161 markings, 4278319 edges, 17909 markings/sec, 65 secs
lola: 1495384 markings, 4605116 edges, 16645 markings/sec, 70 secs
lola: 1587642 markings, 4946506 edges, 18452 markings/sec, 75 secs
lola: 1668485 markings, 5267985 edges, 16169 markings/sec, 80 secs
lola: 1751675 markings, 5596879 edges, 16638 markings/sec, 85 secs
lola: 1836106 markings, 5912640 edges, 16886 markings/sec, 90 secs
lola: 1916490 markings, 6236109 edges, 16077 markings/sec, 95 secs
lola: 1996304 markings, 6555947 edges, 15963 markings/sec, 100 secs
lola: 2072670 markings, 6867385 edges, 15273 markings/sec, 105 secs
lola: 2153725 markings, 7185500 edges, 16211 markings/sec, 110 secs
lola: 2264293 markings, 7517105 edges, 22114 markings/sec, 115 secs
lola: 2374055 markings, 7843220 edges, 21952 markings/sec, 120 secs
lola: 2474351 markings, 8177668 edges, 20059 markings/sec, 125 secs
lola: 2569520 markings, 8508262 edges, 19034 markings/sec, 130 secs
lola: 2666068 markings, 8838215 edges, 19310 markings/sec, 135 secs
lola: 2766267 markings, 9154844 edges, 20040 markings/sec, 140 secs
lola: 2867054 markings, 9472630 edges, 20157 markings/sec, 145 secs
lola: 2964731 markings, 9786069 edges, 19535 markings/sec, 150 secs
lola: 3057395 markings, 10101068 edges, 18533 markings/sec, 155 secs
lola: 3146639 markings, 10420410 edges, 17849 markings/sec, 160 secs
lola: 3234498 markings, 10731765 edges, 17572 markings/sec, 165 secs
lola: 3315796 markings, 11088486 edges, 16260 markings/sec, 170 secs
lola: 3394658 markings, 11411318 edges, 15772 markings/sec, 175 secs
lola: 3471767 markings, 11697340 edges, 15422 markings/sec, 180 secs
lola: 3549932 markings, 12038738 edges, 15633 markings/sec, 185 secs
lola: 3630872 markings, 12377892 edges, 16188 markings/sec, 190 secs
lola: 3714612 markings, 12689662 edges, 16748 markings/sec, 195 secs
lola: 3796959 markings, 13004308 edges, 16469 markings/sec, 200 secs
lola: 3878511 markings, 13319758 edges, 16310 markings/sec, 205 secs
lola: 3957337 markings, 13637407 edges, 15765 markings/sec, 210 secs
lola: 4041595 markings, 13956382 edges, 16852 markings/sec, 215 secs
lola: 4123751 markings, 14276983 edges, 16431 markings/sec, 220 secs
lola: 4205488 markings, 14593555 edges, 16347 markings/sec, 225 secs
lola: 4284740 markings, 14918956 edges, 15850 markings/sec, 230 secs
lola: 4368473 markings, 15266191 edges, 16747 markings/sec, 235 secs
lola: 4447812 markings, 15571061 edges, 15868 markings/sec, 240 secs
lola: 4525491 markings, 15884276 edges, 15536 markings/sec, 245 secs
lola: 4611352 markings, 16214743 edges, 17172 markings/sec, 250 secs
lola: 4687323 markings, 16524471 edges, 15194 markings/sec, 255 secs
lola: 4770399 markings, 16846734 edges, 16615 markings/sec, 260 secs
lola: 4846764 markings, 17155774 edges, 15273 markings/sec, 265 secs
lola: 4923175 markings, 17470103 edges, 15282 markings/sec, 270 secs
lola: 4996712 markings, 17771444 edges, 14707 markings/sec, 275 secs
lola: 5073826 markings, 18077669 edges, 15423 markings/sec, 280 secs
lola: 5155441 markings, 18397126 edges, 16323 markings/sec, 285 secs
lola: 5235327 markings, 18700226 edges, 15977 markings/sec, 290 secs
lola: 5316633 markings, 19004494 edges, 16261 markings/sec, 295 secs
lola: 5396488 markings, 19305924 edges, 15971 markings/sec, 300 secs
lola: 5471952 markings, 19608914 edges, 15093 markings/sec, 305 secs
lola: 5553617 markings, 19915295 edges, 16333 markings/sec, 310 secs
lola: 5632434 markings, 20220753 edges, 15763 markings/sec, 315 secs
lola: 5712005 markings, 20521917 edges, 15914 markings/sec, 320 secs
lola: 5790761 markings, 20823503 edges, 15751 markings/sec, 325 secs
lola: 5866282 markings, 21125233 edges, 15104 markings/sec, 330 secs
lola: 5950569 markings, 21441461 edges, 16857 markings/sec, 335 secs
lola: 6032863 markings, 21742445 edges, 16459 markings/sec, 340 secs
lola: 6115270 markings, 22047012 edges, 16481 markings/sec, 345 secs
lola: 6202259 markings, 22339583 edges, 17398 markings/sec, 350 secs
lola: 6283464 markings, 22678974 edges, 16241 markings/sec, 355 secs
lola: 6365128 markings, 23032092 edges, 16333 markings/sec, 360 secs
lola: 6444876 markings, 23381880 edges, 15950 markings/sec, 365 secs
lola: 6525771 markings, 23742870 edges, 16179 markings/sec, 370 secs
lola: 6606286 markings, 24108669 edges, 16103 markings/sec, 375 secs
lola: 6685538 markings, 24468362 edges, 15850 markings/sec, 380 secs
lola: 6764918 markings, 24809094 edges, 15876 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 stdout -----
----- Kill lola and sara stderr -----
----- 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="DNAwalker-PT-17redondantChoiceL"
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/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 mcc4mcc-structural"
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 r215-smll-152732266500259"
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 ;