fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r143-smll-155284920900134
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for RefineWMG-PT-100100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.010 482166.00 483957.00 2669.30 F?FFFFTFFTTTFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r143-smll-155284920900134.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is RefineWMG-PT-100100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-155284920900134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 3.9K Feb 12 14:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 14:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 16:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 16:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 107 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 345 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 01:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 1 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 1 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:30 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 217K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1553025598865

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-100100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-100100 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RefineWMG-PT-100100 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 907/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-100-100-LTLCardinality.task
lola: A (G (((2 <= p349) U X ((p494 <= p41))))) : A (((2 <= p441) U X (G ((1 <= p8))))) : A ((p288 <= p95)) : A (G (G (F (F ((p97 <= p221)))))) : A (X ((F ((p166 <= p350)) U X ((p454 <= p457))))) : A ((2 <= p345)) : A (F (((p306 <= p495) U F ((3 <= p179))))) : A (G (G (G ((p396 <= p199))))) : A ((1 <= p215)) : A ((3 <= p254)) : A ((((3 <= p53) U (p199 <= p47)) U F ((1 <= p229)))) : A (((p66 <= p28) U ((1 <= p89) U (p76 <= p288)))) : A (((p249 <= p94) U G (F ((3 <= p108))))) : A (X ((p415 <= p286))) : A (X (X (((2 <= p411) U (3 <= p406))))) : A (X ((3 <= p97)))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p288 <= p95)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p288 <= p95)
lola: processed formula length: 13
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p345)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p345)
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p215)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p215)
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p254)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p254)
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p441) U X (G ((1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= p441) U X (G ((1 <= p8)))))
lola: processed formula length: 37
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 601416 markings, 905021 edges, 120283 markings/sec, 0 secs
lola: 1178504 markings, 1773550 edges, 115418 markings/sec, 5 secs
lola: 1722278 markings, 2591947 edges, 108755 markings/sec, 10 secs
lola: 2278259 markings, 3428682 edges, 111196 markings/sec, 15 secs
lola: 2872953 markings, 4323685 edges, 118939 markings/sec, 20 secs
lola: 3459097 markings, 5205825 edges, 117229 markings/sec, 25 secs
lola: 4002163 markings, 6023194 edges, 108613 markings/sec, 30 secs
lola: 4576256 markings, 6887185 edges, 114819 markings/sec, 35 secs
lola: 5165471 markings, 7773926 edges, 117843 markings/sec, 40 secs
lola: 5719652 markings, 8607997 edges, 110836 markings/sec, 45 secs
lola: 6256697 markings, 9416261 edges, 107409 markings/sec, 50 secs
lola: 6851076 markings, 10310787 edges, 118876 markings/sec, 55 secs
lola: 7421472 markings, 11169235 edges, 114079 markings/sec, 60 secs
lola: 7969284 markings, 11993697 edges, 109562 markings/sec, 65 secs
lola: 8533838 markings, 12843353 edges, 112911 markings/sec, 70 secs
lola: 9113458 markings, 13715659 edges, 115924 markings/sec, 75 secs
lola: 9678247 markings, 14565672 edges, 112958 markings/sec, 80 secs
lola: 10202028 markings, 15354023 edges, 104756 markings/sec, 85 secs
lola: 10701615 markings, 16105825 edges, 99917 markings/sec, 90 secs
lola: 11221588 markings, 16888395 edges, 103995 markings/sec, 95 secs
lola: 11760440 markings, 17699378 edges, 107770 markings/sec, 100 secs
lola: 12265752 markings, 18459877 edges, 101062 markings/sec, 105 secs
lola: 12741105 markings, 19175267 edges, 95071 markings/sec, 110 secs
lola: 13244891 markings, 19933470 edges, 100757 markings/sec, 115 secs
lola: 13772447 markings, 20727441 edges, 105511 markings/sec, 120 secs
lola: 14272897 markings, 21480637 edges, 100090 markings/sec, 125 secs
lola: 14758424 markings, 22211318 edges, 97105 markings/sec, 130 secs
lola: 15262332 markings, 22969743 edges, 100782 markings/sec, 135 secs
lola: 15765939 markings, 23727642 edges, 100721 markings/sec, 140 secs
lola: 16248518 markings, 24453931 edges, 96516 markings/sec, 145 secs
lola: 16740501 markings, 25194358 edges, 98397 markings/sec, 150 secs
lola: 17217173 markings, 25911741 edges, 95334 markings/sec, 155 secs
lola: 17741963 markings, 26701510 edges, 104958 markings/sec, 160 secs
lola: 18221822 markings, 27423795 edges, 95972 markings/sec, 165 secs
lola: 18705773 markings, 28152138 edges, 96790 markings/sec, 170 secs
lola: 19178185 markings, 28863077 edges, 94482 markings/sec, 175 secs
lola: 19693268 markings, 29638240 edges, 103017 markings/sec, 180 secs
lola: 20198654 markings, 30398903 edges, 101077 markings/sec, 185 secs
lola: 20704081 markings, 31159557 edges, 101085 markings/sec, 190 secs
lola: 21199333 markings, 31904928 edges, 99050 markings/sec, 195 secs
lola: 21710157 markings, 32673710 edges, 102165 markings/sec, 200 secs
lola: 22213255 markings, 33430846 edges, 100620 markings/sec, 205 secs
lola: 22705429 markings, 34171631 edges, 98435 markings/sec, 210 secs
lola: 23180292 markings, 34886277 edges, 94973 markings/sec, 215 secs
lola: 23652900 markings, 35597478 edges, 94522 markings/sec, 220 secs
lola: 24171714 markings, 36378354 edges, 103763 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((p494 <= p41)))) AND A (G (((2 <= p349) OR X ((p494 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p494 <= p41))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p494 <= p41))))
lola: processed formula length: 25
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((p166 <= p350)) U X ((p454 <= p457)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((p166 <= p350)) U X ((p454 <= p457)))))
lola: processed formula length: 49
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 103 markings, 103 edges
lola: ========================================

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

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

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

