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

About the Execution of LoLA for GlobalResAllocation-COL-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1250.340 3600000.00 384012.00 389.70 ????F?TTF??T??FT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K 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 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 28K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GlobalResAllocation-COL-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r244-blw7-152732546700105
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527891254294

info: Time: 3600 - MCC
===========================================================================================
prep: translating GlobalResAllocation-COL-05 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GlobalResAllocation-COL-05 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ GlobalResAllocation-COL-05 @ 3452 seconds
lola: LoLA will run for 3452 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 56180/65536 symbol table entries, 38797 collisions
lola: preprocessing...
lola: Size of bit vector: 2400
lola: finding significant places
lola: 75 places, 56105 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2220 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-05-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p15 + p16 + p17 + p18 + p19 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69)
lola: after: (0 <= 0)
lola: always true
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 0 is above its equality of -1
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1
check_solution: Constraint R11 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Constraint R1 = 0 is above its upper bound -3
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 0 is above its equality of -1
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 3 (rel. error 1)
check_solution: Constraint R2 = 4 is above its equality of -1
check_solution: Constraint R3 = 4 is above its equality of -1
check_solution: Constraint R4 = 4 is above its equality of -1
check_solution: Constraint R5 = 4 is above its equality of -1
check_solution: Constraint R6 = 4 is above its equality of -1
check_solution: Constraint R7 = 4 is above its equality of -1
check_solution: Constraint R8 = 4 is above its equality of -1
check_solution: Constraint R9 = 4 is above its equality of -1
check_solution: Constraint R10 = 4 is above its equality of -1
check_solution: Constraint R11 = 4 is above its equality of -1

Seriously low accuracy found ||*|| = 5 (rel. error 0.00120228)
check_solution: Constraint R2 = 4 is above its equality of -1
check_solution: Constraint R3 = 4 is above its equality of -1
check_solution: Constraint R4 = 4 is above its equality of -1
check_solution: Constraint R5 = 4 is above its equality of -1
check_solution: Constraint R6 = 4 is above its equality of -1
check_solution: Constraint R7 = 4 is above its equality of -1
check_solution: Constraint R8 = 4 is above its equality of -1
check_solution: Constraint R9 = 4 is above its equality of -1
check_solution: Constraint R10 = 4 is above its equality of -1
check_solution: Constraint R11 = 4 is above its equality of -1

Seriously low accuracy found ||*|| = 5 (rel. error 0.00119546)
check_solution: Constraint R2 = 0 lola: place invariant simplifies atomic proposition
lola: before: (p15 + p16 + p17 + p18 + p19 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69)
lola: after: (0 <= 0)
lola: always true
lola: A ((F (G ((1 <= p70 + p71 + p72 + p73 + p74))) U F (G ((p0 + p1 + p2 + p3 + p4 <= p70 + p71 + p72 + p73 + p74))))) : A (F ((p70 + p71 + p72 + p73 + p74 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69))) : A (F (X (((1 <= p15 + p16 + p17 + p18 + p19) U (3 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69))))) : A ((X (G ((3 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))) U X (X ((2 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))))) : A (F ((G ((2 <= p0 + p1 + p2 + p3 + p4)) U X ((3 <= p15 + p16 + p17 + p18 + p19))))) : A (G (F (F (X ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p15 + p16 + p17 + p18 + p19)))))) : A (TRUE) : A ((p70 + p71 + p72 + p73 + p74 <= p0 + p1 + p2 + p3 + p4)) : A (((p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p0 + p1 + p2 + p3 + p4) U G (X ((p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4))))) : A (G ((3 <= p0 + p1 + p2 + p3 + p4))) : A ((X (F ((p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19))) U G (F ((2 <= p70 + p71 + p72 + p73 + p74))))) : A ((p70 + p71 + p72 + p73 + p74 <= p15 + p16 + p17 + p18 + p19)) : A (G (F ((p0 + p1 + p2 + p3 + p4 <= p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69)))) : A (G ((X ((p15 + p16 + p17 + p18 + p19 <= p70 + p71 + p72 + p73 + p74)) U (1 <= p70 + p71 + p72 + p73 + p74)))) : A ((p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19)) : A (TRUE)
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-05-LTLCardinality.task
lola: processed formula with 0 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: ========================================
is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 0 is above its equality of -1
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1
check_solution: Constraint R11 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA GlobalResAllocation-COL-05-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p70 + p71 + p72 + p73 + p74 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p70 + p71 + p72 + p73 + p74 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 55
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-05-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 GlobalResAllocation-COL-05-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p70 + p71 + p72 + p73 + p74 <= p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p70 + p71 + p72 + p73 + p74 <= p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 60
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-05-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 GlobalResAllocation-COL-05-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 55
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-05-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 GlobalResAllocation-COL-05-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-05-LTLCardinality.task
lola: processed formula with 0 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 GlobalResAllocation-COL-05-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p0 + p1 + p2 + p3 + p4) U X (G ((p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p58 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p57 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p56 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p55 + p50 + p51 + p52 + p53 + p54 + p49 + p39 + p29 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p0 + p1 + p2 + p3 + p4) U X (G ((p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4)))))
lola: processed formula length: 397
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-05-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: 15 markings, 15 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-05-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((3 <= p15 + p16 + p17 + p18 + p19)) OR (G ((2 <= p0 + p1 + p2 + p3 + p4)) AND X (F ((3 <= p15 + p16 + p17 + p18 + p19)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((3 <= p15 + p16 + p17 + p18 + p19)) OR (G ((2 <= p0 + p1 + p2 + p3 + p4)) AND X (F ((3 <= p15 + p16 + p17 + p18 + p19)))))))
lola: processed formula length: 134
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-05-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: 3697 markings, 8730 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-05-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= p70 + p71 + p72 + p73 + p74)))) AND A (G ((X ((p15 + p16 + p17 + p18 + p19 <= p70 + p71 + p72 + p73 + p74)) OR (1 <= p70 + p71 + p72 + p73 + p74)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown yes yes no unknown unknown yes unknown unknown no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 1061992 KB
lola: time consumption: 502 seconds
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown yes yes no unknown unknown yes unknown unknown no yes
lola:
preliminary result: unknown unknown unknown unknown no unknown yes yes no unknown unknown yes unknown unknown no yes
lola: memory consumption: 1061992 KB
lola: time consumption: 3452 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="GlobalResAllocation-COL-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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/GlobalResAllocation-COL-05.tgz
mv GlobalResAllocation-COL-05 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 lola"
echo " Input is GlobalResAllocation-COL-05, 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 r244-blw7-152732546700105"
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 ;