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.r099-smll-155246598300035.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 Kanban-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598300035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.4K Feb 11 22:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 22:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 7 23:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 7 23:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 102 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 340 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 06:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 06:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jan 31 23:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 31 23:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-20000-LTLCardinality-00
FORMULA_NAME Kanban-PT-20000-LTLCardinality-01
FORMULA_NAME Kanban-PT-20000-LTLCardinality-02
FORMULA_NAME Kanban-PT-20000-LTLCardinality-03
FORMULA_NAME Kanban-PT-20000-LTLCardinality-04
FORMULA_NAME Kanban-PT-20000-LTLCardinality-05
FORMULA_NAME Kanban-PT-20000-LTLCardinality-06
FORMULA_NAME Kanban-PT-20000-LTLCardinality-07
FORMULA_NAME Kanban-PT-20000-LTLCardinality-08
FORMULA_NAME Kanban-PT-20000-LTLCardinality-09
FORMULA_NAME Kanban-PT-20000-LTLCardinality-10
FORMULA_NAME Kanban-PT-20000-LTLCardinality-11
FORMULA_NAME Kanban-PT-20000-LTLCardinality-12
FORMULA_NAME Kanban-PT-20000-LTLCardinality-13
FORMULA_NAME Kanban-PT-20000-LTLCardinality-14
FORMULA_NAME Kanban-PT-20000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552762856078

info: Time: 3600 - MCC
===========================================================================================
prep: translating Kanban-PT-20000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Kanban-PT-20000 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Kanban-PT-20000 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 32/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from Kanban-PT-20000-LTLCardinality.task
lola: A (F ((P2 <= Pm1))) : A ((Pback3 <= Pback2)) : A (F ((X ((P3 <= Pback1)) U (3 <= Pback2)))) : A ((X (F ((2 <= Pback1))) U X ((P1 <= Pback3)))) : A (G (F (F (X ((2 <= Pback1)))))) : A (F (F (F (X ((2 <= Pback3)))))) : A ((G (X ((1 <= Pback3))) U F (X ((2 <= Pout2))))) : A (((P2 <= Pm3) U X ((1 <= Pback2)))) : A ((F (G ((Pm4 <= Pm1))) U X (F ((2 <= P1))))) : A (G ((X ((1 <= P1)) U (3 <= Pm3)))) : A ((Pm2 <= Pout4)) : A (X (G (X ((Pout4 <= P3))))) : A (X (G (F (G ((Pm3 <= P2)))))) : A (((P4 <= Pout3) U G ((1 <= P4)))) : A (G ((F ((Pback4 <= Pout4)) U X ((Pm4 <= Pback1))))) : A ((G (X ((1 <= Pback3))) U F (G ((P3 <= P1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pback3 <= Pback2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pback3 <= Pback2)
lola: processed formula length: 18
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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 Kanban-PT-20000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pm2 <= Pout4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pm2 <= Pout4)
lola: processed formula length: 14
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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 Kanban-PT-20000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= Pback3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= Pback3))))
lola: processed formula length: 25
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 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: 3 markings, 3 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-5 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: A (X ((F ((2 <= Pout2)) OR (G ((1 <= Pback3)) AND F ((2 <= Pout2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= Pout2)) OR (G ((1 <= Pback3)) AND F ((2 <= Pout2))))))
lola: processed formula length: 70
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 3 markings, 3 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-6 FALSE 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 (((P2 <= Pm3) U X ((1 <= Pback2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((P2 <= Pm3) U X ((1 <= Pback2))))
lola: processed formula length: 37
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 4 markings, 4 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((2 <= P1))) OR (X (F ((2 <= P1))) AND F (G ((Pm4 <= Pm1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((2 <= P1))) OR (X (F ((2 <= P1))) AND F (G ((Pm4 <= Pm1))))))
lola: processed formula length: 71
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((3 <= Pm3)))) AND A (G ((X ((1 <= P1)) OR (3 <= Pm3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= Pm3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= Pm3))))
lola: processed formula length: 22
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 20002 markings, 20002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((2 <= Pback1)) U (P1 <= Pback3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= Pback1)) U (P1 <= Pback3))))
lola: processed formula length: 44
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 4 markings, 4 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((Pout4 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((Pout4 <= P3)))))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 2953759 markings, 7219045 edges, 590752 markings/sec, 0 secs
lola: 5730133 markings, 14072764 edges, 555275 markings/sec, 5 secs
lola: 8344643 markings, 20548935 edges, 522902 markings/sec, 10 secs
lola: 11107311 markings, 27400513 edges, 552534 markings/sec, 15 secs
lola: 13990321 markings, 34559319 edges, 576602 markings/sec, 20 secs
lola: 16679273 markings, 41244432 edges, 537790 markings/sec, 25 secs
lola: 19565308 markings, 48415585 edges, 577207 markings/sec, 30 secs
lola: 22386705 markings, 55427866 edges, 564279 markings/sec, 35 secs
lola: 25189008 markings, 62404802 edges, 560461 markings/sec, 40 secs
lola: 27696277 markings, 68638697 edges, 501454 markings/sec, 45 secs
lola: 30466252 markings, 75537692 edges, 553995 markings/sec, 50 secs
lola: 33336846 markings, 82679137 edges, 574119 markings/sec, 55 secs
lola: 36087375 markings, 89531831 edges, 550106 markings/sec, 60 secs
lola: 38941868 markings, 96635330 edges, 570899 markings/sec, 65 secs
lola: 41705335 markings, 103522054 edges, 552693 markings/sec, 70 secs
lola: 44489037 markings, 110459242 edges, 556740 markings/sec, 75 secs
lola: 47311233 markings, 117485459 edges, 564439 markings/sec, 80 secs
lola: 50013815 markings, 124221974 edges, 540516 markings/sec, 85 secs
lola: 52882749 markings, 131365770 edges, 573787 markings/sec, 90 secs
lola: 55577123 markings, 138083095 edges, 538875 markings/sec, 95 secs
lola: 58348763 markings, 144993143 edges, 554328 markings/sec, 100 secs
lola: 61170691 markings, 152021718 edges, 564386 markings/sec, 105 secs
lola: 63825695 markings, 158642079 edges, 531001 markings/sec, 110 secs
lola: 66608985 markings, 165574868 edges, 556658 markings/sec, 115 secs
lola: 69393584 markings, 172519394 edges, 556920 markings/sec, 120 secs
lola: 72044526 markings, 179130623 edges, 530188 markings/sec, 125 secs
lola: 74830678 markings, 186071879 edges, 557230 markings/sec, 130 secs
lola: 77613239 markings, 193012293 edges, 556512 markings/sec, 135 secs
lola: 80256393 markings, 199604964 edges, 528631 markings/sec, 140 secs
lola: 83008325 markings, 206468978 edges, 550386 markings/sec, 145 secs
lola: 85826813 markings, 213492803 edges, 563698 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((Pm4 <= Pback1)))) AND A (G ((F ((Pback4 <= Pout4)) OR X ((Pm4 <= Pback1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Pm4 <= Pback1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Pm4 <= Pback1))))
lola: processed formula length: 27
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 60003 markings, 80004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= Pback2)))
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: (Pback2 <= 2)
lola: processed formula length: 13
lola: 38 rewrites
lola: closed formula file Kanban-PT-20000-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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 20002 markings, 20002 edges
lola:
FORMULA Kanban-PT-20000-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((P2 <= Pm1)))
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: (Pm1 + 1 <= P2)
lola: processed formula length: 15
lola: 38 rewrites
lola: closed formula file Kanban-PT-20000-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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 20002 markings, 20002 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= Pback1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= Pback1))))
lola: processed formula length: 25
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 20002 markings, 20002 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P4 <= Pout3) U G ((1 <= P4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((P4 <= Pout3) U G ((1 <= P4))))
lola: processed formula length: 35
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 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: 259992 markings, 359987 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Pm3 <= P2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Pm3 <= P2))))
lola: processed formula length: 23
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: add low 9
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: 199998 markings, 279996 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P3 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P3 <= P1))))
lola: processed formula length: 22
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 60012 markings, 80016 edges
lola: ========================================