FORMULA RefineWMG-PT-100-100-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p396 <= p199)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p396 <= p199)))
lola: processed formula length: 22
lola: 20 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p199 + 1 <= p396)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-100-LTLCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 143 markings, 163 edges

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

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

FORMULA RefineWMG-PT-100-100-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= p108))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= p108))))
lola: processed formula length: 23
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 446377 markings, 639738 edges, 89275 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 802441 markings, 1150076 edges

FORMULA RefineWMG-PT-100-100-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p97 <= p221))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p97 <= p221))))
lola: processed formula length: 25
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2530 markings, 3619 edges
lola:
FORMULA RefineWMG-PT-100-100-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p66 <= p28) U ((1 <= p89) U (p76 <= p288))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p66 <= p28) U ((1 <= p89) U (p76 <= p288))))
lola: processed formula length: 49
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (((2 <= p441) U X (G ((1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= p441) U X (G ((1 <= p8)))))
lola: processed formula length: 37
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 598325 markings, 900416 edges, 119665 markings/sec, 0 secs
lola: 1222471 markings, 1839741 edges, 124829 markings/sec, 5 secs
lola: 1790637 markings, 2694814 edges, 113633 markings/sec, 10 secs
lola: 2373589 markings, 3572156 edges, 116590 markings/sec, 15 secs
lola: 2983386 markings, 4489902 edges, 121959 markings/sec, 20 secs
lola: 3564011 markings, 5363728 edges, 116125 markings/sec, 25 secs
lola: 4064959 markings, 6117684 edges, 100190 markings/sec, 30 secs
lola: 4615620 markings, 6946420 edges, 110132 markings/sec, 35 secs
lola: 5183814 markings, 7801532 edges, 113639 markings/sec, 40 secs
lola: 5701792 markings, 8581086 edges, 103596 markings/sec, 45 secs
lola: 6193439 markings, 9321029 edges, 98329 markings/sec, 50 secs
lola: 6774016 markings, 10194834 edges, 116115 markings/sec, 55 secs
lola: 7342069 markings, 11049732 edges, 113611 markings/sec, 60 secs
lola: 7889997 markings, 11874347 edges, 109586 markings/sec, 65 secs
lola: 8443551 markings, 12707488 edges, 110711 markings/sec, 70 secs
lola: 9044060 markings, 13611196 edges, 120102 markings/sec, 75 secs
lola: 9625253 markings, 14485914 edges, 116239 markings/sec, 80 secs
lola: 10163766 markings, 15296403 edges, 107703 markings/sec, 85 secs
lola: 10693844 markings, 16094178 edges, 106016 markings/sec, 90 secs
lola: 11219244 markings, 16884881 edges, 105080 markings/sec, 95 secs
lola: 11759274 markings, 17697606 edges, 108006 markings/sec, 100 secs
lola: 12275382 markings, 18474376 edges, 103222 markings/sec, 105 secs
lola: 12789132 markings, 19247552 edges, 102750 markings/sec, 110 secs
lola: 13301627 markings, 20018854 edges, 102499 markings/sec, 115 secs
lola: 13828988 markings, 20812530 edges, 105472 markings/sec, 120 secs
lola: 14337832 markings, 21578356 edges, 101769 markings/sec, 125 secs
lola: 14843313 markings, 22339083 edges, 101096 markings/sec, 130 secs
lola: 15349143 markings, 23100360 edges, 101166 markings/sec, 135 secs
lola: 15881566 markings, 23901634 edges, 106485 markings/sec, 140 secs
lola: 16398669 markings, 24679907 edges, 103421 markings/sec, 145 secs
lola: 16913343 markings, 25454504 edges, 102935 markings/sec, 150 secs
lola: 17427065 markings, 26227619 edges, 102744 markings/sec, 155 secs
lola: 17951699 markings, 27017230 edges, 104927 markings/sec, 160 secs
lola: 18459888 markings, 27782050 edges, 101638 markings/sec, 165 secs
lola: 18967183 markings, 28545539 edges, 101459 markings/sec, 170 secs
lola: 19472244 markings, 29305604 edges, 101012 markings/sec, 175 secs
lola: 19994691 markings, 30091925 edges, 104489 markings/sec, 180 secs
lola: 20501297 markings, 30854373 edges, 101321 markings/sec, 185 secs
lola: 21007975 markings, 31616926 edges, 101336 markings/sec, 190 secs
lola: 21511966 markings, 32375402 edges, 100798 markings/sec, 195 secs
lola: 22028691 markings, 33153096 edges, 103345 markings/sec, 200 secs
lola: 22530119 markings, 33907751 edges, 100286 markings/sec, 205 secs
lola: 23030626 markings, 34661043 edges, 100101 markings/sec, 210 secs
lola: 23527868 markings, 35409327 edges, 99448 markings/sec, 215 secs
lola: 24049879 markings, 36194976 edges, 104402 markings/sec, 220 secs
lola: 24398907 markings, 36722244 edges, 69806 markings/sec, 225 secs
lola: 24414509 markings, 36743757 edges, 3120 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-100-100-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no unknown no no no no yes no no yes yes yes no no no no
lola:
preliminary result: no unknown no no no no yes no no yes yes yes no no no no
lola: memory consumption: 18228 KB
lola: time consumption: 481 seconds

BK_STOP 1553026081031

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-100100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is RefineWMG-PT-100100, 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 r143-smll-155284920900134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;