FORMULA Kanban-PT-20000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((Pout4 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((Pout4 <= P3)))))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file Kanban-PT-20000-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: 2782849 markings, 6797463 edges, 556570 markings/sec, 0 secs
lola: 5767503 markings, 14165432 edges, 596931 markings/sec, 5 secs
lola: 8538164 markings, 21029443 edges, 554132 markings/sec, 10 secs
lola: 11413739 markings, 28162098 edges, 575115 markings/sec, 15 secs
lola: 14124861 markings, 34891143 edges, 542224 markings/sec, 20 secs
lola: 16786455 markings, 41511002 edges, 532319 markings/sec, 25 secs
lola: 19513433 markings, 48286500 edges, 545396 markings/sec, 30 secs
lola: 22162039 markings, 54877772 edges, 529721 markings/sec, 35 secs
lola: 25010870 markings, 61961286 edges, 569766 markings/sec, 40 secs
lola: 27696099 markings, 68638231 edges, 537046 markings/sec, 45 secs
lola: 30441961 markings, 75477196 edges, 549172 markings/sec, 50 secs
lola: 33148566 markings, 82210058 edges, 541321 markings/sec, 55 secs
lola: 35927808 markings, 89134274 edges, 555848 markings/sec, 60 secs
lola: 38792886 markings, 96264065 edges, 573016 markings/sec, 65 secs
lola: 41591065 markings, 103237324 edges, 559636 markings/sec, 70 secs
lola: 44379413 markings, 110186048 edges, 557670 markings/sec, 75 secs
lola: 47229825 markings, 117282519 edges, 570082 markings/sec, 80 secs
lola: 49951399 markings, 124066423 edges, 544315 markings/sec, 85 secs
lola: 52829892 markings, 131233973 edges, 575699 markings/sec, 90 secs
lola: 55547113 markings, 138008304 edges, 543444 markings/sec, 95 secs
lola: 58328139 markings, 144941709 edges, 556205 markings/sec, 100 secs
lola: 61170939 markings, 152022333 edges, 568560 markings/sec, 105 secs
lola: 63841310 markings, 158681019 edges, 534074 markings/sec, 110 secs
lola: 66644304 markings, 165662907 edges, 560599 markings/sec, 115 secs
lola: 69143042 markings, 171894545 edges, 499748 markings/sec, 120 secs
lola: 71797532 markings, 178514647 edges, 530898 markings/sec, 125 secs
lola: 74577124 markings, 185446718 edges, 555918 markings/sec, 130 secs
lola: 77386720 markings, 192447284 edges, 561919 markings/sec, 135 secs
lola: 80029015 markings, 199037819 edges, 528459 markings/sec, 140 secs
lola: 82780848 markings, 205901618 edges, 550367 markings/sec, 145 secs
lola: 85611511 markings, 212955745 edges, 566133 markings/sec, 150 secs
lola: 87773053 markings, 218347844 edges, 432308 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA Kanban-PT-20000-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no no no no yes no yes unknown no no no no
lola:
preliminary result: no yes no no no no no no yes no yes unknown no no no no
lola: memory consumption: 17492 KB
lola: time consumption: 322 seconds

BK_STOP 1552763178609

--------------------
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="Kanban-PT-20000"
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 Kanban-PT-20000, 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 r099-smll-155246598300035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-20000.tgz
mv Kanban-PT-20000 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 ;